2000 character limit reached
On the Diophantine equation N X^2 + 2^L 3^M = Y^N
Published 23 Apr 2013 in math.NT | (1304.6413v2)
Abstract: We prove that the Diophantine equation N X2 + 2L 3M = YN has no solutions (N,X,Y,L,M) in positive integers with N > 1 and gcd(NX,Y) = 1, generalizing results of Luca, Wang and Wang, and Luca and Soydan. Our proofs use results of Bilu, Hanrot, and Voutier on defective Lehmer pairs.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.