+0  
 
-1
59
1
avatar

Find the number of ways of arranging the numbers 1, 2, 3, ..., 11, 12     in a  array (with three rows and four columns), so that the sum of the numbers in each column is divisible by 3. Each number must appear exactly once in the array.

 

 

Thanks!

 

 Mar 31, 2020
edited by Guest  Mar 31, 2020

35 Online Users

avatar
avatar
avatar
avatar