Fermat Squares

By Fermat's Little Theorem, the number x = 2 p 1 1 p x = \dfrac{2^{p-1} - 1}{p} is always an integer if p p is an odd prime. For what number of values of p p is x x a perfect square?


The answer is 2.

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

Patrick Corn
Jan 21, 2015

I don't know if there's an easier way to do the problem, but here was my approach.

Write 2 p 1 1 = p x 2 2^{p-1}-1= px^2 . Then ( 2 p 1 2 1 ) ( 2 p 1 2 + 1 ) = p x 2 . \left( 2^{\frac{p-1}2} - 1 \right) \left( 2^{\frac{p-1}2} + 1 \right) = px^2. These two factors are relatively prime. So by unique factorization we get that one of them is a square and the other is p p times a square.

There are two cases.

If 2 p 1 2 1 2^{\frac{p-1}2} - 1 is a square, then considering the equation mod 4 4 shows that 2 p 1 2 2^{\frac{p-1}2} is 1 1 or 2 2 mod 4 4 , so the only possibility to consider is p = 3 p = 3 , which happens to work.

If 2 p 1 2 + 1 = y 2 2^{\frac{p-1}2} + 1 = y^2 , then we can factor 2 p 1 2 = ( y 1 ) ( y + 1 ) 2^{\frac{p-1}2} = (y-1)(y+1) . Since the two factors are powers of 2 2 that differ by 2 2 , they can only be 2 2 and 4 4 , so y = 3 y = 3 and p = 7 p = 7 , which also happens to work. So there are 2 \fbox{2} values in all.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...