Papers
Topics
Authors
Recent
Search
2000 character limit reached

Diophantine approximation and the equation (a^2 c x^k - 1)(b^2 c y^k - 1) = (abc z^k - 1)^2

Published 7 Nov 2014 in math.NT | (1411.1984v1)

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 \geq 7 and a2xk \neq b2yk.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.