Search Results for ""

A general quadratic Diophantine equation in two variables x and y is given by ax^2+cy^2=k, (1) where a, c, and k are specified (positive or negative) integers and x and y are ...

As a part of the study of Waring's problem, it is known that every positive integer is a sum of no more than 9 positive cubes (g(3)=9), that every "sufficiently large" ...

The 5.1.2 fifth-order Diophantine equation A^5=B^5+C^5 (1) is a special case of Fermat's last theorem with n=5, and so has no solution. improving on the results on Lander et ...

A Dirichlet L-series is a series of the form L_k(s,chi)=sum_(n=1)^inftychi_k(n)n^(-s), (1) where the number theoretic character chi_k(n) is an integer function with period k, ...

Any two rectilinear figures with equal area can be dissected into a finite number of pieces to form each other. This is the Wallace-Bolyai-Gerwien theorem. For minimal ...

By the duality principle, for every polyhedron, there exists another polyhedron in which faces and polyhedron vertices occupy complementary locations. This polyhedron is ...

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

A doubly periodic function with periods 2omega_1 and 2omega_2 such that f(z+2omega_1)=f(z+2omega_2)=f(z), (1) which is analytic and has no singularities except for poles in ...

An elliptic integral is an integral of the form int(A(x)+B(x)sqrt(S(x)))/(C(x)+D(x)sqrt(S(x)))dx, (1) or int(A(x)dx)/(B(x)sqrt(S(x))), (2) where A(x), B(x), C(x), and D(x) ...

The Euclidean algorithm, also called Euclid's algorithm, is an algorithm for finding the greatest common divisor of two numbers a and b. The algorithm can also be defined for ...