2 Posts • Page 1 of 1
 |
 |
Author |
 |
Message |
 |
 |
 |
 |
 |
 |
Peter
Birch & Swinnerton Dyer


Offline Joined: 05 May 2004 Posts: 5202 Location: Ghent
|
A 13 AMM, Problem E2510, Saul Singer
Show that for all prime numbers , is an integer.
|
Posted: Fri May 25, 2007 2:24 am |
 |
|
|
 |
 |
 |
 |
 |
 |
 |
Peter
Birch & Swinnerton Dyer


Offline Joined: 05 May 2004 Posts: 5202 Location: Ghent
|
| nicetry007 wrote: |
For , it is trivially true. Let .
It is enough to show that the term inside the parenthesis is an integer.
Let be a prime less than . The exponent of in the denominator is given by
In the numerator, the terms that are multiples of are as follows:
Factoring out a from all these terms gives us
In all, there are multiples of in the numerator. Of these are multiples of .
Factoring out a from these terms gives us
.
Continuing in this fashion, we can compute the exponent of in the numerator as follows:
.
Comparing the exponent of in the numerator and the denominator , it suffices to show
.
It is enough to show
.
Suppose divides . Then .
Suppose does not divide . Then (i.e.) where is a fraction less than .
Hence, .
Therefore, is an integer. In fact, a perfect square.
|
|
_________________ Boo!
Posted: Sun Jul 22, 2007 4:25 am |
 |
|
|
 |
 |
 |
 |
|
 |
 |
2 Posts • Page 1 of 1
You cannot post new topics in this forum You cannot reply to topics in this forum You cannot edit your posts in this forum You cannot delete your posts in this forum You cannot vote in polls in this forum You cannot attach files in this forum You can download files in this forum You cannot post calendar events in this forum
|