exercise:D578ac1f30: Difference between revisions
From Stochiki
(Created page with "<div class="d-none"><math> \newcommand{\NA}{{\rm NA}} \newcommand{\mat}[1]{{\bf#1}} \newcommand{\exref}[1]{\ref{##1}} \newcommand{\secstoprocess}{\all} \newcommand{\NA}{{\rm NA}} \newcommand{\mathds}{\mathbb}</math></div> The door on the computer center has a lock which has five buttons numbered from 1 to 5. The combination of numbers that opens the lock is a sequence of five numbers and is reset every week. <ul><li> How many combinations are possible if every but...") |
No edit summary |
||
| Line 1: | Line 1: | ||
The door on the computer center has a lock which has five | |||
buttons numbered from 1 to 5. The combination of numbers that opens the lock is a | buttons numbered from 1 to 5. The combination of numbers that opens the lock is a | ||
sequence of five numbers and is reset every week. | sequence of five numbers and is reset every week. | ||
<ul><li> How many combinations are possible if every button must be used once? | <ul style="list-style-type:lower-alpha"><li> How many combinations are possible if every button must be used once? | ||
</li> | </li> | ||
<li> Assume that the lock can also have combinations that require you to push two | <li> Assume that the lock can also have combinations that require you to push two | ||
Latest revision as of 23:45, 12 June 2024
The door on the computer center has a lock which has five buttons numbered from 1 to 5. The combination of numbers that opens the lock is a sequence of five numbers and is reset every week.
- How many combinations are possible if every button must be used once?
- Assume that the lock can also have combinations that require you to push two buttons simultaneously and then the other three one at a time. How many more combinations does this permit?