Maturity Index: Relatively immature
Every integer mod p keeps its own copy of the modulus; you don't need to set a global modulus. As a consequence, it is possible to do multiple calculations modulo a different prime, even concurrenlty.
IntegerModp is the prototype, in the Computer Algebra Kit, of a field i.e., a structure where each (nonzero) element has a multiplicative inverse (see inField and inverse). Matrix (in Gaussian elimination) and Polynomial (in polynomial division) take advantage of the field structure of scalars, such as integers mod p.
+modulus:(unsigned short)aPrimeCreates a new object, equal to zero, with modulus equal to aPrime. The modulus must be a prime number less than or equal to USHRT_MAX_PRIME.
+int:(int)intValuemodulus:(unsigned short)aPrimeCreates a new object with modulus equal to aPrime. The value of the object is equal to intValue mod aPrime. The modulus must be a prime number less than or equal to USHRT_MAX_PRIME.
- (unsigned short)modulusReturns the modulus, a prime number equal to or less than USHRT_MAX_PRIME.
- (int)intValueReturns a representant of the modular number in the range [0,modulus[.
-intValue:(int)aValueReturns a new object for aValue, modulo the modulus of the receiving object.
-divide:bMultiplies the object by the inverse of b. Returns nil if b is zero (has no inverse).
- (int)characteristicReturns the modulus of the object.
-frobeniusSimply returns a new reference to the object itself, since the p-th power of an integer modulo p is equal to that integer.
-frobeniusInverseSimply returns a new reference to the object itself, since the p-th power of an integer modulo p is equal to that integer. This method also returns zero for the zero object.
- (BOOL)printsLeadingSignReturns NO, because representants are taken positive for printing.
-printOn:(IOD)aFilePrints a (nonnegative) representant of the integer modulo p.