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 15, 2019

edited by
Guest
Oct 15, 2019

#1**+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.

Melody Oct 15, 2019

#3**+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