Finite Math and Applied Calculus (6th Edition)

Published by Brooks Cole
ISBN 10: 1133607705
ISBN 13: 978-1-13360-770-0

Chapter 6 - Section 6.3 - Decision Algorithms: The Addition and Multiplication Principles - Exercises - Page 426: 49b

Answer

$4$

Work Step by Step

This is very similar to the problem in part (a) R means moving to the right, and D means going down. We are going from start to finish in 4 steps, we need to take three steps to the right and 1 down. Therefore we are looking for a 4 four-letter sequence that contain only letters R and D with D occurring only once D only occurs once, therefore we choose where D will be, that is 4 choices, and then the other letters are R's. So there are 4 four-letter sequences that contain only letters R and D with D occurring only once
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.