Search Results for ""

If f is a function on an open set U, then the zero set of f is the set Z={z in U:f(z)=0}. A subset of a topological space X is called a zero set if it is equal to f^(-1)(0) ...

Convergents of the pi continued fractions are the simplest approximants to pi. The first few are given by 3, 22/7, 333/106, 355/113, 103993/33102, 104348/33215, ... (OEIS ...

A primitive root of a prime p is an integer g such that g (mod p) has multiplicative order p-1 (Ribenboim 1996, p. 22). More generally, if GCD(g,n)=1 (g and n are relatively ...

Zero is the integer denoted 0 that, when used as a counting number, means that no objects are present. It is the only integer (and, in fact, the only real number) that is ...

N_phi(m) is the number of integers n for which the totient function phi(n)=m, also called the multiplicity of m (Guy 1994). Erdős (1958) proved that if a multiplicity occurs ...

A theorem in set theory stating that, for all sets A and B, the following equivalences hold, A subset B<=>A intersection B=A<=>A union B=B.

A sentence is called a contradiction if its truth table contains only false entries.

The slicing of a three-dimensional object by a plane (or more general slice).

The problem of determining (or counting) the set of all solutions to a given problem.

A distribution of error such that the error remaining is always given approximately by the last term dropped.