| Note that there are linear algebra and numerical analysis programs below. More linear algebra and numerical analysis programs will be added as soon as possible. |
|
|
|
(Finds the quotient and the remainder when polyonmial a(x) is divided by polynomial b(x). Warning: Enter the variables the way you'll be asked to. Notice that the exponents must be nonnegative integers. Also, you have to combine like terms of each polynomial.)
|
|
(Finds the greatest common divisor of a and b and writes it as a linear combination of a and b. It also finds$ least common multiple of a and b. Warning: Enter the variables the way you'll be asked to. Both a and b must be nonzero integers.) |
|
(Solves the linear congruence system: a x + b y = u (mod n) c x + d y = v (mod n) Warning: Enter the variables the way you'll be asked to. Notice that n must be a natural number and a, b, c, d, u, and v must be integers.) |
|
(Solves the linear congruence equation: a x = b (mod n) Warning: Enter the variables the way you'll be asked to. Notice that n must be a natural number and both a and b must be integers.) |
|
(Solves the quadratic congruence equation: a x2 + b x + c = 0 (mod n) Warning: Enter the variables the way you'll be asked. Notice that n must be a natural number and a, b, and c must be integers.) |
|
(Finds the quotient and the remainder when a is divided by b. Warning: Enter the variables the way you'll be asked to. Notice that both and b must be nonzero integers.) |
|
(Finds whether a natural number n is prime or not. If not, then it returns the number of nontrivial positive divisors of n. Trivial positive divisors are 1 and n. Warning: Enter the variables the way you'll be asked to. Notice that n must be a natural number greater than 4.) |
|
(Finds whether two nonzero integers a and b are relatively prime. If yes, then it write 1 as a linear comination of them. Trivial positive divisors are 1 and n. Warning: Enter the variables the way you'll be asked to. Notice that both and b must be nonzero integers.) |
|
Converts a decimal number to binary/octal/hexadecimal and a binary/octal/hexadecimal number to decimal. |
|
|
|
|
|
|
|
This program finds the Lagrange polynomial interpolation of a set of points.
|
|
This program finds the Newton polynomial interpolation of a set of points.
|
|
This program finds the natural cubic splines interpolation of a set of points.
|
|
This program finds the clamped cubic splines interpolation of a set of points.
|
|
This program finds the LU factorization (LU decomposition) of a positive definite matrix.
|
|
This program finds the Cholesky factorization of a positive definite matrix.
|
|
This program solves a linear system of the form A x = b by the Jacobi method.
|
|
This program solves a linear system of the form A x = b by the Gauss-Seidel method.
|