Solve Permutation Problem: 36 Combination Lock

  • Thread starter Thread starter ajgrebel
  • Start date Start date
  • Tags Tags
    Permutation
AI Thread Summary
A 3 combination lock with 36 possible numbers allows for combinations where numbers can be reused but not consecutively. The correct calculation for the total number of combinations is 36 (for the first number) multiplied by 35 (for the second number, since it cannot be the same as the first) and again 35 (for the third number, which cannot be the same as the second). This results in a total of 44,100 different possible combinations. The focus of the discussion is on understanding the correct mathematical approach rather than just obtaining the answer. The participants confirm the calculation method as accurate.
ajgrebel
Messages
8
Reaction score
0
1. I've only just scrapped through math in high school but recently I have started to take up an interest in the subject. I was listening to a math podcast and they posted a question to be answered the following episode. However, I cannot seem to track that one down and I really need an answer because I'm starting to obsess on it.



2. A 3 combination lock has 36 possible numbers. What are all the possible combinations if you can reuse numbers but not consecutively? Examble: 121 but not 112, or 122



3. I assumed that you would take 36*35*35 which would be 44,100 different possible combinations. Is this correct? I'm more interested in the correct equation to use, then I am the answer.
 
Physics news on Phys.org
welcome to pf!

hi ajgrebel! welcome to pf! :wink:
ajgrebel said:
2. A 3 combination lock has 36 possible numbers. What are all the possible combinations if you can reuse numbers but not consecutively? Examble: 121 but not 112, or 122

3. I assumed that you would take 36*35*35 which would be 44,100 different possible combinations. Is this correct? I'm more interested in the correct equation to use, then I am the answer.

yes that's correct :smile:
 
Thank you for letting me know
 
I picked up this problem from the Schaum's series book titled "College Mathematics" by Ayres/Schmidt. It is a solved problem in the book. But what surprised me was that the solution to this problem was given in one line without any explanation. I could, therefore, not understand how the given one-line solution was reached. The one-line solution in the book says: The equation is ##x \cos{\omega} +y \sin{\omega} - 5 = 0##, ##\omega## being the parameter. From my side, the only thing I could...
Essentially I just have this problem that I'm stuck on, on a sheet about complex numbers: Show that, for ##|r|<1,## $$1+r\cos(x)+r^2\cos(2x)+r^3\cos(3x)...=\frac{1-r\cos(x)}{1-2r\cos(x)+r^2}$$ My first thought was to express it as a geometric series, where the real part of the sum of the series would be the series you see above: $$1+re^{ix}+r^2e^{2ix}+r^3e^{3ix}...$$ The sum of this series is just: $$\frac{(re^{ix})^n-1}{re^{ix} - 1}$$ I'm having some trouble trying to figure out what to...
Back
Top