Search Results for ""

The law appearing in the definition of Boolean algebras and lattice which states that a ^ (a v b)=a v (a ^ b)=a for binary operators v and ^ (which most commonly are logical ...

An abstract group is a group characterized only by its abstract properties and not by the particular representations chosen for elements. For example, there are two distinct ...

The abundancy of a number n is defined as the ratio sigma(n)/n, where sigma(n) is the divisor function. For n=1, 2, ..., the first few values are 1, 3/2, 4/3, 7/4, 6/5, 2, ...

A number of the form n^...^_()_(n)n, where Knuth up-arrow notation has been used. The first few Ackermann numbers are 1^1=1, 2^^2=4, and ...

The polynomials a_n^((beta))(x) given by the Sheffer sequence with g(t) = (1-t)^(-beta) (1) f(t) = ln(1-t), (2) giving generating function ...

An acyclic graph is a graph having no graph cycles. Acyclic graphs are bipartite. A connected acyclic graph is known as a tree, and a possibly disconnected acyclic graph is ...

Given a triangle DeltaABC, construct the contact triangle DeltaT_AT_BT_C. Now extend lines parallel to the sides of the contact triangle from the Gergonne point. These ...

The combining of two or more quantities using the plus operator. The individual numbers being combined are called addends, and the total is called the sum. The first of ...

Consider the process of taking a number, adding its digits, then adding the digits of the number derived from it, etc., until the remaining number has only one digit. The ...

An element of an adèle group, sometimes called a repartition in older literature (e.g., Chevalley 1951, p. 25). Adèles arise in both number fields and function fields. The ...