Mountain climbing problem
In mathematics, the mountain climbing problem is a problem of finding the conditions that two functions forming profiles of a two-dimensional mountain must satisfy, so that two climbers can start on the bottom on the opposite sides of the mountain and coordinate their movements to meet (possibly at the top) while always staying at the same height. This problem was named and posed in this form by James V. Whittaker , but its history goes back to Tatsuo Homma , who solved a version of it. The problem has been repeatedly rediscovered and solved independently in different context by a number of people (see references below).
Wikipage redirect
Link from a Wikipage to another Wikipage
primaryTopic
Mountain climbing problem
In mathematics, the mountain climbing problem is a problem of finding the conditions that two functions forming profiles of a two-dimensional mountain must satisfy, so that two climbers can start on the bottom on the opposite sides of the mountain and coordinate their movements to meet (possibly at the top) while always staying at the same height. This problem was named and posed in this form by James V. Whittaker , but its history goes back to Tatsuo Homma , who solved a version of it. The problem has been repeatedly rediscovered and solved independently in different context by a number of people (see references below).
has abstract
In mathematics, the mountain c ...... Lester R. Ford Award in 1990.
@en
Link from a Wikipage to an external page
Wikipage page ID
20,589,034
page length (characters) of wiki page
Wikipage revision ID
1,025,190,924
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
type
comment
In mathematics, the mountain c ...... people (see references below).
@en
label
Mountain climbing problem
@en