Re: Order modulo p^n (Number Theory)

On Mon, 15 Sep 2008 14:15:37 +0100, I wrote:

*I expect it is true that p^{n - k} divides binom{p^{n - 2}}{k} for
k = 2, 3, ..., n - 2, but this just looks so fiddly to prove that I
can hardly bring myself to look at it.

I now felt obliged to look at this, and I think I managed to give a
laborious proof (by treating the cases k = 2 and k = 3 separately),
but my earlier proof is now looking almost elegant by comparison!

--
Angus Rodgers
(twirlip@ eats spam; reply to angusrod@)
Contains mild peril
.

Relevant Pages