Search Results for ""

The Sendov conjecture, proposed by Blagovest Sendov circa 1958, that for a polynomial f(z)=(z-r_1)(z-r_2)...(z-r_n) with n>=2 and each root r_k located inside the closed unit ...

A q-analog of Gauss's theorem due to Jacobi and Heine, _2phi_1(a,b;c;q,c/(ab))=((c/a;q)_infty(c/b;q)_infty)/((c;q)_infty(c/(ab);q)_infty) (1) for |c/(ab)|<1 (Gordon and ...

Every odd integer n is a prime or the sum of three primes. This problem is closely related to Vinogradov's theorem.

The elliptic curve factorization method, abbreviated ECM and sometimes also called the Lenstra elliptic curve method, is a factorization algorithm that computes a large ...

If the first case of Fermat's last theorem is false for the prime exponent p, then 3^(p-1)=1 (mod p^2).

A specific type of ultraproduct that can be used to construct nonstandard universes and obtain the transfer principle as a corollary of Łoś' theorem for ultraproducts.

The Pratt certificate is a primality certificate based on Fermat's little theorem converse. Prior to the work of Pratt (1975), the Lucas-Lehmer test had been regarded purely ...

(dy)/(dx)+p(x)y=q(x)y^n. (1) Let v=y^(1-n) for n!=1. Then (dv)/(dx)=(1-n)y^(-n)(dy)/(dx). (2) Rewriting (1) gives y^(-n)(dy)/(dx) = q(x)-p(x)y^(1-n) (3) = q(x)-vp(x). (4) ...

The qubit |psi>=a|0>+b|1> can be represented as a point (theta,phi) on a unit sphere called the Bloch sphere. Define the angles theta and phi by letting a=cos(theta/2) and ...

Given a factor a of a number n=ab, the cofactor of a is b=n/a. A different type of cofactor, sometimes called a cofactor matrix, is a signed version of a minor M_(ij) defined ...