Search Results for ""

Consider n intersecting circles. The maximal number of regions into which these divide the plane are N(n)=n^2-n+2, giving values for n=1, 2, ... of 2, 4, 8, 14, 22, 32, 44, ...

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

An equation of the form y=ax^3+bx^2+cx+d where only one root is real.

The system of partial differential equations u_t = (u^2-u_x+2v)_x (1) v_y = (2uv+v_x)_x. (2)

The identity F_n^4-F_(n-2)F_(n-1)F_(n+1)F_(n+2)=1, where F_n is a Fibonacci number.

A binary Hamming code H_r of length n=2^r-1 (with r>=2) is a linear code with parity-check matrix H whose columns consist of all nonzero binary vectors of length r, each used ...

The dilogarithm identity Li_2(-x)=-Li_2(x/(1+x))-1/2[ln(1+x)]^2.

There exist infinitely many n>0 with p_n^2>p_(n-i)p_(n+i) for all i<n, where p_n is the nth prime. Also, there exist infinitely many n>0 such that 2p_n<p_(n-i)+p_(n+i) for ...

F(x) = -Li_2(-x) (1) = int_0^x(ln(1+t))/tdt, (2) where Li_2(x) is the dilogarithm.

A number taken to the power 2 is said to be squared, so x^2 is called "x squared." This terminology derives from the fact that the area of a square of edge length x is given ...