# Set of Symmetries of the Positive Integers [closed]

Consider the set of positive integers as a group with its binary operation being addition. Is this group's set of symmetries countable or uncountable?

## closed as unclear what you're asking by Mike Earnest, Connor Harris, Dietrich Burde, Derek Holt, José Carlos SantosMay 22 '18 at 17:34

Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.

• Do you mean its automorphism group? That's finite. – Lord Shark the Unknown May 22 '18 at 15:31
• For symmetric group see this question. For symmetry group of the integers see here. – Dietrich Burde May 22 '18 at 15:33
• Dear Mr. Burde, I was actually thinking of the set of positive integers as a dihedral group rather than a symmetric group. – Lorenzo Gil Badiola May 22 '18 at 15:38
• The positive integers are a semigroup, not a group. There are no inverses. – Robert Israel May 22 '18 at 15:40
• Since the number of symmetries of dihedral group N is twice the number of its elements, shouldn't the number of symmetries of this infinite dihedral group be double that of the set of natural numbers? – Lorenzo Gil Badiola May 22 '18 at 15:41

You may be thinking of a cycle graph, either finite or infinite. The symmetries of this graph is the dihedral group with twice the number of vertices of the cycle graph. Note that this is not the positive integers, which are not a group, since you don't have a graph structure compatible with the adjacency of the positive integers since $1$ is only adjacent to $2$.