The largest prime

Find the largest prime p p such that p p divides 2 p + 1 + 3 p + 1 + 5 p + 1 + 7 p + 1 . 2^{p+1}+3^{p+1}+5^{p+1}+7^{p+1}.


The answer is 29.

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.

2 solutions

Kushal Bose
May 20, 2017

As p p is a prime then using FLT it can deduce

2 p + 1 = 2 p . 2 2.2 = 4 ( m o d p ) 2^{p+1} =2^p.2 \equiv 2.2 =4 \pmod{p}

Similarly for other terms 3 p + 1 9 ( m o d p ) ; 5 p + 1 25 ( m o d p ) ; 7 p + 1 49 ( m o d p ) 3^{p+1} \equiv 9 \pmod{p} ; 5^{p+1} \equiv 25 \pmod{p} ; 7^{p+1} \equiv 49 \pmod{p}

So, the remainder is 4 + 9 + 25 + 49 = 87 = 29 × 3 4+9+25+49=87=29 \times 3

So, highest prime is 29 29

@Kushal Bose, you made the problem looks easy, while I thought it was not that easy, but it is a good thing.

Hana Wehbi - 4 years ago

Log in to reply

Thank you...

Kushal Bose - 4 years ago

My solution exactly

Alexander Gibson - 4 years ago
Jesse Nieminen
Jun 13, 2017

Relevant wiki: Fermat's Little Theorem 2 p + 1 + 3 p + 1 + 5 p + 1 + 7 p + 1 2 2 + 3 2 + 5 2 + 7 2 87 3 29 0 ( m o d p ) p = 29 2^{p+1}+3^{p+1}+5^{p+1}+7^{p+1}\equiv2^2+3^2+5^2+7^2\equiv87\equiv3\cdot29\equiv0\pmod{p}\implies p=\boxed{29} .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...