What is the total combination for choosing 8 questions out of 10?

  • Thread starter Thread starter caesarkim
  • Start date Start date
  • Tags Tags
    Probability
AI Thread Summary
The total number of combinations for choosing 8 questions out of 10 is 45. This is calculated using the formula 10! / (8! * 2!), which accounts for the different ways to leave out 2 questions. Initially, there are 90 combinations when considering the order of selection, but this is adjusted by dividing by 2 to eliminate duplicates. The discussion highlights the use of combinatorial mathematics to solve such problems. Understanding this concept can be facilitated by using a calculator with combination functions.
caesarkim
there are 10 questions. i can choose only exact 8 questions.

what is the total combination?
 
Mathematics news on Phys.org
45

10!/[(8!)(2!)]

Essentially, you have 10 choices for the first question you leave out, and 9 choices for the second question. This leads to 90 (10x9) combinations. But since it doesn't matter in which order you choose them, you've double counted (ie, you counted #1,#2 ans #2,#1 as different combinations), so divide by 2.

Njorl
 
Njorl's given you the correct answer, but to expand this is a simple cominatrics question, your calculator will probably have a function that allows you to work it out, combinations are given by:

_nC_r \equiv \left(\begin{array}{c}n\\r\end{array}\right) \equiv \frac{n!}{r!(n-r)!}

that is n different things taken r at a time, so in this case n = 10 and r = 8.
 
Last edited:
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...
Thread 'Imaginary Pythagorus'
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...
Back
Top