We consider a class of problems (involving a fixed natural number n>1) where, in order to answer the problem, we treat all numbers that leave the same remainder when divided by n as "the same". Formalising this concept of "sameness" we introduce the set of integers modulo n. We learn how to add and multiply two elements in this set of integers modulo n.