List of disproved mathematical ideas

Last updated

In mathematics, ideas are supposedly not accepted as fact until they have been rigorously proved. However, there have been some ideas that were fairly accepted in the past but which were subsequently shown to be false. This article is meant to serve as a repository for compiling a list of such ideas.

See also

Related Research Articles

<span class="mw-page-title-main">Conjecture</span> Proposition in mathematics that is unproven

In mathematics, a conjecture is a conclusion or a proposition that is proffered on a tentative basis without proof. Some conjectures, such as the Riemann hypothesis or Fermat's Last Theorem, have shaped much of mathematical history as new areas of mathematics are developed in order to prove them.

Euler's conjecture is a disproved conjecture in mathematics related to Fermat's Last Theorem. It was proposed by Leonhard Euler in 1769. It states that for all integers n and k greater than 1, if the sum of n many kth powers of positive integers is itself a kth power, then n is greater than or equal to k:

<span class="mw-page-title-main">Number theory</span> Mathematics of integer properties

Number theory is a branch of pure mathematics devoted primarily to the study of the integers and arithmetic functions. German mathematician Carl Friedrich Gauss (1777–1855) said, "Mathematics is the queen of the sciences—and number theory is the queen of mathematics." Number theorists study prime numbers as well as the properties of mathematical objects constructed from integers, or defined as generalizations of the integers.

<span class="mw-page-title-main">Prime number</span> Evenly divided only by 1 or itself

A prime number is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways of writing it as a product, 1 × 5 or 5 × 1, involve 5 itself. However, 4 is composite because it is a product (2 × 2) in which both numbers are smaller than 4. Primes are central in number theory because of the fundamental theorem of arithmetic: every natural number greater than 1 is either a prime itself or can be factorized as a product of primes that is unique up to their order.

In mathematics, a transcendental number is a real or complex number that is not algebraic – that is, not the root of a non-zero polynomial of finite degree with rational coefficients. The best known transcendental numbers are π and e.

A counterexample is any exception to a generalization. In logic a counterexample disproves the generalization, and does so rigorously in the fields of mathematics and philosophy. For example, the fact that "student John Smith is not lazy" is a counterexample to the generalization “students are lazy”, and both a counterexample to, and disproof of, the universal quantification “all students are lazy.”

<span class="mw-page-title-main">Transcendental number theory</span> Study of numbers that are not solutions of polynomials with rational coefficients

Transcendental number theory is a branch of number theory that investigates transcendental numbers, in both qualitative and quantitative ways.

<span class="mw-page-title-main">Schanuel's conjecture</span> Conjecture on the transcendence degree of field extensions to the rational numbers

In mathematics, specifically transcendental number theory, Schanuel's conjecture is a conjecture made by Stephen Schanuel in the 1960s concerning the transcendence degree of certain field extensions of the rational numbers.

The Beal conjecture is the following conjecture in number theory:

In mathematics, a proof of impossibility is a proof that demonstrates that a particular problem cannot be solved as described in the claim, or that a particular set of problems cannot be solved in general. Such a case is also known as a negative proof, proof of an impossibility theorem, or negative result. Proofs of impossibility often are the resolutions to decades or centuries of work attempting to find a solution, eventually proving that there is no solution. Proving that something is impossible is usually much harder than the opposite task, as it is often necessary to develop a proof that works in general, rather than to just show a particular example. Impossibility theorems are usually expressible as negative existential propositions or universal propositions in logic.

<span class="mw-page-title-main">Pólya conjecture</span> Disproved conjecture in number theory

In number theory, the Pólya conjecture stated that "most" of the natural numbers less than any given number have an odd number of prime factors. The conjecture was set forth by the Hungarian mathematician George Pólya in 1919, and proved false in 1958 by C. Brian Haselgrove. Though mathematicians typically refer to this statement as the Pólya conjecture, Pólya never actually conjectured that the statement was true; rather, he showed that the truth of the statement would imply the Riemann hypothesis. For this reason, it is more accurately called "Pólya's problem".

The Swiss mathematician Leonhard Euler (1707–1783) is among the most prolific and successful mathematicians in the history of the field. His seminal work had a profound impact in numerous areas of mathematics and he is widely credited for introducing and popularizing modern notation and terminology.

<span class="mw-page-title-main">Fermat's Last Theorem</span> 17th-century conjecture proved by Andrew Wiles in 1994

In number theory, Fermat's Last Theorem states that no three positive integers a, b, and c satisfy the equation an + bn = cn for any integer value of n greater than 2. The cases n = 1 and n = 2 have been known since antiquity to have infinitely many solutions.

This is a timeline of pure and applied mathematics history. It is divided here into three stages, corresponding to stages in the development of mathematical notation: a "rhetorical" stage in which calculations are described purely by words, a "syncopated" stage in which quantities and common algebraic operations are beginning to be represented by symbolic abbreviations, and finally a "symbolic" stage, in which comprehensive notational systems for formulas are the norm.

<span class="mw-page-title-main">Irrational number</span> Number that is not a ratio of integers

In mathematics, the irrational numbers are all the real numbers that are not rational numbers. That is, irrational numbers cannot be expressed as the ratio of two integers. When the ratio of lengths of two line segments is an irrational number, the line segments are also described as being incommensurable, meaning that they share no "measure" in common, that is, there is no length, no matter how short, that could be used to express the lengths of both of the two given segments as integer multiples of itself.

<span class="mw-page-title-main">Wiles's proof of Fermat's Last Theorem</span> 1995 publication in mathematics

Wiles's proof of Fermat's Last Theorem is a proof by British mathematician Andrew Wiles of a special case of the modularity theorem for elliptic curves. Together with Ribet's theorem, it provides a proof for Fermat's Last Theorem. Both Fermat's Last Theorem and the modularity theorem were almost universally considered inaccessible to prove by contemporaneous mathematicians, meaning that they were believed to be impossible to prove using current knowledge.

The Lander, Parkin, and Selfridge conjecture concerns the integer solutions of equations which contain sums of like powers. The equations are generalisations of those considered in Fermat's Last Theorem. The conjecture is that if the sum of some k-th powers equals the sum of some other k-th powers, then the total number of terms in both sums combined must be at least k.

References

  1. Farlow, Stanley J. (2014). Paradoxes in Mathematics. Courier Corporation. p. 57. ISBN   978-0-486-49716-7.
  2. Krizek, Michal; Luca, Florian; Somer, Lawrence (2001). 17 Lectures on Fermat Numbers: From Number Theory to Geometry. Springer. p. 1. doi:10.1007/978-0-387-21850-2. ISBN   0-387-95332-9.
  3. McQuarrie, Donald Allan (2003). Mathematical Methods for Scientists and Engineers. University Science Books. p. 711.
  4. Lehman, R. S. (1960). "On Liouville's function". Mathematics of Computation . 14 (72): 311–320. doi: 10.1090/S0025-5718-1960-0120198-5 . JSTOR   2003890. MR   0120198.
  5. Tanaka, M. (1980). "A Numerical Investigation on Cumulative Sum of the Liouville Function". Tokyo Journal of Mathematics . 3 (1): 187–189. doi: 10.3836/tjm/1270216093 . MR   0584557.
  6. Why mathematics is beautiful in New Scientist, 21 July 2007, p. 48
  7. Neeman, Amnon (2002). "A counterexample to a 1961 "theorem" in homological algebra". Inventiones mathematicae. 148: 397–420. doi:10.1007/s002220100197.