Search Results for ""

A beautiful general theorem of which the following two statements are special cases (Coxeter and Greitzer 1967, pp. 99-100). 1. If DeltaABC and DeltaA^'B^'C^' are two ...

A planar hypotraceable graph is a hypotraceable graph that is also planar. A number of planar hypotraceable graphs are illustrated above. Using a theorem of Thomassen (1974), ...

If del xF=0 (i.e., F(x) is an irrotational field) in a simply connected neighborhood U(x) of a point x, then in this neighborhood, F is the gradient of a scalar field phi(x), ...

The low-level language of topology, which is not really considered a separate "branch" of topology. Point-set topology, also called set-theoretic topology or general ...

A root of a polynomial P(z) is a number z_i such that P(z_i)=0. The fundamental theorem of algebra states that a polynomial P(z) of degree n has n roots, some of which may be ...

If a cyclic quadrilateral ABCD is inscribed in a circle c_1 of a coaxal system such that one pair AC of connectors touches another circle c_2 of the system at P, then each ...

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

The prime number theorem gives an asymptotic form for the prime counting function pi(n), which counts the number of primes less than some integer n. Legendre (1808) suggested ...

A number satisfying Fermat's little theorem (or some other primality test) for some nontrivial base. A probable prime which is shown to be composite is called a pseudoprime ...

A Proth number that is prime, i.e., a number of the form N=k·2^n+1 for odd k, n a positive integer, and 2^n>k. Factors of Fermat numbers are of this form as long as they ...