Next: Integer-printing, Previous: Integer-iterators, Up: Integer [Index]
Compute the number of combinations of anInteger objects among a number of objects given by the receiver.
Answer (self log: radix) ceiling. Optimized to answer an integer.
Answer an estimate of (self abs floorLog: 10)
Return whether the receiver is even
Return the receiver’s factorial.
Answer (self log: radix) floor. Optimized to answer an integer.
Return the greatest common divisor (Euclid’s algorithm) between the receiver and anInteger
Return the least common multiple between the receiver and anInteger
Return whether the receiver is odd