RE: [PrimeNumbers] Phi
From: Phil Carmody [mailto:thefatphil@...]
Sent: 27 February 2002 18:47
Subject: Re: [PrimeNumbers] Phi
--- Jon Perry <perry@...> wrote:
> A paper on Phi:I helped Jan Kristian Haugland look for 'near misses' a short while
> This includes the neat partial proof that k.phi(n) != n-1 for any
> Consider FLT: a^(p-1) = 1 mod p, and Euler's: a^phi(m) = 1 mod m
> a^(m-1) = a^[k.phi(m)] = [a^phi(m)]^k = 1 mod m
> But FLT implies m is therefore prime.
> Unfortunately FLT is not iff, but this does narrow the search down
> to m such
> that FLT holds for these composite m.
back. A google for something like "Carmichael Lehmer Carmody" should
find the summary of my tables.
.sig selecter broken, please ignore.
Do You Yahoo!?
Yahoo! Greetings - Send FREE e-cards for every occasion!
Unsubscribe by an email to: firstname.lastname@example.org
The Prime Pages : http://www.primepages.org
Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/