Resource Library

Contests & More: Brain Teasers Archive

November 13, 2008

Three is the Magic Number: (source: www.cartalk.com; contributed by: Jacob Peterson)

An old car’s odometer (which gives the current number of miles the car has been driven since it was made) has six digits—from 000,000 to 999,999.  If the car is driven until the odometer hits its maximum number (999,999), how many times will the digit “3” appear on the odometer? 

Note: each “3” in every number counts, so you would count four 3’s in the mileage “134,333”.  After another mile, you would add three more 3’s for the mileage “134,334”.

Answer

To figure out how many times “3” will appear on the odometer, it helps to restrict your scope to just one of the six digit places on the odometer.  It’s easiest to just think about the left-most (hundred-thousands) place, since all the mileages that have a 3 in that place happen consecutively—300,000 to 399,999.  Thus, the digit “3” appears 100,000 times in that place.  Multiply that by six places and we get a total of 600,000 3s.

October 20, 2008

Fulsome Prison: (source: www.cartalk.com; written and contributed by: Jacob Peterson)

You were recently convicted of a minor offense.  The judge sentenced you to spend one day in jail, but decided to show mercy by letting you choose any day in the next year on which to serve your sentence.  What day should you choose, and why?

Answer

Assuming that by “one day”, the judge means to sentence you to 24 hours in jail, the best day to pick is the one day a year that (in most locations in the U.S. and Canada) you can serve 24 hours while only experiencing 23 hours.  How is this possible?  If you choose to serve your sentence on the day that Daylight Savings Time goes into effect, you will get credit for the hour (between 2 a.m. and 3 a.m.) that is skipped when the clocks are moved ahead.  Daylight Savings Time currently goes into effect on the second Sunday in March, which in 2009 will be March 8.  That hour may not sound like much, but any hour spent outside of jail is a good hour!

If, on the other hand, the judge meant “from sunrise to sunset” when he said “one day” (which seems less likely, but who knows?), you would want to choose the shortest day of the year (or Winter Solstice in the northern hemisphere). Choosing the start of Daylight Savings Time wouldn’t help you in this case, since the clocks are set forward at 2 a.m.  In 2008 and 2009, the winter solstice occurs on December 21. To give you an idea of how much jail time you’ll save this way, in 2008, if you served in New York City on December 21, you would be in jail from 7:16 a.m. (sunrise) to 4:31 p.m. (sunset).  That’s 9 hours and 15 minutes.  If you served on June 22, on the other hand, you’d be in jail from 5:24 a.m. to 8:31 p.m.  That’s 15 hours and 7 minutes, or almost 6 hours more than you’d serve on the Winter Solstice!

October 11, 2008

Dividing Up the Dollars: (source: www.cartalk.com; contributed by: Jacob Peterson)

I have 1000 dollar bills and a bunch of envelopes.  I can put any number of dollar bills in each envelope.  I know that you will be asking me for a number of dollars between 1 and 1000, but I do not have any idea what amount you will ask me for.  What is the fewest number of envelopes I can use so that I can be prepared to hand you a combination of envelopes for any amount you ask for?

Answer

I should have envelopes with the following amounts: $1, $2, $4, $8, $16, $32, $64, $128, and $256 (a total of 9 envelopes).  These envelopes total $511, leaving you with $489 in dollar bills outside of the envelopes.  With some combination of $489 and the 9 dollar values in the envelopes, I can come up with any dollar value between 1 and 1000.  How?  Well, by using powers of 2 for the envelopes, we can easily get any value between 1 and 511:

511 = 1 + 2 + 4 + 8 + 16 + 32 + 64 + 128 + 256;
510 = 2 + 4 + 8 + 16 + 32 + 64 + 128 + 256;
509 = 1 + 4 + 8 + 16 + 32 + 64 + 128 + 256;
508 = 4 + 8 + 16 + 32 + 64 + 128 + 256;
507 = 1 + 2 + 8 + 16 + 32 + 64 + 128 + 256;
506 = 2 + 8 + 16 + 32 + 64 + 128 + 256;
505 = 1 + 8 + 16 + 32 + 64 + 128 + 256;
504 = 8 + 16 + 32 + 64 + 128 + 256;
503 = 1 + 2 + 4 + 16 + 32 + 64 + 128 + 256;
and so on…

For any value higher than $511, we start with the $489 that are outside of the envelopes, then add from envelopes.  Since we already know that we can get any value less than or equal to $511 from the envelopes, we will have little trouble getting any value less than $1000.  For instance, if you asked me for $777, I would give you the $489 loose dollars, plus $288 in envelopes: $256 + $32.

October 6, 2008

Alaskan Rescue: (written and contributed by: Jacob Peterson) Ten adventurers are camped at a cabin in the remote Alaskan wilderness.  One day, one of them goes missing.  The other nine decide to organize a search party.  They discover the missing adventurer’s trail, but have no idea how far away it will lead.  They want to be able to search as far away from the cabin as they can, but with all the necessary cold-weather gear, each person can only carry seven days’ worth of food and water.  In addition, if they find the missing person alive, the rescuers need to have enough food and water to get him back safely as well.  If they can travel 5 kilometers a day, what is the furthest distance away from the cabin that they can safely search, and how can they accomplish this?

Answer

The rescue team can reach 20 kilometers away from the cabin if only 6, 7, or 8 of them are on the team.  Here’s how a team of six people can make it 20 kilometers:

Before leaving on the first day, the six people have 42 days’ worth of food and water (7 days’ worth each).  After the first day, they have 36 days of supplies, and are 5 km from the cabin.  On the second day, one of the six people returns to the cabin, taking just enough food and water to reach it safely (1 day’s worth).  He gives the rest of his supplies (5 days’ worth) to the other rescuers, who split it among themselves.  Now, there are 5 rescuers, with a total of 35 days of supplies. 

After the second day, the 5 people are left with 30 days of supplies (6 days’ worth each), and are 10 km from the cabin.  Before the third day starts, another person returns to the cabin, taking with him two days of supplies, and giving his remaining four days’ worth of supplies to the remaining four rescuers.  We now have 4 people, and 28 days of supplies. 

After the third day, the 4 people have 24 days of supplies, and are 15 km from the cabin.  The process repeats again on the fourth day, after which there are 3 people left in the group, with 18 days of supplies.  They are 20 km from the cabin.  If they were to find the missing person then, they would need 16 days of supplies to return to the cabin (4 people * 4 days’ travel).  If they traveled for another day, even if one person returned to the cabin as on the previous days, they’d be left with 3 people (2 rescuers and the rescuee) and 5 days’ travel, but only 12 days of supplies.

A similar solution works with seven people; after the fourth day, there would be 4 rescuers and 21 days of supplies, of which they would require 20 to return to the cabin (5 total people * 4 days’ travel = 20).  If 8 people start out, 5 rescuers with 24 days of supplies would remain after the fourth day; they’d need all 24 to get back (6 total people * 4 days’ travel = 24).  If there are fewer than 5, or more than 8, rescuers, they can go no farther than 15 km from the cabin.  Try it yourself to find out why.

September 29, 2008

Missing Numbers:
source: www.cartalk.com
(written and contributed by: Jacob Peterson)

Three brothers named Al, Bob, and Carl run a hamburger stand.  In order for the stand to run properly, at least two of them must be there at the same time.  The only problem is that all three brothers are prone to illness.  In fact, Al is too sick to come in to work 30% of the time; Bob is sick 40% of the time; and Carl is sick 20% of the time.  In order for the stand to stay in business, it must be open at least 75% of the time.  If these percentages hold true, is the stand doomed, or can the brothers somehow keep it afloat despite their frequent sick days?

Answer

The brothers’ hamburger stand should be fine.  We can compute the probabilities easily if we convert the percentages in the problem to decimals (30% = 0.3, etc.).  The probability of each combination of brothers being sick can be calculated by multiplying probabilities.  Thus, if we wanted to find the probability that Al and Bob are well, but Carl is sick, we multiply the chances of Al not being sick (100% – 30% = 70% = 0.7) by the chances of Bob not being sick (100% – 40% = 60% = 0.6) and the chances of Carl being sick (20% = 0.2).  The result, 0.7 × 0.6 × 0.2 = 0.084 = 8.4%, is one part of our answer.  The table below shows the data for all the possible combinations of sick and well brothers:

Brothers There (Chance)

Brothers Not There (Chance)

Calculation

Final %

A (0.7), B (0.6), C (0.8)

----

0.7 × 0.6 × 0.8 = 0.336

33.6%

A (0.7), B (0.6)

C (0.2)

0.7 × 0.6 × 0.2 = 0.084

  8.4%

A (0.7), C (0.8)

B (0.4)

0.7 × 0.8 × 0.4 = 0.224

22.4%

B (0.6), C (0.8)

A (0.3)

0.6 × 0.8 × 0.3 = 0.144

14.4%

A (0.7)

B (0.4), C (0.2)

0.7 × 0.4 × 0.2 = 0.056

  5.6%

B (0.6)

A (0.3), C (0.2)

0.6 × 0.3 × 0.2 = 0.036

  3.6%

C (0.8)

A (0.3), B (0.4)

0.8 × 0.3 × 0.4 = 0.096

  9.6%

----

A (0.3), B (0.4), C (0.2)

0.3 × 0.4 × 0.2 = 0.024

  2.4%

Total:

100%

If we add up the top four rows of the table, we can find the total percentage for all the combinations in which at least two brothers are at the stand: 33.6% + 8.4% + 22.4% + 14.4% = 78.8%.  Since this is greater than 75%, the brothers’ hamburger stand will (barely) be able to stay afloat.

September 22, 2008

Missing Numbers:
source: www.cartalk.com
(written and contributed by: Jacob Peterson)

In a certain puzzle, a series of digits is used to represent a string of letters that make up a secret word.  In this type of puzzle, the same digit always represents the same letter (and different digits always represent different letters).  For instance, the digits “34843” could represent “radar” (r = 3, a = 4, and d = 8) or “tenet” (t = 3, e = 4, and n = 8).  Given these rules, can you think of a word that the following series of digits could represent?

512121234

Yes, this word has the same pair of letters (the “12”) repeated three times in a row!  Since this is a tough word, I’ll go ahead and give you a few hints.  The “5” represents the letter “L”, the “3” represents the letter “U”, and the “4” represents the letter “E”.  You just have to figure out what the “1” and the “2” represent:

L121212UE

Another hint: the solution is a word about someone who uses words.  Good luck!

Answer

To fill in the remaining letters in the word “L121212UE”, you can take either of two approaches.  The “hard” approach is to think about the clue, namely that the word is about “someone who uses words”.  If you think of some words about words that start with “L”, you may notice the root log, which is often used at the end of a word (often with a “ue” on the end): monologue, dialogue, epilog, etc.  This root, which means “speech,” gives us all we need to fill in the rest of the word.  If it starts with “L-O-G”, then the digit 1 must be “O” and the digit 2 must be “G”.  This means that the resulting word is “logogogue”.  The suffix –gogue means “one who leads”, as seen in the vocab words demagogue (one who leads people; i.e., a ruler) and pedagogue (one who leads children; i.e., a teacher).  Thus, logogogue means “one who leads others in the use of speech or words”.  Hopefully, by writing C2’s Words of the Week, I am acting as a logogogue!

The easier way to solve this puzzle (which some may consider cheating) is to utilize an online dictionary with wildcard capability, such as the OneLook dictionary (http://www.onelook.com/).  Wildcards are symbols (such as * and ?) to search for words when you don’t know all the letters of the word.  This is especially useful when trying to find an answer for a crossword puzzle.  On these sites, the ? symbol is used to represent any letter, so if you searched for “b?d”, you would get the following results: bad, bed, bid, and bud.  So, if you wanted to search for the word from this puzzle, you could enter in “l??????ue” (six ?’s).  If you do this, only one result will come up: logogogue.

September 15, 2008

Missing Numbers:
source: www.cartalk.com
(written and contributed by: Jacob Peterson)

Here's a challenge for you: I am going to read you a list of 99 of the 100 numbers between 1 and 100 (inclusive), but they will not be in order, and since there are only 99 of them, there will be one number that I will leave out. Once I finish reading the list, you have to tell me which number I left out. You do not get to write anything down. What is the easiest way to be sure you pick the right number?

Answer

The key to figuring out the missing numbers is to add all the numbers together as they are read.  Then, you just subtract the sum of those 99 numbers from the sum of all the numbers from 1 to 100, which is relatively easy to calculate (more on this below).  So, let’s say you add up all the numbers and get 4992.

Since the sum of any set of consecutive integers is equal to the median of the set times the number of integers in the set, we just need to figure out the median of the 100 integers to find their sum. Since there are an even number of integers in the set, the median is the average of the middle two, in this case 50 and 51.  Thus, the median is 50.5.  Now, we just multiply 50.5 by the number of integers in the set (100) to get our sum: 5050.

Now, we just subtract 4992 from 5050 and we have our missing number (in this case, 58).  As a shortcut, you don’t have to remember the first two digits of your sum—they will always be “49” if the last two digits are 50 or higher, and “50” if the last two digits are less than 50.  In other words, the range of possible sums is from 4950 to 5049.  Using this shortcut, we may get a sum of, say “78”.  This represents 4978, which, subtracted from 5050, would give us a missing number of 72.

September 4, 2008

Sugar Sugar:
(written and contributed by: Jacob Peterson)

Veruca and Willy have a large candy bowl.  The bowl can hold 50 of Willy’s gumdrops.  Every minute, Willy adds 4 gumdrops to the bowl.  Every minute, right after Willy adds the gumdrops to the bowl, Veruca snatches 3 of the gumdrops from the bowl and shoves them into her mouth.  How long will it take for the bowl to be completely filled with gumdrops?

Answer

Since 4 gumdrops are added and 3 are taken away each minute, it would be tempting to say that it takes 50 minutes for the bowl to be filled. There is one trick, though. After 45 minutes, there are 45 gumdrops in the bowl. After 46 minutes, there are 46 gumdrops. Then, in minute 47, Willy adds 4 gumdrops. At that point, the bowl of candy is full. It doesn't matter that Veruca will soon take 3 gumdrops from the bowl, since the question doesn't specify that it has to be full at the end of a minute. Thus, the answer is 47 minutes.

August 28, 2008

Cry Vowel Part 2:
(written and contributed by: Jacob Peterson)

Last week, I asked about two words that use all the vowels in order.  This week, I’m thinking of a different word.  This word uses the five main vowels (not “y”), and only have one consonant.  The vowels are not in order in this word.  It’s a very rare (but cool!) word.  If you can’t find it, there is a much more common word that uses only two consonants.  A hint for the easier word: you’d be much more likely to see it in a forest in California.

Answer:

The shortest word in the English language that has all 5 main vowels is the rarely used medical term eunoia, which means (roughly) “well mind”.  This word comes from the Greek prefix eu- (“good”) and the Greek root –noia (“mind)”.  So, the next time you feel better after a time of sadness, you could say that you have returned to a state of eunoia.  The shortest common word that has all five vowels is sequoia, the type of tree.  Sequoia trees, which grow in California, are the tallest in the world, with many measuring over 300 feet in height.  The world’s tallest tree, named “Hyperion,” is a 379-foot sequoia!

August 21, 2008

Cry Vowel:
(written and contributed by: Jacob Peterson)

I’m thinking of two words.  Each of the words uses all of the English vowels (including “y”) in order, and does not have any other vowels.  What words are they?  They’re not exactly common words, but if you have a good SAT-level vocabulary, you should know at least one of them. (Hint: Think of the suffixes first!)

Answer:

The two words are facetiously and abstemiously.  Both have the vowels a, e, i, o, u, and y—in order—and no other vowels.  So you know, facetious means “not literal or serious; humorous” and abstemious means “sparing or moderate, particularly related to eating and drinking.”  So, I could lighten the mood of a dreary gathering by talking facetiously, and I could try to lose weight by eating abstemiously.  And in both cases, I’d be using all the vowels!

August 14, 2008

“DEAD” Letter Office:
(written and contributed by: Jacob Peterson)

While making a standardized test—you know the kind, multiple choice, with letters A through E—I came across the letters “DEAD” in order on an answer key.  This led me to wonder: what is the longest word in the English language that can be spelled out on a standard multiple-choice answer key?  In other words, what is the longest word that only uses the letters A, B, C, D, and E?

Answer:

There are a variety of 6-letter words that can be formed using the letters A-E: decade, accede, deeded, bedded, beaded, and a few obscure words.  The only 7-letter word that I have found is acceded.  What was the longest word you found?  Can you think of one that is 8 or more letters?  If so, let us know!

August 11, 2008

Secret Sequence:
(source: www.cartalk.com; contributed by: Jacob Peterson)

What are the next three numbers of the following sequence?

3, 3, 5, 4, 4, 3, 5, 5, 4, __, __, _

Answer:

The next three numbers in the sequence are: 3, 6, and 6. The solution has nothing to do with the numbers themselves, so trying to find a mathematical pattern will only prove fruitless. The key is connecting each number’s position in the sequence to the number itself:

Number:

3

3

5

4

4

3

5

5

4

Position:

1

2

3

4

5

6

7

8

9

How does that help?  Well, all you have to do now is spell out the “Position” numbers:

Number:

3

3

5

4

4

3

5

5

4

Position:

one

two

three

four

five

six

seven

eight

nine

See the pattern yet?  Each number refers to the number of letters in its position.  Since the next three positions will be “ten”, “eleven”, and “twelve”, our next three numbers must be 3, 6, and 6, or the number of letters in each of those positions.

August 4, 2008

Keeping Cool:
(source: www.cartalk.com; contributed by: Jacob Peterson)

In the early days of the space program, NASA experienced a recurring problem with many of its electronic systems: they kept overheating.  To remedy this, the NASA engineers installed new, larger cooling fans on all the equipment.  But the problems continued.  It seems the engineers had forgotten a very basic principle. What did they forget, and why didn’t the fans help the problem?

Answer:

Why didn’t the cooling fans on the electrical equipment help keep the equipment cool?  Well, fans cool by blowing air… and in space, there’s no air!  Though today’s space shuttles are pressurized and have air in the cabins, this was not the case in the early days of the space program. Because of this, early astronauts had to wear their suits at all times, of course.

July 28, 2008

Helping Handshakes
(source: www.cartalk.com; contributed by: Jacob Peterson)

Carla and her husband are going to dinner with four other married couples.  Since many of the attendees do not know each other, there is a round of handshakes before the dinner.  Each person shakes hand with any person that he or she is meeting for the first time (obviously, no one then would shake hands with his or her spouse).  At the end of the dinner, Carla asks the other 9 people how many hands they had shaken earlier.  The responses were all different: 0, 1, 2, 3, 4, 5, 6, 7, and 8. How many hands did Carla shake before the dinner?

Answer:

Carla shook 4 hands.  How do you figure this out?  Well, a good place to start is with the person who shook 8 hands (let’s call him James).  Since there are 10 people at the party, and James obviously didn’t shake his own hand or his wife’s hand, he must have shaken hands with every other person at the dinner party.  That means that his wife (Anita) must be the person who shook 0 hands, since she is the only person who didn’t shake hands with her husband.

The person who shook 7 hands (Ivan) thus shook everyone’s hand but his own, his wife’s, and Anita’s.  This means that his wife (Betty) must be the person who shook only 1 hand, since she is the only one who shook James’ hand but not Ivan’s.  Next, we look at the person who shook 6 hands (call him Gary).  Gary shook hands with everyone but himself, his wife, Anita, and Betty.  Following the same process, we can see that his wife (Debby) must have shaken 2 hands (only James’ and Ivan’s).  Similarly, the person who shook 5 hands, Frank, must be married to the person who shook 3 hands, Eva.

Who’s left over?  Only Carla and her husband (we’ll call him Harry).  We know that Harry must be the person who answered that he shook 4 hands (the only answer that we have not yet accounted for).  He shook hands with the four other men: James, Ivan, Gary, and Frank.  Looking back at our analysis, we see that none of the women shook hands with Carla; only James, Ivan, Gary, and Frank did.  Thus, Carla (like Harry) shook hands with 4 people.

To help you see this, we’ve included below a graphical version of this solution and a table of all the handshakes.  A box indicates a marriage; a line indicates a handshake.  Carla’s handshakes are in orange:

Anita (0): (no handshakes)
Betty (1): James
Debby (2): James, Ivan
Eva (3): James, Ivan, Gary
Carla (4): James, Ivan, Gary, Frank
Harry (4): James, Ivan, Gary, Frank
Frank (5): James, Ivan, Gary, Harry, Carla
Gary (6): James, Ivan, Eva, Frank, Harry, Carla
Ivan (7): James, Debby, Gary, Eva, Frank, Harry, Carla
James (8): Betty, Ivan, Debby, Gary, Eva, Frank, Harry, Carla

July 21, 2008

Strange Sums:
(written and contributed by Jacob Peterson)

Joseph forgot his calculator one day, so before he went to his Calculus class, he borrowed his friend’s calculator, a fancy model that Joseph had not used before.  When he got to class, he opened the calculator and started punching in some numbers so he could get used to the strange device.  He put in the addition 17 + 19, but was startled to see the calculator’s result: 30.  Confused, he put in the addition 15 + 14, but this time he got the expected result: 29.  While wondering if his friend’s calculator was broken, he tried one more addition: 15 + 19.  When he saw the calculator’s answer, he knew immediately what was going on.  What was the calculator’s result for this last addition, and what was up with the calculator?  (Hint: the calculator was working properly.)

Answer:

The problem with Joseph’s friend’s calculator?  It was in hexadecimal mode.  In hexadecimal, there are 16 digits instead of 10 (0 through 9, then A through F).  Thus, the number 15 in the normal decimal system would be expressed as F in hexadecimal mode.  Instead of having a ones place, a tens place, and a hundreds place (etc.) like a decimal number, a hexadecimal number has a ones place, a sixteens place, and a two-hundred-fifty-sixes place (256 = 16 * 16).

So, when Joseph punched in the addition “17 + 19” and got the result “30” in hexadecimal, he was punching in the equivalent of the decimal addition “23” (16 + 7) + “25” (16 + 9) = “48” (16 * 3 + 0).  “15 + 14 = 29” is, in decimal, “21 + 20 = 41”.  And the final addition he punched in, “15 + 19” was the hexadecimal equivalent of “21 + 25,” and its answer, which is “46” in decimal, was “2E” in hexadecimal.  When Joseph saw the E, he knew that he was in hexadecimal mode, and changed back to the standard decimal mode.

July 14, 2008

Nugget Conundrum:
(source: www.cartalk.com; contributed by Jacob Peterson)

At a certain fast-food restaurant, you can purchase packages of chicken nuggets in three sizes: 6 nuggets, 9 nuggets, and 20 nuggets.  What is the largest number of nuggets that you cannot purchase, using some combination of the three sizes?  There is no limit to the number of packages of nuggets you can buy.

Answer:

What this question is really asking (in math terms) is this: What is the largest number that cannot be expressed as the sum of multiples of 6, 9, or 20?  Let’s start by listing some multiples of those numbers:

6, 12, 18, 24, 30, 36, 42, 48, 54, 60, …
9, 18, 27, 36, 45, 54, 63, …
20, 40, 60, …

Now, let’s make a chart of some numbers, and whether they can be expressed as a sum of these numbers:

#

Sum of Multiples of 6, 9, 20?

#

Sum of Multiples of 6, 9, 20?

24

yes: 24 (multiple of 6)

34

no

25

no

35

yes: 20 + 9 + 6

26

yes: 20 + 6

36

yes: 36 (multiple of 6)

27

yes: 27 (multiple of 9)

37

no

28

no

38

yes: 20 + 18

29

yes: 20 + 9

39

yes: 30 + 9

30

yes: 30 (multiple of 6)

40

yes: 40 (multiple of 20)

31

no

41

no

32

yes: 20 + 12

42

yes: 42 (multiple of 6)

33

yes: 24 + 9

43

no

So far, 43 is the largest number that cannot be expressed in this way.  After 43, something interesting happens:

#

Sum of Multiples of 6, 9, 20?

#

Sum of Multiples of 6, 9, 20?

44

yes: 20 + 24

47

yes: 27 + 20

45

yes: 36 + 9

48

yes: 48 (multiple of 6)

46

yes: 40 + 6

49

yes: 40 + 9

We could keep going, but we don’t have to.  Why?  Because now that we have found six consecutive numbers that are sums of the multiples, we can add six to each of those numbers to prove that the next six (50 through 55) do not fit, like so:

#

Sum of Multiples of 6, 9, 20?

#

Sum of Multiples of 6, 9, 20?

50

yes: 44 + 6

53

yes: 47 + 6

51

yes: 45 + 6

54

yes: 48 + 6

52

yes: 46 + 6

55

yes: 49 + 6

…and so on for each set of six numbers after that.  Thus, we know that 43 is the last number that we cannot express in this way.  In other words, 43 is the largest number of nuggets that you cannot buy.

 

July 7, 2008

The White Stone Hoop:
(source: written and contributed by Jacob Peterson)

(Last week, we featured the classic riddle “The Green Glass Door.”  This week, we are offering my take on the same game, called The White Stone Hoop. While the object of the riddle is similar to the Green Glass Door, the solution is a little tougher. Good luck!)

In another galaxy, even farther away, there is a magical object known as the White Stone Hoop. Only certain objects can go through this hoop. The local villagers have figured out, for instance, that cabbage will go through the hoop, but lettuce will not.  Similarly, ghosts can go through the hoop, but not spirits; cars can go through, but not trucks; and snow can go through, but not rain.  Here are a few more examples.  Can you solve the puzzle, and come up with some of your own?

Autumn can go through, but not winter, spring, or summer.
Calm people can go through, but not quiet people.
Oxygen and xenon can go through, but not hydrogen or nitrogen.

Answer:

Much like with the Green Glass Door riddle, the key to this riddle is in the letters.  The rule for the White Stone Hoop, however, doesn’t rely on double letters (as you have no doubt guessed).  I’ve bolded the key letters in the examples below:

cabbage will go through the hoop, but lettuce will not
ghosts can go through the hoop, but not spirits
cars can go through, but not trucks
snow can go through, but not rain

Have you figured it out?  In the letter pairs ab, gh, rs, and no, the second letter always follows the first alphabetically.  Thus, any word that contains two consecutive letters from the alphabet will go through the White Stone Hoop, which incidentally contains a hint to the solution (white, stone, and hoop all have consecutive-letter pairs).  Can you think of any other examples?

June 30, 2008

The Green Glass Door:
(source: written and contributed by Jacob Peterson)

In a galaxy far, far away, there is a magical door known as the Green Glass Door. What makes the Green Glass Door so special is that only certain things can go through it. For instance, sheep can go through it, but not cows; trees can go through it, but not bushes; and boots can go through it, but not shoes. How does the Green Glass Door determine what can go through it and what cannot? Can you determine the rule that it follows, and come up with a few examples that fit the rule? Here are a few more examples:

Bottles can go through it, but not cans.
Doors can go through it, but not windows.
Balls can go through it, but not bats or gloves.

Answer:

This key to this classic riddle is to consider, not the objects themselves, but the letters in the words.  What do the words “sheep,” “trees,” and “boots” have that the words “cows,” “bushes,” and “shoes” do not?  The answer is a double-letter combination: sheep, trees, boots. Any word with the same letter twice in a row will “go through” the Green Glass Door.  You can form your own examples by thinking of a word with a double letter (like, say “letter”) and then thinking of a synonym or similar word that does not have a double letter (like “vowel” or “consonant”).  Thus, you could get the example “Letters can go through it, but not vowels or consonants.”

By the way, there is a clue to the solution in the title of the riddle: every word in Green Glass Door has a double-letter combination in it.

June 23, 2008

Filling in the Blanks:
(source: www.cartalk.com; contributed by Jacob Peterson)

In the following sentence, the three blanks contain the same letters, in the same order. The only difference is that the first blank has no space in it, and the last two have one space (but in different places). What letters can be put in the blanks so that the sentence makes sense?

The ____ doctor was ____ to operate because she had ____.

For example, if the first blank was “teasing,” then the second or third blank could be “tea sing” (except for the fact that this makes no sense!). Good luck finding a set of letters that works for all three (and makes sense).


Answer:

The letters that complete all three blanks are “notable.” Here’s how it works:

The notable doctor was not able to operate because she had no table.

There you have it!

June 16, 2008

Dividing Up the Hours:
(source: www.cartalk.com; contributed by Jacob Peterson)

You are given a drawing of a standard circular clock, with the numbers 1 through 12 arranged clockwise around the edge of the circle. Your task is to draw two lines that go through the circle, and that divide the clock up into sections. The numbers in each section must add up to the same number. Can you do it?


Answer:

The trick to this puzzle is that the two lines do not have to intersect. If the lines intersect, then the clock will be divided up into four areas. Since the numbers on a clock total 78, and 78 does not divide evenly by 4, there is no way for four regions to all have the same value!

Instead, we will divide the clock into three regions. The first line starts between the 10 and the 11 and ends between the 2 and the 3. The second line starts between 8 and 9 and ends between 4 and 5. The three regions are as follows:

  1. 11, 12, 1, and 2 at the top (11 + 12 + 1 + 2 = 26)
  2. 10, 9, 3, and 4 in the middle (10 + 9 + 3 + 4 = 26)
  3. 8, 7, 6, and 5 at the bottom (8 + 7 + 6 + 5 = 26)

Here is a picture version of the solution. Pretty neat, huh?

June 9, 2008

Switcheroo:
(source: www.cartalk.com; contributed by Jacob Peterson)

Suppose you are in a long hall. In the long hall are 1,000 light bulbs in a row, each with its own switch (all of them are turned off to begin with). A person comes along and flips every switch, turning all the lights on. Then, another person walks by and flips every other switch. He is immediately followed by someone who flips every third switch, someone who flips every fourth switch, and so on until someone comes along who only flips every thousandth switch.

After all of this switch-flipping, some of the lights are off and some are on. How many of them are on? How can you tell which ones?


Answer:

Let’s start by examining a random light bulb in the hall, say, the 14th one. How many times will its switch be flipped? Obviously, the first person, who flips every switch, will flip it. The 2nd person (who flips every 2nd switch) and the 7th person will also flip it; finally, the 14th person will flip it. That’s a total of 4 flips, which, since it started in the “OFF” position, means that the bulb will be off once all is said and done. The same process can be repeated for every switch, but that would be time consuming.

The trick here is to realize that in order for a bulb to be on, its switch must be flipped an odd number of times (ON-OFF-ON, ON-OFF-ON-OFF-ON, etc.). As you may have noticed from our example, a bulb’s switch is flipped by the people representing the factors of the number of the bulb (i.e., the 14th switch is flipped by the 1st, 2nd, 7th, and 14th people; 1, 2, 7, and 14 are the factors of 14). Put these two facts together, and you realize that the bulb numbers that end up in the “ON” position must have an odd number of factors.

What numbers have an odd number of factors? It turns out that this is only true of perfect squares. Since all factors have a pair that they are multiplied by to equal the number (i.e., 2 and 7 are a pair, since 2 * 7 = 14), most numbers will have an even number of factors. But with perfect squares, one of the factors (the square root of the number) is paired with itself. As an example, 9 has the factors 1, 3, and 9 (1 and 9 are pairs, and 3 is paired with itself).

To solve the problem, then, we just count up all the perfect squares less than or equal to 1000. They are: 1, 4, 9, 16, 25, 36, 49, 64, 81, 100, 121, 144, 169, 196, 225, 256, 289, 324, 361, 400, 441, 484, 529, 576, 625, 676, 729, 784, 841, 900, and 961. Thus, 31 light bulbs are on after the process is complete (a shortcut would be to just take the square root of 1000, ~31.6228, and round down to 31; this gives you the last integer that, when squared, is less than 1000).

June 2, 2008

Inherited Problems:
(source: www.cartalk.com; contributed by Jacob Peterson)

Old Mr. Smith was eagerly anticipating the birth of his first child with his (much younger) wife. Unfortunately, Mr. Smith had a terminal disease and knew he would not live to see the baby’s birth. Knowing this, he decided to add the following provision to his will:

“If my child is a girl, I will leave two-thirds of my estate to my daughter, and one third to my wife. If my child is a boy, I will leave two-thirds of my estate to my wife and one third to my son.”

Not long after this, Mr. Smith passed away. However, when his wife gave birth, she discovered (to her surprise) that she had been pregnant with twins, as she gave birth to both a boy and a girl. This left Mr. Smith’s lawyer with a dilemma: how should he divide Mr. Smith’s estate while adhering to the intent of the will?


Answer:

Two things are clear from Mr. Smith’s wishes:

  1. He wants his daughter to receive twice as much as his wife (two-thirds to one-third) and
  2. He wants his wife to receive twice as much as his son (by the same ratio).

So, if we assume that the son receives one part of the inheritance, the wife must thus receive two parts, and the daughter four parts. Adding these together, we get a total of seven parts. Thus, the daughter should receive four-sevenths of the estate, the wife two-sevenths, and the son one-seventh.

May 26, 2008

Creative Measurement:
(source: www.cartalk.com; contributed by Jacob Peterson)

Recently, I was attempting to make a drink using a powdered drink mix. The mix called for 6 ounces of water. Unfortunately, I was staying in a hotel room, and all I had was a 9-ounce glass and a 4-ounce tumbler. What is the quickest way that I could measure exactly 6 ounces of water using only the glass and the tumbler? Assume that I have a sink with a drain and as much water as I want.


Answer:

First, fill the 9-ounce glass. Then, fill the 4-ounce tumbler using the water in the glass. This should leave you with 5 ounces in the glass and 4 ounces in the tumbler.

Next, dump the water in the tumbler down the drain, and fill the tumbler again using the water in the glass. Now there is 1 ounce in the glass and 4 ounces in the tumbler. Again, dump the water in the tumbler down the drain.

Next, transfer the 1 ounce of water from the glass to the tumbler. Then, fill the entire glass with water (9 ounces worth). There are now 9 ounces in the glass and 1 ounce in the (4-ounce) tumbler.

Finally, fill the tumbler using the water from the glass. Since this requires 3 ounces of water, the glass will now have 6 ounces in it. Now I can add the drink mix and enjoy!

May 19, 2008

Building Words:
(source: www.cartalk.com; written and contributed by Jacob Peterson)

After a recent game of Scrabble, I decided to play a different word game with the letter tiles. I challenged myself to start with a valid 1-letter English word (“I” or “a”, basically) and add a letter to that word to form a valid, 2-letter English word (“pi” or “as”, for example). I continued in this vein, adding letters one at a time (I could add the letter anywhere in the word: at the beginning or end, or in the middle) so that every word that I formed was a valid English word. As an example, here was how I formed the word “spines”:

I » in » sin » spin » spins » spines

I eventually built a 9-letter word that fit my criteria (there are actually several 9-letter words and even a couple longer words). Can you think of one? What is the longest word that you can build in this manner?


Answer:

Here are some nine-letter words that you can build using the method described (one letter at a time, with every step along the way forming a valid English word):

  • I » in » sin » sing » sting » siting » sitting » spitting » splitting
  • I » in » sin » sing » singe » singer » stinger » stringer » stringier
  • a » at » ate » sate » state » estate » restate » restated » restarted
  • I » in » pin » ping » aping » taping » tapping » trapping » strapping

There is also at least one 10-letter word (assuming you think that “estating” is a valid word):

  • I » in » sin » sing » sting » sating » stating » estating » restating » restarting

Finally, here is an obscure 11-letter word that works (at least according to the Scrabble dictionary):

  • I » pi » pin » ping » oping » coping » comping » compting » competing » completing » complecting

So you know, complecting means “joining by weaving,” compting is an archaic form of “counting,” comping means “providing something for free, ” and oping is an archaic form of “opening.”

May 12, 2008

Mileage Restrictions May Apply:
(written and contributed by Jacob Peterson)

I am a fan of palindromes, so naturally I was pleased when I turned on my car this morning and saw that the mileage on the odometer was a 5-digit palindrome. My delight deepened when, after driving exactly a mile, the last four digits of the odometer formed a different palindrome. I became downright ecstatic when, after driving one more mile, the last three digits of the odometer formed yet another palindrome. What did the odometer read when I first started the car this morning?


Answer:
The most important digit for us to consider for this brainteaser is the last one, since we know it changes with every mile that is driven. Since the initial mileage is a 5-digit palindrome, our first (ten-thousands) digit must be the same as our last (ones) digit. After a mile has been driven, the last four digits are a palindrome, so the second (thousands) digit must be the same as the new last (ones) digit. Similarly, after the second mile has been driven, the last three digits are a palindrome, so the third (hundreds) digit must be the same as the new last (ones) digit.

If we call the initial first digit n, we can express our initial mileage as (the one caveat here is that we are dealing with digits here, not integers, so if n is 9, then n + 1 = 0, not 10):

n    n+1    n+2    n+1    n

Similarly, after one mile, our mileage must read:

n    n+1    n+2    n+1    n+1

You may have noticed that the last four digits here are not a palindrome; in order for them to be a palindrome, the fourth (tens) digit must be n+2, not n+1. What this means is that adding 1 to n requires us to carry a 1 into the next column, thus increasing it by 1 as well. Therefore, the digit n must be 9 (since 9 + 1 = 10). Plugging this into our formula above, our three mileages are:

90109
90110
90111

May 5, 2008

A Perfect Problem
(written and contributed by Jacob Peterson)

Which of the following numbers is a perfect square, and how can you tell quickly?

20,912,987,165,498,363,332
20,657,109,569,430,112,548
20,312,375,059,056,460,917
20,489,654,354,987,012,343
20,865,620,175,800,955,129

Answer:
The last number (20,865,620,175,800,955,129) is the perfect square (of 4,567,890,123).  The key is in the final digit: perfect squares cannot end in the digits 2, 3, 7, or 8. We can determine this by squaring all 10 digits, and seeing what the last digit of each square is:

02 =   0
12 =   1
22 =   4
32 =   9
42 = 16
52 = 25
62 = 36
72 = 49
82 = 64
92 = 81

Thus, regardless of how many digits come before the last digit, the last digit of a perfect square must be 0, 1, 4, 9, 6, or 5.  This eliminates the first four numbers, leaving the fifth as the only possible perfect square.

April 28, 2008

A Prime Prize
(written and contributed by Jacob Peterson)

Your school’s Math Club is having a prime numbers contest. In the contest, the club members are given a list of five very large numbers. The first person to identify which one is the prime number wins the prize (a Prime Rib dinner at the local steakhouse). The numbers are revealed to be:

11,791,321,567,913,548,972
12,764,787,846,358,441,471
13,680,287,964,781,234,568
14,009,057,680,846,587,657
15,189,316,549,873,136,793


Within ten seconds, the girl sitting next to you raises her hand. After a few seconds spent conferring with the club president, she is awarded the prize. Which number is prime, and how did she know so quickly?

Answer:
Well, the first and third numbers end in an even number, so they are divisible by 2, and thus are not prime. That leaves the three odd numbers. If we can eliminate two of them, we’ll know the answer. So, let’s check to see if any of the three odd numbers is divisible by 3. To do this, let’s add up their digits. A fun fact related to multiples of 3 is that any number whose digits add up to 3 is also a multiple of 3. So, let’s add some digits:

1 + 2 + 7 + 6 + 4 + 7 + 8 + 7 + 8 + 4 + 6 + 3 + 5 + 8 + 4 + 4 + 1 + 4 + 7 + 1 = 97

1 + 4 + 0 + 0 + 9 + 0 + 5 + 7 + 6 + 8 + 0 + 8 + 4 + 6 + 5 + 8 + 7 + 6 + 5 + 7 = 96

1 + 5 + 1 + 8 + 9 + 3 + 1 + 6 + 5 + 4 + 9 + 8 + 7 + 3 + 1 + 3 + 6 + 7 + 9 + 3 = 99

Since 96 and 99 are both multiples of 3, the last two numbers are multiples of 3 and cannot be prime. Thus, the number 12,764,787,846,358,441,471 must be prime.

April 21, 2008

Wild Cards
(written and contributed by Jacob Peterson)

The latest game show craze is a show called “Wild Cards.” On the show, each contestant is given a standard deck of cards (no Jokers). The contestant is then asked to divide the cards into at least two stacks (there is no upper limit to the number of stacks). The contestant (after several commercial breaks) is then blindfolded. Each stack is shuffled, and the host of the show places the stacks in identical boxes. The contestant’s blindfold is then removed. After a few more commercials, the contestant chooses one of the boxes, and the stack of cards within that box is removed and spread out on the table (face down, of course). The contestant then (after yet more commercial interruption) chooses one of the cards. If the card is an ace, the contestant wins $1,000,000. If the card is not an ace, the contestant wins nothing.

You are about to appear on “Wild Cards.” How should you divide up the cards so as to give yourself the best chance of winning the $1,000,000?

Answer:
To maximize your chances of winning on “Wild Cards,” you need to consider two sets of probabilities: the chance that you will pick a given stack, and the chance that you will select an ace from the chosen stack. As it turns out, your best chance is to split the deck into five stacks. Four of the stacks will consist of just one card (an ace), while the other stack contains the other 48 cards. Thus, your odds of selecting one of the ace “stacks” is 4/5; if you select an ace stack, you are guaranteed to win (since the chances are 1/1 that you will then pick the ace), whereas if you select the other stack, you are guaranteed to lose (since the chances are 0/48 that you will get an ace).

If you divide the deck into fewer stacks (say, 4), the best you can do is to have 3 stacks containing just an ace, and a fourth stack with one ace and the other 48 cards. The odds of winning in this case are 3/4 + 1/49, or approximately 0.77 (less than 4/5, or 0.8). If you divide the deck into more stacks (say, 6), the best you can do is to have 4 stacks with just an ace, and two stacks without (it doesn’t matter how you divide the last two). The odds then are 4/6 + 0, or about 0.67.

April 14, 2008

Digit Moving
(written and contributed by Jacob Peterson)

The equation below is not true. Can you make it true merely by moving one digit? You cannot move the signs or add any additional signs or digits.

43 – 62 = 19

Answer:
The trick to this brainteaser is to make the 4 an exponent (this doesn’t constitute “adding a sign” since there is no operator for exponents):

3^4 – 62 = 19 (3^4 = 81; 81 – 62 = 19)

April 7, 2008

Light Bulbs
(source: www.brainden.com; contributed by Jacob Peterson)

You are in a room with three light switches. In the next room, there are three identical light bulbs. Each switch is connected to exactly one of the light bulbs. If you can only enter the next room once, how can you identify which switch goes with which bulb? Note: you cannot see into the next room or get help from any other person.

Answer:
First, turn on the first switch. Leave it on for a few minutes. Then, turn it off, and turn on the second switch. Now, go into the room with the light bulbs. The bulb that is on obviously corresponds with the second switch. Feel the other two bulbs—one of them will be warm. The warm bulb is the one that had been on for several minutes, and thus the one that corresponds with the first switch. The remaining bulb is paired with the third switch.

March 31, 2008

Desert Escape
(written and contributed by Jacob Peterson)

Four prisoners are trying to devise a way to escape from their desert prison camp. At the camp, there is a fuel pump and eight Jeeps. While the prisoners have figured out how to steal the Jeeps, and how to fill their tanks with gas, they have not been able to locate any means of storing additional fuel. This is unfortunate, since one Jeep can only drive halfway to the nearest gas station on a tank of gas. How can the four prisoners reach the safety of the gas station? Note: The prisoners have no means of communicating with the outside world, or of towing one Jeep behind another.

Answer:
Once each of the four prisoners has stolen a Jeep and filled its tank completely (for a total of 4 tanks of gas), there are at least two ways for them to escape:

  1. Each prisoner drives his stolen Jeep one-sixth of the way to the gas station, using up one-third of the gas in each tank. There are now eight-thirds of a tank of gas left (4 tanks – 4/3 tank = 8/3 tank). One of the prisoners abandons his Jeep, dividing its remaining gas equally among the other three vehicles. Each Jeep now has 8/9 of a tank (8/3 of a tank divided by 3 vehicles).  The four prisoners now drive in the three Jeeps, traveling another 1/6 of the distance to the gas station. Each of the three vehicles uses up another 1/3 of a tank, leaving each with 5/9 of a tank (8/9 – 1/3 = 5/9). There is a total of 5/3 of a tank of gas left. The prisoners abandon another Jeep, dividing its gas between the two remaining Jeeps, each of which now has 5/6 of a tank of gas. The four prisoners are now in two Jeeps; they drive another 1/6 of the way to the gas station, so that they are halfway there. Each of the two Jeeps uses another third of a tank, leaving each with half a tank (5/6 – 1/3 = 1/2). The four prisoners then put all the gas into one Jeep (giving it a full tank) and pile into it. They drive the remaining distance to the gas station, arriving just as the gas runs out.
  2. Same as #1, except the prisoners drive four cars 1/4 of the distance, transfer the remaining gas to just two cars (filling them completely), drive another 1/4 of the distance, and transfer the gas to just one car. As before, they are now halfway to the station, and have one car with a full tank, just enough to reach the station.
March 24, 2008

Twins
(source: www.brainden.com; contributed by Jacob Peterson)

A woman gives birth to two babies on the same date (i.e., the same day of the same month of the same year), and yet they are not twins. How can this be?

Answer:
The two babies are two-thirds of a set of triplets (or two of four quadruplets, etc.).

March 17, 2008

Mathematicians Anonymous
(written and contributed by Jacob Peterson)

The local chapter of Mathematicians Anonymous is having a meeting. As part of the meeting, the mathematicians have to split up into equal-sized groups without leaving anyone out. They try splitting into groups of three, but there is one person left over. Then they try splitting into groups of four, with no luck: there is still one person left over. They try groups of five and groups of six, but there is one person left over each time. Finally, they split into groups of seven, and there is no one left over.

If there are fewer than 500 mathematicians at the meeting, how many mathematicians are there?

Answer:
Let’s say there are B mathematicians. We know that B divided by 7 has no remainder, since when the mathematicians divide into groups of 7, there is no one left over. Thus, B is a multiple of 7. Similarly, we know that B has a remainder of 1 when divided by 2, 3, 4, 5, or 6. This means that B is 1 more than a multiple of 2 (and thus odd), 1 more than a multiple of 3, etc. Thus, B – 1 is a multiple of 2, 3, 4, 5, and 6. If we find the least common multiple (LCM) of 2, 3, 4, 5, and 6, we will have a good starting point in searching for B. It turns out that the LCM of those numbers is 60.

What this means is that B – 1 must be a multiple of 60. To find B, we must add 1 to all the multiples of 60 until we find a B that is a multiple of 7:

B – 1

60

120

180

240

300

B

61

121

181

241

301

Is B a multiple of 7?

no

no

no

no

yes

Thus, there are 301 mathematicians at the meeting.

March 10, 2008

ABBA
(source: www.brainden.com; contributed by Jacob Peterson)

Each letter in the following equation represents a digit. Replace the letters with digits to make the equation true.

(AA)^B = ABBA

Answer:
(11)^3 = 1331

There are 9 possibilities for the number AA–11, 22, 33, 44, 55, 66, 77, 88, 99. B cannot be 1, since any of those numbers to the first power is only two digits, not four. Next, we try a B of 2, which means we square each of the possible values of AA. The results of these nine calculations are 121, 484, 1089, 1936, 3025, 4356, 5929, 7744, and 9801, none of which fits the ABBA pattern that we need. Next, we try a B of 3. The first possible value of AA is 11: 113 = 1331. Voila! We have an answer. A = 1, and B = 3.

March 3, 2008

Lucky Beans?
(written and contributed by Jacob Peterson)

Amy is on a TV gameshow called “Lucky Beans.” On the show, Amy is given a gigantic bucket of jelly beans. She is told that, in order to win the grand prize, she must eat a certain number of jelly beans over the course of the show. The catch is that Biff Gellington, the host of “Lucky Beans,” will not tell her the number of jelly beans she must eat, and will only give her one hint when the show is half over.

Amy eats an average of 13 beans per minute from the start of the show until Biff gives her the hint, which is as follows: “To win the grand prize of one million dollars, you must have eaten an average of exactly 4 beans per minute over the course of the entire show. To receive the second prize of one hundred thousand dollars, you must have eaten an average of exactly 6 beans per minute over the course of the entire show. If you continue and do not win the grand prize or second prize, you will receive nothing. If you quit now, you will receive the consolation prize of ten dollars.”

What must Amy do to win the largest prize possible, and why? (Assume that there are as many jelly beans as Amy wants, and that she can eat them as quickly or as slowly as she likes.)

Answer:
In order to win the largest prize possible, Amy must quit now, even though she only gets $10 for doing so. This is because she has already eaten too many jelly beans to win the grand prize or second prize. The hint says that she must average 4 beans per minute to win the grand prize, and 6 beans per minute for the second prize. Unfortunately, the show is half over when she gets this hint—and she has already eaten 13 jelly beans per minute for the first half of the show! Let’s say the show is 60 minutes long (though it could be any length):

  • 13 jelly beans per minute * 30 minutes (half of 60 minutes) = 390 jelly beans
  • To win the grand prize: 4 jelly beans per minute * 60 minutes = 240 jelly beans
  • To win the second prize: 6 jelly beans per minute * 60 minutes = 360 jelly beans

Thus, Amy has already eaten 30 too many jelly beans to win one of the bigger prizes. If she realizes this, however, she can at least quit now and get the $10 consolation prize.

February 25, 2008

(taken from BrainDen.com)

Apples:
Five children find a basket with five identical apples in it. How can they divide the apples amongst themselves so that each child has one apple, yet there is still one apple left in the basket? (Assume that the apples cannot be cut or otherwise modified, and that the children cannot share the apples.)

Answer:
First, four of the children take one apple each. Then, the fifth child takes the last apple, puts it in the basket, and holds the basket. Thus, an apple is in the basket, and each child has exactly one apple.

February 18, 2008

(Contributed by Jacob Peterson, Director of Curriculum Development)

Masters of Logic Puzzle II (hats):
Three masters of logic wanted to find out who was wisest, so the grandmaster showed them 5 hats, two white and three black. Then he said: "I will turn off the light and put a hat on each of your heads and hide the other hats. When I turn on the light you will have equal chances to win. Each of you will see the hats of the two others, though not his own. The first one saying the color of his hat will win." Before the grandmaster could turn off the light, one of the masters guessed what the color of his hat would be.

What color hat was it and how did he know?

Answer:
The master's hat was black. He was able to deduce this from the fact that each master had an equal chance to win. In order for this to be true, all three hats had to be black. If only one of the masters had a black hat, then that master would see two white hats and thus know that his must be black; the other two masters, however, would not be certain of their hat color, making the contest unfair.

Similarly, if two of the masters had black hats and the third had a white hat, then the two with black hats would have had an advantage. They would be able to see one black and one white hat each; each one would suppose that if he had been given a white hat, then the master with the black hat would see two white hats, and thus the contest would be unfair (as described above). Eliminating this possibility leaves only the possibility that all three hats are black. Thus, the winner was the master who realized this first, and proclaimed that his hat was black.

February 11, 2008

Masters of Logic Puzzles (dots)
Three masters of logic wanted to find out who was the wisest one. So they invited the grand master, who took them into a dark room and said: "I will paint each one of you a red or a blue dot on your forehead. When you walk out and you see at least one red point, raise your hands. The one who says what color is the dot on his own forehead first, wins." Then he painted only red dots on every one. When they went out everybody had their hands up and after a while one of them said: "I have a red dot on my head."
How could he be so sure?
(taken from BrainDen.com)

Answer:
The wisest one must have thought like this:
I see all hands up and 2 red dots, so I can have either a blue or a red dot. If I had a blue one, the other 2 guys would see all hands up and one red and one blue dot. So they would have to think that if the second one of them (the other with red dot) sees the same blue dot, then he must see a red dot on the first one with red dot. However, they were both silent (and they are wise), so I have a red dot on my forehead.

Here is another way to explain it:
All three of us (A, B, and C (me)) see everyone's hand up, which means that everyone can see at least one red dot on someone's head. If C has a blue dot on his head then both A and B see three hands up, one red dot (the only way they can raise their hands), and one blue dot (on C's, my, head). Therefore, A and B would both think this way: if the other guys' hands are up, and I see one blue dot and one red dot, then the guy with the red dot must raise his hand because he sees a red dot somewhere, and that can only mean that he sees it on my head, which would mean that I have a red dot on my head. But neither A nor B say anything, which means that they cannot be so sure, as they would be if they saw a blue dot on my head. If they do not see a blue dot on my head, then they see a red dot. So I have a red dot on my forehead.

Magnet
This is a logic puzzle published in Martin Gardner's column in the Scientific American.

You are in a room where there are no metal objects except for two iron rods. Only one of them is a magnet.
How can you identify this magnet?

Answer:
You can hang the iron rods on a string and watch which one turns to the north (or hang just one rod).

Gardner gives one more solution: take one rod and touch with its end the middle of the second rod. If they get closer, then you have a magnet in your hand.

The real magnet will have a magnetic field at its poles, but not at its center. So as previously mentioned, if you take the iron bar and touch its tip to the magnet's center, the iron bar will not be attracted. This is assuming that the magnet's poles are at its ends. If the poles run through the length of the magnet, then it would be much harder to use this method.

In that case, rotate one rod around its axis while holding an end of the other to its middle. If the rotating rod is the magnet, the force will fluctuate as the rod rotates. If the rotating rod is not magnetic, the force is constant (provided you can keep their positions steady).

February 4, 2008

(Contributed by David Kim, C2 President/CEO)

There is a number.

  • If it is not a multiple of 4, then it is between 60 and 69.
  • If it is a multiple of 3, it is between 50 and 59.
  • If it is not a multiple of 6, it is between 70 and 79.

What is the number?

Answer: 76

Where do we start to find the answer?! Let's try a random guess: is it 10? No. Why? As 10 isn't a multiple of 4 it would have to be between 60 and 69 (by #1). Therefore, if it isn't a multiple of 4, it must lie between 60 and 69 (and not be a multiple of 4), i.e. 61, 62, 63, 65, 66, 67 or 69. It can't be a multiple of 3 (by #2) therefore only 61, 62, 65, 67 remain. However, by #3 none of these numbers is allowed (as none is a multiple of 6). Therefore we've reached a contradiction, and the number MUST be a multiple of 4. Let's try another random number now, 8 say, but by #3 the number must be between 70 and 79, so another contradiction. So, either the number is a multiple of 6, or between 70 and 79 (and not a multiple of 6). Every multiple of 6 is also a multiple of 3, therefore by #2 we're looking for a number between 50 and 59, which is a multiple of 3, i.e. 51, 54, 57, BUT by #1 none of these is allowed. Therefore by #3, the number lies between 70 and 79. We know it's a multiple of 4 (by #1) which leaves only 72 and 76, but by #2 (and #3) we can rule out 72. Which only leaves 76!

« Back to Brain Teasers