Search Results for ""

An algorithm used to recursively construct a set of objects from the smallest possible constituent parts. Given a set of k integers (a_1, a_2, ..., a_k) with a_1<a_2<...<a_k, ...

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-... ...

Define the sequence a_0=1, a_1=x, and a_n=(a_(n-2))/(1+a_(n-1)) (1) for n>=0. The first few values are a_2 = 1/(1+x) (2) a_3 = (x(1+x))/(2+x) (3) a_4 = ...

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 ...

Guilloché patterns are spirograph-like curves that frame a curve within an inner and outer envelope curve. They are used on banknotes, securities, and passports worldwide for ...

Guy's conjecture, which has not yet been proven or disproven, states that the graph crossing number for a complete graph K_n is ...

Hadjicostas's formula is a generalization of the unit square double integral gamma=int_0^1int_0^1(x-1)/((1-xy)ln(xy))dxdy (1) (Sondow 2003, 2005; Borwein et al. 2004, p. 49), ...

The Hall-Janko near octagon, also known as the Cohen-Tits near octagon, is a weakly regular graph on 315 vertices with parameters (n,k,lambda,mu)=(315,(10),(1),(0,1)). It is ...

The Hall graph is a distance-transitive graph on 65 vertices having intersection array {10,6,4,1;1,2,5} (Hall 1980). It is denoted Gamma^((3)) by Hall (1980) and was ...

The determination of whether a Turing machine will come to a halt given a particular input program. The halting problem is solvable for machines with less than four states. ...