Search Results for ""

The Pierce expansion, or alternated Egyptian product, of a real number 0<x<1 is the unique increasing sequence {a_1,a_2,...} of positive integers a_i such that ...

A figurate number which is given by Ptop_n=1/4Te_n(n+3)=1/(24)n(n+1)(n+2)(n+3), where Te_n is the nth tetrahedral number. The first few pentatope numbers are 1, 5, 15, 35, ...

A Carmichael number is an odd composite number n which satisfies Fermat's little theorem a^(n-1)-1=0 (mod n) (1) for every choice of a satisfying (a,n)=1 (i.e., a and n are ...

omega^epsilon=epsilon, where omega is an ordinal number and epsilon is an inaccessible cardinal.

Any prime number other than 2 (which is the unique even prime). Humorously, 2 is therefore the "oddest" prime.

Subtraction is the operation of taking the difference d=x-y of two numbers x and y. Here, x is called the minuend, y is called the subtrahend, and the symbol between the x ...

If there is an integer 0<x<p such that x^2=q (mod p), (1) i.e., the congruence (1) has a solution, then q is said to be a quadratic residue (mod p). Note that the trivial ...

A number which can be computed to any number of digits desired by a Turing machine. Surprisingly, most irrationals are not computable numbers!

The Fermat number F_n is prime iff 3^(2^(2^n-1))=-1 (mod F_n).

alpha is called a predecessor if there is no ordinal number beta such that beta+1=alpha.