majka@ubc-vision.CDN (Marc Majka) (08/27/84)
[Bugbuster] > What is the minimum amount of people that it would take to assure that Mr. Explorer reaches the out post and all his assistants make it back to Alaska? Notice that Mr. Explorer doesn't return. Thus: Person-days = Time + ((Time * 2) * N) Food-days = Food * (N + 1) > Mr. Explorer is off to an outpost at the north pole that is a six-day hike from Alaska across a desolate expanse of snow and ice. Time = 6 > One man can carry only enough food and supplies for four days. Food = 4 So Person-days = 6 + 12N and Food-days = 4 + 4N. If nobody starves: Person-days = Food-days 6 + 12N = 4 + 4N 8N = -2 N = -1/4 So Mr. Explorer must take -1/4 of an assistant. >>> <<< >>> Don't we have anything better to discuss on net/math <<< >>> than Baby-logic and trivial arithmetic? <<< >>> <<< --- (name & path in the header. If you can't get it, fix your software)