Search Results for ""

Let s_1, s_2, ... be an infinite series of real numbers lying between 0 and 1. Then corresponding to any arbitrarily large K, there exists a positive integer n and two ...

A sequence of real numbers {x_n} is equidistributed on an interval [a,b] if the probability of finding x_n in any subinterval is proportional to the subinterval length. The ...

A quadratic map is a quadratic recurrence equation of the form x_(n+1)=a_2x_n^2+a_1x_n+a_0. (1) While some quadratic maps are solvable in closed form (for example, the three ...

Let {a_i}_(i=1)^n be a set of positive numbers. Then sum_(i=1)^n(a_1a_2...a_i)^(1/i)<=esum_(i=1)^na_i (which is given incorrectly in Gradshteyn and Ryzhik 2000). Here, the ...

The detour polynomial of a graph G is the characteristic polynomial of the detour matrix of G. Precomputed detour polynomials for many named graphs are available in the ...

Consider an arbitrary one-dimensional map x_(n+1)=F(x_n) (1) (with implicit parameter r) at the onset of chaos. After a suitable rescaling, the Feigenbaum function ...

The Lotka-Volterra equations describe an ecological predator-prey (or parasite-host) model which assumes that, for a set of fixed positive constants A (the growth rate of ...

A minimal cover is a cover for which removal of any single member destroys the covering property. For example, of the five covers of {1,2}, namely {{1},{2}}, {{1,2}}, ...

Newton's method for finding roots of a complex polynomial f entails iterating the function z-[f(z)/f^'(z)], which can be viewed as applying the Euler backward method with ...

A recursive sequence {f(n)}_n, also known as a recurrence sequence, is a sequence of numbers f(n) indexed by an integer n and generated by solving a recurrence equation. The ...