+0

0
332
6

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 15, 2019
edited by Guest  Oct 15, 2019

#1
+108675
+1

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.)

There are none.

Oct 15, 2019
#2
0

There is one for sure because 1,2,3,4,5,6,7,8,9 works

Guest Oct 15, 2019
#3
+108675
+1

No the numbers in the question are 1,2,3 and 9

No other numbers are mentioned.

There are no possible combinations

Melody  Oct 16, 2019
#4
0

Sorry. It seems like I made a typo in the question. The correct question is: 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.)

Guest Oct 20, 2019
#5
+108675
0

If you want the numbers 1 through 9 you should type all of them in individually.

If you are still looking for answers I suggest you start a new thread and put this one in the rubbish heap.

Melody  Oct 21, 2019
edited by Melody  Oct 21, 2019
#6
+117
+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