Here is new brain teaser written by puzzle master Wes Carroll.

The Really, Really, Really Big Number

Difficulty: HARDER
Type: MATH (Numerical/Abstract)
Intimidation Factor: HIGH --- but don't be scared!

Question:
When you divide 12 by 5, the remainder is 2; it's what's left over after you have removed all the 5s from the 12.  When you raise 4 to the fifth power (that is, 45), you multiply four by itself five times: 4×4x4×4x4, which equals 1,024.

What is the remainder when you divide 100100 by 11?

Click to read the Solution and Explanation.

20 Responses to “Brain Teaser: The Really, Really, Really Big Number”
  1. Masaon 18 May 2007 at 5:37

    This was easy for me, but it still was quite delightful. I think that some people will think of this as impossible. *I'm so super * :)

    BTW, why do you post the solution as documents? That's slow.

  2. Carolineon 18 May 2007 at 9:34

    Good for you! I think it sounds scary, but yes, it's not that bad once you start working on it!

    I post the answers as a separate document to avoid the temptation of just reading the answer before at least trying to solve it! I'm open to trying other means of hiding the answer if you have ideas.

  3. lizzyon 18 May 2007 at 8:20

    I'm glad I came across this sight. Seems over time a person loses the ability to solve simple Math. I've been accused of being stupid but now don't feel as such. Thanks!

  4. Carolineon 18 May 2007 at 10:25

    Welcome Lizzy! Keep coming back for practice, and you'll get better and faster at the teasers!

  5. Jonathanon 19 May 2007 at 5:09

    Very nice. I'm going to make the number a little smaller (small enough to lure some poor souls into doing hand calculations, but still way too big for a calculator) and give it to my high school students.

    Btw, you may enjoy this trick (not really a puzzle) I share with my students.

    Nice site (found it through the Carnival of Mathematics)

  6. Carolineon 20 May 2007 at 12:11

    Let us know how it goes! I'm going to work on that trick!

  7. Dave Marainon 20 May 2007 at 6:20

    Wonderful problem, Caroline!
    It's very hard for me not to use Remainder Theory, better known as Congruence Theorems in Number Theory.
    10^2 is congruent to 1 modulo 11. Raise both sides to the 100th power and the result follows directly. However, your solution is far more instructive for students. Note that 10^1 leaves a remainder of 10 when divided by 11. Number theorists would write:
    10 is congruent to -1 mod 11.
    Therefore, 10^3 is also congruent to -1 mod 11. This translates to 1001 being divisible by 11, which it is, since 1001 = 7×11x13. Thus every odd power of 10 leaves a remainder of 10 when divided by 11. That's why the problem you posed used a base of 100 - it guaranteed an even exponent so the remainder would be 1. Sorry for the technical stuff - number theory has always been my passion and my knowledge represents an infinitesimal part of what the pros know...
    I hope you'll visit my site - there are occasionally puzzles like this, although my primary goal is to provide enrichment lesson plans for math educators in grades 7-12. Good luck!
    Dave Marain

  8. Carolineon 21 May 2007 at 4:48

    Thanks for the analysis Dave- it's great to hear other solutions and theories. I'll definitely check out your site and please keep coming back here! And PS- the credit for the problem goes to Wes Carroll who is writing puzzles for us. You can follow the links to him at the top of the post.

  9. [...] The Unkindest Cut of All The Really, Really, Really Big Number Two brainteasers from SharpBrains. [...]

  10. Jyrki Leskeläon 28 Aug 2007 at 11:01

    There is much easier way to solve this. We are all aware that 99 is 9*11. We can easily derive, that all numbers 99...99 where the amount of nines is even, are a product of "some constant number" and 9*11. 100^n has always even number of zeros so there is an equivalent 99..99. No math needed to understand that the difference is 1.

  11. Rami Lehtion 18 Oct 2007 at 1:10

    Ok. The remainder is 1.
    What is the solution?

    The generic solution for all positive exponents is:
    9*100^0+9*100^1+9*100^2+...+9*100^(n-1)

    For this particular problem just substitute n=100.

  12. [...] 45. Find the the Really, Really, Really Big Number. [...]

  13. [...] What is the remainder when is divided by 11? [...]

  14. Jonathanon 22 Dec 2007 at 11:49

    So, I finally used the puzzle in class, though perhaps not exactly as you intended. It was with 2 9th grade, pre-vacation algebra classes, and the results are here.

  15. Alvaroon 24 Dec 2007 at 7:10

    Hello Jonathan, thanks for sharing that experience! We are very glad your students enjoyed the teaser, very impressive :-)

    Happy holidays

  16. RCon 06 Mar 2008 at 1:33

    The number 100^100 may be written as,

    (99 + 1)^(99 + 1). By the exponent law, a^m * a^n = a^(m + n),

    we can rewrite to this,

    (99 + 1)(99 + 1)^99

    and futher,

    (99 + 1)(99 + 1)(99 + 1)^98

    and so on, down the line. Let a = (9)(11). We get,

    (a^2 + 2a + 1)(a + 1)^98 =

    (a^3 + 3a^2 + 3a + 1)(a + 1)^97 =

    (a^4 + 4a^3 + 6a^2 + 4a + 1)(a + 1)^96 = .. = a^99 + [98 terms] + 1

    We find that every term is divisible by 11 (a is divisible) except the very last one, 1.

    The remainder is 1.

    Here's another quick one, which is learned from the above.

    Using only 9s, express 100^100.

    Well, it's no trick at all. 9/9 = 1.

    Ans. (99 + 9/9)^(99 + 9/9)

    or (99 + 9/9)(99 + 9/9)^99

  17. Aaronon 23 Mar 2008 at 11:00

    I think it's one, I don't have any crazy solution it's just my gut instinct =P

  18. Anthuanon 13 May 2008 at 5:03

    My solution was a bit different.

    10^0 mod 11 = 1
    10^1 mod 11 = 10
    10^2 mod 11 = 1
    10^3 mod 11 = 10

    Thus

    10^n mod 11 = 1, if n is even, and
    10^n mod 11 = 10, if n is odd!

  19. T-Mak1978on 23 May 2008 at 6:24

    Raising 100 to the 100 power is really not relevant. When you divide 100 by 11 the remainder is 1. In this case, no matter how many zeros will be in the "big number", you will still come out with a remainder of 1.

  20. Lucaon 13 Jun 2008 at 4:29

    I used an invariant property of multiples of 11:

    n=k*11 in n the sum of odd position digits is equal to the sum of even position digits.

    Thus, 100^n=10^2n has 2n+1 digits, and the previous multiple of 11 must have 2n digits.

    so it can only be a number like 999...999, and the remainder must be 1

Trackback URI | Comments RSS

Leave a Reply