Modulo J. Instead of returning the result of the division, the modulo operation returns the whole number remainder. In older versions of fpc that support operator overloading you can add this feature yourself.
Thus we are looking for numbers whose products are 1 more than a multiple of 26.
A number a has an inverse modulo 26 if there is a b such that a·b ≡ 1(mod 26)or a·b = 26·k +1. X ≡ 1 (mod n) # x is congruent to 1 (modulo n) the (mod n) and the triple equals sign denote that you're working with modular arithmetic, not normal arithmetic. An example of leap year with modulo operator. The % character is the modulus operator in java.
Nessun commento:
Posta un commento