(base ^ exp) % n

Perform a strong Lucas primality test on `n`.

Decompose a height, given in inches, into the largest whole number of feet, plus the leftover inches. For example, `inches(17)` would be decomposed i

Produce the Lucas element whose index is twice the input element's index.

Pollard's rho algorithm, using Brent's cycle detection method. Precondition: `n` is known to be composite.

Test whether the number is a perfect square.

The string-length needed to hold a representation of this unsigned integer.

Compute the next step for Pollard's rho algorithm factoring `n`, with parameter `t`.

Get a C-string representation of this constant. (Note that the constructors have guaranteed a correct placement of the '\0'.)

Get a (sizeof()-compatible) char array reference to the data.

The first `D` in the infinite sequence {5, -7, 9, -11, ...} whose Jacobi symbol is (-1) is the `D` we want to use for the Strong Lucas Probable Prime

Compute the strong Lucas sequence element at index `i`.

Find the next element in the Lucas sequence, using parameters for strong Lucas probable primes.

The Jacobi symbol (a/n) is defined for odd positive `n` and any integer `a` as the product of the Legendre symbols (a/p) for all prime factors `p` of

The string-length needed to hold a representation of this integer.

The default constructor produces a QuantityPoint whose value is default constructed. It exists to give you an object you can assign to. The main mot