Search Results for ""

Diophantus's riddle is a poem that encodes a mathematical problem. In verse, it read as follows: 'Here lies Diophantus,' the wonder behold. Through art algebraic, the stone ...

In order to find integers x and y such that x^2=y^2 (mod n) (1) (a modified form of Fermat's factorization method), in which case there is a 50% chance that GCD(n,x-y) is a ...

The term Euclidean refers to everything that can historically or logically be referred to Euclid's monumental treatise The Thirteen Books of the Elements, written around the ...

The Euler polynomial E_n(x) is given by the Appell sequence with g(t)=1/2(e^t+1), (1) giving the generating function (2e^(xt))/(e^t+1)=sum_(n=0)^inftyE_n(x)(t^n)/(n!). (2) ...

Euler (1772ab) conjectured that there are no positive integer solutions to the quartic Diophantine equation A^4=B^4+C^4+D^4. This conjecture was disproved by Elkies (1988), ...

The W polynomials obtained by setting p(x)=x and q(x)=1 in the Lucas polynomial sequence. (The corresponding w polynomials are called Lucas polynomials.) They have explicit ...

The following are equivalent definitions for a Galois extension field (also simply known as a Galois extension) K of F. 1. K is the splitting field for a collection of ...

A generalized Moore graph is a regular graph of degree r where the counts of vertices at each distance d=0, 1, ... from any vertex are 1, r, r(r-1), r(r-1)^2, r(r-1)^3, ..., ...

Let lambda be (possibly complex) eigenvalues of a set of random n×n real matrices with entries independent and taken from a standard normal distribution. Then as n->infty, ...

An algorithm used to recursively construct a set of objects from the smallest possible constituent parts. Given a set of k integers (a_1, a_2, ..., a_k) with a_1<a_2<...<a_k, ...