The problem is as follows:
Find at least one polygon $\mathbb{P}$ whose group of symmetries has order $n \in \mathbb{N}$ and is equal to its group of rotations. Is that group cyclic?
Although the problem doesn't specify how many vertices the polygon should have, I assume that it should be an $n$-gon. What confuses me is that in order for the polygon to have $n$ rotations, it needs to be cyclic, and all of its central angles must be equal, which means that it must be regular, but regular polygons have $2n$ symmetries. Is my conclusion wrong? If so, which part of my deduction is wrong? I'd appreciate any input, and of course, a solution (even without any attention to my additional questions, which might be completely off the mark).
EDIT: In case it's unclear, the group of symmetries of a polygon $\mathbb{P}$ is the set of all isometries $\phi:\mathbb{E}^2 \to \mathbb{E}^2$ such that $\phi(\mathbb{P})=\mathbb{P}$ with its operation being function composition. Also, its group of rotations (almost always) consists of rotations around the same point, as the composition of two rotations around different points need not be a rotation.