Thursday

July 31, 2014

July 31, 2014

Posted by **john** on Wednesday, August 1, 2012 at 9:22pm.

- number theory -
**MathMate**, Wednesday, August 1, 2012 at 10:06pmIf 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.

**Related Questions**

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

number theory - Find the least positive integer that leaves the remainder 3 ...

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

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

Math - How many integers between 200 and 500 inclusive leave a remainder 1 when ...

Math - How many integers bewteen 200 and 500 inclusive leave a remainder 1 when ...

math - What is the lowest numberthat has a remainder of 1 when divided by 2 and ...

Math - Find the least positive integer that leaves the remainder 3 when divided...

math - what is the least common positive integer that meets the following ...

Math - This problem from China is almost 2000 years old: Find a number that when...