Search Results for ""

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.

A quasiperfect number, called a "slightly excessive number" by Singh (1997), is a "least" abundant number, i.e., one such that sigma(n)=2n+1. Quasiperfect numbers are ...

A Z-number is a real number xi such that 0<=frac[(3/2)^kxi]<1/2 for all k=1, 2, ..., where frac(x) is the fractional part of x. Mahler (1968) showed that there is at most one ...

There exist infinitely many odd integers k such that k·2^n-1 is composite for every n>=1. Numbers k with this property are called Riesel numbers, while analogous numbers with ...

Q(n), also denoted q(n) (Abramowitz and Stegun 1972, p. 825), gives the number of ways of writing the integer n as a sum of positive integers without regard to order with the ...