Determine the largest 3-digit prime factor of the integer above.
Notation: denotes the binomial coefficient .
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.
( 1 0 0 0 2 0 0 0 ) = 1 0 0 0 ! × 1 0 0 0 ! 2 0 0 0 ! = 1 × 2 × 3 × ⋯ × 1 0 0 0 2 0 0 0 × 1 9 9 9 × 1 9 9 8 × ⋯ × 1 0 0 1 = 1 0 0 0 ! ∏ n = 1 0 0 1 2 0 0 0 n
We note that since ( 1 0 0 0 2 0 0 0 ) is an integer. the numerator ∏ n = 1 0 0 1 2 0 0 0 n is divisible by the denominator 1 0 0 0 ! . Every 3-digit prime in the numerator is cancel once with the one in the denominator. Any remaining 3-digit prime p must be 3 p < 2 0 0 0 or p < 6 6 6 . The largest of which is 6 6 1 .