Modulo R. Trying to understand some results in r with x modulo y i found this page. I had read that the remainder or result of modulo operator is supposed to be always positive, but this is not the case in r, and the definition and example provide here explain the logic.
(6) for any prime p > 3, prove that the primitive roots modulo p occur in incongruent pairs r, r 0, where rr ≡ 1 (mod p).
A = n * q + r. On all current r platforms iec 60559 (also known as ieee 754) arithmetic is used, but some things in those standards are optional. (6) for any prime p > 3, prove that the primitive roots modulo p occur in incongruent pairs r, r 0, where rr ≡ 1 (mod p). Then trying to explain to myself some querky results i wrote this r script below.
Nessun commento:
Posta un commento