Revision as of 17:46, 20 February 2016 editSimmeD (talk | contribs)Extended confirmed users, File movers, Pending changes reviewers, Rollbackers3,114 edits Then you should edit the notes, no need to delete references; Undid revision 705972833 by 2605:A601:613:7F01:C00D:939A:6A41:AE19 (talk)← Previous edit |
Revision as of 19:48, 29 December 2016 edit undo91.125.106.199 (talk)No edit summaryNext edit → |
Line 8: |
Line 8: |
|
\end{align}</math> |
|
\end{align}</math> |
|
|
|
|
|
where we turn a blind eye to the fact that {{math| 19<sup>2</sup>⋅61 {{=}} 22021 }} reveals that 22021 is ]! |
|
where we ignore the fact that {{math| 19<sup>2</sup>⋅61 {{=}} 22021 }} reveals that 22021 is ]. |
|
|
|
|
|
A Descartes number is defined as an odd number {{math| ''n'' {{=}} ''m''⋅''p'' }} where {{math| ''m'' }} and {{math| ''p'' }} are ] and {{math| 2''n'' {{=}} σ(''m'')⋅(''p'' + 1) }}, whence {{math| ''p'' }} is taken as a 'spoof' prime. The example given is the only one currently known. |
|
A Descartes number is defined as an odd number {{math| ''n'' {{=}} ''m''⋅''p'' }} where {{math| ''m'' }} and {{math| ''p'' }} are ] and {{math| 2''n'' {{=}} σ(''m'')⋅(''p'' + 1) }}, whence {{math| ''p'' }} is taken as a 'spoof' prime. The example given is the only one currently known. |
|
|
|
|
|
If {{math| ''m'' }} is an odd ],<ref>Currently, the only known almost perfect numbers are the nonnegative powers of 2, whence the only known odd almost perfect number is {{math| 2<sup>0</sup> {{=}} 1. }}</ref> that is, {{math| σ(''m'') {{=}} 2''m'' − 1 }} and {{math| 2''m'' − 1 }} is taken as a 'spoof' prime, then {{math| ''n'' {{=}} ''m''⋅(2''m'' − 1) }} is a Descartes number, since {{math| σ(''n'') {{=}} σ(''m''⋅(2''m'' − 1)) {{=}} σ(''m'')⋅2''m'' {{=}} (2''m'' − 1)⋅2''m'' {{=}} 2''n'' }}. If {{math| 2''m'' − 1 }} were prime, {{math| ''n'' }} would be an odd perfect number! |
|
If {{math| ''m'' }} is an odd ],<ref>Currently, the only known almost perfect numbers are the nonnegative powers of 2, whence the only known odd almost perfect number is {{math| 2<sup>0</sup> {{=}} 1. }}</ref> that is, {{math| σ(''m'') {{=}} 2''m'' − 1 }} and {{math| 2''m'' − 1 }} is taken as a 'spoof' prime, then {{math| ''n'' {{=}} ''m''⋅(2''m'' − 1) }} is a Descartes number, since {{math| σ(''n'') {{=}} σ(''m''⋅(2''m'' − 1)) {{=}} σ(''m'')⋅2''m'' {{=}} (2''m'' − 1)⋅2''m'' {{=}} 2''n'' }}. If {{math| 2''m'' − 1 }} were prime, {{math| ''n'' }} would be an odd perfect number. |
|
|
|
|
|
==Notes== |
|
==Notes== |