MHB Nabeela Zubair's Question on Facebook (Counting Problem)

  • Thread starter Thread starter Sudharaka
  • Start date Start date
  • Tags Tags
    Counting problem
Sudharaka
Gold Member
MHB
Messages
1,558
Reaction score
1
Nabeela Zubair on Facebook writes:

How I can solve this problem?

Students are choosing 2 colors to be used as school colors. There are 10 colors from which to choose. How many different ways are there to choose 2 different colors?

Total Colors 3 4 5 6 7 8 9 10
# of 2-color Comb. 3 6 10
 
Mathematics news on Phys.org
Sudharaka said:
Nabeela Zubair on Facebook writes:

How I can solve this problem?

Students are choosing 2 colors to be used as school colors. There are 10 colors from which to choose. How many different ways are there to choose 2 different colors?

Total Colors 3 4 5 6 7 8 9 10
# of 2-color Comb. 3 6 10

Hi Nabeela, :)

For the first color yo have 10 possibilities. After choosing the first color the second one sould be something different, so there are 9 possibilities for the second one. So by the multiplication principle there are \(10\times 9\) total possibilities for choosing the two colors. But then there are repetitions involved here. That is we have counted each combination twice. If A and B are two colors we have counted A first, B second as well as B first, A second. Therefore the answer should be divided by two to get the number of combinations.

\[\frac{10\times 9}{2}=45\]

This idea can be generalized using the binomial coefficient.

\[\binom {10}{2}=\frac{10!}{2!\,8!}=\frac{10\times 9}{2}=45\]
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
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...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.

Similar threads

Back
Top