Search Results for ""

A congruence of the form ax^2+bx+c=0 (mod m), (1) where a, b, and c are integers. A general quadratic congruence can be reduced to the congruence x^2=q (mod p) (2) and can be ...

The quantity ps-rq obtained by letting x = pX+qY (1) y = rX+sY (2) in ax^2+2bxy+cy^2 (3) so that A = ap^2+2bpr+cr^2 (4) B = apq+b(ps+qr)+crs (5) C = aq^2+2bqs+cs^2 (6) and ...

The set of projective projectively extended real numbers. Unfortunately, the notation is not standardized, so the set of affinely extended real numbers, denoted here R^_, is ...

The two-argument Ramanujan function is defined by phi(a,n) = 1+2sum_(k=1)^(n)1/((ak)^3-ak) (1) = 1-1/a(H_(-1/a)+H_(1/a)+2H_n-H_(n-1/a)-H_(n+1/a)). (2) The one-argument ...

"The reals" is a common way of referring to the set of real numbers and is commonly denoted R.

The sum of reciprocal multifactorials can be given in closed form by the beautiful formula m(n) = sum_(n=0)^(infty)1/(n!...!_()_(k)) (1) = ...

A fraction a/b written in lowest terms, i.e., by dividing numerator and denominator through by their greatest common divisor (a,b). For example, 2/3 is the reduced fraction ...

A reducible fraction is a fraction p/q such that GCD(p,q)>1, i.e., p/q can be written in reduced form. A fraction that is not reducible is said to be irreducible. For ...

An extension to the Berlekamp-Massey algorithm which applies when the terms of the sequences are integers modulo some given modulus m.

An algorithm for computing an Egyptian fraction.