Dividing Pizza with a Clock

Source: Alok Goyal Puzzle Page ( http://alokgoyal1971.com/ ) . Alok is ex-IIT Delhi, Partner at Helion VC




Problem:

Part I (Easy): Using a clock, divide a pizza among 12 people

Part II (Difficult): Using a clock, divide a pizza among 11 people?


Comments

  1. Unknown9:36 PM, March 06, 2015

    a) use the 12 marks corresponding to 1'o clock, 2'o clock, ...., 12'o clock
    b) use the 11 distinct and symmetric positions of the clock where the minute hand and hour hand overlap.

    thought of a couple of further extensions:
    c) (easy once previous parts are done) make 59 equal slices.
    d) (mayb hard even after previous parts are done) make 43140 equal slices (not sure if the pizza would be edible by the time u finish this arduous task :D)

    ReplyDelete
    Replies
    1. Unknown11:17 PM, September 09, 2015

      for c) i draw the analogy from part b, since hour and minute hand overlap 11 times, i think minute and second hand will overlap 59 times in an hour, so we can devide in 59 parts.

      Delete
    2. Unknown11:19 PM, September 09, 2015

      for c) i draw the analogy from part b, since hour and minute hand overlap 11 times, i think minute and second hand will overlap 59 times in an hour, so we can devide in 59 parts.

      Delete
  2. Blue sword10:01 PM, April 21, 2015

    Omkar's b) was good
    Another method ( not that easy though )
    We will use the Hours hand to mark the cut and the minutes hand for keeping the count. The total 12 hours consists of 12 * 60 minutes = 720 minutes. If we divide the 720 minutes by 11 we get 65.45 If the hand is currently at 12'o' clock, we keep on extending the minutes hand by 65 minutes ( approx )

    ReplyDelete
  3. Unknown3:37 PM, December 13, 2015

    (d) was really Nice!
    We make the count using minute hand and cut using hour hand. So we get 12*60 = 720min. But first cut can be made at start of each hour,so making it 719. Multiplying it with number of different second hand moves,we get 719*60 =43140 different slices.

    ReplyDelete
  4. SHIVANSHU CHAUHAN10:00 AM, March 22, 2016

    Start when Hour, minute and second overlap on 12'O Clock. Then after 5 minute and 57 seconds, meaning when the minute hand is somewhat ahead of 1 and second hand is on 57 then take the angle b/w hour hand and minute hand. Which is approximately (360/11) degree.

    ReplyDelete

Post a Comment

Popular posts from this blog

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

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

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