Find the largest prime p such that p divides 2 p + 1 + 3 p + 1 + 5 p + 1 + 7 p + 1 .
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.
@Kushal Bose, you made the problem looks easy, while I thought it was not that easy, but it is a good thing.
My solution exactly
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 ≡ 8 7 ≡ 3 ⋅ 2 9 ≡ 0 ( m o d p ) ⟹ p = 2 9 .
Problem Loading...
Note Loading...
Set Loading...
As p is a prime then using FLT it can deduce
2 p + 1 = 2 p . 2 ≡ 2 . 2 = 4 ( m o d p )
Similarly for other terms 3 p + 1 ≡ 9 ( m o d p ) ; 5 p + 1 ≡ 2 5 ( m o d p ) ; 7 p + 1 ≡ 4 9 ( m o d p )
So, the remainder is 4 + 9 + 2 5 + 4 9 = 8 7 = 2 9 × 3
So, highest prime is 2 9