Search Results for ""

A "law of large numbers" is one of several theorems expressing the idea that as the number of trials of a random process increases, the percentage difference between the ...

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

A prime magic square is a magic square consisting only of prime numbers (although the number 1 is sometimes allowed in such squares). The left square is the 3×3 prime magic ...

For every k>=1, let C_k be the set of composite numbers n>k such that if 1<a<n, GCD(a,n)=1 (where GCD is the greatest common divisor), then a^(n-k)=1 (mod n). Special cases ...

A composite number n is a positive integer n>1 which is not prime (i.e., which has factors other than 1 and itself). The first few composite numbers (sometimes called ...

A symbol used to distinguish one quantity x^' ("x prime") from another related x. Prime marks are most commonly used to denote 1. Transformed coordinates, 2. Conjugate ...

The term "square" can be used to mean either a square number ("x^2 is the square of x") or a geometric figure consisting of a convex quadrilateral with sides of equal length ...

A composite knot is a knot that is not a prime knot. Schubert (1949) showed that every knot can be uniquely decomposed (up to the order in which the decomposition is ...

An odd number is an integer of the form n=2k+1, where k is an integer. The odd numbers are therefore ..., -3, -1, 1, 3, 5, 7, ... (OEIS A005408), which are also the gnomonic ...

As proved by Sierpiński (1960), there exist infinitely many positive odd numbers k such that k·2^n+1 is composite for every n>=1. Numbers k with this property are called ...