James mentally calculated 19! (19 factorial) and wrote down the answer. Someone erased the 2nd and 15th digits of the number:
1 ? 1 6 4 5 1 0 0 4 0 8 8 3 ? 0 0 0
Which digits were erased?
Note: If you think the 2nd digit is 3 and the 15th digit is 8, answer 38. If you think the 2nd digit is 0 and the 15th is 2, answer 2.
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.
Awesome, as always!
We note that the number of trialing zeros in 1 9 ! is ⌊ 5 1 9 ⌋ = 3 . This means the last three digits (16th to 18th) are zeros. Then the 15th digit d 1 5 is given by:
1 0 3 1 9 ! ≡ d 1 5 (mod 10) ≡ 1 9 × 1 8 × 1 7 × 1 6 × 1 5 3 × 1 4 × 1 3 × 1 2 × 1 1 × 1 0 2 × 9 × 8 1 × 7 × 6 × 5 1 × 4 × 3 × 2 (mod 10) ≡ 9 × 8 × 7 × 6 × 3 × 4 × 3 × 2 × 2 × 9 × 7 × 6 × 4 × 3 × 2 (mod 10) ≡ 2 (mod 10) Since 2 3 = 8
Now we have 1 9 ! = 1 d 2 1 6 4 5 1 0 0 4 0 8 8 3 2 0 0 0 . Since 1 9 ! is divisible by 9, its sum of digits is also divisible by 9. We note that the sum of digit without d 2 is 1 + 1 + 6 + 4 + 5 + 1 + 4 + 8 + 8 + 3 + 2 = 4 3 . The next multiple of 9 is 45 then d 2 = 2 . The one after is 54 then d 2 = 1 1 , which is unacceptable. Therefore, d 2 = 2 and d 1 5 = 2 and the answer is 2 2 .
Since 19! ends with three zeroes, we can divide it by 1000 and still get an integer:
1 0 3 1 9 × 1 8 × 1 7 × 1 6 × 1 5 × 1 4 × 1 3 × 1 2 × 1 1 × 1 0 × 9 × 8 × 7 × 6 × 5 × 4 × 3 × 2 × 1 =
2 3 × 5 3 1 9 × 1 8 × 1 7 × 1 6 × 1 5 × 1 4 × 1 3 × 1 2 × 1 1 × 1 0 × 9 × 8 × 7 × 6 × 5 × 4 × 3 × 2 =
1 9 × 1 8 × 1 7 × 1 6 × 5 1 5 × 1 4 × 1 3 × 1 2 × 1 1 × 5 1 0 × 9 × 2 3 8 × 7 × 6 × 5 5 × 4 × 3 × 2 =
1 9 × 1 8 × 1 7 × 1 6 × 3 × 1 4 × 1 3 × 1 2 × 1 1 × 2 × 9 × 7 × 6 × 4 × 3 × 2
Finding this product's last digit is the same as finding the original number's 15th digit, so we'll evaluate the product mod 10:
1 9 × 1 8 × 1 7 × 1 6 × 3 × 1 4 × 1 3 × 1 2 × 1 1 × 2 × 9 × 7 × 6 × 4 × 3 × 2 ( m o d 1 0 ) ≡
9 × 8 × 7 × 6 × 3 × 4 × 3 × 2 × 1 × 2 × 9 × 7 × 6 × 4 × 3 × 2 ( m o d 1 0 ) ≡
7 2 × 4 2 × 7 2 × 1 8 × 4 2 × 2 4 ( m o d 1 0 ) ≡
2 × 2 × 2 × 8 × 2 × 4 ( m o d 1 0 ) ≡
5 1 2 ( m o d 1 0 ) ≡
2 ( m o d 1 0 )
Therefore, the 15th digit of 19! is 2.
Since in 19! is a multiple of nine, the sum of its digits must also be a multiple of nine, so if we call the 2nd digit x :
1 + x + 1 + 6 + 4 + 5 + 1 + 0 + 0 + 4 + 0 + 8 + 8 + 3 + 2 + 0 + 0 + 0 =
4 3 + x
And the only digit that makes the sum divisible by nine is 2
So the 2nd digit is 2 and the 15th digit is 2
Another way for the second ? digit. Dividing the original number by 1000 must yield a multiple of 8, since 19! is divisible by a very high power of 2. Therefore this new number ends in 832.
Problem Loading...
Note Loading...
Set Loading...
If we call the missing digits x (2nd) and y (15th) then we can calculate the alternating and the normal digit sum s a and s n .
s a s n = 1 − x + 1 − 6 + 4 − 5 + 1 − 0 + 0 − 4 + 0 − 8 + 8 − 3 + y − 0 + 0 − 0 = − 1 1 − x + y = 1 + x + 1 + 6 + 4 + 5 + 1 + 0 + 0 + 4 + 0 + 8 + 8 + 3 + y + 0 + 0 + 0 = 4 1 + x + y
Since 1 9 ! is divisible by 9 and 1 1 , these digit sums have to be multiples of those numbers.
− 1 1 − x + y can only be a multiple of 11 for x = y , because 0 ≤ x , y ≤ 9 .
4 1 + x + y = 4 1 + 2 x can be at most 4 1 + 2 ⋅ 9 = 5 9 < 6 3 . Note that it also has to be odd since we're adding odd (41) and even ( 2 x ). The only possible solution is 4 1 + 2 x = 4 5 ⇒ x = y = 2