加载中…
The existence of a perfect odd number is an old open problem of number theory. An Euler’s theorem states that if an odd integer is perfect, then is written as , where are odd numbers, is a prime number of the form and , where denotes the greatest common divisor of and . In this article we show that the exponent , of , in this equation, is necessarily equal to 1. That is, if is an odd perfect number, then is written as $ n = pm ^ 2. $

生成讲解博客的中文版本

生成AI智能校验的中文版本