Search Results for ""

Closed forms are known for the sums of reciprocals of even-indexed Fibonacci numbers P_F^((e)) = sum_(n=1)^(infty)1/(F_(2n)) (1) = ...

The conjecture made by Belgian mathematician Eugène Charles Catalan in 1844 that 8 and 9 (2^3 and 3^2) are the only consecutive powers (excluding 0 and 1). In other words, ...

There are (at least) three different types of points known as Steiner points. The point S of concurrence of the three lines drawn through the vertices of a triangle parallel ...

An elliptic partial differential equation given by del ^2psi+k^2psi=0, (1) where psi is a scalar function and del ^2 is the scalar Laplacian, or del ^2F+k^2F=0, (2) where F ...

An idoneal number, also called a suitable number or convenient number, is a positive integer D for which the fact that a number is a monomorph (i.e., is expressible in only ...

An algorithm for making tables of primes. Sequentially write down the integers from 2 to the highest number n you wish to include in the table. Cross out all numbers >2 which ...

The tribonacci numbers are a generalization of the Fibonacci numbers defined by T_1=1, T_2=1, T_3=2, and the recurrence equation T_n=T_(n-1)+T_(n-2)+T_(n-3) (1) for n>=4 ...

For |z|<1, product_(k=1)^infty(1+z^k)=product_(k=1)^infty(1-z^(2k-1))^(-1). (1) Both of these have closed form representation 1/2(-1;z)_infty, (2) where (a;q)_infty is a ...

The decimal expansion of the natural logarithm of 10 is given by ln10=2.302585092994045684... (1) (OEIS A002392). It is also given by the BBP-type formulas ln10 = (2) = ...

A simple graph, also called a strict graph (Tutte 1998, p. 2), is an unweighted, undirected graph containing no graph loops or multiple edges (Gibbons 1985, p. 2; West 2000, ...