Search Results for ""

If g is a continuous function g(x) in [a,b] for all x in [a,b], then g has a fixed point in [a,b]. This can be proven by supposing that g(a)>=a g(b)<=b (1) g(a)-a>=0 ...

Given a sequence S_i as input to stage i, form sequence S_(i+1) as follows: 1. For k in [1,...,i], write term i+k and then term i-k. 2. Discard the ith term. 3. Write the ...

The thinnest sequence which contains 1, and whenever it contains x, also contains 2x, 3x+2, and 6x+3: 1, 2, 4, 5, 8, 9, 10, 14, 15, 16, 17, ... (OEIS A005658).

A linear extension of a partially ordered set P is a permutation of the elements p_1, p_2, ... of P such that p_i<p_j implies i<j. For example, the linear extensions of the ...

A bounded plane convex region symmetric about a lattice point and with area >4 must contain at least three lattice points in the interior. In n dimensions, the theorem can be ...

The tetranacci constant is ratio to which adjacent tetranacci numbers tend, and is given by T = (x^4-x^3-x^2-x-1)_2 (1) = 1.92756... (2) (OEIS A086088), where (P(x))_n ...

A hyperelliptic curve is an algebraic curve given by an equation of the form y^2=f(x), where f(x) is a polynomial of degree n>4 with n distinct roots. If f(x) is a cubic or ...

A cubic polynomial is a polynomial of degree 3. A univariate cubic polynomial has the form f(x)=a_3x^3+a_2x^2+a_1x+a_0. An equation involving a cubic polynomial is called a ...

Algebra

A connected graph G is said to be t-tough if, for every integer k>1, G cannot be split into k different connected components by the removal of fewer than tk vertices. The ...