Numbers In a circle

Consider the set: S = ( 1 , 2 , 3 , . . . , 8 , 9 ) S={(1,2,3,...,8,9)} Can we put all these numbers in a circular arrangement such that the sum of no two adjacent numbers is divisible by 3 , 5 , 7 3,5,7 ?. If you think no such arrangement is possible then enter 0 .If you think 1 arrangement is possible,then enter 1 1 , If you think more than one arrangement is possible , then enter the smallest possible arrangement starting from 1 1 in Clockwise direction.


The answer is 138562947.

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.

1 solution

Let A n A_n denote the numbers that can be on either side of the number n n .

A 1 = { 3 , 5 , 7 } A_1 = \{3,5,7\}

A 2 = { 6 , 9 } A_2 = \{6,9\}

A 3 = { 1 , 5 , 8 } A_3 = \{1,5,8\}

A 4 = { 7 , 9 } A_4 = \{7,9\}

A 5 = { 3 , 6 , 8 } A_5 = \{3,6,8\}

A 6 = { 2 , 5 , 7 } A_6 = \{2,5,7\}

A 7 = { 1 , 4 , 6 , 9 } A_7 = \{1,4,6,9\}

A 8 = { 3 , 5 , 9 } A_8 = \{3,5,9\}

A 9 = { 2 , 4 , 7 , 8 } A_9 = \{2,4,7,8\}

Thus the answer must contain 629 629 or 926 926 as they are the only possible neighbours of 2 2 .

The should also contain 947 947 or 749 749 for the same reason.

Since 9 9 is common the answer must contain 62947 62947 or 74926 74926 .

Now 7 7 cannot have 6 6 or 9 9 as neighbours it must have 1 1 as the other neighbour.

Thus the answer must contain 629471 629471 or 174926 174926 .

Similarly 6 6 cannot have 7 7 as a neighbor thus it should have 5 5 as it's other neighbour.

Thus the answer must contain 5629471 5629471 or 1749265 1749265 .

Now 8 8 must have 3 3 and 5 5 as neighbours.

Thus the answer must contain 385629471 385629471 or 174926583 174926583 .

Thus rearranging the sequences to start with 1 1 we get 138562947 138562947 and 174926583 174926583 .

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 1 and smallest amomg all possible arrangement.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...