3 0 3 9 1 6 2 5 3 7 □ 6
For some integer n , the value of the ( n ( n + 1 ) ( n + 2 ) ) 2 equal to the 12-digit integer shown above with the second last digit omitted. What is the value of this digit?
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.
Sorry, but can you elaborate without using # tag ?
Log in to reply
He used "#" just to indicate the missing digit. You may call it x if you like, the reasoning is the same, i.e., product of three consecutive integers is always divisible by 3 ! , i.e., by both 2 and 3 , hence its square is divisible by both 2 2 = 4 and 3 2 = 9 . Use the divisibility rule of 9 to get that the missing digit is possibly 0 or 9 . Then, use the divisibility rule of 4 to conclude that the missing digit must be 9 , hence # = 9 in the number 3 0 3 9 1 6 2 5 3 7 # 6 .
In case it isn't explicitly stated that there exists an integer n satisfying the criterions, then you'd have to verify it manually using some approximations and a calculator, but that isn't the case here since the problem guarantees the existence of such an n beforehand.
Not a good explanation
Log in to reply
n(n+1)(n+2) is a multiple of 6 for every integer n. So its square is a multiple of 36 and hence the number is a multiple of 9 and 4. We note that the digit sum is 45 so the missing digit must be 0 or 9 because of a number is divisible by 9 its digit sum should also be divisible by 9. And the number is divisible by 4 so it's last 2 digits are divisible by 4 and the last 2 digits can be 06 and 96. We see that 06 is not divisible by 4 so last two digits are 96 and hence the missing digit is 9.
Set this number equal to N . Then N ≈ 3 × 1 0 1 1 . Since N = ( n ( n + 1 ) ( n + 2 ) ) 2 , we know n 6 ≤ N ≤ ( n + 2 ) 6 . Then n ≤ 6 N ≤ n + 2 , or evaluated (rounded to the nearest tenth), 7 9 . 8 ≤ n ≤ 8 1 . 8 . Thus, n = 8 0 or 8 1 . If n were divisible by 5 , then clearly N will be divisible by 1 0 0 , meaning its last two digits would be 0 0 , which is false. Thus, 5 does not divide n , so n = 8 1 . Finally, ( 8 1 ⋅ 8 2 ⋅ 8 3 ) 2 ≡ ( 8 6 ) 2 ≡ 9 6 m o d 1 0 0 , so the missing digit is 9 .
Problem Loading...
Note Loading...
Set Loading...
( n ( n + 1 ) ( n + 2 ) ) 2 is a multiple of 9 and so # is either 0 or 9. Next, ( n ( n + 1 ) ( n + 2 ) ) 2 is multiple of 4 and so #6 is a multiple of 4. Hence # = 9 .