n
(set theory) Any of a sequence of numbers used to represent the cardinality of infinite sets, denoted by the Hebrew letter aleph.
n
(set theory) The first of the transfinite cardinal numbers; corresponds to the number of natural numbers.
n
(uncountable, mathematics) The study of algebraic structures.
n
Abbreviation of algorithm. [(countable) A collection of ordered steps that solve a mathematical problem. A precise step-by-step plan for a computational procedure that possibly begins with an input value and yields an output value in a finite number of steps.]
n
Obsolete spelling of algorithm (all senses) [(countable) A collection of ordered steps that solve a mathematical problem. A precise step-by-step plan for a computational procedure that possibly begins with an input value and yields an output value in a finite number of steps.]
n
(mathematics, dated) An integer that is less than another, but that does not divide the other integer into integral parts.
n
(mathematical analysis) Any function that is defined for all positive integers, and has values that are either real or complex.
n
(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.
n
(arithmetic) Any of the four basic operators in arithmetic, namely addition, subtraction, multiplication and division.
n
(mathematics) A mean of two numbers which is the common limit of a pair of sequences, whose terms are defined by taking the arithmetic and geometric means of the previous pair of terms.
n
(mathematics) The minimum dimension in which a graph may be represented as a specific intersection of boxes
n
(computing) A search procedure which involves generating and checking all possible scenarios.
n
(mathematics, obsolete) A fraction.
n
(mathematics, computing theory) The mathematical function that maps each positive integer n to the number of steps required for the busy beaver among machines with two colors and n states to terminate.
n
(set theory, of a set) The number of elements a given set contains.
n
(mathematics) The smallest integer greater than or equal to a given number.
n
(mathematics, education) The partial-quotients method for solving simple division problems by repeated subtraction.
n
(mathematics) Any of several Peano arithmetics based on computability logic.
n
(mathematics) The branch of mathematics dealing with the art of transmitting messages reliably over a noisy channel by adding redundancy to the message.
n
(arithmetic) A fraction in the form of one integer divided by another, non-zero, integer.
n
(mathematics) The ratio of each term of a geometric progression to the term preceding it.
n
(mathematics, number theory) The field of study dealing with computational methods for investigating and solving problems in number theory and arithmetic geometry.
n
(mathematics) The equivalent of multiplication in a coalgebra.
n
(computing) A function which maps a tuple of sequences into a sequence of tuples.
n
(mathematics) a covariant of a cubic form
n
(mathematics) A certain syntax for terms in the lambda calculus.
n
(mathematics) The creation of a new sequence comprising only every nth element of a source sequence.
n
(arithmetic) The number or expression written below the line in a fraction (such as 2 in ½).
n
(mathematics, of a positive integer) The sum of all digits.
n
(mathematics) The single digit obtained from a number by repetitive digitaddition
n
(algebra, set theory) A set equipped with a preorder such that for any two elements a and b there is an element c such that a ≤ c and b ≤ c.
n
(mathematics, computing) A function, implemented in many programming languages, that returns the result of a division of two integers.
n
An integer that divides another integer an integral number of times.
adj
(mathematics) Related to a divisor
n
(mathematics) A historic form of multiplication based on doubling
n
(arithmetic) The result of adding no numbers, conventionally defined to equal zero.
n
(obsolete, mathematics) The ratio equal to an integer divided by one more or less than that integer (e.g. 4/5 or 5/4)
n
(mathematics, now chiefly historical) The extraction of a root from a given power.
n
A representation of a number in terms of powers of a base, such as the representation of 1234 as 4⨯16²+13⨯16+2⨯16⁰ or the representation of 2345 as 2000+300+40+5.
n
(mathematics, obsolete) The degree to which the root of a radicand is found, for example, the 2 in ^(2])√=b.
n
(mathematics) An arrangement of symbols denoting values, operations performed on them, and grouping symbols.
n
(in combination) A fraction whose (integer) denominator ends in the digit 1.
adj
(computing) Pertaining to fixed point representations or operations.
adj
(computing) Of the internal representation of such a number as a pair of integers.
n
A number written in the form a × bᶜ, e.g. 3.75 × 10³ (a being the mantissa, b, the base and c, the exponent).
n
(attributive, programming) Method of Four Russians: a technique for speeding up certain matrix operations by partitioning the matrix into smaller blocks associated with lookup tables
n
(arithmetic) A ratio of two numbers, the numerator and the denominator, usually written one above the other and separated by a horizontal bar.
adj
(computing theory) Having semantics defined purely in terms of mathematical functions, without side-effects.
n
(mathematics) The Gamma function, symbolized by Γ.
n
(number theory) The subbranch of number theory which applies techniques from geometry to the study of algebraic numbers.
adv
(mathematics) In a manner which uses graph theory
n
(mathematics) The symbol “∎” marking the end of a proof.
n
(mathematics) A raised suffix indicating a power.
n
(mathematics) A branch of applied mathematics and engineering involving the quantification of information sent over a communication channel, disregarding the meaning of the sent messages, exemplified by the noisy-channel coding theorem.
adj
(computing theory) Of a tree traversal, recursively visiting the root in between the left and right subtrees.
adj
(mathematics) Of or pertaining to k-adic notation or the k-adic numbers.
n
(logic, computing theory) The asterisk, *, used as an operator to concatenate zero or more strings from a given set, widely used in regular expressions.
n
(mathematics) A binary function, written as δ with two subscripts, which evaluates to 1 when its arguments are equal, and 0 otherwise.
n
(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.
n
(mathematics) A procedure for dividing multidigit numbers, breaking down the division into a series of easier steps.
n
(computing) An upper bound on the relative approximation error due to rounding in floating-point arithmetic, denoted by the symbol ε.
n
Pronunciation spelling of math. [(uncountable, Canada, US, Philippines) Arithmetic calculations; (see do the math).]
n
A person's ability to count, calculate, and use different systems of mathematics at differing levels.
n
(computing theory) A heap data structure with a "less than or equal to" comparison function.
n
(graph theory) A cut whose size is at least the size of any other cut; a partition of the graph's vertices into two complementary sets S and T, such that the number of edges between S and T is as large as possible.
n
(mathematics) Either of the two parts of an algebraic equation, connected by the equality sign.
n
(mathematics) A number consisting of a whole number and a fraction, such as 11½.
n
(uncountable, arithmetic) The process of computing the sum of a number with itself a specified number of times, or any other analogous binary operation that combines other mathematical objects.
n
(arithmetic) A table showing the products of each of the integers from 1 to 10 (or, especially formerly, 12) with each of the integers from 1 to 10 (or 12).
n
the inverse element with respect to multiplication; the reciprocal
n
An act of multiplication.
n
(mathematical analysis) The symbol ∇, used to denote the gradient operator.
n
Any of a set of number-like objects used in combinatorial game theory.
n
(mathematics) An integer that cannot be expressed as the difference between a positive integer and the number of coprime integers below it
n
(set theory) The sign ∅, associated with empty sets.
n
(countable, mathematics) An element of one of several sets: natural numbers, integers, rational numbers, real numbers, complex numbers, and sometimes extensions such as hypercomplex numbers, etc.
n
(mathematics) A line that graphically represents the real numbers as a series of points whose distance from an origin is proportional to their value
n
(arithmetic) The number or expression written above the line in a fraction (such as 1 in ½).
n
(mathematics, computing) A quantity to which an operator is applied (in 3-x, the operands of the subtraction operator are 3 and x).
n
(mathematics, more formally) a function which maps zero or more (but typically two) operands to a single output value.
n
(mathematics) A totally ordered set.
n
(set theory) Such a number generalised to correspond to any cardinal number (the size of some set); formally, the order type of some well-ordered set of some cardinality a, which represents an equivalence class of well-ordered sets (exactly those of cardinality a) under the equivalence relation "existence of an order-preserving bijection".
n
(Vedic arithmetic) Determining whether a number is divisible by another by means of certain operations on its digits.
n
(mathematics) Either of two related numeration systems based on continued fractions: a non-standard positional numeral system for integers, and a non-integer representation of real numbers.
adj
(mathematics, of a number) Containing at least one of every digit in its base.
n
(game theory) A type of game played on a directed graph whose nodes are coloured by priority.
n
(set theory) A collection of non-empty, disjoint subsets of a set whose union is the set itself (i.e. all elements of the set are contained in exactly one of the subsets).
n
F is a set of arcs known as a flow relation. The set F is subject to the constraint that no arc may connect two places or two transitions, or more formally: F⊆(S⨯T)∪(T⨯S).
adj
(mathematics) Synonym of multiperfect
n
(graph theory) The property of a node that postdominates another.
n
(arithmetic) A quantity obtained by multiplication of two or more numbers.
n
(arithmetic) A vulgar fraction in which the magnitude of the numerator is less than or equal to that of the denominator, such as 2/3.
n
(mathematics, geometry, archaic) A proportion.
n
(mathematics) Any of several methods of division that employ addition and shifting of digits.
n
(mathematics) A function of a complex variable obtained by differentiating the logarithm of a gamma function; the digamma function
n
(arithmetic) The number resulting from the division of one number by another.
n
(arithmetic, rare) The process of extracting a number's root.
n
(computing) A structure composed of a collection of decision trees with controlled variance
n
(mathematics) The dimensionality of an array (computing) or tensor.
n
(mathematics) A rational number: a number that can be expressed as the quotient of two integers.
n
(mathematics) The set of numbers that can be expressed as a ratio of integers, often denoted with the bold letter Q, or the blackboard bold letter ℚ.
v
(mathematics) To remove radicals, without changing the value of an expression or the roots of an equation.
n
(computing) A floating-point number.
n
(arithmetic) The number obtained by dividing 1 by another given number; the result of exchanging the numerator and the denominator of a fraction.
n
(mathematics) The amount left over after subtracting the divisor as many times as possible from the dividend without producing a negative result. If n (dividend) and d (divisor) are integers, then n can always be expressed in the form n = dq + r, where q (quotient) and r (remainder) are also integers and 0 ≤ r < d.
adj
(mathematics) Of or relating to ring theory.
n
(mathematics) A finitely axiomatized fragment of first-order Peano arithmetic, lacking the axiom schema of mathematical induction.
n
(gematria, very rare in print) The rule according to which one digit may be added to or subtracted from the gematric value of a word.
n
(algebra) A unary operation that denotes a subset of a relation.
n
(music) Musical set theory, a systematic approach to describing musical objects and their relationships.
adj
(mathematics, computer science) Having both positive and negative varieties.
n
(number theory) Any of a sequence of numbers having the property that the sum of the divisors of each, excluding itself, is equal to the next number in the sequence; in the case of the last number of the sequence, the sum of the divisors, excluding that number, is equal to the first number of the sequence.
n
(computer science) A technique that can reduce the runtime of an algorithm by a factor of √ (where n is the size of the input) by dividing the input into √ chunks and performing operations on whole chunks when possible.
n
(mathematics) A subset of an arrangement
n
(mathematics) The child of a child (subordinate node) of a tree
n
(mathematics) A subset of a composition
n
(mathematics) A subsidiary constraint
n
(sciences) A quantity that gives another quantity when multiplied by an integer
n
(mathematics) A subset of a packing
n
A permutation that is a subset of another permutation, containing only some of its elements.
n
(mathematics, programming) A subset of a given range or numeric set.
n
(mathematics) A sequence that is contained within a larger one.
n
(category theory, uncountable) The subobject classifier restricted to the category Set.
n
(mathematics, computing) The production of a subset.
n
(mathematics) A subset of a stack
n
(arithmetic, uncountable) The process of subtracting a number from another.
n
(mathematics) A substring.
n
A typographical index mark in the form of a superscript e.g. A^*
n
(graph theory) The path that contains a particular subpath.
adj
(computing theory) Being a generalization of ordinary algorithms that are more powerful than Turing machines.
n
(mathematics) A partially ordered set in which the elements consist of different ways of grouping a sequence of objects into pairs using parentheses (e.g. for a sequence of four objects abcd, the five possible groupings are ((ab)c)d, (ab)(cd), (a(bc))d, a((bc)d), and a(b(cd))).
n
(mathematics, cryptography) A function that is easy to compute in one direction but difficult to compute in the opposite direction (finding its inverse) without special information.
n
(mathematics) A simple method of finding the divisors of an integer, or establishing if the integer is prime, by selecting a set of smaller integers and seeing if there is a zero remainder upon division by each one
n
(mathematics) A part of the partition of the object domain of a logical theory (which due to the existence of such partition, would be called a typed theory). (Note: this corresponds to the notion of "data type" in computing theory.)
n
(information theory) Unary coding, an entropy encoding for natural numbers.
n
(algebra) An operation taking one operand, such as the square, factorial or absolute value operation.
n
(arithmetic) A fraction whose numerator is 1 and whose denominator is a positive integer; for example, 1/2 or 1/7.
n
(mathematics, archaic) The remainder after dividing a number by any digit.
n
(mathematics) The number 1 or any element of a set or field that behaves under a given operation as the number 1 behaves under multiplication.
n
(computing) A numeric value or variable that has no sign and can only be positive.
n
(mathematics) An integer
n
(mathematics) A diagram obtained by filling in the boxes of the Young diagram with symbols from some alphabet, usually required to be a totally ordered set.
n
(mathematics) A value of the independent variables of a function, for which the function is equal to zero.
n
(set theory) Initialism of Zermelo-Fraenkel set theory with Choice; the standard axiomatization of set theory, including the axiom of choice.
Note: Concept clusters like the one above are an experimental OneLook
feature. We've grouped words and phrases into thousands of clusters
based on a statistical analysis of how they are used in writing. Some
of the words and concepts may be vulgar or offensive. The names of the
clusters were written automatically and may not precisely describe
every word within the cluster; furthermore, the clusters may be
missing some entries that you'd normally associate with their
names. Click on a word to look it up on OneLook.
Our daily word games Threepeat and Compound Your Joy are going strong. Bookmark and enjoy!
Today's secret word is 8 letters and means "Believable and worthy of trust." Can you find it?