Search Results for ""

A product involving an infinite number of terms. Such products can converge. In fact, for positive a_n, the product product_(n=1)^(infty)a_n converges to a nonzero number iff ...

A complete metric space is a metric space in which every Cauchy sequence is convergent. Examples include the real numbers with the usual metric, the complex numbers, ...

y^(n/m)+c|x/a|^(n/m)-c=0, with n/m<2. If n/m>2, the curve is a hyperellipse.

Convergents of the pi continued fractions are the simplest approximants to pi. The first few are given by 3, 22/7, 333/106, 355/113, 103993/33102, 104348/33215, ... (OEIS ...

A graph G is distance transitive if its automorphism group is transitive on pairs of vertices at each pairwise distance in the graph. Distance-transitivity is a ...

Given a quadratic form Q(x,y)=x^2+y^2, (1) then Q(x,y)Q(x^',y^')=Q(xx^'-yy^',x^'y+xy^'), (2) since (x^2+y^2)(x^('2)+y^('2)) = (xx^'-yy^')^2+(xy^'+x^'y)^2 (3) = ...

The integer sequence defined by the recurrence P(n)=P(n-2)+P(n-3) (1) with the initial conditions P(0)=3, P(1)=0, P(2)=2. This recurrence relation is the same as that for the ...

A spider graph, spider tree, or simply "spider," is a tree with one vertex of degree at least 3 and all others with degree at most 2. The numbers of spiders on n=1, 2, ... ...

There are two incompatible definitions of the squircle. The first defines the squircle as the quartic plane curve which is special case of the superellipse with a=b and r=4, ...

A weakly binary tree is a planted tree in which all nonroot graph vertices are adjacent to at most three graph vertices. Let g(z)=sum_(i=0)^inftyg_iz^i, (1) be the generating ...