number theory

posted by .

Find the remainder when 1!+2!+...+299!+300! is divided by 21

  • number theory -

    If you note that we only need to calculate

    6
    s=∑ i!
    n=1

    or

    s=873 mod 21 = 12

    Because all terms 7! and beyond are divisible by 21.

Respond to this Question

First Name
School Subject
Your Answer

Similar Questions

  1. math

    What is the lowest numberthat has a remainder of 1 when divided by 2 and a remainder of 2 when devided by 3 and a remainder of 3 when divided by 4 and a remainder of 4 when divided by 5?
  2. math

    what is the least common positive integer that meets the following conditions: divided by 7 with remainder 4 divided by 8 with remainder 5 divided by 9 with remainder 6 i thought you could add 7 and 4 to get 13, then divide 13 and …
  3. number theory

    Find the least positive integer that leaves the remainder 3 when divided by 7, remainder 4 when divided by 9, and remainder 8 when divided by 11
  4. number theory

    Find the remainder when 1!+2!+...+299!+300! is divided by 21
  5. math

    Find the remainder when 1!+2!+...+299!+300! is divided by 21
  6. Math

    Find the least positive integer that leaves the remainder 3 when divided by 7, remainder 4 when divided by 9, and remainder 8 when divided by 11. Using the Chinese Remainder Theorem.
  7. Math

    Find the remainder when 1!+2!+...+299!=300! is divided by 21 using mod 0 in base 21.
  8. Math

    How many integers bewteen 200 and 500 inclusive leave a remainder 1 when divided by 7 and a remainder 3 when divided by 4?
  9. Math

    How many integers between 200 and 500 inclusive leave a remainder 1 when divided by 7 and a remainder 3 when divided by 4?
  10. Math adv function

    An unknown polynomial f(x) of degree 37 yields a remainder of 1 when divided by x – 1, a remainder of 3 when divided by x – 3, a remainder of 21 when divided by x – 5. Find the remainder when f(x) is divided by (x – 1)(x – …

More Similar Questions