TOPICS
Search

Search Results for ""


1201 - 1210 of 8565 for L 1 NormSearch Results
A sum is the result of an addition. For example, adding 1, 2, 3, and 4 gives the sum 10, written 1+2+3+4=10. (1) The numbers being summed are called addends, or sometimes ...
A unit in a ring is an element u such that there exists u^(-1) where u·u^(-1)=1.
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, ...
Define an antipode of a given graph vertex v_i as a vertex v_j at greatest possible graph distance from v_i. Then an antipodal graph is a connected graph in which each vertex ...
A block graph, also called a clique tree, is a simple graph in which every block is a complete graph. The numbers of connected block graphs on n=1, 2, ... vertices are 1, 1, ...
The conchoid of de Sluze is the cubic curve first constructed by René de Sluze in 1662. It is given by the implicit equation (x-1)(x^2+y^2)=ax^2, (1) or the polar equation ...
The term diamond is another word for a rhombus. The term is also used to denote a square tilted at a 45 degrees angle. The diamond shape is a special case of the superellipse ...
The term "Euler function" may be used to refer to any of several functions in number theory and the theory of special functions, including 1. the totient function phi(n), ...
The Franel numbers are the numbers Fr_n=sum_(k=0)^n(n; k)^3, (1) where (n; k) is a binomial coefficient. The first few values for n=0, 1, ... are 1, 2, 10, 56, 346, ... (OEIS ...
The numbers H_n=H_n(0), where H_n(x) is a Hermite polynomial, may be called Hermite numbers. For n=0, 1, ..., the first few are 1, 0, -2, 0, 12, 0, -120, 0, 1680, 0, ... ...
1 ... 118|119|120|121|122|123|124 ... 857 Previous Next

...