MHB Number Combinations: 30 Items in 6x5 Array

  • Thread starter Thread starter schinb65
  • Start date Start date
  • Tags Tags
    Combination
AI Thread Summary
Thirty items arranged in a 6-by-5 array can yield 1200 distinct sets of three items, ensuring no two items are in the same row or column. The calculation involves selecting the first item from 30 options, the second from 20 remaining items, and the third from 12, resulting in 7200 combinations. Since the order of selection does not matter, this total is divided by 3! to account for the permutations of the three items. The discussion highlights the importance of correctly applying combinatorial principles, particularly the factorial division for non-ordered selections. The final confirmation of 1200 as the correct answer emphasizes the need for careful consideration of selection constraints.
schinb65
Messages
12
Reaction score
0
Thirty items are arranged in a 6-by-5 array. Calculate the number of ways to form a set of three distinct items such that no two of the selected items are in the same row or same column.

I am told the answer is 1200.

I do not believe that I am able to use the standard combination formula.

This is what I did which I got the correct answer but do not really believe I am able to do this every time.

The first Number I can chose from 30.
The Second #, Chose from 20.
The 3rd #, Chose from 12.
So 30*20*12= 7200
7200/6= 1200
I divided by 6 since I am choosing 3 numbers and I multiplied that by 2 since I have to get rid of each row and column when a number is chosen.

Will this always work? Does an easier way exist?
 
Mathematics news on Phys.org
I'm not sure what the correct answer is but [math]\frac{30*20*12}{\binom{3}{1}}=2400[/math] is my first thought. I don't see a reason to divide by 2 at the end. Hopefully someone else can provide some insight but that's my first thought on the problem.

Let's look at a simpler case of a 3x3 grid where we want to arrange 3 items that can't be in the same row or column. The first item has 9 slots, the second has 4 and the last one just has 1. We again divide by [math]\binom{3}{1}[/math] to account for the combinations of these items and that should be the final answer.

Anyway, that's my reasoning for now. Not promising it's correct unfortunately :(
 
Hello, schinb65!

Thirty items are arranged in a 6-by-5 array.
Calculate the number of ways to form a set of three distinct items
such that no two of the selected items are in the same row or same column.

I am told the answer is 1200.

I do not believe that I am able to use the standard combination formula.

This is what I did which I got the correct answer,
but do not really believe I am able to do this every time.

The first number I can chose from 30.
The second #, choose from 20.
The third #, choose from 12.

So: 30*20*12= 7200

7200/6 = 1200 . Correct!
The first can be any of the 30 items.
Select, say, #7; cross out all items in its row and column.

. . $\begin{array}{|c|c|c|c|c|} \hline
1 & \times & 3 & 4 & 5 \\ \hline
\times & \bullet & \times & \times & \times \\ \hline
11 & \times & 13 & 14 & 15 \\ \hline
16 & \times & 18 & 19 & 20 \\ \hline
21 & \times & 23 & 24 & 25 \\ \hline
26 & \times & 28 & 29 & 30 \\ \hline
\end{array}$The second can be any of the remaining 20 items.
Select, say, #24; cross out all items in its row and column.

. . $\begin{array}{|c|c|c|c|c|} \hline
1 & \times & 3 & \times & 5 \\ \hline
\times & \bullet & \times & \times & \times \\ \hline
11 & \times & 13 & \times & 15 \\ \hline
16 & \times & 18 & \times & 20 \\ \hline
\times & \times & \times& \bullet & \times \\ \hline
26 & \times & 28 & \times & 30 \\ \hline
\end{array}$The third can be any of the remaining 12 items.
Select, say, #28.

. . $\begin{array}{|c|c|c|c|c|} \hline
1 & \times & \times & \times & 5 \\ \hline
\times & \bullet & \times & \times & \times \\ \hline
11 & \times & \times & \times & 15 \\ \hline
16 & \times & \times & \times & 20 \\ \hline
\times & \times & \times& \bullet & \times \\ \hline
\times & \times & \bullet & \times & \times \\ \hline
\end{array}$There are: .$30\cdot20\cdot12 \,=\,7200$ ways to select 3 items.

Since the order of the selections is not considered,
. . we divide by $3!$

Answer: .$\dfrac{7200}{3!} \;=\;1200$
 
That was the thing I was missing, soroban! Thank you for pointing it out. We should divide by $3!$, not [math]\binom{3}{1}[/math].
 
Seemingly by some mathematical coincidence, a hexagon of sides 2,2,7,7, 11, and 11 can be inscribed in a circle of radius 7. The other day I saw a math problem on line, which they said came from a Polish Olympiad, where you compute the length x of the 3rd side which is the same as the radius, so that the sides of length 2,x, and 11 are inscribed on the arc of a semi-circle. The law of cosines applied twice gives the answer for x of exactly 7, but the arithmetic is so complex that the...
Thread 'Imaginary Pythagoras'
I posted this in the Lame Math thread, but it's got me thinking. Is there any validity to this? Or is it really just a mathematical trick? Naively, I see that i2 + plus 12 does equal zero2. But does this have a meaning? I know one can treat the imaginary number line as just another axis like the reals, but does that mean this does represent a triangle in the complex plane with a hypotenuse of length zero? Ibix offered a rendering of the diagram using what I assume is matrix* notation...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
Back
Top