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: 17

Answer

1,321,368,961

Work Step by Step

Number of strings of five ASCII characters containing the '@' at least once = Total number of strings of five ASCII characters - number of strings of five ASCII characters containing no '@' sign Total number of strings of five ASCII characters = $128\times128\times128\times128\times128 = 128^5$ [5 decisions each with 128 options] Number of strings of five ASCII characters containing no '@' sign = $127\times127\times127\times127\times127 = 127^5$ [[5 decisions each with 127 option, we can't use '@'] Therefore, answer = $128^5 - 127^5$ = 1,321,368,961
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.