SPOOF ODD PERFECT NUMBERS

被引：4
|
作者：
Dittmer, Samuel J. [1 ]
机构：
[1] Brigham Young Univ, Dept Math, Provo, UT 84602 USA
来源：
MATHEMATICS OF COMPUTATION | 2014年 / 83卷 / 289期
关键词：
D O I：
10.1090/S0025-5718-2013-02793-7
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
In 1638, Descartes showed that 3(2) . 7(2) . 11(2) . 13(2) . 22021(1) would be an odd perfect number if 22021 were prime. We give a formal definition for such "spoof" odd perfect numbers, and construct an algorithm to find all such integers with a given number of distinct quasi-prime factors. We show that Descartes' example is the only spoof with less than seven such factors.
引用
收藏
页码：2575 / 2582
页数：8
相关论文
共 50 条
12345