Hungry Lion

Source: Puzzle Toad, CMU

Problem: A hungry lion runs inside a circus arena which is a circle of radius 10 meters. Running in broken lines (i.e. along a piecewise linear trajectory), the lion covers 30 kilometers. Prove that the sum of all turning angles is at least 2998 radians.

Update(05/02/10):
Solution: Solution posted by me in comments!!

Comments

  1. Pratik Poddar10:41 PM, February 05, 2010

    Posting solution since no one has solved it till now.

    Solution at http://www.cs.cmu.edu/puzzle/Solution16.pdf

    ReplyDelete
  2. Pratik Poddar9:29 AM, February 06, 2010

    Let us look at the world through the eyes of the hungry lion, that is, the lion is stationary but everything else moves around. Assuming furthermore that the poor animal has a stiff neck and cannot rotate its head and is always facing North. The trajectory of the center of the arena looks in the the following way: It is a combination of linear segments pointing South and circular arcs. The total length of the linear segments is 30 km. Since the center is never more than 10 meters away from the lion, the initial and final positions of the center are at most 20 meters apart. By a form of the triangle inequality, the total length of arcs is at least 30, 000 − 20 = 29, 980 meters. But each arc has radius at most 10 meters, so the sum of all arc angles is at least 2, 998 radians.

    ReplyDelete
  3. sumit somani4:07 PM, November 29, 2010

    very old puzzle but still I would like to say that assume lion is very smart and wish to reduce the amount of angle it requires to turn, so he moves in infinitesmall segments along the circumference so that in min movement in terms of angle he gets the max distance. So 2*pi radians gives him 20*pi m, i.e. 10 metre per radian, So for 30 km angle min required wud be atleast 3,000 radians.

    ReplyDelete

Post a Comment

Popular posts from this blog

Fraction Brainteaser

Source: Sent to me by Gaurav Sinha Problem: Siddhant writes a Maths test and correctly answers 5 out of 6 Arithmetic questions and 20 out of 28 Geometry questions.  In total, Siddhant scores 25 out of 34.  Vaibhav writes another Maths test and correctly answers 20 out of 25 Arithmetic questions and 6 out of 9 Geometry questions. in total, Vaibhav scores 26 out of 34. Note that a) Vaibhav scores more than Siddhant b) Siddhant score better than Vaibhav in both individual topics -  5/6 > 20/25 and 20/28 > 6/9 How is it possible? 
Read more

Buying Dimsums

Source: Alok Goyal (Stellaris VP, Ex-Helion VC) puzzle blog Problem: A fast food restaurant sells dimsums in boxes of 7 and 3. What’s the greatest number of dimsums a person cannot buy. Generalize it for p and q where p and q are relatively prime. I loved the puzzle. Hope you enjoy it too.
Read more

Consecutive Heads

Let's say A keep tossing a fair coin, until he get 2 consecutive heads, define X to be the number of tosses for this process; B keep tossing another fair coin, until he get 3 consecutive heads, define Y to be the number of the tosses for this process. 1) Calculate P{X>Y} 2) What's the expected value of X 3) What's the expected value of Y This is probably the hardest puzzle I have ever put on my blog. Hence, I will post its solution in the post directly rather than on comment. Solution: 1) (Solved by me finally after 13 months :)) Make a state diagram. Let the state be (a,b) where a is the number of consecutive heads streak "A" is on currently and b is the number of consecutive heads streak "B" is on currently. So, (0,3) (1,3) are final accepted states and (2,0) (2,1) (2,2) (2,3) are failure states. If you get tails, your contribution to the state reaches to "0" f(State) = P(X>Y | "State" configuration initially)
Read more