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.1 - The Basics of Counting - Exercises - Page 396: 8


People can have 15600 different 3 letter initials without repeating the same letter.

Work Step by Step

We assume only capital alphabets (A - Z) The first letter has 26 choices The second letter has 25 choices (we cannot choose the first letter again). The third letter has 24 choices (we cannot choose first or second letter again). So, total ways = 26 x 25 x 24 = 15600
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.