MHB Solve GRE Combinations Question: 24 x 9 x 10 Options

  • Thread starter Thread starter greprep
  • Start date Start date
  • Tags Tags
    Combinations
greprep
Messages
11
Reaction score
0
Hello! What is the fastest way to solve the following (I'm prepping for GRE and going too slow right now):"An appliances model number has three alphanumeric characters. The first character must be one of 24 permissible letters in the alphabet. The next character is numeric, a digit from 1 to 9. The last character is also numeric, ranging from 0 to 9.

How many distinct model numbers are possible? "Thank you SO MUCH for your help!
 
Mathematics news on Phys.org
For this, we can apply the fundamental counting principle to state that the number $N$ of distinct model numbers is given by:

$$N=(24)(9)(10)=2160$$
 
Thank you so much. Would I use the same method for this problem:

"how many different committees of 7 people can be formed from a group of 10 people?"
 
greprep said:
Thank you so much. Would I use the same method for this problem:

"how many different committees of 7 people can be formed from a group of 10 people?"

No, that requires using a combination, or binomial coefficient. Let's look at how we can determine this number without simply using a formula.

We know that for the first position on the committee, we have 10 choices, for the second we have 9 choices and so forth down to 4 choices for the 7th and final position. Now, if the order in which the members of the committee mattered, the number of ways we could choose the committee would in fact use the fundamental counting principle. Let's call the number of ways to pick such a committee, where the order chosen matters, as $N_1$...we would have:

$$N_1=10\cdot9\cdot8\cdot7\cdot6\cdot5\cdot4=\frac{10!}{3!}=\frac{10!}{(10-7)!}$$

This is referred to as permutations, and if we choose $r$ objects from $n$, where $r\le n$, then we may use the special notation:

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

However, since the order does not matter in this case, we are only interested in finding how many ways 7 can be chosen from 10 (will call this number $N$), we need to divide the previous result by the number of ways to order 7 objects, which is $7!$...thus:

$$N=\frac{N_1}{7!}=\frac{10!}{7!(10-7)!}$$

For the general case, where we are choosing $r$ objects from $n$ objects, where $r\le n$, we would have:

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

In probability, this is a special formula, and is referred to as combinations, and uses the notations:

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

So, the answer to the question you asked is:

$$N={10 \choose 7}=\frac{10!}{7!(10-7)!}=\,?$$

By the way, for future reference, please start a new thread for a new question...this way our threads don't potentially become convoluted and difficult to follow. :)
 
Awesome! So the answer here would just then just be (10)(9)(8)(7)(6)(5)(4), or 604,800.
 
greprep said:
Awesome! So the answer here would just then just be (10)(9)(8)(7)(6)(5)(4), or 604,800.

That would be the correct number if the order in which the committee was chosen mattered, but in this case order doesn't matter.

$$N={10 \choose 7}=\frac{10!}{7!(10-7)!}=\frac{10\cdot9\cdot8}{3\cdot2}=5\cdot3\cdot8=120$$
 
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.
Back
Top