Convert a textual representation into an !mpz number. The form {text}::mpz is equivalent to mpz({text}).

White space is allowed in the string, and is simply ignored.

The base may vary from 2 to 62, or if base is 0 or omitted, then the leading characters are used: 0x and 0X for hexadecimal, 0b and 0B for binary, 0 for octal, or decimal otherwise.

For bases up to 36, case is ignored; upper-case and lower-case letters have the same value. For bases 37 to 62, upper-case letter represent the usual 10..35 while lower-case letter represent 36..61.

=# SELECT '0x10'::mpz AS "hex", '10'::mpz AS "dec",
-#        '010'::mpz AS "oct", '0b10'::mpz AS "bin";
 hex | dec | oct | bin
-----+-----+-----+-----
 16  | 10  | 8   | 2

Convert the !mpz z into a string. The form {z}::text is equivalent to text({z}).

base may vary from 2 to 62 or from −2 to −36. For base in the range 2..36, digits and lower-case letters are used; for −2..−36, digits and upper-case letters are used; for 37..62, digits, upper-case letters, and lower-case letters (in that significance order) are used. If base is not specified, 10 is assumed.

Note

GMP defines many structures in terms of !long or !unsigned long, whose definitions may vary across platforms. PostgreSQL instead offers data types with a defined number of bytes (e.g. !int4, !int8). For this reason, functions taking an integer as argument are defined as !int8, but they may actually fail if the server is 32 bit and the argument doesn't fit into an !int4.

Return the absolute value of z.

Return +1 if z > 0, 0 if z = 0, and -1 if z < 0.

Return !true if z is odd or even, respectively, else !false.

Note

Only the truncating division and reminder (!/ and !%) have the correct precedence respect to addition, subtraction and multiplication. See the PostgreSQL precedence table for further details.

Return a tuple containing quotient q and remainder r of the division, rounding towards 0.

Return a tuple containing quotient q and remainder r of the division, rounding towards +infinity (ceil).

Return a tuple containing quotient q and remainder r of the division, rounding towards -infinity (floor).

Return !true if n is exactly divisible by d, or in the case of !divisible_2exp() by 2^b .

n is divisible by d if there exists an integer q satisfying n = q⋅d . Unlike the other division operators, d=0 is accepted and following the rule it can be seen that only 0 is considered divisible by 0.

The operators !/? and !>>? are aliases for !divisible() and !divisible_2exp().

Return !true if n is congruent to c modulo d, or in the case of !congruent_2exp() modulo 2^b .

n is congruent to c\modd if there exists an integer q satisfying n = c + q⋅d . Unlike the other division operators, d=0 is accepted and following the rule it can be seen that n and c are considered congruent mod 0 only when exactly equal.

Return base raised to exp.

exp is defined as !int8 but must fit into a !long as defined on the server.

The function is an alias for the !^ operator.

Return (base raised to exp) modulo mod.

Negative exp is supported if an inverse base^-1 mod mod exists (see invert() function). If an inverse doesn't exist then a divide by zero is raised.

Return the truncated integer part of the nth root of op.

n is defined as !int8 but must fit into a !long as defined on the server.

Return a tuple of 2 elements with the truncated integer part of the nth root of op and the remainder (i.e. op - root ^ n).

=# select * from rootrem(28, 3);
 root | rem
------+-----
 3    | 1

Return the truncated integer part of the square root of op.

Return a tuple of 2 elements with the truncated integer part of the square root of op and the remainder (i.e. op - root * root).

=# select * from sqrtrem(83);
 root | rem
------+-----
 9    | 2

Return !true if op is a perfect power, i.e., if there exist integers a and b , with b > 1 , such that op equals a^b .

Under this definition both 0 and 1 are considered to be perfect powers. Negative values of op are accepted, but of course can only be odd perfect powers.

Return !true if op is a perfect square, i.e., if the square root of op is an integer. Under this definition both 0 and 1 are considered to be perfect squares.

Determine whether n is prime. Return 2 if n is definitely prime, return 1 if n is probably prime (without being certain), or return 0 if n is definitely composite.

This function does some trial divisions, then some Miller-Rabin probabilistic primality tests. reps controls how many such tests are done, 5 to 10 is a reasonable number, more will reduce the chances of a composite being returned as “probably prime”.

Miller-Rabin and similar tests can be more properly called compositeness tests. Numbers which fail are known to be composite but those which pass might be prime or might be composite. Only a few composites pass, hence those which pass are considered probably prime.

Return the next prime greater than op.

This function uses a probabilistic algorithm to identify primes. For practical purposes it's adequate, the chance of a composite passing will be extremely small.

Return the greatest common divisor of a and b. The result is always positive even if one or both input operands are negative.

Return the greatest common divisor g of a and b, and in addition coefficients s and t satisfying a⋅s + b⋅t = g . The value g is always positive, even if one or both of a and b are negative. The values s and t are chosen such that |s| ≤ |b| and |t| ≤ |a| .

=# select * from  gcdext(6, 15);
 g | s  | t
---+----+---
 3 | -2 | 1

Return the least common multiple of a and b. The value returned is always positive, irrespective of the signs of a and b. The return will be zero if either a or b is zero.

Return op!, the factorial of op.

Return the binomial coefficient n\choosek . Negative values of n are supported, using the identity  − n\choosek = ( − 1)^kn + k − 1\choosek .

!fib() returns F_n , the nth Fibonacci number. !fib2() returns F_n and F_n − 1 .

These functions are designed for calculating isolated Fibonacci numbers. When a sequence of values is wanted it's best to start with !fib2() and iterate the defining F_n + 1 = F_n + F_n − 1 or similar.

!lucnum() returns L_n , the nth Lucas number. !lucnum2() returns L_n and L_n − 1 .

These functions are designed for calculating isolated Lucas numbers. When a sequence of values is wanted it's best to start with !lucnum2() and iterate the defining L_n + 1 = L_n + L_n − 1 or similar.

The Fibonacci numbers and Lucas numbers are related sequences, so it's never necessary to call both !fib2() and !lucnum2(). The formulas for going from Fibonacci to Lucas can be found in Lucas Numbers Algorithm, the reverse is straightforward too.

Return the inverse of a modulo b if exists. The return value r will satisfy 0 ≤ r\ltb . If an inverse doesn't exist return !NULL.

Calculate the Jacobi symbol ((a)/(b)) . This is defined only for b odd.

Calculate the Legendre symbol ((a)/(p)) . This is defined only for p an odd positive prime, and for such p it's identical to the Jacobi symbol.

Calculate the Jacobi symbol ((a)/(b)) with the Kronecker extension ((a)/(2)) = ((2)/(a)) when a odd, or ((a)/(2)) = 0 when a even.

Return the ones' complement of op.

If op>=0, return the population count of op, which is the number of 1 bits in the binary representation. If op<0, the number of 1s is infinite, and the return value is the largest possible, represented by gmp_max_bitcnt().

If op1 and op2 are both >=0 or both <0, return the Hamming distance between the two operands, which is the number of bit positions where op1 and op2 have different bit values. If one operand is >=0 and the other <0 then the number of bits different is infinite, and the return value is the largest possible, represented by gmp_max_bitcnt().

Scan op, starting from bit starting_bit, towards more significant bits, until the first 0 or 1 bit (respectively) is found. Return the index of the found bit.

If the bit at starting_bit is already what's sought, then starting_bit is returned.

If there's no bit found, then the largest possible bit count is returned (represented by gmp_max_bitcnt()). This will happen in !mpz_scan0() past the end of a negative number, or !mpz_scan1() past the end of a nonnegative number.

Return op with bit bit_index set.

Return op with bit bit_index cleared.

Return op with bit bit_index complemented.

Test bit bit_index in op and return 0 or 1 accordingly.

Initialize the session random state with a default algorithm. This will be a compromise between speed and randomness, and is recommended for applications with no special requirements. Currently this is randinit_mt().

Initialize the session random state for a Mersenne Twister algorithm. This algorithm is fast and has good randomness properties.

Initialize the session random state with a linear congruential algorithm X = (a⋅X + c)\mod2^e .

The low bits of X in this algorithm are not very random. The least significant bit will have a period no more than 2, and the second bit no more than 4, etc. For this reason only the high half of each X is actually used.

When a random number of more than e ⁄ 2 bits is to be generated, multiple iterations of the recurrence are used and the results concatenated.

Initialize the session random state for a linear congruential algorithm as per randinit_lc_2exp(). a, c and e are selected from a table, chosen so that size bits (or more) of each X will be used, ie. e ⁄ 2 ≥ s .

The function fails if s is bigger than the table data provides. The maximum size currently supported is 128.

Set an initial seed value into session random state.

The size of a seed determines how many different sequences of random numbers is possible to generate. The "quality" of the seed is the randomness of a given seed compared to the previous seed used, and this affects the randomness of separate number sequences. The method for choosing a seed is critical if the generated numbers are to be used for important applications, such as generating cryptographic keys.

Traditionally the system time has been used to seed, but care needs to be taken with this. If an application seeds often and the resolution of the system clock is low, then the same sequence of numbers might be repeated. Also, the system time is quite easy to guess, so if unpredictability is required then it should definitely not be the only source for the seed value. On some systems there's a special device /dev/random which provides random data better suited for use as a seed.

Generate a uniformly distributed random integer in the range 0 to 2ⁿ − 1 , inclusive.

The session state must be initialized by calling one of the !randinit() functions before invoking this function.

Generate a uniformly distributed random integer in the range 0 to n−1, inclusive.

The session state must be initialized by calling one of the !randinit() functions before invoking this function.

Generate a random integer with long strings of zeros and ones in the binary representation. Useful for testing functions and algorithms, since this kind of random numbers have proven to be more likely to trigger corner-case bugs. The random number will be in the range 0 to 2ⁿ − 1 , inclusive.

The session state must be initialized by calling one of the !randinit() functions before invoking this function.

Return the sum of z across all input values.

Return the product of z across all input values.

Return the maximum value of z across all input values.

Return the minimum value of z across all input values.

Return the bitwise and of z across all input values.

Return the bitwise inclusive-or of z across all input values.

Return the bitwise exclusive-or of z across all input values.