Browse Groups

• ## Re: [PrimeNumbers] Proof of infinite Germainn primes

(4)
• NextPrevious
• ... http://www.users.globalnet.co.uk/~perry/maths/germainprimes/germainprimes.ht ... s/A bit sketchy/Completely bogus/ You manage to make it from line 1 to
Message 1 of 4 , Jul 2, 2002
View Source
--- Jon Perry <perry@...> wrote:
> A bit sketchy, in fact you'll probably hate it, but the essence is
> there:
>
>
http://www.users.globalnet.co.uk/~perry/maths/germainprimes/germainprimes.ht
> m

s/A bit sketchy/Completely bogus/

You manage to make it from line 1 to line 2 of the so-called proof in
one piece, but you lose it on line 3.

Phil

=====
--
"One cannot delete the Web browser from KDE without
losing the ability to manage files on the user's own
hard disk." - Prof. Stuart E Madnick, MIT.
So called "expert" witness for Microsoft. 2002/05/02

__________________________________________________
Do You Yahoo!?
http://sbc.yahoo.com
• Phil, Jon, No need to look that far into the proof - it has all gone wrong before we even get into the mathematics, at the definition stage: Germain primes
Message 2 of 4 , Jul 2, 2002
View Source
Phil, Jon,

No need to look that far into the proof - it has all gone wrong before we even
get into the mathematics, at the definition stage: "Germain primes are primes
'p' such that 2p-1 is prime". (They are primes p such that 2p+1 is prime)

Regards,

Paul.

__________________________________________________
Virus checked by MessageLabs Virus Control Centre.
• Alright, I meant the Woodall primes. Anyway the proof covers both 2p-1 and 2p+1. Jon Perry perry@globalnet.co.uk http://www.users.globalnet.co.uk/~perry/maths
Message 3 of 4 , Jul 2, 2002
View Source
Alright, I meant the Woodall primes. Anyway the proof covers both 2p-1 and
2p+1.

Jon Perry
perry@...
http://www.users.globalnet.co.uk/~perry/maths
BrainBench MVP for HTML and JavaScript
http://www.brainbench.com

-----Original Message-----
From: Paul Jobling [mailto:Paul.Jobling@...]
Sent: 02 July 2002 15:51
Subject: RE: [PrimeNumbers] Proof of infinite Germainn primes

Phil, Jon,

No need to look that far into the proof - it has all gone wrong before we
even
get into the mathematics, at the definition stage: "Germain primes are
primes
'p' such that 2p-1 is prime". (They are primes p such that 2p+1 is prime)

Regards,

Paul.

__________________________________________________
Virus checked by MessageLabs Virus Control Centre.

Unsubscribe by an email to: primenumbers-unsubscribe@egroups.com
The Prime Pages : http://www.primepages.org

Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/
Your message has been successfully submitted and would be delivered to recipients shortly.
• Changes have not been saved
Press OK to abandon changes or Cancel to continue editing
• Your browser is not supported
Kindly note that Groups does not support 7.0 or earlier versions of Internet Explorer. We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox. If you are using IE 9 or later, make sure you turn off Compatibility View.