Search Results for ""

A predictor-corrector method for solution of ordinary differential equations. The third-order equations for predictor and corrector are y_(n+1) = ...

A congruence of the form f(x)=g(x) (mod n), where f(x) and g(x) are both integer polynomials. Functional congruences are sometimes also called "identical congruences" (Nagell ...

A congruence that has a solution.

The second part of Pollard rho factorization method concerns detection of the fact that a sequence has become periodic. Pollard's original suggestion was to use the idea ...

Caesar's method is an encryption scheme involving shifting an alphabet (so a->c, b->d, c->e, d->f, etc., x->z,y->a,z->b). It is one of the most basic encryption methods, and ...

A method for computing the prime counting function. Define the function T_k(x,a)=(-1)^(beta_0+beta_1+...+beta_(a-1))|_x/(p_1^(beta_0)p_2^(beta_1)...p_a^(beta_(a-1)))_|, (1) ...

Wynn's epsilon-method is a method for numerical evaluation of sums and products that samples a number of additional terms in the series and then tries to extrapolate them by ...

Also known as the difference of squares method. It was first used by Fermat and improved by Gauss. Gauss looked for integers x and y satisfying y^2=x^2-N (mod E) for various ...

Two families of equations used to find roots of nonlinear functions of a single variable. The "B" family is more robust and can be used in the neighborhood of degenerate ...

A method for numerical solution of a second-order ordinary differential equation y^('')=f(x,y) first expounded by Gauss. It proceeds by introducing a function delta^(-2)f ...