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

Green's theorem is a vector identity which is equivalent to the curl theorem in the plane. Over a region D in the plane with boundary partialD, Green's theorem states ...

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

A group G is said to act on a set X when there is a map phi:G×X->X such that the following conditions hold for all elements x in X. 1. phi(e,x)=x where e is the identity ...

For any prime number p and any positive integer n, the p^n-rank r_(p^n)(G) of a finitely generated Abelian group G is the number of copies of the cyclic group Z_(p^n) ...

A representation of a group G is a group action of G on a vector space V by invertible linear maps. For example, the group of two elements Z_2={0,1} has a representation phi ...

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