Search Results for ""

Let p>3 be a prime number, then 4(x^p-y^p)/(x-y)=R^2(x,y)-(-1)^((p-1)/2)pS^2(x,y), where R(x,y) and S(x,y) are homogeneous polynomials in x and y with integer coefficients. ...

A triple (a,b,c) of positive integers satisfying a<b<c is said to be geometric if ac=b^2. In particular, such a triple is geometric if its terms form a geometric sequence ...

A triple (a,b,c) of positive integers satisfying a<b<c is said to be harmonic if 1/a+1/c=2/b. In particular, such a triple is harmonic if the reciprocals of its terms form an ...

Lucas's theorem states that if n>=3 be a squarefree integer and Phi_n(z) a cyclotomic polynomial, then Phi_n(z)=U_n^2(z)-(-1)^((n-1)/2)nzV_n^2(z), (1) where U_n(z) and V_n(z) ...

It is possible to find six points in the plane, no three on a line and no four on a circle (i.e., none of which are collinear or concyclic), such that all the mutual ...

Catalan's constant is a constant that commonly appears in estimates of combinatorial functions and in certain classes of sums and definite integrals. It is usually denoted K ...

An Egyptian fraction is a sum of positive (usually) distinct unit fractions. The famous Rhind papyrus, dated to around 1650 BC contains a table of representations of 2/n as ...

An Euler brick is a cuboid that possesses integer edges a>b>c and face diagonals d_(ab) = sqrt(a^2+b^2) (1) d_(ac) = sqrt(a^2+c^2) (2) d_(bc) = sqrt(b^2+c^2). (3) If the ...

The extended greatest common divisor of two integers m and n can be defined as the greatest common divisor GCD(m,n) of m and n which also satisfies the constraint ...

The l^infty-polynomial norm defined for a polynomial P=a_kx^k+...+a_1x+a_0 by ||P||_infty=max_(k)|a_k|. Note that some authors (especially in the area of Diophantine ...