Download PDF

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts

Law of large numbers wikipedia , lookup

Mathematics of radio engineering wikipedia , lookup

Large numbers wikipedia , lookup

Proofs of Fermat's little theorem wikipedia , lookup

Elementary mathematics wikipedia , lookup

Addition wikipedia , lookup

Transcript
almost perfect number∗
PrimeFan†
2013-03-22 0:09:01
An almost perfect number or least deficient number is a number n whose
proper divisors add up to just one less than itself. That is, σ(n) − n = n − 1,
with σ(n) being the sum of divisors function. Currently, the only known almost
perfect numbers are the integer powers of 2 (e.g., 1, 2, 4, 8, 16, 32, 64, 128,
etc.) No one has been able to prove that there are almost perfect numbers of a
different form.
∗ hAlmostPerfectNumberi created: h2013-03-2i by: hPrimeFani version: h40139i Privacy
setting: h1i hDefinitioni h11A05i
† This text is available under the Creative Commons Attribution/Share-Alike License 3.0.
You can reuse this document or portions thereof only if you do so under terms that are
compatible with the CC-BY-SA license.
1