Search Results for ""

A method which can be used to solve any quadratic congruence equation. This technique relies on the fact that solving x^2=b (mod p) is equivalent to finding a value y such ...

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 ...

Let p_i denote the ith prime, and write m=product_(i)p_i^(v_i). Then the exponent vector is v(m)=(v_1,v_2,...).

An exponential generating function for the integer sequence a_0, a_1, ... is a function E(x) such that E(x) = sum_(k=0)^(infty)a_k(x^k)/(k!) (1) = ...

A binary tree in which special nodes are added wherever a null subtree was present in the original tree so that each node in the original tree (except the root node) has ...

The extended greatest common divisor of two integers m and n can be defined as the greatest common divisor GCD(m,n) of m and n which also satisfies the constraint ...

The first quadratic nonresidue mod p of a number is always less than 3(lnp)^2/2 (Wedeniwski 2001).

The degree (or relative degree, or index) of an extension field K/F, denoted [K:F], is the dimension of K as a vector space over F, i.e., [K:F]=dim_FK. If [K:F] is finite, ...

The primes with Legendre symbol (n/p)=1 (less than N=pi(d) for trial divisor d) which need be considered when using the quadratic sieve factorization method.

A game which is not biased toward any player. A game in which a given player can always win by playing correctly is therefore called an unfair game.