A combination lock requires three selections of numbers, each from 1 through 30.
a. How many different combinations are possible?
b. Suppose the locks are constructed in such a way that no number may be used twice. How many different combinations are possible?
Step 1 of 3
MODULE 15 -- BASIC COUNTING, PERMUTATIONS → 6.1 BASIC COUNTING ← The Product Rule: A procedure can be broken down into a sequence of two tasks. There are n w1ys to do the first task and n ways2to do the second task. Then there are n 1n 2ays to do the procedure. Example: How many bit strings of length seven are there 7 Solution: Since each of the seven bits is either a 0 or 1, the answer is 2 = 128. Example: How many different license plates can be made if each plate contains a sequence of three uppercase English letters followed by three digits Solution: Using the product rule, there are 26 • 26 • 26 • 10 • 10 • 10 = 17,576,000 different possible license plates. 26 represents the 26 choices for eac
Textbook: Discrete Mathematics with Applications
Author: Susanna S. Epp
The full step-by-step solution to problem: 15E from chapter: 9.2 was answered by , our top Math solution expert on 07/19/17, 06:34AM. Discrete Mathematics with Applications was written by and is associated to the ISBN: 9780495391326. The answer to “A combination lock requires three selections of numbers, each from 1 through 30.a. How many different combinations are possible?________________b. Suppose the locks are constructed in such a way that no number may be used twice. How many different combinations are possible?” is broken down into a number of easy to follow steps, and 41 words. Since the solution to 15E from 9.2 chapter was answered, more than 314 students have viewed the full step-by-step answer. This full solution covers the following key subjects: Combinations, requires, constructed, lock, locks. This expansive textbook survival guide covers 131 chapters, and 5076 solutions. This textbook survival guide was created for the textbook: Discrete Mathematics with Applications , edition: 4.