Search Results for ""

A clique of a graph G is a complete subgraph of G, and the clique of largest possible size is referred to as a maximum clique (which has size known as the (upper) clique ...

First-passage percolation is a time-dependent generalization of discrete Bernoulli percolation in which each graph edge e of Z^d is assigned a nonnegative random variable ...

The simple continued fraction of the Golomb-Dickman constant lambda is [0; 1, 1, 1, 1, 1, 22, 1, 2, 3, 1, 1, 11, ...] (OEIS A225336). Note that this continued fraction ...

Like the entire harmonic series, the harmonic series sum_(k=1)^infty1/(p_k)=infty (1) taken over all primes p_k also diverges, as first shown by Euler in 1737 (Nagell 1951, ...

A positive integer which is divisible by the sum of its digits, also called a Niven number (Kennedy et al. 1980) or a multidigital number (Kaprekar 1955). The first few are ...

The Hochberg-O'Donnell fish graph is the unit-distance graph on 23 nodes and 42 edges illustrated above. It is triangle-free and is the smallest example of a unit-distance ...

The icosahedral group I_h is the group of symmetries of the icosahedron and dodecahedron having order 120, equivalent to the group direct product A_5×Z_2 of the alternating ...

A statistic which assigns a single number to several individual statistics in order to quantify trends. The best-known index in the United States is the consumer price index, ...

Let P, Q be integers satisfying D=P^2-4Q>0. (1) Then roots of x^2-Px+Q=0 (2) are a = 1/2(P+sqrt(D)) (3) b = 1/2(P-sqrt(D)), (4) so a+b = P (5) ab = 1/4(P^2-D) (6) = Q (7) a-b ...

A Maclaurin series is a Taylor series expansion of a function about 0, (1) Maclaurin series are named after the Scottish mathematician Colin Maclaurin. The Maclaurin series ...