Photo from archive.org
Abstract Let a , b , c be fixed coprime positive integers with min { a , b , c } > 1 . In this paper, combining the… Click to show full abstract
Abstract Let a , b , c be fixed coprime positive integers with min { a , b , c } > 1 . In this paper, combining the Gel'fond–Baker method with an elementary approach, we prove that if max { a , b , c } > 5 × 10 27 , then the equation a x + b y = c z has at most three positive integer solutions ( x , y , z ) .
Keywords:
bound number;
solutions ternary;
number;
upper bound;
number solutions;
ternary purely
Journal Title: Journal of Number Theory
Year Published: 2018
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Journal of Number Theory
Year Published: 2018
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!