The Racist Coin Problem

September 19th, 2009 by ben Leave a reply »

Hank has 744 black coins and 527 white coins. He wants to arrange them in stacks of the same kind of coins (since if differently-colored coins are placed together in the same stack, discrimination will eventually result in hate crimes and lynchings). In other words, all coins in a stack are all black or all white. If each stack has the same number of coins, what is the minimum number of stacks needed?

Related Posts:



  1. Benji says:

    Kevin found the correct answer in less than 3 minutes. Han-chan, try to do it under that!

    (edit, nvm, he used a calculator =A=)

  2. k says:

    i could’ve done it in under 3 minutes anyway

  3. k says:

    It’s a really easy problem that you don’t need to use special math team methods to solve.

Leave a Reply

This site uses Akismet to reduce spam. Learn how your comment data is processed.