Search Results for ""

An ordinal number is called an initial ordinal if every smaller ordinal has a smaller cardinal number (Moore 1982, p. 248; Rubin 1967, p. 271). The omega_alphas ordinal ...

The representation, beloved of engineers and physicists, of a complex number in terms of a complex exponential x+iy=|z|e^(iphi), (1) where i (called j by engineers) is the ...

A prime which does not divide the class number h(p) of the cyclotomic field obtained by adjoining a primitive pth root of unity to the field of rationals. A prime p is ...

The twin composites may be defined by analogy with the twin primes as pairs of composite numbers (n,n+2). Since all even number are trivially twin composites, it is natural ...

Any nonzero rational number x can be represented by x=(p^ar)/s, (1) where p is a prime number, r and s are integers not divisible by p, and a is a unique integer. The p-adic ...

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

In determinant expansion by minors, the minimal number of transpositions of adjacent columns in a square matrix needed to turn the matrix representing a permutation of ...

An algorithm for multiplying two 32-bit integers modulo a 32-bit constant without using any intermediates larger than 32 bits. It is also useful in certain types of random ...

The Pell numbers are the numbers obtained by the U_ns in the Lucas sequence with P=2 and Q=-1. They correspond to the Pell polynomial P_n(x) and Fibonacci polynomial F_n(x) ...

A Dyck path is a staircase walk from (0,0) to (n,n) that lies strictly below (but may touch) the diagonal y=x. The number of Dyck paths of order n is given by the Catalan ...