| Revision as of 06:22, 14 January 2018 editDavid Eppstein (talk | contribs)Autopatrolled, Administrators226,426 edits see also Erdős–Nicolas number, another type of almost-perfect number← Previous edit | Revision as of 14:10, 11 May 2018 edit undoBear-rings (talk | contribs)Extended confirmed users4,494 edits + linkNext edit → | ||
| Line 1: | Line 1: | ||
| In number theory<!--mathematics-->, a '''Descartes number''' is an odd number which would have been an ], if one of its composite factors were prime. They are named after ] who observed that the number {{math| ''D'' {{=}} 3<sup>2</sup>⋅7<sup>2</sup>⋅11<sup>2</sup>⋅13<sup>2</sup>⋅22021 {{=}} (3⋅1001)<sup>2</sup>⋅(22⋅1001 − 1) {{=}} 198585576189 }} would be an ] if only {{math| 22021 }} were a ], since the ] for {{math| ''D'' }} would satisfy, if 22021 were prime, | In ]<!--mathematics-->, a '''Descartes number''' is an odd number which would have been an ], if one of its composite factors were prime. They are named after ] who observed that the number {{math| ''D'' {{=}} 3<sup>2</sup>⋅7<sup>2</sup>⋅11<sup>2</sup>⋅13<sup>2</sup>⋅22021 {{=}} (3⋅1001)<sup>2</sup>⋅(22⋅1001 − 1) {{=}} 198585576189 }} would be an ] if only {{math| 22021 }} were a ], since the ] for {{math| ''D'' }} would satisfy, if 22021 were prime, | ||
| :<math>\begin{align} | :<math>\begin{align} | ||
Revision as of 14:10, 11 May 2018
In number theory, a Descartes number is an odd number which would have been an odd perfect number, if one of its composite factors were prime. They are named after René Descartes who observed that the number D = 3⋅7⋅11⋅13⋅22021 = (3⋅1001)⋅(22⋅1001 − 1) = 198585576189 would be an odd perfect number if only 22021 were a prime number, since the sum-of-divisors function for D would satisfy, if 22021 were prime,
where we ignore the fact that 19⋅61 = 22021 reveals that 22021 is composite.
A Descartes number is defined as an odd number n = m⋅p where m and p are coprime and 2n = σ(m)⋅(p + 1) , whence p is taken as a 'spoof' prime. The example given is the only one currently known.
If m is an odd almost perfect number, that is, σ(m) = 2m − 1 and 2m − 1 is taken as a 'spoof' prime, then n = m⋅(2m − 1) is a Descartes number, since σ(n) = σ(m⋅(2m − 1)) = σ(m)⋅2m = (2m − 1)⋅2m = 2n . If 2m − 1 were prime, n would be an odd perfect number.
See also
- Erdős–Nicolas number, another type of almost-perfect number
Notes
- Currently, the only known almost perfect numbers are the nonnegative powers of 2, whence the only known odd almost perfect number is 2 = 1.
References
- Banks, William D.; Güloğlu, Ahmet M.; Nevans, C. Wesley; Saidak, Filip (2008). "Descartes numbers". In De Koninck, Jean-Marie; Granville, Andrew; Luca, Florian (eds.). Anatomy of integers. Based on the CRM workshop, Montreal, Canada, March 13--17, 2006. CRM Proceedings and Lecture Notes. Vol. 46. Providence, RI: American Mathematical Society. pp. 167–173. ISBN 978-0-8218-4406-9. Zbl 1186.11004.
- Klee, Victor; Wagon, Stan (1991). Old and new unsolved problems in plane geometry and number theory. The Dolciani Mathematical Expositions. Vol. 11. Washington, DC: Mathematical Association of America. ISBN 0-88385-315-9. Zbl 0784.51002.
| Classes of natural numbers | |||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| |||||||||||||||||||||||||
| |||||||||||||||||||||||||
| |||||||||||||||||||||||||
| |||||||||||||||||||||||||
| |||||||||||||||||||||||||
| |||||||||||||||||||||||||
| |||||||||||||||||||||||||
| |||||||||||||||||||||||||
| |||||||||||||||||||||||||
| |||||||||||||||||||||||||
| |||||||||||||||||||||||||
| |||||||||||||||||||||||||
| |||||||||||||||||||||||||
| |||||||||||||||||||||||||
| |||||||||||||||||||||||||
| |||||||||||||||||||||||||
| |||||||||||||||||||||||||
| |||||||||||||||||||||||||
 | This number theory-related article is a stub. You can help Misplaced Pages by expanding it. |