Search Results for ""

A cyclic quadrilateral is a quadrilateral for which a circle can be circumscribed so that it touches each polygon vertex. A quadrilateral that can be both inscribed and ...

The dilogarithm Li_2(z) is a special case of the polylogarithm Li_n(z) for n=2. Note that the notation Li_2(x) is unfortunately similar to that for the logarithmic integral ...

The distinct prime factors of a positive integer n>=2 are defined as the omega(n) numbers p_1, ..., p_(omega(n)) in the prime factorization ...

An equilateral triangle is a triangle with all three sides of equal length a, corresponding to what could also be known as a "regular" triangle. An equilateral triangle is ...

erf(z) is the "error function" encountered in integrating the normal distribution (which is a normalized form of the Gaussian function). It is an entire function defined by ...

The Euler-Mascheroni constant gamma=0.577215664901532860606512090082402431042... (OEIS A001620) was calculated to 16 digits by Euler in 1781 and to 32 decimal places by ...

A factorial prime is a prime number of the form n!+/-1, where n! is a factorial. n!-1 is prime for n=3, 4, 6, 7, 12, 14, 30, 32, 33, 38, 94, 166, 324, 379, 469, 546, 974, ...

The sum-of-factorial powers function is defined by sf^p(n)=sum_(k=1)^nk!^p. (1) For p=1, sf^1(n) = sum_(k=1)^(n)k! (2) = (-e+Ei(1)+pii+E_(n+2)(-1)Gamma(n+2))/e (3) = ...

The graph distance matrix, sometimes also called the all-pairs shortest path matrix, is the square matrix (d_(ij)) consisting of all graph distances from vertex v_i to vertex ...

The Greenfield graph is the name given in this work to the 12-vertex graph illustrated above due to Greenfield (2011). This graph provided the first known example which ...