(mathematical analysis) Any function that is defined for all positive integers, and has values that are either real or complex.

(mathematical analysis) A sequence in which each term except the first is obtained from the previous by adding a constant value, known as the common difference of the arithmetic progression.

(arithmetic) A device and technique described in Napier's treatise Rabdologiæ for performing multiplication, division and extraction of square roots by using counters to represent numbers in binary.

(mathematical analysis, computing) A model for self-validated numerical analysis in which quantities are represented as affine combinations (called affine forms) of certain primitive variables that stand for sources of uncertainty in data or approximations made during computations.

(arithmetic) Arithmetic using decimal numbers.

(arithmetic) arithmetic using binary numbers

(arithmetic, computing) Any one of the four basic operations in arithmetic: addition, subtraction, multiplication or division; any one of said operations as implemented on a computer.

Synonym of felicific calculus

(logic) A set of axioms of first-order logic for the natural numbers specifying the operations of zero, successor, and addition, including a first-order schema of induction, without multiplication.

(logic) A set of axioms of first-order logic for the natural numbers specifying the operations of zero, successor, addition and multiplication, including a first-order schema of induction.