$\sigma(n) \equiv 1 \space \pmod{n}$ if and only if $n$ is prime

This is a hard problem.

If you can prove your conjecture, then it will imply immediately that there are no quasi-perfect numbers. The existence of quasi-perfect numbers is a long-open problem.

Tags:

Number Theory

Modular Arithmetic

Prime Numbers

Divisor Sum

Related

What's the probability of choosing two numbers from $[0,1]$ and having the difference at least one half? Factoring rational primes over the Eisenstein integers - when can a prime be written as $j^2+3k^2$? Limit of a sequenced defined by arithmetic mean and geometric mean. Is there an intuitive reason for a certain operation to be associative? Definition of convergence to infinity Find stationary distribution for infinite space Markov chain Can there be an onto homomorphism from a ring without unity to a ring with unity? Zeroes of a non elementary integral Problem of Mary Somerville and Hypatia Is the product of all positive rational numbers equal to one? A subgroup $H$ of $G$ is normal iff for all $a,b \in G$, $ab \in H \iff ba \in H$. Understanding the philosophy behind the axiomatic definition of reals

Recent Posts