The last 14 digits of 3 1 ! are 2 5 5 6 2 8 X Y 0 0 0 0 0 0 . Find X Y .
Inspired by Calvin Lin
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.
We can factorize a factorial as n ! = k = 1 ∏ ∞ p k q k , where p k is the k th prime and q k is the highest power of p k . If p k is not a factor of n ! , then q k = 0 . We can find q k by q k = j = 1 ∑ ∞ ⌊ p k j n ⌋ , where ⌊ ⋅ ⌋ denotes the floor function. For n = 3 1 , we get:
3 1 ! = 2 2 6 ⋅ 3 1 4 ⋅ 5 7 ⋅ 7 4 ⋅ 1 1 2 ⋅ 1 3 2 ⋅ 1 7 1 ⋅ 1 9 1 ⋅ 2 3 1 ⋅ 2 9 1 ⋅ 3 1 1 = 2 1 9 ⋅ 3 1 4 ⋅ 7 4 ⋅ 1 1 2 ⋅ 1 3 2 ⋅ 1 7 1 ⋅ 1 9 1 ⋅ 2 3 1 ⋅ 2 9 1 ⋅ 3 1 1 ⋅ 1 0 7 As 2 7 ⋅ 5 7 = 1 0 7 or 7 trialing 0’s
This means that Y = 0 . Now let N = 1 0 7 3 1 ! . Then X = N m o d 1 0 .
N ≡ 2 1 9 ⋅ 3 1 4 ⋅ 7 4 ⋅ 1 1 2 ⋅ 1 3 2 ⋅ 1 7 ⋅ 1 9 ⋅ 2 3 ⋅ 2 9 ⋅ 3 1 (mod 10) ≡ ( 1 6 4 ⋅ 8 ) ⋅ 9 7 ⋅ 4 9 2 ⋅ 1 2 ⋅ 3 2 ⋅ 7 ⋅ 9 ⋅ 3 ⋅ 9 ⋅ 1 (mod 10) ≡ ( 6 ⋅ 8 ) ( 1 0 − 1 ) 7 ( 5 0 − 1 ) 2 ( 1 ) ( − 1 ) ( 7 ) ( − 1 ) ( 3 ) ( − 1 ) ( 1 ) (mod 10) ≡ ( 8 ) ( − 1 ) ( − 1 ) ( − 1 ) ( − 1 ) (mod 10) ≡ 8 (mod 10)
Implying X = 8 and X Y = 8 0 .
Problem Loading...
Note Loading...
Set Loading...
First, let's see how many trailing zeroes there are in 3 1 ! . For this, we look for pairs of numbers in 3 1 ! whoose product is divisible by 10.
The last six trailing zeroes are given in the problem, so one is missing, which means Y = 0 .
In the remaining factors, there are still enough even numbers to make the product divisible by 16. The divisibility rule for 16 is that the numbrt formed by the last 4 digits is divisible by 16. This number is 6 2 8 X = 3 9 2 ⋅ 1 6 + 8 + X . To make it divisible by 16, X has to cancel out the 8, so X = 8 .
Combining both results, the answer is X Y = 8 0 .