Search Results for ""

Wolfram's iteration is an algorithm for computing the square root of a rational number 1<=r<4 using properties of the binary representation of r. The algorithm begins with ...

A prize of 100000 German marks offered for the first valid proof of Fermat's last theorem (Ball and Coxeter 1987, p. 72; Barner 1997; Hoffman 1998, pp. 193-194 and 199). The ...

Let the values of a function f(x) be tabulated at points x_i equally spaced by h=x_(i+1)-x_i, so f_1=f(x_1), f_2=f(x_2), ..., f_n=f(x_n). Then Woolhouse's formulas ...

x^n=sum_(k=0)^n<n; k>(x+k; n), where <n; k> is an Eulerian number and (n; k) is a binomial coefficient (Worpitzky 1883; Comtet 1974, p. 242).

The Wronskian of a set of n functions phi_1, phi_2, ... is defined by W(phi_1,...,phi_n)=|phi_1 phi_2 ... phi_n; phi_1^' phi_2^' ... phi_n^'; | | ... |; phi_1^((n-1)) ...

An illusion invented by the German psychologist Wilhelm Wundt in the 19th century. In the figure above, the two red horizontal lines are both straight, but they look as if ...

Begin with the Yff central triangle and then parallel-displace the isoscelizers in such a way as to reduce the central triangle to a point while keeping the other three ...

Let three isoscelizers I_(AC)I_(AB), I_(BA)I_(BC), and I_(CA)I_(CB) be constructed on a triangle DeltaABC, one for each side. This makes all of the inner triangles similar to ...

The Yff circles are the two triplets of congruent circle in which each circle is tangent to two sides of a reference triangle. In each case, the triplets intersect pairwise ...

The Yff contact triangle DeltaX_AX_BX_C (a term coined here for the first time), is the Cevian triangle of Kimberling center X_(190). It is the polar triangle of the Yff ...