# Tour:Group of integers modulo n

From Groupprops

**This article adapts material from the main article:** group of integers modulo n

This page is part of the Groupprops guided tour for beginners (Jump to beginning of tour)PREVIOUS: Group of integers|UP: Introduction four (beginners)|NEXT: Order of an element

General instructions for the tour | Pedagogical notes for the tour | Pedagogical notes for this part

{{**WHAT YOU NEED TO DO**:

- Understand the definition of the group of integers modulo
- Check that the addition tables given for small values of are correct.}}

## Definition

Let be a positive integer. The group of integers modulo is an Abelian group defined as follows:

- Its underlying set is the set
- The rule for addition in the group is as follows. If the integer sum is between and , then the sum is defined as equal to the integer sum. If the integer sum is at least , then the sum is defined as .
- The identity element of the group is .
- The inverse map in the group is defined as follows: the additive inverse of is , and the additive inverse of any other is, as an integer, .

The group of integers modulo is a concrete description of the cyclic group of order .

This group is typically denoted as or simply . It is also sometimes denoted as .

## Examples

Here are the multiplication tables (more aptly called addition tables, because the group is Abelian and the operation is more typically called addition) for the group of integers mod for small values of :

:

This is isomorphic to the trivial group.

:

:

:

This page is part of the Groupprops guided tour for beginners. Make notes of any doubts, confusions or comments you have about this page before proceeding.PREVIOUS: Group of integers|UP: Introduction four (beginners)|NEXT: Order of an element