Safe Combination Possibilities

  • Context: Undergrad 
  • Thread starter Thread starter willr12
  • Start date Start date
  • Tags Tags
    Combination
Click For Summary
SUMMARY

The discussion centers on calculating the number of possible combinations for a safe with a given number of digits, specifically using the equation 10^(y-x)y!/(y-x)!. Here, 'y' represents the total digits in the sequence, while 'x' indicates the number of known digits. The equation effectively simplifies to y! when all digits are known, and to 10^y when no digits are known. An example calculation for a 4-number combination containing the digits 3, 6, and 7 confirms that there are 240 possible combinations.

PREREQUISITES
  • Understanding of factorial notation (n!)
  • Basic knowledge of combinatorial mathematics
  • Familiarity with exponential functions
  • Ability to manipulate algebraic equations
NEXT STEPS
  • Study combinatorial mathematics to deepen understanding of arrangements and selections
  • Learn about permutations and combinations in detail
  • Explore applications of factorials in probability theory
  • Investigate the use of exponential functions in mathematical modeling
USEFUL FOR

Students, mathematicians, and anyone interested in combinatorial problems and mathematical equations related to permutations and combinations.

willr12
Messages
17
Reaction score
2
I am a 15 year old who is obsessed with math...anyway, I developed an equation dealing with safe combination possibilities. For example, if you have a safe with 5 digits, and you know there is (for example) a 4 and an 8 in the combination. You aren't sure which position they are in, and they can be rearranged in all different ways. How many possible combinations are there?
The equation i came up with was as follows:
When y=total digits in the sequence and x=number of digits known,
10^(y-x)y!/(y-x)!
will give you the answer. When you know all the digits, that's the same as saying "how many different ways can n items be arranged?" We all know that can be represented by n!, and this equation satisfies that. When you know all the numbers, 10^(y-x) will cancel to 10^0, since x and y are equal. And on the bottom, (y-x)! will cancel to 0!, which again is 1. Therefore you are left with y!.
Also, if you know 0 of the numbers, the equation is simply 10^y, and this equation satisfies that as well. When the amount of digits you know (x) is zero, the 10^(y-x) cancels to 10^y and the bottom ((y-x)!) cancels to y!. There is also a y! on the top, so those cancel out and you are simply left with 10^y.
So, let's say a friend hands you their phone. While trying to deduce their password, they tell you that their 4-number combination contains a 3, a 6 and a 7. How many combinations are there?
10^(y-x)y!/(y-x)!
10^(4-3)4!/(4-3)!
10^1(24)/1!
240/1
=240 possible combinations
I'm not exactly a professional mathematician (at all) but I just wanted some feedback. Are there any flaws?
 
Mathematics news on Phys.org
willr12 said:
I am a 15 year old who is obsessed with math...anyway, I developed an equation dealing with safe combination possibilities. For example, if you have a safe with 5 digits, and you know there is (for example) a 4 and an 8 in the combination. You aren't sure which position they are in, and they can be rearranged in all different ways. How many possible combinations are there?
The equation i came up with was as follows:
When y=total digits in the sequence and x=number of digits known,
10^(y-x)y!/(y-x)!
will give you the answer. When you know all the digits, that's the same as saying "how many different ways can n items be arranged?" We all know that can be represented by n!, and this equation satisfies that. When you know all the numbers, 10^(y-x) will cancel to 10^0, since x and y are equal. And on the bottom, (y-x)! will cancel to 0!, which again is 1. Therefore you are left with y!.
Also, if you know 0 of the numbers, the equation is simply 10^y, and this equation satisfies that as well. When the amount of digits you know (x) is zero, the 10^(y-x) cancels to 10^y and the bottom ((y-x)!) cancels to y!. There is also a y! on the top, so those cancel out and you are simply left with 10^y.
So, let's say a friend hands you their phone. While trying to deduce their password, they tell you that their 4-number combination contains a 3, a 6 and a 7. How many combinations are there?
10^(y-x)y!/(y-x)!
10^(4-3)4!/(4-3)!
10^1(24)/1!
240/1
=240 possible combinations
I'm not exactly a professional mathematician (at all) but I just wanted some feedback. Are there any flaws?

You're 15 and still not a professional mathematician ? Get of the couch and go do something useful with your life : ) !

For the 4-number code, another way, just notice that the 4th number can be any of 0,1,2,...,9 , and can be put in either in 1st, 2nd,etc. and then the other 3 numbers can be permuted, also giving 240 as result, if I understood the rules correctly.

For the first, there are 5C2 ways of choosing the spots for the 4,8 , and for each of these,then the numbers in the other spots can be permutted in any way.
 
Last edited:
Note that my first comment is just a joke.
 
WWGD said:
Note that my first comment is just a joke.
Hahah I know:)
 

Similar threads

  • · Replies 24 ·
Replies
24
Views
3K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 51 ·
2
Replies
51
Views
4K
  • · Replies 4 ·
Replies
4
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K