Results 1 to 2 of 2

Math Help - 1!+2!+...+1000! \equiv x (mod 10)

  1. #1
    MHF Contributor
    Joined
    Mar 2010
    From
    Florida
    Posts
    3,093
    Thanks
    5

    1!+2!+...+1000! \equiv x (mod 10)

    Solve for x

    1!+2!+\dots +1000! \equiv x \ \mbox{(mod 10)}

    The book say when k\geq 5, k!\equiv 0 \ \mbox{(mod 10)} \ \mbox{and} \ \mbox{(mod 15)}.

    Why is this? And how am I supposed to use this to solve this problem?
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor undefined's Avatar
    Joined
    Mar 2010
    From
    Chicago
    Posts
    2,340
    Awards
    1
    Quote Originally Posted by dwsmith View Post
    Solve for x

    1!+2!+\dots +1000! \equiv x \ \mbox{(mod 10)}

    The book say when k\geq 5, k!\equiv 0 \ \mbox{(mod 10)} \ \mbox{and} \ \mbox{(mod 15)}.

    Why is this? And how am I supposed to use this to solve this problem?
    5 = 5 * 4 * 3 * 2, you can see why it's divisible by 10 and 15? Also 6! = 6 * 5! so it's also divisible by 10 and 15, etc. But the mod 15 part really doesn't matter here.

    So 1! + 2! + ... + 1000! looks like 1 + 2 + 6 + 4 + 0 + 0 + 0 + ... + 0 (mod 10).
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. [SOLVED] if ra\equiv rb (mod m), then a\equiv b (mod \frac{m}{gcd(r,m)})
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: June 15th 2011, 08:04 AM
  2. Replies: 2
    Last Post: July 10th 2010, 05:14 PM
  3. [SOLVED] if ab\equiv 0 (mod p), then a\equiv 0 (mod p) or b\equiv 0 (mod p).
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: July 7th 2010, 04:21 PM
  4. [SOLVED] if a^2 \equiv 1, then a \equiv \pm 1 (mod p)
    Posted in the Number Theory Forum
    Replies: 5
    Last Post: June 27th 2010, 03:43 PM
  5. 1 coin tossed 1000 times vs 1000 coins
    Posted in the Advanced Statistics Forum
    Replies: 14
    Last Post: December 20th 2007, 06:55 PM

/mathhelpforum @mathhelpforum