IdealInt

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

implicit object IdealIntIsIntegral extends Integral[IdealInt]

val MINUS_ONE: IdealInt

val ONE: IdealInt

val ZERO: IdealInt

def apply(intString: String, b: Int): IdealInt

Translates the String representation of an IdealInt with base b into an IdealInt.

def apply(intString: String): IdealInt

Translates the decimal String representation of an IdealInt into an IdealInt.

def apply(i: BigInteger): IdealInt

def apply(i: Long): IdealInt

def apply(i: Int): IdealInt

Constructs a IdealInt whose value is equal to that of the specified integer value.

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def gcd(vals: Iterator[IdealInt]): IdealInt

The gcd of a collection of IdealInt.

def gcd(vals: Iterable[IdealInt]): IdealInt

The gcd of a collection of IdealInt.

def gcdAndCofactors(vals: Seq[IdealInt]): (IdealInt, Seq[IdealInt])

Extended euclidean algorithm for computing both the gcd and the cofactors of a sequence of IdealInt.

def gcdAndCofactors(_a: IdealInt, _b: IdealInt): (IdealInt, IdealInt, IdealInt)

Extended euclidean algorithm for computing both the gcd and the cofactors of two IdealInt.

final def getClass(): Class[_]

def hashCode(): Int

implicit def int2idealInt(i: Int): IdealInt

Implicit conversion from Int to IdealInt.

final def isInstanceOf[T0]: Boolean

def lcm(vals: Iterator[IdealInt]): IdealInt

The lcm of a collection of IdealInt.

def lcm(vals: Iterable[IdealInt]): IdealInt

The lcm of a collection of IdealInt.

def log2(n: IdealInt): Option[Int]

If n = 2^k, return Some(k), otherwise None.

implicit def long2idealInt(l: Long): IdealInt

Implicit conversion from Long to IdealInt

def max(els: Iterable[IdealInt]): IdealInt

def max(it: Iterator[IdealInt]): IdealInt

Compute the maximum of a sequence of IdealInt.

def min(els: Iterable[IdealInt]): IdealInt

def min(it: Iterator[IdealInt]): IdealInt

Compute the maximum of a sequence of IdealInt.

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def pow2(exp: IdealInt): IdealInt

Compute 2^exp.

def pow2(exp: Int): IdealInt

Compute 2^exp.

def pow2MinusOne(exp: Int): IdealInt

Compute 2^exp - 1.

def pow2Mod(exp: IdealInt, modulus: IdealInt): IdealInt

Compute 2^exp % modulus.

def sum(it: Iterator[IdealInt]): IdealInt

def sum(it: Iterable[IdealInt]): IdealInt

Compute the sum of a sequence of IdealInt

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

def unapply(n: IdealInt): Option[Int]

Extract a 32-bit integer from an IdealInt.

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

final def wait(): Unit

def finalize(): Unit