Discrete Mathematics and Its Applications, Seventh Edition

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

Chapter 5 - Section 5.1 - Mathematical Induction - Exercises - Page 329: 1

Answer

The train stops at all stations.

Work Step by Step

There are infinitely many stations on a train route. Suppose that the train stops at the first station and suppose that if the train stops at a station, then it stops at the next station. Show that the train stops at all stations. This set-up provides the information necessary to demonstrate the conclusion using induction. The stations can be labeled one-to-one using each integer, the base case is that the train stops at the first station, and if the train stops at station $n$, then it stops at station $n+1$. Thus, the train stops at all stations.
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.