Search Results for ""

The recursive sequence generated by the recurrence equation Q(n)=Q(n-Q(n-1))+Q(n-Q(n-2)), with Q(1)=Q(2)=1. The first few values are 1, 1, 2, 3, 3, 4, 5, 5, 6, 6, ... (OEIS ...

Let there be n ways for a "good" selection and m ways for a "bad" selection out of a total of n+m possibilities. Take N samples and let x_i equal 1 if selection i is ...

p^x is an infinitary divisor of p^y (with y>0) if p^x|_(y-1)p^y, where d|_kn denotes a k-ary Divisor (Guy 1994, p. 54). Infinitary divisors therefore generalize the concept ...

An isosceles tetrahedron is a nonregular tetrahedron in which each pair of opposite polyhedron edges are equal, i.e., a^'=a, b^'=b, and c^'=c, so that all triangular faces ...

The Kakeya needle problems asks for the plane figure of least area in which a line segment of width 1 can be freely rotated (where translation of the segment is also ...

The Kummer surfaces are a family of quartic surfaces given by the algebraic equation (x^2+y^2+z^2-mu^2w^2)^2-lambdapqrs=0, (1) where lambda=(3mu^2-1)/(3-mu^2), (2) p, q, r, ...

A labeled graph G=(V,E) is a finite series of graph vertices V with a set of graph edges E of 2-subsets of V. Given a graph vertex set V_n={1,2,...,n}, the number of ...

A Lambert series is a series of the form F(x)=sum_(n=1)^inftya_n(x^n)/(1-x^n) (1) for |x|<1. Then F(x) = sum_(n=1)^(infty)a_nsum_(m=1)^(infty)x^(mn) (2) = ...

There are two sets of constants that are commonly known as Lebesgue constants. The first is related to approximation of function via Fourier series, which the other arises in ...

The Löwenheim-Skolem theorem is a fundamental result in model theory which states that if a countable theory has a model, then it has a countable model. Furthermore, it has a ...