The modular method is a fantastic tool to solve families of Diophantine equations with a varying exponent, but it often fails for small values of the exponent. For example, the Fermat-type equation x13+y13=3zp has been solved for all p≠7. In this talk we will discuss how a combination of a unit sieve, modular method, level raising, computations of systems of eigenvalues modulo 7 and results for reducibility of certain Galois representations, allows to solve the missing case p=7.
No hi ha fitxers per descarregar