Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Number of solutions to a special type of unit equations in two unknowns, II

Takafumi Miyazaki, István Pink

Abstract

This paper contributes to the conjecture of R. Scott and R. Styer which asserts that for any fixed relatively prime positive integers $a,b$ and $c$ all greater than 1 there is at most one solution to the equation $a^x+b^y=c^z$ in positive integers $x,y$ and $z$, except for specific cases. The fundamental result proves the conjecture under some congruence condition modulo $c$ on $a$ and $b$. As applications the conjecture is confirmed to be true if $c$ takes some small values including the Fermat primes found so far, and in particular this provides an analytic proof of the celebrated theorem of Scott [R. Scott, On the equations $p^x-b^y=c$ and $a^x+b^y=c^z$, J. Number Theory 44(1993), no.2, 153-165] solving the conjecture for $c=2$ in a purely algebraic manner. The method can be generalized for smaller modulus cases, and it turns out that the conjecture holds true for infinitely many specific values of $c$ not being perfect powers. The main novelty is to apply a special type of the $p$-adic analogue to Baker's theory on linear forms in logarithms via a certain divisibility relation arising from the existence of two hypothetical solutions to the equation. The other tools include Baker's theory in the complex case and its non-Archimedean analogue for number fields together with various elementary arguments through rational and quadratic numbers, and extensive computation.

Number of solutions to a special type of unit equations in two unknowns, II

Abstract

This paper contributes to the conjecture of R. Scott and R. Styer which asserts that for any fixed relatively prime positive integers and all greater than 1 there is at most one solution to the equation in positive integers and , except for specific cases. The fundamental result proves the conjecture under some congruence condition modulo on and . As applications the conjecture is confirmed to be true if takes some small values including the Fermat primes found so far, and in particular this provides an analytic proof of the celebrated theorem of Scott [R. Scott, On the equations and , J. Number Theory 44(1993), no.2, 153-165] solving the conjecture for in a purely algebraic manner. The method can be generalized for smaller modulus cases, and it turns out that the conjecture holds true for infinitely many specific values of not being perfect powers. The main novelty is to apply a special type of the -adic analogue to Baker's theory on linear forms in logarithms via a certain divisibility relation arising from the existence of two hypothetical solutions to the equation. The other tools include Baker's theory in the complex case and its non-Archimedean analogue for number fields together with various elementary arguments through rational and quadratic numbers, and extensive computation.
Paper Structure (16 sections, 56 theorems, 225 equations)

This paper contains 16 sections, 56 theorems, 225 equations.

Table of Contents

  1. Introduction
  2. Reducing to weak forms
  3. Preliminaries for Theorem \ref{['th1']}
  4. Upper bounds for solutions
  5. Proof of Theorem \ref{['th1']}
  6. Case where $x>1$ or $y>1$
  7. Case where $c \notin \{2,3,5,6,7,10,14\}$
  8. Case where $c \in \{2,3,5,6,7,10,14\}$
  9. Case where $x=1$ and $y=1$
  10. Case where $Z \ge 2z$
  11. Case where $c \not \in \{2,3,5,6,7,10,14\}$
  12. Case where $c \in \{2,3,5,6,7,10,14\}$
  13. Proof of Theorem \ref{['th2']}
  14. Preliminaries for Theorem \ref{['th3']}
  15. Proof of Theorem \ref{['th3']}
  16. ...and 1 more sections

Key Result

Proposition 1.1

There are at most two solutions to equation $pillai.$

Theorems & Definitions (95)

  • Proposition 1.1
  • Proposition 1.2
  • Conjecture 1
  • Definition 1
  • Theorem 1
  • Corollary 1
  • Theorem 2
  • Corollary 2
  • Corollary 3
  • Theorem 3
  • ...and 85 more