3 Modulo 12. Enter an integer number to calculate its remainder of euclidean division by a. Instead of saying 1600 hours, we just say 4 o'clock.
This 12 is the modulus. The modulo 9 equivalent of 12 is 3 which is also the digit sum of 12. There is a very close relationship between the modulo 9 equivalents of numbers and their digit sums.
.{z}_{12}$ (those integers modulo 12 under addition) to the integers in $\mathbb{z}_{13}^{*}$ (those integers modulo 13 that are relatively prime to 13 under multiplication).
This modulo calculator is a handy tool if you need to find the result of modulo operations. The calculator below solves a math equation modulo p. The calculator performs arithmetic operations modulo p. Tool to compute any modulo operation.
Nessun commento:
Posta un commento