In the division of integers, there are only two situations: divisible and non-divisible. The remainder can not be generated in a time-sharing manner, and the remainder operation: a mod b = c(b is not 0) means that the remainder obtained by dividing the integer a by the integer b is c, for example, 7 ÷ 3 = 2 1 point. In the division of integers, there are only two situations: divisible and non-divisible. When it is not divisible, it will produce a remainder, so the remainder problem is very important in primary school mathematics.

The difference between remainder and divisor:

The absolute value of the difference between the remainder and the divisor is less than the absolute value of the divisor (applicable to the real number field), and the sum of A and B divided by the remainder of C (except when there is no remainder) is equal to the sum of A and B divided by C (or the sum divided by the remainder of C) respectively.

For example, 23, the remainder of 16 divided by 5 is 3 and 1 respectively, so the remainder of (23+ 16) divided by 5 is equal to 3+ 1=4. When the sum of the remainder is greater than the divisor, the remainder is equal to the sum of the remainder divided by the remainder of c, for example, 23, and the remainder of 19 divided by 5 is 3 and 4 respectively, so the remainder of (23+ 19) divided by 5 is equal to that of (3+4) divided by 5.