Misplaced Pages

Descartes number

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.

This is an old revision of this page, as edited by 91.125.106.199 (talk) at 19:48, 29 December 2016. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Revision as of 19:48, 29 December 2016 by 91.125.106.199 (talk)(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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,

σ ( D ) = ( 3 2 + 3 + 1 ) ( 7 2 + 7 + 1 ) ( 11 2 + 11 + 1 ) ( 13 2 + 13 + 1 ) ( 22021 + 1 ) = ( 13 ) ( 3 19 ) ( 7 19 ) ( 3 61 ) ( 22 1001 ) = 3 2 7 13 19 2 61 ( 22 7 11 13 ) = 2 ( 3 2 7 2 11 2 13 2 ) ( 19 2 61 ) = 2 ( 3 2 7 2 11 2 13 2 ) 22021 = 2 D , {\displaystyle {\begin{aligned}\sigma (D)&=(3^{2}+3+1)\cdot (7^{2}+7+1)\cdot (11^{2}+11+1)\cdot (13^{2}+13+1)\cdot (22021+1)=(13)\cdot (3\cdot 19)\cdot (7\cdot 19)\cdot (3\cdot 61)\cdot (22\cdot 1001)\\&=3^{2}\cdot 7\cdot 13\cdot 19^{2}\cdot 61\cdot (22\cdot 7\cdot 11\cdot 13)=2\cdot (3^{2}\cdot 7^{2}\cdot 11^{2}\cdot 13^{2})\cdot (19^{2}\cdot 61)=2\cdot (3^{2}\cdot 7^{2}\cdot 11^{2}\cdot 13^{2})\cdot 22021=2D,\end{aligned}}}

where we ignore the fact that 19⋅61 = 22021 reveals that 22021 is composite.

A Descartes number is defined as an odd number n = mp 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.

Notes

  1. 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

Classes of natural numbers
Powers and related numbers
Of the form a × 2 ± 1
Other polynomial numbers
Recursively defined numbers
Possessing a specific set of other numbers
Expressible via specific sums
Figurate numbers
2-dimensional
centered
non-centered
3-dimensional
centered
non-centered
pyramidal
4-dimensional
non-centered
Combinatorial numbers
Primes
Pseudoprimes
Arithmetic functions and dynamics
Divisor functions
Prime omega functions
Euler's totient function
Aliquot sequences
Primorial
Other prime factor or divisor related numbers
Numeral system-dependent numbers
Arithmetic functions
and dynamics
Digit sum
Digit product
Coding-related
Other
P-adic numbers-related
Digit-composition related
Digit-permutation related
Divisor-related
Other
Binary numbers
Generated via a sieve
Sorting related
Natural language related
Graphemics related


Stub icon

This number theory-related article is a stub. You can help Misplaced Pages by expanding it.

Categories: