Mathematics Atlas

How Proof Is Made
Sign In
Text size
100%
Theme
Theorem

Tijdeman's Theorem

Number Theory

Tijdeman's theorem, proved by the Dutch number theorist Robert Tijdeman in 1976 using Baker's method from transcendental number theory, states that the equation y to the m equals x to the n plus 1, with both exponents greater than one, has only finitely many integer solutions, and it gives an effective upper bound on those solutions, though Michel Langevin later computed a bound so large it offered little practical help. The theorem provided a strong impetus toward the eventual proof of Catalan's conjecture, which Preda Mihailescu completed by narrowing the possibilities down to the single known consecutive-power pair, 9 equals 8 plus 1. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/

Facts
Classification
Statement Form
Inequality 1
Proof Year
1976 2
Connections

Has Statement Form

Inequality, Concepts

In Branch

Source Tijdeman's theorem (Wikipedia)

Proved By

Source Tijdeman's theorem (Wikipedia)
Sources
1. Wikipedia: Tijdeman's theorem
WikipediaLead section, statement-form reference
Quote, Lead section, statement-form reference
In number theory, Tijdeman's theorem states that there are at most a finite number of consecutive powers.
View the Source
2. Tijdeman's theorem (Wikipedia)
  • The theorem was proven by Dutch number theorist Robert Tijdeman in 1976
  • In Branch: Number Theory, Lead sentence
    In number theory, Tijdeman's theorem states that there are at most a finite number of consecutive powers.
  • Proved By: Robert Tijdeman, Lead
    The theorem was proven by Dutch number theorist Robert Tijdeman in 1976, making use of Baker's method in transcendental number theory to give an effective upper bound for x,y,m,n.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.