Modular Arithmetichard
0:00.0

If a regular polygon has nn sides, and the sum of its interior angles is S≡0(mod360)S \equiv 0 \pmod{360}, what is the smallest n>2n > 2 satisfying this?