Jim Propp's self-referential aptitude test is quite interesting. It's a difficult puzzle but here are some hints/spoilers:
    • Q1 states that Q1-5 must have at least one B.
    • Q3 states that the number of Qs with answer E is 0-4.
    • Q4 states that the number of Qs with answer A is 4-8.
    • Q6 Answer to Q17 is C, D or E.
    • Q8 states that the number of Qs with answer of A is 4-8.
    • Q9 states that Q10 is A or Q11 is B or Q12 is C or Q13 is D or Q14 is E.
    • Q11 states that there are 0-4 Qs before it with answer B.
    • Q13 states that either 9,11,13,15,17 are A.
    • Q14 states that the number of Qs with answer D are 6-10.
    • Q17 states that the answer to Q6 is C, D, or E.
There is a discussion about it over at reddit if you need more help :-D
Click to read the comments on this entry...


God's number is 20

Aug 9, 2010  
rubiks cube

A team of researchers has shown that no position of the Rubik's cube requires more than 20 moves by using around 35 CPU-years of idle computer time donated by Google. The algorithms used by those fast cube solvers typically require more than 40 moves.

"One may suppose God would use a much more efficient algorithm, one that always uses the shortest sequence of moves; this is known as God's Algorithm. The number of moves this algorithm would take in the worst case is called God's Number. At long last, God's Number has been shown to be 20."
It should be noted that there exists configurations of the Rubik's cube which require at least 20 moves to solve, as shown by Michael Reid who proved that the ''superflip'' position requires 20 moves.

(Source Cube20.org)
Click to read the comments on this entry...


This is an interesting tv show. Golden Balls is a British daytime game show. At the end of the show the contestants have to make one last decision over the final jackpot. They are each presented with two golden balls. One has "split" printed inside it and the other has "steal" printed inside it:
  • If both contestants choose the split ball, the jackpot is split equally between them.
  • If one contestant chooses the split ball and the other chooses the steal ball, the stealer gets all the money and the splitter leaves empty-handed.
  • If both contestants choose the steal ball, they both leave empty-handed.
It is similar to the prisoner's dilemma in game theory, however, in this game the players are allowed to communicate. In North America, you might have seen the show "Friend or Foe?" which is quite similar.

split or steal
Link 1


split or steal
Link 2

There may not be a whole lot of math involved, but social scientists have studied the game. See the paper "Split or Steal? Cooperative Behavior When the Stakes are Large".
Click to read the comments on this entry...


Solving a 1000x1000x1000 Rubiks cube


(via Youtube).
Click to read the comments on this entry...


Brain teaser

May 14, 2010  
My friend just finished a job interview and was asked the following question that I thought I'd share with you (it's a somewhat common puzzle):

You are given 8 balls, 7 of which are the same weight and 1 which is heavier than the rest. Using a balance, what is the minimum number of weightings required to determine which ball is the heavier one?
balance
Click to read the comments on this entry...


Making change

Apr 3, 2010  
dollar-sign dollar-sign dollar-sign dollar-sign dollar-sign dollar-sign dollar-sign


Consider the following hypothetical situation:

You are a cashier and you have to give the customer $0.40 in change, however, you have no nickels left in your till. The goal is to minimize the number of coins that the customer receives. How do you do it?

Well this actually happened, and the process the cashier went through was to:
  • first take out a quarter (the highest denomination coin below $0.40),
  • then take out a dime (the next highest denomination below $0.15),
  • then finally, take out 5 pennies (since there is no nickels).
This produces 7 coins! The cashier realized this was not good, thought for a moment, then grabbed 4 dimes, which is the optimal solution in this case.

The "Change-making problem" is a well known problem you may have encountered if you have studied optimization. The problem is to see how one can give change with the least number of coins of given denominations.

The interesting thing is that for currency in North America, the greedy algorithm always produces an optimal solution (i.e. picking the largest denomination of coin which is not greater than the remaining amount). As we saw in the above example, if nickels were not allowable coins, the greedy algorithm would no longer produce an optimal solution for our currency denominations.

Check out the wikipedia links above for more info about this problem :P
Click to read the comments on this entry...


Topological Poker

Feb 28, 2010  
poker

This is interesting. RandomPairing over at the math subreddit listed some rules for a game called Topological Poker (aka Dicks and Hoes), which I assume he created himself. [I did a google search for "Topological Poker" and only got the subreddit, and then did a search for "Dicks and Hoes" and got a bunch of dirty sites but no poker ones.]

RandomPairing explains...
"There are four ranks of cards, instead of the usual 13. Instead of 2 through Ace, cards are ranked according to the topological classification of their symbol ... 2,3,5,7,J,K all have the same property that they can be deformed into a dot or line. These are the lowest ranked cards. In fact, by themselves they're worth dick--hence the name for these cards.

4,6,9,A are topologically the same as a 'o', and hence are called holes, ohs, or--if you can get away with it--hoes. These are the second ranked cards in ascending order.

10 is in a class by itself because it's a combination of a dick and a hoe, so it's called a Split, and is third ranked.

8,Q are topologically the same because of the way the Q is made on cards, with the slash going all the way across and creating two holes. This is the highest rank--the double hoe, or just double."
Go to the reddit link to find out the rules of play.
Click to read the comments on this entry...



Nice! That'll keep me awake :D
Click to read the comments on this entry...


Math clock

Dec 10, 2009  
math clock

Do the math! I dare you...
Click to read the comments on this entry...


Pinocchio paradox

Dec 9, 2009  
paradox

Hmmm...

Click to read the comments on this entry...



Via reddit I stumbled upon this site which talks about something called hyperreal numbers and claims that in this theory, the equation 0.999... = 1 is false.

For those who follow the internet, the question of whether 0.999...=1 has come up a quadbrazillion times on practically every math related forum and even the non-math ones. And every single time it turns into this huge argument with
non-mathematicans vs frustrated-mathematicians
and neither of them winning. Some mathie forums even have strict rules banning users against posting topics that deal with 0.999....=1.

But the site mentioned above actually gives some decent points to support why 0.999...=1 isn't necessarily true., but you have to change some of the concepts that we take for granted.

In my opinion, 0.999... and 1 are as equal as can be.
Click to read the comments on this entry...


Silly prediction quiz

Nov 1, 2009  
Take this silly quiz and we will predict your all time favorite tv show!

First pick a number from 1 to 9.

Multiply by 3.

Add 3.

Multiply by 3 again.

Add the two digits together.

Now you should get a number and find it in the chart below!

1. Smallville
2. Grey's Anatomy
3. Supernatural
4. House
5. Gossip Girl
6. Heroes
7. One Tree Hill
8. Prison Break
9. Barney & Friends
10. Family Guy
11. The Office
12. Scrubs
13. Battlestar Galactica
14. CSI
15. NCIS
16. Bones
17. Naruto
18. ER
19. Desperate Housewives
20. Ghost Whisperer
Click to read the comments on this entry...


X NDPZ FSY'Z RBYZ ZS IA ZLAKA RLAY XZ LBMMAYP.

Can you decode it? If not, let's go through some general strategies that will help :D
1. Words with one letter are either "A" or "I".

2. A very frequent 3-letter word is "THE".

3. There is an apostrophe then the letter after it is T or S. (DON'T, CAN'T, CAT'S, etc).

4. If it ends in a question mark, the first word is usually:
WHO, WHAT, WHEN, WHERE, HOW or WHY.


5. Frequent pairs of constants are TH, WH, SH or CH.

6. Frequent word endings are:
"TION", "ENT", "ANT", "ING" "ERS", "ENS" and "ED".


7. Short words where "ING" or "ED" are at the end sometimes have a double up on the last consonant, like "HOPPED" and "HUGGING".

8. In 2 letter words one is a vowel (or Y). Example, IF, BY, HE, AT.

9. If it's a word like [] ' [] .... then the second one is usually a D (or could be an M). Example, I'M or I'D.

10. Guess and test!!
Click to read the comments on this entry...


How to solve the sudokube

Oct 26, 2009  
The Sudoku Cube is a ripoff of the Rubik's Cube, where each face has the numbers 1-9 instead of colours. The goal:
put the numbers 1-9 on each side with no repetition

Sudokube.jpg It was created in 2006 by some guy named Jay Horowitz in Ohio. You can buy it at Barnes and Noble and some other places. In what follows we briefly describe how to solve it...
Of course there are lots of variations, including cubes with 4x4x4, and naming variations are Sodokube, Roxdoku. If you want to solve it you need to realize there are a few different variations on the cube, so depending which one you have, the solution will be slightly different.

Step 1: Familiarize yourself with solving a Rubik's Cube. If you don't know how to solve the Rubik's cube, then you will have a LOT of trouble with the Sudokube (trust me!).

Step 2: Note the centres of each face of your cube. Some cubes have 5's in all the centres, others have varying numbers. As in the Rubik's cube, these centres will be fixed points and stay in place when you do the "moves".

Step 3: If you have the Rubik's cube algorithm memorized, you should now have no trouble at all solving the cube!!

The end!
Click to read the comments on this entry...


Ya... so...
Tanya Khovanova has a dirty post on her math blog:


It has to do with what she calls the condom puzzle. Basically, it's a variation of the glove problem:

Suppose there are "m" doctors and "n" patients (with "n<=m"). There are "mn" combination's of examinations that pair doctors/patients. How many surgical gloves are needed so that no doctor wears a glove contaminated by a patient, and no patient is exposed to a glove worn by another doctor?

Of course "mn" is an upper bound, but the minimum number is much smaller (can you see why?).

Click to read the comments on this entry...


Hey guys, there is this game called "Tower Stack" or "Tower Bricks" or "Tower Blocks" (among other names) and you can play it on Facebook, or MindJolt Games, or Brothersoft Games (etc). Here is a screenshot to show what I am talking about:



What you have to do is:
  • - build tower as tall as possible
  • - blocks swing at top and you click mouse to drop them
  • - block will fall after you click and it MUST land on top of the block that you dropped previously (otherwise you lose a "life" - you have 3 "lives")
  • - if you drop PERFECTLY on top, you get bonus points
  • - as the tower gets bigger, it starts to shake back and forth making it harder to drop the blocks on top
Okay, let's do the first block. Just drop it anywhere on the platform as shown below.



Now drop the second block on top (see image below).



You now have 200 points, 100 from dropping the first block, and 100 from dropping the second block. Notice the 2 on the bottom left of the screen - that records the # of blocks dropped so far. Theoretically, you could go on forever dropping the blocks in this fashion scoring 100 points per drop. But as mentioned above you could get bonus points if you drop it perfectly on top as shown below:



Here we got 200 points instead of 100! Let's do another perfect drop:



Wowzers! 250 this time, instead 100 or 200! If we mess up it goes back to 100 as shown below:



Get 4 in a row and it's 300 points for that 4th block:



Get 6 in a row and it's 400 points for that 6th block:



So let's do some math! Basically the scoring works as follows:

Imperfect drops score:
100 points

Perfect drops score as follows:
(# perfect blocks in a row, score for that block)
(1, 100)
(2, 200)
(3, 250)
(4, 300)
(5, 350)
(6, 400)
(7, 450)
(8, 500)
...
(n, 50n + 100)

What this means is that if you have n-1 perfect drops in a row, on the n'th perfect drop you will score an amazing 50n+100 points! (Note that for simplicity, we take the convention that the first drop was perfect).

Obviously one can figure out the optimal strategy now. If you keep getting imperfect drops, then you only get 100 points per drop:



But if you keep getting perfect drops you will score HUGE points on each drop. Below I had 19 perfect drops, so on that drop I got an outstanding 1050. If I get another perfect drop after that, the next one will be worth 1100.



It gets harder as you get lots of blocks. In the final image below I made it up to 132 blocks, but I didn't score that high because I just couldn't get in the rhythm of successive perfect drops.



So the question you should ask yourself is:
how high of a score can you get?
Well, let's assume you only have 100 blocks to drop until it becomes too hard and the game ends.

(i) If you do 100 imperfect drops, each drop will be worth 100 points. Thus, the score would amount to:
10,000 points.

(ii) On the contrary, what if you have a perfect game so far. Then you would receive the following points:
100 + 200 + 250 + 300 + 350 + 400 + 450 + ...
Can you see what the last number will be in this sum?
If you said 5100 then you are right! This is the number of points you would get on the 100'th drop, and you can use the formula I presented to you above: 50n + 100.

Do you remember how to add up sums of numbers? Let's do it in general. Let's say you get n perfect drops in a row. How many total points would you get from those n drops? The total is:



This just follows from the sum formulas that you may have learned in either high school or university (note that the formula 50n+100 only works for n>=2, that's why we started the summation at 2). It's okay if you forgot the sum formulas or don't follow all the steps. The main point is that, if you get n PERFECT drops in a row the TOTAL number of points you will score is 25(n^2 + 5n - 2). Let's do an example. If n=5 then the total score you will have after 5 perfect drops is: 1200.

If you get 100 perfect drops in a row (which is possible!) then your total score will be:
 262,450
That's an amazing score! I checked facebook and people have like 1,600,000, which seems totally impossible, but if you get 200 perfect drops in a row you're looking at a score of over 1,000,000. Now, mathematically it's possible, but come on!! Who is going to play a game for that long and be that dedicated to get so many perfect drops! I call cheats/hacks! (if it's a real score then I'm truly jealous)!
Click to read the comments on this entry...


Tom Davis has a great article on the mathematics of sudoku. He first describes a brief history of the puzzle and how to play. Then he discusses why it is mathematically interesting (it is, trust me!). He goes through some obvious strategies that a lot of people try when doing sudoku and some other clever strategies. Definitely check it out if you have time!

sudoku.jpg
Click to read the comments on this entry...


Silly but trickly puzzle

Oct 6, 2009  
So my PhD friends couldn't solve the following problem...

3489 = 4
8410 = 4
9120 = 2
8328 = 4
2210 = 1
9910 = 3
9900 = 4
7172 = 0
3884 = 5
9889 = 6
9009 = 4
0911 = 2
8888 = 8

What is 3859?
Click to read the comments on this entry...


Identical lottery draw

Sep 18, 2009  
In Bulgaria's national lottery, the same six winning numbers were drawn twice in a row. Minister Svilen Neikov ordered an investigation after the numbers 4, 15, 23, 24, 35 and 42 were selected, in a different order, by a machine live on television on September 6th and 10th. Some thought the results were manipulated, however after an investigation there was no wrongdoing found.

A total of 18 people got all six numbers when they were drawn the second time and each got $7,700. Nobody guessed right the first draw.

Mathematicians say that the chance of drawing the same six numbers in two consecutive rounds is about 1 in 4.2 million.

The following website has some calculations dealing with lottery math and whether it's better to play 50 dollars in one lottery, or play one dollar in fifty lotteries.
Click to read the comments on this entry...


Silly math test

Sep 7, 2009  
Test your mathematics by answering the following questions (no peaking below):

1. Noah built it.
2. An expression that represents the loss of a parrot.
3. An appropriate title for Koll the knight.
4. A sunburned man.
5. What we do when it rains.
6. What you call someone who wrote for an Inn.
7. What the Captain said when his ship was attacked.
8. What a baby acorn says to his mother about his home.
9. What one does to trees which are in the way.
10. What you do if with yarn and needles.
11. April Fool's pranks that are a month late.
12. Minnie's mother?
13. When you multiply something by itself three times.
14. The musical beat for cutting tree limbs.
15. What a police dog does while looking for a woman criminal.
Answers below:
1. Arc
2. Polygon
3. Circle
4. Tangent
5. Coincide
6. Inscribe
7. Decagon
8. Geometry
9. Axiom
10. Unit
11. Matrix
12. Minimum
13. Cubit
14. Logarithm
15. Centre
Click to read the comments on this entry...


How to play STRIMKO

Sep 4, 2009  
I thought it would be fun to create a video on "How to play strimko." It's just like Sudoku but more fun!! Hopefully the creators over at strimko.com don't mind me posting it on Youtube ^_^

STRIMKO

You can view the video here (and you can play the fun game at strimko.com).
Click to read the comments on this entry...


Twenty Questions is a popular game which encourages deductive reasoning. Usually, one person is chosen to be the answerer. That person chooses a subject but does not reveal this to the others. All other players are questioners. They each take turns asking a question which can be answered with a simple "Yes" or "No". Lying is not allowed, as it would ruin the game. If a questioner guesses the correct answer, that questioner wins and becomes the answerer for the next round. If 20 questions are asked without a correct guess, then the answerer has stumped the questioners and gets to be the answerer for another round.

20 questions
The above game is called 20Q and you can play it online at 20Q.net.

Now for some math:
The game is often used as an example when teaching students about information theory. Mathematically, if each question is structured to eliminate half the objects, 20 questions will allow the questioner to distinguish between 2^20 or 1,048,576 objects. Thus, the best strategy for 20 Questions is to ask questions that will split the field of remaining possibilities roughly in half each time. This process is analogous to a binary search algorithm in computer science.
Click to read the comments on this entry...


Cool Math Games

Aug 28, 2009  
The net has a great amount of interactive cool maths games. Below are a few sites worth taking a look at. Most of the math games are fun for all ages and they are all absolutely free.

1. http://www.mathplayground.com/games.html

2. http://www.coolmath-games.com/

3. http://resources.kaboose.com/games/math2.html

4. http://www.primarygames.com/math.htm

5. http://cemc2.math.uwaterloo.ca/mathfrog/
Click to read the comments on this entry...


The impossible (yet so simple) dice game.

Play the game:

                           
                                                           





The number of moves until checkmate is:


Instructions:

  • Press the "Roll dice!" button to start.
  • Try and determine how many moves there are until checkmate.
  • Press the "Display Answer!" button to see if you are right.
  • Once you have figured it out, don't spoil the fun for others!

Background:

This game is based on the "Petals Around the Rose" dice game. Both games are easy in the sense that once you know the "secret", you can easily determine the answer in seconds. After hearing of this game, I was able to figure out the secret immediately. Just remember, as in "Petals Around the Rose", the name of the game is important. Note however, you do not actually need to know anything about chess to figure out the secret.
Click to read the comments on this entry...


Play the game here:

                           
                                                           





The number petals around the rose is:


Instructions:

  • Press the "Roll dice!" button to start.
  • Try and determine how many petals are around the rose.
  • Press the "Display Answer!" button to see if you are right.
  • Once you have figured it out, don't spoil the fun for others!
Good Luck! (some of you will need it, lol)
Click to read the comments on this entry...


strimko example


Strimko is a brand new logic puzzle with numbers, just like Suduko. It is based on Latin squares described by Leonhard Euler in the 18th century.

The rules are simple: each row and column of an n x n grid must contain the numbers 1, 2, ..., n exactly once (just like in Sudoku ), and each "stream" (connected path in the grid) must also contain the numbers 1, 2, ..., n exactly once.

Strimko is created and developed by The Grabarchuk Family. It's basically a generalization of Sudoku as Sudoku can be thought of as having 9 streams.

You can play the addicting game at their website: strimko.com
Click to read the comments on this entry...


We had a math camp at University and needed something educational for the elementary school kids. We chose the topic graph theory and decided to teach them about planar graphs. It turns out thathttp://www.planarity.net has this great flash game that you can play where you have to arrange the vertices such that no edges overlap. The kids sure had fun with it. It was created by John Tantalo, a CS undergrad at Case Western Reserve University.

planar graphAnother task we had on paper was for the kids to design an air flight pathway between airports, where the airports are fixed 'vertices', and the flight paths ('edges') can't overlap to avoid crashes.
Click to read the comments on this entry...


rubiks cube picture

Dan Brown takes us inside on how to solve the Rubik's Cube:
Click to read the comments on this entry...


The 5 Pirates Puzzle

Jul 31, 2009  
Five pirates (of different ages) have a treasure of 100 gold coins. On the ship, they decide to split the coins using the following scheme:

  • The oldest pirate proposes how to share the coins, and all pirates remaining will vote for or against it.
  • If 50% or more of the pirates vote for it, then the coins will be shared that way. Otherwise, the pirate proposing the scheme will be thrown overboard, and the process is repeated with the pirates that remain.
Assuming that all five pirates are intelligent, rational, greedy, and do not wish to die, what should the oldest pirate propose to a) survive and b) maximize his profit?

pirate skull cross bones
Click to read the comments on this entry...


The following is a tutorial about how to make the Yoshimoto cube using paper (though it takes a very long time!). To make it you'll need paper, scisors, some glue and some adhesive tape.

How to Make a Yoshimoto Cube origami

You can check out a non-paper version here.

To make one yourself you can print out the following Yoshimoto sheet and try to assemble it yourself :-)
Click to read the comments on this entry...


Using prime numbers, you can amaze your friends with a prime prediction...

1. Ask your friends to pick any prime number greater than 3.
2. Square it.
3. Add 14.
4. Divide by 12.

Without knowing which prime number your friends picked, you can still tell them:
    There will be a remainder of 3.
But HOW does it work?
Let's do an example:
13 is a prime number, squaring it gives 169, adding 14 gives 183 which has a remainder of 3 upon division by 12.

This works for every prime number greater than 3, but how exactly does it work?

The mathematics behind this is rather simple.
1. Let p be a prime number, p > 3.
2. Squaring gives:
    p^2.
3. Adding 14 gives:
    p^2 + 14
4. Taking it modulo 12 gives:
    (p^2 + 14) mod 12

We want to show that:
    (p^2 + 14) mod 12 = 3
This is equivalent to:
    p^2 - 1 is divisible by 12.
That is:
    (p-1)(p+1) is divisible by 12.

For a number to be divisible by twelve, it has to be divisible both by 3 and by 4. We know that, out of p-1, p and p+1, one of them must be divisible by 3; and it can't be p, because p is prime and greater than 3. Thus, either p-1 or p+1 is divisible by 3, and so their product is also:
    (p-1)(p+1) is divisible by 3.

Now, since p is a prime greater than 3, we know that it is odd. Therefore, both p-1 and p+1 are even numbers. The product of two even numbers is divisible by 4, so:
    (p-1)(p+1) is divisible by 4.

Combining this with the above, we get that:
    (p-1)(p+1) is divisible by 12.
And hence:
    (p^2 + 14) mod 12 = 3
Click to read the comments on this entry...