完全数,円分数,及びABC予想
2006 年 16 巻 3 号 p. 187-195
詳細
2006 年 16 巻 3 号 p. 187-195
Jenkins recently showed that an odd perfect number must be divisible by a prime greater than 10^7. The aim of this article is to give a new algorithm to obtain such a lower bound. The theory of cyclotomic numbers plays an important role in the algorithm. We also discuss some relation between cyclotomic numbers and ABC conjecture.
