You want to hike an entire subrange. Assuming you summit exactly one mountain with each hike, what is the fewest number of hikes necessary to hike an entire subrange? Briefly justify the answer. Your friend wants to hike all 10 mountains. To decide the order, they will pick a new mountain of a hat each week (they don't replace the mountain, once it is hiked they move on to a new one until they get all 10). After how many hikes will they be guaranteed to hike an entire subrange? Justify your answer. Hint: It may help to first determine the subranges.

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Topic Video
Question
Mountain Ranges
A mountain range is a series of mountains connected by high ground. Consider the following
fictional mountain range with 10 peaks which are ordered in a line, from 1 to 10.
1. First Mountain - 3500 ft.
2. Second Mountain - 3300 ft.
3. Giant Mountain - 5000 ft.
4. Giant's Nephew - 4600 ft.
5. Old Giant Mountain - 4950 ft.
6. Old Giant's Cane Mountain - 4600 ft.
7. Mt. Discrete Structures - 4200 ft.
8. Mt. Noname - 4800 ft.
9. Mt. Runningoutofnames - 4725 ft. 10. Last Mountain - 4650 ft
We call a subset of peaks consecutive if they include all of the peaks from į toj (1si<js 10). For
example, First, Second, and Giant Mountain are consecutive, as are Old Giant Mountain and Old Giant's
Cane Mountain.
We will define a subrange as a maximal subset of three or more consecutive peaks in the range whose
elevations are all within 500 feet of each other. Maximal means that a subrange can not be a proper
subset of another subrange (e.g. if {1,2,3,4} were a subrange, then {1,2,3} is not a subrange because
{1,2,3} C {1,2,3,4}).
Transcribed Image Text:Mountain Ranges A mountain range is a series of mountains connected by high ground. Consider the following fictional mountain range with 10 peaks which are ordered in a line, from 1 to 10. 1. First Mountain - 3500 ft. 2. Second Mountain - 3300 ft. 3. Giant Mountain - 5000 ft. 4. Giant's Nephew - 4600 ft. 5. Old Giant Mountain - 4950 ft. 6. Old Giant's Cane Mountain - 4600 ft. 7. Mt. Discrete Structures - 4200 ft. 8. Mt. Noname - 4800 ft. 9. Mt. Runningoutofnames - 4725 ft. 10. Last Mountain - 4650 ft We call a subset of peaks consecutive if they include all of the peaks from į toj (1si<js 10). For example, First, Second, and Giant Mountain are consecutive, as are Old Giant Mountain and Old Giant's Cane Mountain. We will define a subrange as a maximal subset of three or more consecutive peaks in the range whose elevations are all within 500 feet of each other. Maximal means that a subrange can not be a proper subset of another subrange (e.g. if {1,2,3,4} were a subrange, then {1,2,3} is not a subrange because {1,2,3} C {1,2,3,4}).
A. You want to hike an entire subrange. Assuming you summit exactly one mountain with each
hike, what is the fewest number of hikes necessary to hike an entire subrange? Briefly justify the
answer.
B. Your friend wants to hike all 10 mountains. To decide the order, they will pick a new mountain
of a hat each week (they don't replace the mountain, once it is hiked they move on to a new one
until they get all 10). After how many hikes will they be guaranteed to hike an entire subrange?
Justify your answer. Hint: It may help to first determine the subranges.
Answer:
Transcribed Image Text:A. You want to hike an entire subrange. Assuming you summit exactly one mountain with each hike, what is the fewest number of hikes necessary to hike an entire subrange? Briefly justify the answer. B. Your friend wants to hike all 10 mountains. To decide the order, they will pick a new mountain of a hat each week (they don't replace the mountain, once it is hiked they move on to a new one until they get all 10). After how many hikes will they be guaranteed to hike an entire subrange? Justify your answer. Hint: It may help to first determine the subranges. Answer:
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Permutation and Combination
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,