MHB How many possible 7-place license plates are there with 3 letters and 4 digits?

  • Thread starter Thread starter iamjokerface
  • Start date Start date
  • Tags Tags
    Plate
iamjokerface
Hello,

I am stuck on this one problem. The problem asks:

How many different 7-place license plates are possible when 3 of the entries are letters and 4 are digits? Assume that repetition of letters and numbers is allowed and that there is no restriction on where the letters or numbers can be placed.

The way I approached the problem was:

There are 7C3 ways of choosing the places for letters, and in each letter place, there can be 26 choices. So 7C3*26*26*26 for the letters.
Then there are 7C4 ways of choosing the places for digits, and in each digit place, there are 10 choices, so 7C4*10*10*10*10.
To get the total possibilities, I multiplied the two.

I checked the answer but I am not getting the correct answer.

Where have I gone wrong?
 
Mathematics news on Phys.org
I think the problem is that letters are indistinguishable from one another, as are numbers. I would consider it more like this:

There 7 places to choose the first letter, 6 for the second, and 5 for the third. Once you've chosen the letter locations, the rest are all numbers. So I would probably have an expression like: $7\cdot 6\cdot 5\cdot 26^3 \cdot 10^4$. Does that work?
 
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