We use cookies to personalise content and advertisements and to analyse access to our website. Furthermore, our partners for online advertising receive pseudonymised information about your use of our website. cookie policy and privacy policy.
 
+0  
 
0
139
2
avatar+28 

Find the number of ways of arranging the numbers 1, 2, 3, ...  9 in a circle, so that the sum of any three adjacent numbers is divisible by 3. (Two arrangements are considered the same if one arrangement can be rotated to obtain the other.

 Oct 12, 2019
 #1
avatar+6045 
+1

....

 Oct 12, 2019
edited by Rom  Oct 12, 2019
edited by Rom  Oct 18, 2019
 #2
avatar+118 
+4

Please do not post solutions to this problem!

 

This is a homework problem, and the original poster is trying to cheat.  I know, because I am in the same class, and have the same homework.

 Oct 21, 2019

37 Online Users

avatar
avatar
avatar
avatar