Search Results for ""

A sequence of n 0s and 1s is called an odd sequence if each of the n sums sum_(i=1)^(n-k)a_ia_(i+k) for k=0, 1, ..., n-1 is odd.

A set of residues {a_1,a_2,...,a_(k+1)} (mod n) such that every nonzero residue can be uniquely expressed in the form a_i-a_j. Examples include {1,2,4} (mod 7) and {1,2,5,7} ...

A^*(x)=sum_(lambda_n<=x)^'a_n=1/(2pii)int_(c-iinfty)^(c+iinfty)f(s)(e^(sx))/sds, where f(s)=suma_ne^(-lambda_ns).

An integer which is expressible in more than one way in the form x^2+Dy^2 or x^2-Dy^2 where x^2 is relatively prime to Dy^2. If the integer is expressible in only one way, it ...

1 and -1 are the only integers which divide every integer. They are therefore called the prime units.

The notation Q^_ denotes the algebraic closure of the rational numbers Q. This is equivalent to the set of algebraic numbers, sometimes denoted A.

The positive rational numbers, denoted Q^+.

The doublestruck letter R denotes the field of real numbers.

Any system of phi(n) integers, where phi(n) is the totient function, representing all the residue classes relatively prime to n is called a reduced residue system (Nagell ...

The transformation T(x) = frac(1/x) (1) = 1/x-|_1/x_|, (2) where frac(x) is the fractional part of x and |_x_| is the floor function, that takes a continued fraction ...