Discrete Mathematics and Its Applications, Seventh Edition

Published by McGraw-Hill Education
ISBN 10: 0073383090
ISBN 13: 978-0-07338-309-5

Chapter 6 - Section 6.6 - Generating Permutations and Combinations - Review Questions - Page 439: 3

Answer

a) $n^{m}$ b) $10^{5}$ c) n(n-1)...(n-m+1) d) 30240 e) 0

Work Step by Step

a) According to the product rule, the number of functions, ie number of different tasks of assigning values is the product of n.n.n...$m$ times = $n^{m}$ b) 10$\times$10$\times$10$\times$10$\times$10 =$10^{5}$ c) According to the product rule, the total number of one-to-one functions is n(n-1)..(n-m+1) d) As before one-to-one function = 6.7.8.9.10 = 30240 e) Not a single onto function is possible when its image and codomain are equal.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.