Puzzle #146: The Proud Party Goers

This is a very nice puzzle I got from a site (fivethirtyeight.com) recommended to me by Suman Saraf – thanks Suman.

It’s Friday and that means it’s party time! A group of N people are in attendance at your shindig, some of whom are friends with each other. (Let’s assume friendship is symmetric — if person A is friends with person B, then B is friends with A.) Suppose that everyone has at least one friend at the party, and that a person is “proud” if her number of friends is strictly larger than the average number of friends that her own friends have. (A competitive lot, your guests.)

Importantly, more than one person can be proud. How large can the share of proud people at the party be?

As always, please send your answers as comments within the blog (preferred), or send an e-mail to alokgoyal_2001@yahoo.com. Please do share the puzzle with others if you like, and please also send puzzles that you have come across that you think I can share in this blog.

Happy partying!

Posted in Puzzles | Tagged , | 2 Comments

Solution to Puzzle #144: Pirates and Gold Once Again

Many correct responses to this puzzle, but the I was happiest to see was Danny from Washington DC, an 8th grader – well done Danny. Other people who sent the right answer included Suman Saraf, Vivek Rai and Pratik Poddar. Thank you all!

The answer is that both Jack and Will will have the same number of coins at the end of the game. The reason is that they pass on the same number of coins to each other in every turn. Here is how this works (copying the answer from Pratik as well as Danny):

(J,W) = (2015!, 2015!) –> (2015!/2, 3/2*2015!) –> (2015!, 2015!) –> (2015!3*/4, 5/4*2015!) –> (2015!, 2015!) and so on

In other words, say Jack and Will have X amount of gold.  Jack gives Will X/n amount of gold, so Will ends up with X +X/n  OR (n+1)X/n amount of gold. Now Will gives Jack the amount he has divided by (n+1)  back , which equals X/n. 

Note that if instead of 2015, we had an even number, the answer would not be same!

Hope you all enjoyed the puzzle!

Posted in Solution | Tagged , | Leave a comment

Puzzle #145: The WHO Puzzle

This is another puzzle from the Ramanujan collection, a nice probability puzzle!

The World Health Organization has just identified a new disease. The good news is that it is very rare: only 1 in every million people has it. The bad news is that it is very deadly.
There is a test available that can tell you whether or not you have the disease. It gives the correct diagnosis 99% of the time. This means that if someone with the disease is tested, the test will say “positive” 99% of the time and “negative” 1% of the time; if someone without the disease is tested, it will say “negative” 99% of the time and “positive” 1% of the time.
You take the test, and it comes up “positive”. Oh no! Before you start to panic, what is the probability that you definitely have the disease? Round your calculation to the nearest whole percent.

As always, please send your answers as comments within the blog (preferred), or send an e-mail to alokgoyal_2001@yahoo.com. Please do share the puzzle with others if you like, and please also send puzzles that you have come across that you think I can share in this blog.

Happy Back to School Day in India!

Posted in Puzzles | Tagged , | 2 Comments

Solution to Puzzle #143: Magic 8

Apologies for a long period of silence, I was traveling on work and then on vacation outside India and in the process just did not have the time to respond to messages and also add any posts. Normal service resumes though!

I only got three correct answers for this puzzle – two of them being 9 year olds and third one 11 year old, I presume it was too simple for most people. Congratulations to Mahi Saraf, Arushi Goyal and Aneyaa Dube!.

In the interest of time, I will keep the explanation short for this answer, though it is important to note that this method is often used for many similar magic grid puzzles. Here is an explanation, and I am also attaching the full solution from Mahi Saraf as well:

  • If we add all the numbers, they sum to 36, where as if we add all the 4 lines (each of which add up to 12), they add to 48. That leads to the conclusion that the center 4 boxes add up to 12
  • Center 4 boxes, therefore, can be 1,2,3,6 or 1,2,4,5
  • Recognize that 8 needs to be in outer boxes – whichever line connects to it, needs to have the other two boxes add up to 4 (12 – 8). If the center boxes had 1,2,4,5, we cannot get any combination of two boxes that add up to 4. Therefore, the center boxes will have 1,2,3,6
  • We also now know that 1 and 3 need to be adjacent to each other
  • We also know that 1 and 2 cannot be adjacent to each other as that line will need a “9” to add up to 12 then, therefore, 1 and 2 need to be opposite to each other and 6 and 3 will be adjacent to each other
  • You can now form the full picture
Puzzle 143 Solution

Puzzle 143 Solution

Mahi Saraf Solution Part 1

Mahi Saraf Solution Part 1

Mahi Saraf Solution Part 2

Mahi Saraf Solution Part 2

Hope you all enjoyed the puzzle!

 

Posted in Solution | Tagged , | Leave a comment

Puzzle #144: Pirates and Gold Once Again!

This is a beauty of a puzzle taken from the recent internet puzzle series on Ramanujan going on. Several great puzzles, this one of them.

Jack and Will are very successful pirates who have become very wealthy from their years of pillaging. They each start with 2015! gold coins. (This exclamation point is a factorial symbol as introduced in the previous problem and means 1x2x3x4x…..x2014x2015) Jack gives Will one-half of his gold. Will then gives Jack one-third of his gold. Jack then gives Will one-fourth of his gold. They repeat this back and forth process, ending with Will giving Jack  1/2015 of his gold. How much more gold does Will have than Jack at the end of these exchanges?

As always, please send your answers as comments within the blog (preferred), or send an e-mail to alokgoyal_2001@yahoo.com. Please do share the puzzle with others if you like, and please also send puzzles that you have come across that you think I can share in this blog.

Happy gold juggling!

Posted in Puzzles | Tagged , | 2 Comments

Solution to Puzzle #142: Bills and Two Hats

Got many correct answers for this puzzle, particularly pleased that Mahi, Suman’s daughter also answered this correctly. Other people to send correct answers included Suman Saraf, Bhanu, Pratik Poddar and Karan Sharma, my nephew. Well done all.

The boy maximizes his chance of drawing a $10 bill by putting a single $10 bill in one hat, and the other 19 bills (9 $10 bills and 10 $1 bills) in the other hat. If one set is one 10 dollar bill and the second set is the rest of the nineteen bills (ten 1s and nine 10s) then the probability of picking a 10 dollar bill is 1/2*(1+9/19) or 14/19 or .737.

Hope you all enjoyed the puzzle.

 

Posted in Solution | Tagged , | Leave a comment

Puzzle #143: Magic 8

This is a simple puzzle, and I hope that the adults will take the pain of showing this to their children. This was contributed to me by my daughter, Arushi, who got this puzzle in her holiday homework. While the puzzle can be solved by some trial and error, would love to see if children can find some method to the madness!

Please see the graphic below. Fill in numbers 1 to 8 in the grid below, such that each of the three numbers on a line add up to 12. Each number appears exactly once.

Screenshot 2016-05-28 10.32.42

As always, please send your answers as comments within the blog (preferred), or send an e-mail to alokgoyal_2001@yahoo.com. Please do share the puzzle with others if you like, and please also send puzzles that you have come across that you think I can share in this blog.

Happy weekend!

Posted in Puzzles | Tagged , | Leave a comment

Solution to Puzzle #141: Wolfs and Sheep

This was not an easy puzzle, I received only 3 correct answers – Pooja (my wife), Vishal Patel and Suman Saraf. I tried and failed 😦 Well done all.

There seems to be only one solution to the puzzle. I am attaching the graphic sent to me by Vishal Patel.

Solution to Puzzle #141

Solution to Puzzle #141

Hope you all enjoyed the puzzle!

Posted in Solution | Tagged , | Leave a comment

Puzzle #142: Bills and Two Hats

This one is a simple problem, is a variation of a probability puzzle posted about 3 years back – try it with your teenage children! This one is again taken from The Colossal Book of Short Puzzles and Problems by Martin Gardner. Here it goes:

“No,”said the mathematician to his 14-year old son, “I do not feel inclined to increase your allowances this week by 10 dollars. But if you will take a risk, I will make you a sporting proposition.”

The boy groaned. “What is it this time, Dad?”

“I happen to have,” said the father, “10 crisp new 10-dollar bills and 10 crisp new one-dollar bills. You may divide them any way you please into two sets. We’ll put one set into hat A, the other set into hat B. Then I’ll blindfold you. I’ll mix the contents of each hat and put one hat on the right and one on the left side of the mantel. You pick either hat at random, then reach into that hat and take out one bill. If it’s a 10, you may keep it.”

“And if it isn’t?”

“You’ll mow the lawn for a month, with no complaints.”

The boy agreed. How should he divide the 20 bills between the two hats to maximise the probability of his drawing a 10-dollar bill, and what will that probability be?

As always, please send your answers as comments within the blog (preferred), or send an e-mail to alokgoyal_2001@yahoo.com. Please do share the puzzle with others if you like, and please also send puzzles that you have come across that you think I can share in this blog.

Happy lawn mowing!

Posted in Puzzles | Tagged , | 3 Comments

Solution to Puzzle #140: Traffic Flow in Floyd’s Knob – Version 2

Tough problem for most – I got only one correct answer – Suman Saraf – well done!

I only knew one solution, but Suman sent a small variation of the same answer, so here are both the solutions:

E,E,S,S,E,N,N,N,E,S,W,S,E,S,S,W,W,W,W,N,N,E,S,W,S,E,E,E,E,N,E
E,E,S,S,E,N,N,N,E,S,W,S,E,S,S,W,W,W,W,N,E,N,W,S,S,E,E,E,E,N,E

Also attached is a video link that traces the path:

Hope you all enjoyed the puzzle!

 

Posted in Solution | Tagged , | Leave a comment