Search Results for ""

A Størmer number is a positive integer n for which the greatest prime factor p of n^2+1 is at least 2n. Every Gregory number t_x can be expressed uniquely as a sum of t_ns ...

The successive overrelaxation method (SOR) is a method of solving a linear system of equations Ax=b derived by extrapolating the Gauss-Seidel method. This extrapolation takes ...

The totient function phi(n), also called Euler's totient function, is defined as the number of positive integers <=n that are relatively prime to (i.e., do not contain any ...

The word weight has many uses in mathematics. It can refer to a function w(x) (also called a weighting function or weighting function) used to normalize orthogonal functions. ...

A Woodall number is a number of the form W_n=2^nn-1. Woodall numbers are therefore similar to Mersenne numbers 2^n-1 but with an additional factor of n multiplying the power ...

Computational number theory is the branch of number theory concerned with finding and implementing efficient computer algorithms for solving various problems in number ...

Given a number n, Fermat's factorization methods look for integers x and y such that n=x^2-y^2. Then n=(x-y)(x+y) (1) and n is factored. A modified form of this observation ...

The determination of a set of factors (divisors) of a given integer ("prime factorization"), polynomial ("polynomial factorization"), etc., which, when multiplied together, ...

The number of elements in a group G, denoted |G|. If the order of a group is a finite number, the group is said to be a finite group. The order of an element g of a finite ...

Many algorithms have been devised for determining the prime factors of a given number (a process called prime factorization). They vary quite a bit in sophistication and ...