Find the largest prime number that divides 2 7 ! + 2 8 ! .
Notation :
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.
How 29 is the ans according to the explanation
Log in to reply
2 7 ! + 2 8 ! = 2 7 ! ⋅ 2 9 = 1 ⋅ 2 ⋅ 3 … 2 6 ⋅ 2 7 ⋅ 2 9
Now, the primes here in the product are,
2 , 3 , 5 , 7 , 1 1 , 1 3 , 1 7 , 1 9 , 2 3 , 2 9
Therefore, 2 9 is the largest prime divisor of the product.
2 7 ! + 2 8 ! = 2 7 ! + 2 8 ∗ 2 7 !
then it's equal to , 2 7 ! ( 1 + 2 8 ) = 2 7 ! ∗ 2 9
Thus, 29 is the l a r g e s t p r i m e f a c t o r .
If n+1 = m, n+2 = j, and j is a prime, so finding the largest prime divisor for n! x m! is j
Problem Loading...
Note Loading...
Set Loading...
So we know that
2 7 ! 2 8 ! = = 1 × 2 × 3 × ⋯ × 2 7 1 × 2 × 3 × ⋯ × 2 7 × 2 8
And also, 2 8 ! = 2 8 × 2 7 ! , so adding these numbers gives
2 7 ! + 2 8 ! = = = 2 7 ! + 2 8 × 2 7 ! 2 7 ! × ( 1 + 2 8 ) 2 7 ! × 2 9
This tells us that we want to find the maximum prime factor of the product, 2 7 ! × 2 9 . Since all the prime factors of 2 7 ! must be less than or equals to 27, and 29 is already a prime number, this tells us that 2 9 is indeed the largest prime factor.