These predicates are additions to standard the arithmetic functions provided by
expmod(+Base, +Expo, +Mod, -R).
Modular exponentiation. Base, Expo and Mod must be integers.
lcm(+A, +B, -Lcm) is det.
Calculates the Least common multiple for A and B: the smallest positive integer that is divisible by both A and B.
A and B need to be integers.
True iff N is the least significat bit of integer X
True iff N is the most significant bit of integer X
True iff given a number Real, Fraction is the same number represented as a fraction.
True iff given an integer Number, Bits1 is the amount of 1 bits the binary representation of that number has.
rational_numerator_denominator(+Fraction, -Numerator, -Denominator).
True iff given a fraction Fraction, Numerator is the numerator of that fraction and Denominator the denominator.