n = 0 ∑ 1 0 0 n !
If the last 2 digits of the sum above is x , find the last 2 digits of:
m = 0 ∑ 1 0 0 m x
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.
Wow, I've never seen that binomial theorem used like that. Ingenious.
That is such an elegant solution, I especially love the x^14 = x^2 mod 10 part, I'm amazed
From 1 0 ! on, all factorials are divisible by 100, so they won't influence the last two digits of the first sum.
Since \sum_\limits{n = 0}^9 n! = 409114, it immediately follows that x = 1 4 .
Now we notice that m 1 4 = ( m 2 ) 7 .
We also notice, that with
a ∈ { 1 , 2 , 3 , 4 } and b ∈ { 1 0 , 2 0 , 3 0 , 4 0 , 5 0 , 6 0 , 7 0 , 8 0 , 9 0 } :
( b + a ) 2 = b 2 + 2 a b + a 2 and ( b − a ) 2 = b 2 − 2 a b + a 2 .
This means that
( b + a ) 1 4 ≡ ( b 2 + 2 a b + a 2 ) 7 ≡ 7 . ( b 2 + 2 a b + a 2 ) m o d 1 0 0 and
( b − a ) 1 4 ≡ ( b 2 − 2 a b + a 2 ) 7 ≡ 7 . ( b 2 − 2 a b + a 2 ) m o d 1 0 0 .
So [ ( b + a ) 1 4 + ( b − a ) 1 4 ] ≡ 1 4 a 2 ≡ 2 a 1 4 m o d 1 0 0 .
Moreover , we can see that
9 6 1 4 ≡ 7 . ( 1 0 0 − 4 ) 2 ≡ 7 . ( 1 0 0 0 0 − 4 0 0 + 4 2 ) ≡ 7 . 4 2 ≡ 4 1 4 m o d 1 0 0 .
We can deduce similar results for 97,98 and 99, with 3,2,1 (it is left as an exercise for the reader).
We get \begin{aligned} \sum_\limits{m = 0}^{100} m^{14} & \equiv 20.(1^{14} + 2^{14} + 3^{14} + 4^{14}) + \sum_\limits{i = 0}^{9}(10i+5)^{14} & \mod 100 \\ & \equiv 200 + \sum_\limits{i = 0}^{9}(10i+5)^{14} & \mod 100 \\ & \equiv \sum_\limits{i = 0}^{9}(10i+5)^{14} & \mod 100 \\ & \equiv 10 . 5^{14} & \mod 100 \\ & \equiv 70. 25 & \mod 100 \\ & \equiv 50 & \mod 100. \end{aligned}
Problem Loading...
Note Loading...
Set Loading...
When n ≥ 1 0 then by definition 2 5 ∣ n ! and 4 ∣ n ! so 1 0 0 ∣ n ! . Therefore the last two digits of n ! is 0 when n ≥ 1 0 . By calculating directly, we get x = 1 4 .
Now to find the last 2 digits of ∑ m = 0 1 0 0 m 1 4 , since 1 0 0 1 4 ≡ 0 m o d 1 0 0 , we have by using the binomial theorem: m = 0 ∑ 1 0 0 m 1 4 ≡ r = 0 ∑ 9 b = 0 ∑ 9 ( 1 0 b + r ) 1 4 ≡ r = 0 ∑ 9 b = 0 ∑ 9 1 4 0 b r 1 3 + r 1 4 ≡ r = 0 ∑ 9 4 5 × 1 4 0 r 1 3 + 1 0 × r 1 4 ≡ r = 0 ∑ 9 1 0 r 1 4 m o d 1 0 0 m o d 1 0 0 m o d 1 0 0 m o d 1 0 0
Since last digit of the value we're looking is going to be 0 , we only need to find the last digit of ∑ r = 0 9 r 1 4 which gives us our second to last digit. This doesn't take long at all as x 5 ≡ x m o d 1 0 ⟹ x 1 3 ≡ x m o d 1 0 ⟹ x 1 4 ≡ x 2 m o d 1 0 so r = 0 ∑ 9 r 1 4 ≡ r = 0 ∑ 9 r 2 ≡ 6 9 × 1 0 × 1 9 ≡ 2 8 5 ≡ 5 m o d 1 0 Hence the last 2 digits of ∑ m = 0 1 0 0 m 1 4 is 5 0 .