The calculators in this site are:
Complex number calculator: Reverse Polish Notation calculator capable of performing all basic operations, powers, roots, logarithms, trigonometric functions, hyperbolic functions, gamma and polygamma functions.
Generic Two integer variable equation solver: Diophantine equation ax2 + bxy + cy2 + dx + ey + f = 0 solver, where the unknowns x and y can be integer numbers only.
Quadratic modular equation solver: Calculator that can solve equations of the form ax2 + bx + c = 0 (mod n).
Factorization using the Elliptic Curve Method: Applet that can be used to find 20- or 30-digit factors of numbers or numerical expressions up to 100000 digits long. It also computes the number and sum of divisors, Euler's totient and Moebius, and its decomposition as a sum of up to 4 perfect squares.
Gaussian Integer Factorization applet: Finds the factors of complex numbers of the form a+bi where a and b are integers. It also includes a complete calculator with operators and functions using gaussian integers.
Discrete logarithm calculator: Applet that finds the exponent in the expression BaseExponent = Power (mod Modulus).
Continued fraction calculator: This calculator can find the continued fraction expansions of rational numbers and quadratic irrationalities.
Sum of squares: This calculator can find the decomposition of a number or numerical expression in a sum of up to four squares. It does not need its prime factorization.
Sum of four cubes: This calculator can find the decomposition of a number or numerical expression that is not congruent to 4 or 5 (mod 9) in a sum of four cubes.
Polynomial factorization: This calculator can find the decomposition of an integer polynomial or a polynomial modulo a prime in a product of irreducible factors. In the first case it also shows the exact roots using radical expressions.