Consider the set: Can we put all these numbers in a circular arrangement such that the sum of no two adjacent numbers is divisible by ?. If you think no such arrangement is possible then enter 0 .If you think 1 arrangement is possible,then enter , If you think more than one arrangement is possible , then enter the smallest possible arrangement starting from in Clockwise direction.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Let A n denote the numbers that can be on either side of the number n .
A 1 = { 3 , 5 , 7 }
A 2 = { 6 , 9 }
A 3 = { 1 , 5 , 8 }
A 4 = { 7 , 9 }
A 5 = { 3 , 6 , 8 }
A 6 = { 2 , 5 , 7 }
A 7 = { 1 , 4 , 6 , 9 }
A 8 = { 3 , 5 , 9 }
A 9 = { 2 , 4 , 7 , 8 }
Thus the answer must contain 6 2 9 or 9 2 6 as they are the only possible neighbours of 2 .
The should also contain 9 4 7 or 7 4 9 for the same reason.
Since 9 is common the answer must contain 6 2 9 4 7 or 7 4 9 2 6 .
Now 7 cannot have 6 or 9 as neighbours it must have 1 as the other neighbour.
Thus the answer must contain 6 2 9 4 7 1 or 1 7 4 9 2 6 .
Similarly 6 cannot have 7 as a neighbor thus it should have 5 as it's other neighbour.
Thus the answer must contain 5 6 2 9 4 7 1 or 1 7 4 9 2 6 5 .
Now 8 must have 3 and 5 as neighbours.
Thus the answer must contain 3 8 5 6 2 9 4 7 1 or 1 7 4 9 2 6 5 8 3 .
Thus rearranging the sequences to start with 1 we get 1 3 8 5 6 2 9 4 7 and 1 7 4 9 2 6 5 8 3 .
These are the possible answers to the question. You should modify the question to make the current answer the only possible answer like beginning from 1 and smallest amomg all possible arrangement.