Search Results for ""

A system of congruences a_i mod n_i with 1<=i<=k is called a complete residue system (or covering system) if every integer y satisfies y=a_i (mod n) for at least one value of ...

The field of reals is the set of real numbers, which form a field. This field is commonly denoted R (doublestruck R).

Almost all natural numbers are very, very, very large (Steinbach 1990, p. 111).

A congruence of the form f(x)=g(x) (mod n), where f(x) and g(x) are both integer polynomials. Functional congruences are sometimes also called "identical congruences" (Nagell ...

The Machin-like formula 1/4pi=2cot^(-1)(2)-cot^(-1)(7). The other 2-term Machin-like formulas are Euler's Machin-like formula, Hutton's formula, and Machin's formula.

Two numbers are homogeneous if they have identical prime factors. An example of a homogeneous pair is (6, 72), both of which share prime factors 2 and 3: 6 = 2·3 (1) 72 = ...

The Machin-like formula 1/4pi=2cot^(-1)(3)+cot^(-1)(7). The other two-term Machin-like formulas are Euler's Machin-like formula, Hermann's formula, and Machin's formula.

A fraction p/q>=1. A fraction with p/q<1 is called a proper fraction. Therefore, the special cases 1/1, 2/2, 3/3, etc. are generally considered to be improper.

n divides a^n-a for all integers a iff n is squarefree and (p-1)|(n-1) for all prime divisors p of n. Carmichael numbers satisfy this criterion.

The continued fraction ((x+1)^n-(x-1)^n)/((x+1)^n+(x-1)^n)=n/(x+)(n^2-1)/(3x+)(n^2-2^2)/(5x+...).