# Factors of Integer Congruent to 5 modulo 6

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

- 1986: David Wells:
*Curious and Interesting Numbers*... (previous) ... (next): $6$ - 1997: David Wells:
*Curious and Interesting Numbers*(2nd ed.) ... (previous) ... (next): $6$