Re: OT: Errors in Marcel's "Perfect Number code" examples?
by Coos Haak <chforth@[EMAIL PROTECTED]
>
Feb 15, 2008 at 06:48 PM
Op Fri, 15 Feb 2008 18:24:16 +0100 schreef Coos Haak:
> Op Thu, 14 Feb 2008 19:08:50 -0500 schreef Rod Pemberton:
>
>> Marcel,
>>
>> I've got a couple of problems with the examples on your "Perfect Number
>> code" webpage:
>> http://home.iae.nl/users/mhx/perfect.html
>>
>> You state:
>>
>> "The perfect number A can be characterized by a unique number n, where
A =
>> 2^n * (2^n-1 - 1). "
>
> 2^(n - 1)*(2^n - 1)
But only of 2^n - 1 is a Mersenne prime ;-)
--
Coos
CHForth, 16 bit DOS applications
http://home.hccnet.nl/j.j.haak/forth.html
