Perfect - Compute a perfect number from an input number q
      Version 1.00, last revised: 1994-08-13, 0600 hours
      Copyright (c) 1981-1994 by author: Harry J. Smith,
      19628 Via Monte Dr., Saratoga, CA 95070.  All rights reserved.

Perfect is a MS Windows program to compute a perfect number from q, the
exponent in a Mersenne prime M(q) = 2^q - 1.  When q = 859433 the
517430-digit number is computed and stored on disk in about 5 minutes on
a 33 MHz i486 machine.

A number is called perfect if it is equal to the sum of its divisors.
Six is perfect: 6 = 1 + 2 + 3.
28 is perfect: 28 = 1 + 2 + 4 + 7 + 14.

M(n) = 2^n - 1 is called a Mersenne number.
If M(q) = is prime then it is called a Mersenne prime and q will be prime also.
If q makes a Mersenne prime then P(q) = 2^(q-1) * (2^q - 1) is a Perfect number.

File name    | What it is for
-------------|------------------------------------------------------------------
MIKE    .LET | Letter to Dr. Michael W. Ecker, editor of REC
MULTIFDW.CPP | C++ Source code for MultiFD for Windows (Floating point package)
MULTIFDW.H   | C++ header source file for MultuFD for Windows
MULTIIDW.CPP | C++ Source code for MultiID for Windows (Integer package)
MULTIIDW.H   | C++ header source file for MultiID for Windows
PERFECT .CPP | C++ Source code for Perfect
PERFECT .DEF | Borland C++ module definition file
PERFECT .DOC | Documentation for Perfect program (Microsoft Word file)
PERFECT .EXE | Executable file for Perfect
PERFECT .ICO | MS Windows icon for Perfect
PERFECT .IDE | Borland C++ 4.0 project file for Perfect
PERFECT .TXT | Documentation for Perfect program (DOS text file)
Q_859433.OUT | Perfect number for q = 859433, all 517,430 decimal digits
READ-ME .    | Information for legal ownership
WHATFOR .    | This file

End of file