(mathematics, number theory) A branch of number theory in which suitable ideas and techniques from analytic number theory are generalised and applied to a variety of mathematical fields.

Synonym of computational number theory.

(mathematics, number theory) A branch of number theory that uses methods from mathematical analysis to solve problems about the integers.

The mathematics of numbers (integers, rational numbers, real numbers, or complex numbers) under the operations of addition, subtraction, multiplication, and division.

(mathematics) A field of mathematics in the intersection of number theory, combinatorics, ergodic theory and harmonic analysis.

A form of numerology that equates letters or words with numbers.

(mathematics) Any of several methods for describing and analyzing the behaviour of a system at its limits

(set theory) The axiom that the power set of any set exists and is a valid set, which appears in the standard axiomatisation of set theory, ZFC.

(mathematics, uncountable) The act or process of calculating.

(mathematics) causal set

(set theory) A collection of sets definable by a shared property.

(mathematics) a branch of mathematics that studies (usually finite) collections of objects that satisfy specified criteria

(set theory) A set that is countable.

(set theory) A type of set of natural numbers, related to mathematical logic.

(set theory) Having the properties of a directed set.

(set theory) An ideal.

(arithmetic) The result of multiplying no numbers, conventionally defined to equal one.

(number theory) An abundant number.

(mathematics) Related to finitism

(mathematics, economics) Of, relating to, or defined in terms of game theory.

(mathematics) In the sense of graph theory

(mathematics, chiefly dated) Number theory; the branch of pure mathematics concerned primarily with integers and integer-valued functions.

(mathematics) Any power series such that the ratio of the (k+1)-th and the k-th terms is a rational function of the natural integer k.

(uncountable, Canada, US, Philippines) Arithmetic calculations; (see do the math).

(mathematics) Any game featuring arithmetic or other branches of mathematics; a branch of recreational mathematics

(set theory) An element of a set.

(mathematics) For a given number n, the number of different ways of drawing non-intersecting chords between n points on a circle (not necessarily touching every point by a chord). They have diverse applications in geometry, combinatorics, and number theory.

(mathematics, computer science) The set of non-negative integers, {0, 1, 2, 3, ...}.

Alternative form of new math [(US, education, historical) A dramatic and short-lived change in the teaching of mathematics in grade schools in the 1960s, focusing on abstract topics such as symbolic logic, to the detriment of simple arithmetic etc.]

(obsolete, derogatory) One who believed in the mathematical theory of infinite divisibility, and hence dealt with immeasurably small quantities.

(mathematics) Of an element of a partially ordered ring, either positive or zero; not negative; greater than or equal to zero.

(computing theory) A problem H is NP-hard if and only if there is an NP-complete problem L that is polynomial time Turing-reducible to H.

(mathematics) Of the null set.

(mathematics) A mathematician who specializes in number theory

(mathematics) The branch of pure mathematics concerned with the properties of integers.

(mathematics) Of or relating to number theory.

(mathematics) By means of, or in terms of, number theory.

(mathematics) Any number, proper or improper fraction, or incommensurable ratio.

(mathematics) The study of algorithms to solve mathematical problems concerning continuous sets of values (such as the real numbers, complex numbers or vector spaces).

(mathematics) A branch of functional analysis, being the study of linear operators on function spaces.

(set theory) An object containing exactly two elements in a fixed order, so that, when the elements are different, exchanging them gives a different object. Notation: (a, b) or ⟨a,b⟩.

(computing theory) Describing any problem in the complexity class P to which there exists a polynomial time mapping from any other problem in P.

(set theory, order theory, loosely) A set that has a given, elsewhere specified partial order.

A mathematical formalism for describing knowledge of the world in terms of patterns that can be studied using statistical methods.

(set theory, order theory) A partially ordered set.

(computing theory) The operator 𝜌, that creates a new function from two functions g, and h, such that:

(set theory) A type of set of natural numbers, related to mathematical logic.

(set theory) a set that is a subset of the set, but not equal to it.

(mathematics) The study of the behaviour of queues, and of stochastic processes modelled on them.

(mathematics) Having a basis in ranges

(mathematics) Any use of mathematics or logic whose primary purpose is recreation, though often with more serious characteristics.

(set theory) An axiomatic set theory, developed by logician George Boolos, in which several of the axioms of ZF are derivable as theorems.

(set theory) A type of set of natural numbers, related to mathematical logic.

(in plural, “sets”, mathematics, informal) Set theory.

(set theory) A mathematical operation that returns a set taking one or more sets as input.

(mathematics) In the sense of set theory

(mathematics) Of, relating to or using set theory.

(set theory, of two sets A and B) The set that contains exactly those elements belonging to A but not to B; the relative complement of B in A.

(mathematics) Any function in which each point in the domain maps to just one point in the range

(set theory, order theory) Irreflexive; if the described object is defined to be reflexive, that condition is overridden and replaced with irreflexive.

(set theory) (symbol: ⊇) With respect to another set, a set such that each of the elements of the other set is also an element of the set.

(set theory, order theory) That is equipped with a total order, that is a subset of (the ground set of) a partially ordered set whose partial order is a total order with respect to said subset.

(set theory) A set having a specified total order.

(set theory) Any set X such that for any x ∈ X, if y ∈ x then y ∈ X; equivalently, such that if x ∈ X and x is not an urelement then x ⊆ X.

(mathematics, logic) A set of all true values

(set theory) A set large enough to contain all sets under consideration in the current context.

(set theory) A diagram representing some sets by contours of closed shapes, such as circles or ellipses (and sometimes also the universal set as a rectangle enclosing all of these shapes), and indicating the relationships between the sets: by overlapping the shapes to show that the corresponding sets have a non-empty intersection, and by possibly (but not necessarily) enclosing all of the sets (which are proper subsets of the universal set) within a universal set (represented typically by a rectangle); such that the total number of simply connected regions is 2ⁿ, where n is the number of depicted sets which are proper subsets of the universal set.

(set theory, order theory) A total order of some set such that every nonempty subset contains a least element.

(set theory) An early and influential axiomatisation of set theory.

(mathematics) An axiomatic system that was proposed in the early 20th century in order to formulate a theory of sets free from paradoxes such as Russell's paradox, and became the standard form of axiomatic set theory.

(set theory) Initialism of Zermelo-Fraenkel (set theory): a particular axiomatic formulation of set theory without the axiom of choice.