Applying results on linear forms in p-adic logarithms, we prove that if (x,y,z) is a positive integer solution to the equation with gcd(x,y) = 1 then (x,y,z) = (2,1,k), (3,2,k), k ≥ 1 if c = 1, and either , k ≥ 1 or if c ≥ 2.
We discuss the equation in which a, b, and c are non-zero relatively prime integers, p is an odd prime number, and α is a positive integer. The technique used to prove Fermat’s Last Theorem shows that the equation has no solutions with α < 1 or b even. When α=1 and b is odd, there are the two trivial solutions (±1, ∓ 1, ±1). In 1952, Dénes conjectured that these are the only ones. Using methods of Darmon, we prove this conjecture for p≡ 1 mod 4.
We study coprime integer solutions to the equation a³ + b³ⁿ = c² using Galois representations and modular forms. This case represents perhaps the last natural family of generalized Fermat equations descended from spherical cases which is amenable to resolution using the so-called modular method. Our techniques involve an elaborate combination of ingredients, ranging from ℚ-curves and a delicate multi-Frey approach, to appeal to intricate image of inertia arguments.
In a recent paper, Freitas and Siksek proved an asymptotic version of Fermat’s Last Theorem for many totally real fields. We prove an extension of their result to generalized Fermat equations of the form , where A, B, C are odd integers belonging to a totally real field.