SOLUTION: Determine the number of ways of placing the numbers 1-9 in a circle, so that the sum of any three numbers in consecutive positions is divisible by 3 (Two arrangements are considere

Question 1160355: Determine the number of ways of placing the numbers 1-9 in a circle, so that the sum of any three numbers in consecutive positions is divisible by 3 (Two arrangements are considered the same if one arrangement can be rotated to obtain the other.)
please asap thank you
Answer by greenestamps(13206) (Show Source): You can put this solution on YOUR website!

The nine numbers can be divided into three groups:

A: 1, 4, 7 (1 more than a multiple of 3)
B: 2, 5, 8 (1 less than a multiple of 3)
C: 3, 6, 9 (a multiple of 3)

A sequence of three numbers, one chosen from each group, will have a sum that is divisible by 3. Since there are the same number of numbers in each group, the arrangement of the numbers around the circle must be ABCABCABC.

We can count the number of different arrangements by counting the numbers of ways we can choose the number for each position, going around the table one place at a time.

(1) We can choose any of the 9 numbers first. 9 choices.
(2) The second number must be one of the 6 numbers in the two other groups. 6 choices.
(3) The third number must be one of the 3 numbers in the third group. 3 choices.
(4) The fourth number must be one of the remaining 2 numbers in the first group. 2 choices.
(5) The fifth number must be one of the remaining 2 numbers in the second group. 2 choices.
(6) The sixth number must be one of the remaining 2 numbers in the third group. 2 choices.
(7) The seventh, eighth, and ninth numbers must be the 1 remaining numbers in the first, second, and third groups, respectively. 1 choice each.

The total number of arrangements is the product of all the numbers of choices:

9*6*3*2*2*2*1*1*1 = 1296

However, two arrangements which are the same except for a rotation are considered to be the same. That essentially means we don't know where the "starting point" is for the arrangement; and that means our count of 1296 is too large by a factor of 9.

So with the given rules, the number of arrangements is 1296/9 = 144.

ANSWER: 144 different arrangements

RELATED QUESTIONS
How many ways are there to re-arrange numbers 1 to 12 on a circle, so that the sum of any (answered by KMST)

A bag contains red and blue tiles. Each tile has a number from the set \{-1, 0, 1\}... (answered by CPhill)

Show that the sum of any three consecutive numbers is a multiple of 3. Show that the sum (answered by Alan3354)

Write the number 6 as a sum of three natural numbers in several different ways, and , in... (answered by checkley77)

Find the number of ways of placing three As, three Bs, and three Cs in a 3 \times 3 grid, (answered by CPhill,ikleyn)

The sum of three consecutive EVEN number is 78.Determine the three... (answered by LauraGED,richwmiller)

The sum of three consecutive natural numbers is 33 determine the smallest of the three... (answered by Alan3354)

-------------------------------------- || _ || 7 || _ || _ || _ || 10 || _ ||... (answered by Edwin McCravy,greenestamps)

1 Three in a Row The sum of three consecutive numbers is 600. What is the least of... (answered by rfer)