Diophantine approximation and the equation (a2 c xk - 1)(b2 c yk - 1) = (abc zk - 1)2
Abstract
We prove that the Diophantine equation (a2 c xk - 1)(b2 c yk - 1) = (abc zk - 1)2 has no solutions in positive integers with x, y, z > 1, k ≥ 7 and a2xk ≠ b2yk.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.