+0  
 
+3
108
1
avatar+215 

Find the number of ways of arranging the numbers  1-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.

 

I got 4*4*4*12=768 ways to arrange the numbers. Is that correct? 

 Mar 14, 2020
 #1
avatar+109712 
-4

This question has been asked and answered.

 Mar 14, 2020

13 Online Users

avatar