Search Results for ""

As a consequence of Matiyasevich's refutation of Hilbert's 10th problem, it can be proved that there does not exist a general algorithm for solving a general quartic ...

In Book IX of The Elements, Euclid gave a method for constructing perfect numbers (Dickson 2005, p. 3), although this method applies only to even perfect numbers. In a 1638 ...

The prime number theorem gives an asymptotic form for the prime counting function pi(n), which counts the number of primes less than some integer n. Legendre (1808) suggested ...

Topology is the mathematical study of the properties that are preserved through deformations, twistings, and stretchings of objects. Tearing, however, is not allowed. A ...

An almost integer is a number that is very close to an integer. Near-solutions to Fermat's last theorem provide a number of high-profile almost integers. In the season 7, ...

The Jacobi theta functions are the elliptic analogs of the exponential function, and may be used to express the Jacobi elliptic functions. The theta functions are ...

A Pythagorean triple is a triple of positive integers a, b, and c such that a right triangle exists with legs a,b and hypotenuse c. By the Pythagorean theorem, this is ...

The Fibonacci numbers are the sequence of numbers {F_n}_(n=1)^infty defined by the linear recurrence equation F_n=F_(n-1)+F_(n-2) (1) with F_1=F_2=1. As a result of the ...

A prime number (or prime integer, often simply called a "prime" for short) is a positive integer p>1 that has no positive integer divisors other than 1 and p itself. More ...