You are not logged in.
Pages: 1
Find all prime numbers
and all positive integers
such that
Offline
Well, N = 1 is one answer. For N > 1, N must be divisible by 5, otherwise
would be divisible by 5 by Fermats little theorem.Moreover, it must be an odd mutliple of 5, otherwise
would be even.Offline
Got it! Got it!
We will show that
is never prime for N > 1.If N > 1, it must be an odd multiple of 5, so let
.Then
It remains to show that
and are both greater than 1 for all k ≥ 1. Well, they are, becauseand
Hence
is a product of two integers both greater than 1 and so cannot be prime.Thus the only solution is
.Offline
very nice
Offline
Ive found a quicker way.
Let
be an odd integer greater than 1.Then
Offline
Pages: 1