My little prime factors

We are given that 2 30 + 3 30 2^{30}+3^{30} has only two prime factors that have two digits. Find the sum of these two prime factors.


The answer is 74.

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 solution

Paola Ramírez
Jul 17, 2015

It is known that if n n is a positive odd integer a + b a n + b n \Rightarrow\ a+b|a^n+b^n

Write 2 30 + 3 30 2^{30}+3^{30} as an expression with odd exponents.

2 30 + 3 30 = 4 15 + 9 15 = ( 4 3 ) 5 + ( 9 3 ) 5 = ( 4 5 ) 3 + ( 9 5 ) 3 4 + 9 , 4 3 + 9 3 , 4 5 + 9 5 2^{30}+3^{30}=4^{15}+9^{15}=(4^3)^5+(9^3)^5=(4^5)^3+(9^5)^3 \Rightarrow 4+9,4^3+9^3,4^5+9^5 divide 2 30 + 3 30 2^{30}+3^{30} , so one of the two prime factors searched is 13 13 . To find the other apply divisibility rules to:

4 3 + 9 3 = 793 = 13 × 61 4^3+9^3=793=13\times 61

4 5 + 9 5 = 60073 = 13 × 4621 4^5+9^5=60073=13\times4621

tTe two prime factors of two digits are 13 13 and 61 61 , \therefore its sum is 74 \boxed{74}

Is there any reason why there are no other 2-digit prime factors? Or do we have to check all of them one at a time to confirm?

Calvin Lin Staff - 5 years, 10 months ago

Log in to reply

I have not found a special reason, I checked all of them

Paola Ramírez - 5 years, 10 months ago

I did the problem via Euler totient function considerations. Tedious compared to your elegant method.

Jake Lai - 5 years, 10 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...