Algebra
A letter lock contains 5 rings each marked with for different letters.the no of all possible unsuccessful attempts are?
A letter lock contains 5 rings each marked with for different letters.the no of all possible unsuccessful attempts are?
1 Answer
Saurabh Koranglekar
Dear student question is slightly incomplete
however ill state algebraic variables for the assumption
Let ring 1 have p letters
Let ring 2 have q letters
Let ring 3 have r letters
Let ring 4 have s letters
Let ring 5 have t letters
total combinations = p*q*r*s*t
successful combination =1
total unsuccessful attempts = p*q*r*s*t-1
however ill state algebraic variables for the assumption
Let ring 1 have p letters
Let ring 2 have q letters
Let ring 3 have r letters
Let ring 4 have s letters
Let ring 5 have t letters
total combinations = p*q*r*s*t
successful combination =1
total unsuccessful attempts = p*q*r*s*t-1
Other Related Questions on algebra
How do you write “the product of 18 and q” as an algebraic expression?
How do you write “the product of 18 and q” as an algebraic expression?
algebra
Last Activity: 2 Years ago