## 2 comments on “100th Post…discrete logs and cayley graphs”

1. There’s only one cyclic group of order N (up to isomorphism) — the group of integers modulo N. The number of Abelian groups of order N is harder to calculate in general since repeated prime factors in N give rise to different Abelian groups (e.g. the cyclic group of order 4 is not isomorphic to the direct product of 2 cyclic groups of order 2 as the latter has no elenent of order 4)…

• Hi Rafi! I think you are the first genuine math professor to comment on the furloff! Hopefully a sign of good things to come!