MP(3X) MP(3X)
NAME
itom, madd, msub, mult, mdiv, min, mout, pow, gcd, rpow - multiple precision integer arithmetic
SYNOPSIS
typedef struct { int len; short *val; } mint;
madd(a, b, c)
msub(a, b, c)
mult(a, b, c)
mdiv(a, b, q, r)
min(a)
mout(a)
pow(a, b, m, c)
gcd(a, b, c)
rpow(a, b, c)
msqrt(a, b, r)
mint *a, *b, *c, *m, *q, *r;
sdiv(a, n, q, r)
mint *a, *q;
short *r;
mint *itom(n)
DESCRIPTION
These routines perform arithmetic on integers of arbitrary length. The integers are stored using the defined type mint. Pointers to a
mint should be initialized using the function itom, which sets the initial value to n. After that space is managed automatically by the
routines.
madd, msub, mult, assign to their third arguments the sum, difference, and product, respectively, of their first two arguments. mdiv
assigns the quotient and remainder, respectively, to its third and fourth arguments. sdiv is like mdiv except that the divisor is an ordi-
nary integer. msqrt produces the square root and remainder of its first argument. rpow calculates a raised to the power b, while pow cal-
culates this reduced modulo m. min andmout do decimal input and output.
The functions are obtained with the loader option -lmp.
DIAGNOSTICS
Illegal operations and running out of memory produce messages and core images.
MP(3X)
Check Out this Related Man Page
MP(3X) MP(3X)
NAME
madd, msub, mult, mdiv, pow, gcd, invert, rpow, msqrt, mcmp, move, min, omin, fmin, m_in, mout, omout, fmout, m_out, sdiv, itom - multiple
precision integer arithmetic
SYNOPSIS
#include <mp.h>
#include <stdio.h>
typedef struct mint { int len; short *val; } MINT;
madd(a, b, c)
msub(a, b, c)
mult(a, b, c)
mdiv(a, b, q, r)
pow(a, b, m, c)
gcd(a, b, c)
invert(a, b, c)
rpow(a, n, c)
msqrt(a, b, r)
mcmp(a, b)
move(a, b)
min(a)
omin(a)
fmin(a, f)
m_in(a, n, f)
mout(a)
omout(a)
fmout(a, f)
m_out(a, n, f)
MINT *a, *b, *c, *m, *q, *r;
FILE *f;
int n;
sdiv(a, n, q, r)
MINT *a, *q;
short n;
short *r;
MINT *itom(n)
DESCRIPTION
These routines perform arithmetic on integers of arbitrary length. The integers are stored using the defined type MINT. Pointers to a
MINT can be initialized using the function itom which sets the initial value to n. After that, space is managed automatically by the rou-
tines.
madd, msub and mult assign to c the sum, difference and product, respectively, of a and b. mdiv assigns to q and r the quotient and
remainder obtained from dividing a by b. sdiv is like mdiv except that the divisor is a short integer n and the remainder is placed in a
short whose address is given as r. msqrt produces the integer square root of a in b and places the remainder in r. rpow calculates in c
the value of a raised to the (``regular'' integral) power n, while pow calculates this with a full multiple precision exponent b and the
result is reduced modulo m. gcd returns the greatest common denominator of a and b in c, and invert computes c such that a*c mod b = 1,
for a and b relatively prime. mcmp returns a negative, zero or positive integer value when a is less than, equal to or greater than b,
respectively. move copies a to b. min and mout do decimal input and output while omin and omout do octal input and output. More gener-
ally, fmin and fmout do decimal input and output using file f, and m_in and m_out do I/O with arbitrary radix n. On input, records should
have the form of strings of digits terminated by a newline; output records have a similar form.
Programs which use the multiple-precision arithmetic library must be loaded using the loader flag -lmp.
FILES
/usr/include/mp.h include file
/usr/lib/libmp.a object code library
SEE ALSO
dc(1), bc(1)
DIAGNOSTICS
Illegal operations and running out of memory produce messages and core images.
BUGS
Bases for input and output should be <= 10.
dc(1) and bc(1) don't use this library.
The input and output routines are a crock.
pow is also the name of a standard math library routine.
4.3 Berkeley Distribution June 4, 1986 MP(3X)