2000 character limit reached
On the generalized Fermat equation
Published 14 Oct 2025 in math.NT | (2510.12092v1)
Abstract: Let . We study the generalized Fermat equation [x{13}+y{13}=zn, \quad x,y,z \in \mathbb{Z}, \quad \gcd(x,y,z)=1.] Using a combination of techniques, including the modular method, classical descent, unit sieves, and Chabauty and Mordell--Weil sieve methods over number fields, we show that for all its solutions are trivial, i.e. satisfy . Under the assumption of GRH, we also show that for there are only trivial solutions. Furthermore, we provide partial results towards solving the equation for general , in particular that any solution with is trivial.
Paper Prompts
Sign up for free to create and run prompts on this paper.