2000 character limit reached
More on the Nonexistence of Odd Perfect Numbers of a Certain Form
Published 3 Dec 2015 in math.NT | (1512.01270v1)
Abstract: Euler showed that if an odd perfect number exists, it must be of the form $N = p\alpha q_{1}{2\beta_{1}}$ $\ldots$ $q_{k}{2\beta_{k}}$, where $p, q_{1}, \ldots, q_k$ are distinct odd primes, $\alpha$, $\beta_{i} \geq 1$, for $1 \leq i \leq k$, with $p \equiv \alpha \equiv 1 \pmod{4}$. In 2005, Evans and Pearlman showed that $N$ is not perfect, if $3|N$ or $7|N$ and each $\beta_{i} \equiv 2 \pmod{5}$. We improve on this result by removing the hypothesis that $3|N$ or $7|N$ and show that $N$ is not perfect, simply, if each $\beta_{i} \equiv 2 \pmod{5}$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.