MHB In how many ways can Ben paint his apartment?

  • Thread starter Thread starter Istar
  • Start date Start date
  • Tags Tags
    Paint
AI Thread Summary
Ben has 14 walls in his apartment and can paint 10 walls one color and the remaining 4 walls another color. The calculation involves using combinations, specifically 14C10 or 14C4, which yield the same result due to the combinatorial identity. The correct calculation shows that there are 1,001 ways for Ben to choose which walls to paint in each color. Thus, the final answer is that Ben can paint his apartment in 1,001 different ways.
Istar
Messages
8
Reaction score
0
The rooms of Ben’s apartment has 14 walls. He has enough paint to cover 10 of these walls with one color and the rest with another color. In how many ways could Ben paint his apartment ?

This problem I used combinations for 10 walls for one color and 4 walls for one color; Here my calculations:

14 walls in total, 10 walls in one colour and the rest (4 walls) in another colour.

For 10 walls: nCr = 14C10 = n!/(n-r)!r! = (14)!/(14-10)!(10)! = (14)!/(4)!(10)!

=(14x13x12x11x10!)/(4x3x2x1)(10)! = (24,024)/(24) = 6,006

For 4 walls: nCr = 14C4 = n!/(n-r)!r! = (14)!/(14-4)!(4)! = (14)!/(10)!(4)!

=(14x13x12x11x10!)/(4x3x2x1)(10)! = (24,024)/(24) = 6,006

i wonder if I am in the right direction ? Pls and Thank you
 
Mathematics news on Phys.org
I think you are definitely on the right track. We could either look at the number of ways to choose 10 from 14 or the number of ways to choose 4 from 14, as after all these will necessarily return the same number since:

$${n \choose r}={n \choose n-r}$$

$$\frac{n!}{r!(n-r)!}=\frac{n!}{(n-r)!(n-(n-r))!}$$

$$\frac{n!}{r!(n-r)!}=\frac{n!}{r!(n-r)!}\quad\checkmark$$

$${14 \choose 4}=\frac{14!}{4!(14-4)!}=\frac{14!}{4!10!}=\frac{14\cdot13\cdot12\cdot11}{4!}=7\cdot13\cdot11=1001$$

Your work was correct up until the final division where you made a slight error.
 
Thank you, guess did most of the work and didnt finish it . So do I have to multiply 14C10 x 14C4 to get the final answer ?
 
No, the final answer is that there are 1,001 ways for Ben to paint his apartment. He can either choose the 10 walls for one color, or the 4 walls for the other. In either case he will find there are 1001 ways to do so, and that they are equivalent.
 
Thank you very much
 
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