Search Results for ""

An additive group is a group where the operation is called addition and is denoted +. In an additive group, the identity element is called zero, and the inverse of the ...

Let B_k be the kth Bernoulli number and consider nB_(n-1)=-1 (mod n), where the residues of fractions are taken in the usual way so as to yield integers, for which the ...

In most computer programs and computing environments, the precision of any calculation (even including addition) is limited by the word size of the computer, that is, by ...

Define a Bouniakowsky polynomial as an irreducible polynomial f(x) with integer coefficients, degree >1, and GCD(f(1),f(2),...)=1. The Bouniakowsky conjecture states that ...

Let f:M|->N be a map between two compact, connected, oriented n-dimensional manifolds without boundary. Then f induces a homomorphism f_* from the homology groups H_n(M) to ...

The Cantor function F(x) is the continuous but not absolutely continuous function on [0,1] which may be defined as follows. First, express x in ternary. If the resulting ...

There are two definitions of the Carmichael function. One is the reduced totient function (also called the least universal exponent function), defined as the smallest integer ...

A Chen prime is a prime number p for which p+2 is either a prime or semiprime. Chen primes are named after Jing Run Chen who proved in 1966 that there are infinitely many ...

The Chu-Vandermonde identity _2F_1(-n,b;c;1)=((c-b)_n)/((c)_n) (1) (for n in Z^+) is a special case of Gauss's hypergeometric theorem _2F_1(a,b;c;1) = ((c-b)_(-a))/((c)_(-a)) ...

Determining the maximum number of pieces in which it is possible to divide a circle for a given number of cuts is called the circle cutting or pancake cutting problem. The ...