What are the last three digits of the alternating sum 2 0 1 4 ! − 2 0 1 3 ! + 2 0 1 2 ! − 2 0 1 1 ! + . . . + 4 ! − 3 ! + 2 ! − 1 ! ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Yes, this was my solution :)
yes this is the way i solved problem
We are only asked for the last three digits; note that if n ≥ 1 5 , then n ! has at least three factors of 5 and three factors of 2 , so it ends in 3 zeroes. Thus, we may disregard the term n ! when n ≥ 1 5 . Our sum becomes
1 4 ! − 1 3 ! + 1 2 ! − 1 1 ! + 1 0 ! − 9 ! + 8 ! − 7 ! + 6 ! − 5 ! + 4 ! − 3 ! + 2 ! − 1 ! .
Computing the last three digits of these first few factorials, we get the following list:
1 ! = 1 ends in 0 0 1 .
2 ! = 2 ends in 0 0 2 .
3 ! = 6 ends in 0 0 6 .
4 ! = 2 4 ends in 0 2 4 .
5 ! = 1 2 0 ends in 1 2 0 .
6 ! = 7 2 0 ends in 7 2 0 .
7 ! ends in 0 4 0 .
8 ! ends in 3 2 0 .
9 ! ends in 8 8 0 .
1 0 ! ends in 8 0 0 .
1 1 ! ends in 8 0 0 .
1 2 ! ends in 6 0 0 .
1 3 ! ends in 8 0 0 .
1 4 ! ends in 2 0 0 .
So, the last three digits of our sum are
2 0 0 − 8 0 0 + 6 0 0 − 8 0 0 + 8 0 0 − 8 8 0 + 3 2 0 − 4 0 + 7 2 0 − 1 2 0 + 2 4 − 6 + 2 − 1
which equals 1 9 .
This was the intended solution. Note B. Kruger's comment on Jubayer Nirjhor's solution for a slightly simpler method of calculating the sum.
Nice :)
I did the same way...
Note that: 2 0 1 4 ! − 2 0 1 3 ! + 2 0 1 2 ! − ⋅ ⋅ ⋅ − 3 ! + 2 ! − 1 ! = n = 1 ∑ 2 0 1 4 ( − 1 ) n ⋅ n !
Since 1 5 ! is the first factorial number containing 3 trailing zeroes, and hence 1 0 0 0 ∣ 1 5 ! , we get the following: n = 1 ∑ 2 0 1 4 ( − 1 ) n ⋅ n ! ≡ n = 1 ∑ 1 4 ( − 1 ) n ⋅ n ! ( m o d 1 0 0 0 )
The rest is a bit calculator work as I couldn't find a way to calculate the value more easily or manually: n = 1 ∑ 1 4 ( − 1 ) n ⋅ n ! = 8 1 3 9 3 6 5 7 0 1 9 ≡ 0 1 9 ( m o d 1 0 0 0 )
If we didn't have a calculator at our disposal, this would be an easier way of calculating the last three digits:
( ( ( ( ( 1 4 − 1 ) ⋅ 1 3 + 1 ) ⋅ 1 2 − 1 ) ⋅ 1 1 + 1 ) ⋯ − 1 ) ⋅ 1
Each time multiplication is performed in the above factorization, we could take the modulus 1000.
Log in to reply
Excellent solution, Bob!
Brilliant!
We only care about the last three digits of the sum, which are the hundreds digit, tens digit, and ones digit. We also know that anything above 1 5 ! = 1 3 0 7 6 7 4 3 6 8 0 0 0 ends in three zeroes (since it contains three factors of 5 from 5 , 1 0 , and 1 5 and it also contains eleven factors of 2 from all the even numbers in its factorization). Taking the factorial of any integer higher than 1 5 is multiplying 1 5 ! by some other integer, therefore, we can ignore every element of the sequence except those less than 15. If we then evaluate the expression 1 4 ! − 1 3 ! + 1 2 ! − 1 1 ! + 1 0 ! − 9 ! + 8 ! − 7 ! + 6 ! − 5 ! + 4 ! − 3 ! + 2 ! − 1 ! , we find an answer of 8 1 3 9 3 6 5 7 0 1 9 , which, if we take the last three digits is 0 1 9 .
We can simply the problem above become 2013.2013! + 2011.2011! + ... + (2n+1).(2n+1)! + .... + 3.3! + 1.1!, Because three last digits 000 in 15.15!, so we only sum the three last digit of 13.13! + 11.11! + 9.9! + 7.7! + 5.5! + 3.3! + 1.1! = ..400 + ..800 + .. 920 + ..280 + 600 + 18 + 1 = ..3019. So, We have 019 is the three last digits. Answer : 19
let it b simple as last digits will be from the addition of last 3 alternating sum just sum 600+18+1=6019 last three digits are 019 or simply 19
Problem Loading...
Note Loading...
Set Loading...
n ! − ( n − 1 ) ! + ( n − 2 ) ! − ( n − 3 ) ! + . . . + 4 ! − 3 ! + 2 ! − 1 ! =
n ∗ ( n − 1 ) ! − ( n − 1 ) ! + ( n − 2 ) ∗ ( n − 3 ) ! − ( n − 3 ) ! + . . . + 4 ∗ 3 ! − 3 ! + 2 ∗ 1 ! − 1 ! =
( n − 1 ) ∗ ( n − 1 ) ! + ( n − 3 ) ∗ ( n − 3 ) ! + . . . + 3 ∗ 3 ! + 1 ∗ 1 !
So the problem is reduced to: 2 0 1 3 ∗ 2 0 1 3 ! + 2 0 1 1 ∗ 2 0 1 1 ! + . . . + 3 ∗ 3 ! + 1 ∗ 1 !
Since we only need the last three digits we only have to calculate till 13! since 15! contains 3 zeros, further factorials won't change the last 3 digits. 1 3 ∗ 1 3 ! + 1 1 ∗ 1 1 ! + 9 ∗ 9 ! + 7 ∗ 7 ! + 5 ∗ 5 ! + 3 ∗ 3 ! + 1 ∗ 1 ! = 6 5 0 9 1 7 7 0 1 9
The answer is 1 9