Weird Arrangements

In how many ways can 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 {1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9} be arranged such that the sum of any three consecutive integers is a multiple of 3.

Enter your answer as ( m o d 1000 ) \pmod{1000}

This is part of the set My Problems and THRILLER


The answer is 296.

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

Abhijit Dixit
Mar 1, 2017

Divide the given digits on the basis of wether they are of 3 k , 3 k + 1 , 3 k + 2 3k , 3k+1 , 3k+2 form.

If we place these forms consecutively in a fixed order throughout the 9 vacant places the condition would be fulfilled.

As 3 ( 3 k + 3 k + 1 + 3 k + 2 ) 3|(3k+3k+1+3k+2)

(Fixed order of forms can be k , k + 1 , k + 2 k,k+1,k+2 or k + 1 , k + 2 , k k+1,k+2,k etc)

The order can be decided in 3 ! 3! ways. Once the order is decided the no. Corresponding to a given form can be placed 3 ! 3! ways. As each form has. 3 choices.

Finally total ways = 6 4 6^4 ways

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...