Factors of Integer Congruent to 5 modulo 6

From ProofWiki
Jump to navigation Jump to search

Theorem

Let $m$ be an positive integer.

Let $m \equiv 5 \pmod 6$.


Then $m$ has two divisors whose sum is divisible by $6$.


Proof


Sources