Search Results for ""

A method used by Gauss to solve the quadratic Diophantine equation of the form mx^2+ny^2=A (Dickson 2005, pp. 391 and 407).

The minimal residue of a (mod m) is the value b or b-m, whichever is smaller in absolute value, where a=b (mod m). If m=2b (so that b=|b-m|), then the minimal residue is ...

A mixed fraction is an improper fraction p/q>1 written in the form n+r/s. In common usage such as cooking recipes, n+r/s is often written as n r/s (e.g., 1 1/2), much to the ...

A multiplicand is a quantity that is multiplied by another (the multiplier). For example, in the expression a×b, b is the multiplicand. The result of the multiplication of ...

A quantity by which another (the multiplicand) is multiplied. For example, in the expression a×b, a is the multiplier. The result of the multiplication of two or more ...

The British word for "zero." It is often used to indicate 0 subscripts, so a_0 would be spoken as "a naught."

A negative integer is one of the integers ..., -4, -3, -2, -1 obtained by negating the positive integers. The negative integers are commonly denoted Z^-.

If m is an integer, then for every residue class r (mod m), there are infinitely many nonnegative integers n for which P(n)=r (mod m), where P(n) is the partition function P.

A quantity which is either 0 (zero) or negative, i.e., <=0.

A constant appearing in formulas for the efficiency of the Euclidean algorithm, B = (12ln2)/(pi^2)[-1/2+6/(pi^2)zeta^'(2)]+C-1/2 (1) = 0.06535142... (2) (OEIS A143304), where ...