ELECTRONICS >> Intel Microprocessors (Spanish only)

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. Written in JavaScript.
Generic Two integer variable equation solver: Diophantine equation ax^{2} + bxy + cy^{2} + dx + ey + f = 0 solver, where the unknowns x and y can be integer numbers only. Written in Java/JavaScript. Last updated on May 31st, 2001.
Quadratic modular equation solver: Calculator that can solve equations of the form ax^{2} + bx + c = 0 (mod n). Last updated: May 2nd, 2002.
Factorization using the Elliptic Curve Method: Applet that can be used to find 20 or 30digit factors of numbers or numerical expressions up to 10000 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. Last updated on December 20th, 2004.
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. Last updated on June 1st, 2002.
Discrete logarithm calculator: Applet that finds the exponent in the expression Base^{Exponent} = Power (mod Modulus). Last updated on March 30th, 2002.
Continued fraction calculator: This calculator can find the continued fraction expansions of rational numbers and quadratic irrationalities. Last updated on April 28th, 2002.
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. Last updated on November 27th, 2002.
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. Last updated on March 27th, 2005.
Polynomial factorization: This calculator can find the decomposition of a polynomial modulo a prime in a product of irreducible factors. Last updated on January 12th, 2005.
Big Number scientific calculator: This highprecision calculator features complex numbers, precision up to 1 million digits and exponents up to 1 billion.