u> mbers.htm

Jon, regarding your proof of the non-existence of odd square-free perfect

>

squares, isn't it a bit long winded? If n is perfect, then sigma(n)=2n. It

has a smallest prime factor p, and is squarefree. Since the sigma function

is multiplicative, sigma(p)=p+1 divides 2n, which imples n is divisible by a

smaller prime than p, which is a contradiction. And that's about it.'

Can't see that there's that much in it. Mine uses 3 words to your 1, but

that's just a different teaching style. P>S> I polished the proof up a bit.

Jon Perry

perry@...

http://www.users.globalnet.co.uk/~perry/maths/

http://www.users.globalnet.co.uk/~perry/DIVMenu/

BrainBench MVP for HTML and JavaScript

http://www.brainbench.com