Search Results for ""

A factorization algorithm which works by expressing N as a quadratic form in two different ways. Then N=a^2+b^2=c^2+d^2, (1) so a^2-c^2=d^2-b^2 (2) (a-c)(a+c)=(d-b)(d+b). (3) ...

Euler conjectured that there do not exist Euler squares of order n=4k+2 for k=1, 2, .... In fact, MacNeish (1921-1922) published a purported proof of this conjecture (Bruck ...

Let f(x,y) be a homogeneous function of order n so that f(tx,ty)=t^nf(x,y). (1) Then define x^'=xt and y^'=yt. Then nt^(n-1)f(x,y) = ...

_2F_1(a,b;c;z)=int_0^1(t^(b-1)(1-t)^(c-b-1))/((1-tz)^a)dt, (1) where _2F_1(a,b;c;z) is a hypergeometric function. The solution can be written using the Euler's ...

The Euler triangle formula states that the distance d between the incenter and circumcenter of a triangle is given by d^2=R(R-2r), where R is the circumradius and r is the ...

The Machin-like formula 1/4pi=cot^(-1)(2)+cot^(-1)(3). The other 2-term Machin-like formulas are Hermann's formula, hutton's formula, and Machin's formula.

The triangle of numbers A_(n,k) given by A_(n,1)=A_(n,n)=1 (1) and the recurrence relation A_(n+1,k)=kA_(n,k)+(n+2-k)A_(n,k-1) (2) for k in [2,n], where A_(n,k) are shifted ...

The problem of finding in how many ways E_n a plane convex polygon of n sides can be divided into triangles by diagonals. Euler first proposed it to Christian Goldbach in ...

A number D that possesses no common divisor with a prime number p is either a quadratic residue or nonresidue of p, depending whether D^((p-1)/2) is congruent mod p to +/-1.

An arbitrary rotation may be described by only three parameters.