Search Results for ""

Ore (1962) noted that not only does a tree possesses a unique shortest path between any two vertices, but that there also exist also other connected graphs having the same ...

The geometric mean of a sequence {a_i}_(i=1)^n is defined by G(a_1,...,a_n)=(product_(i=1)^na_i)^(1/n). (1) Thus, G(a_1,a_2) = sqrt(a_1a_2) (2) G(a_1,a_2,a_3) = ...

The golden triangle, sometimes also called the sublime triangle, is an isosceles triangle such that the ratio of the hypotenuse a to base b is equal to the golden ratio, ...

The great cubicuboctahedron is the uniform polyhedron with Maeder index 14 (Maeder 1997), Wenninger index 77 (Wenninger 1989), Coxeter index 50 (Coxeter et al. 1954), and ...

The Gregory series is a pi formula found by Gregory and Leibniz and obtained by plugging x=1 into the Leibniz series, pi/4=sum_(k=1)^infty((-1)^(k+1))/(2k-1)=1-1/3+1/5-... ...

The Gudermannian function is the odd function denoted either gamma(x) or gd(x) which arises in the inverse equations for the Mercator projection. phi(y)=gd(y) expresses the ...

The Hankel transform (of order zero) is an integral transform equivalent to a two-dimensional Fourier transform with a radially symmetric integral kernel and also called the ...

If the square is instead erected internally, their centers form a triangle DeltaI_AI_BI_C that has (exact) trilinear vertex matrix given by (1) (E. Weisstein, Apr. 25, 2004). ...

d sum OEIS 0 23.10344 A082839 1 16.17696 A082830 2 19.25735 A082831 3 20.56987 A082832 4 21.32746 A082833 5 21.83460 A082834 6 22.20559 A082835 7 22.49347 A082836 8 22.72636 ...

A root-finding algorithm which converges to a complex root from any starting position. To motivate the formula, consider an nth order polynomial and its derivatives, P_n(x) = ...