Consider the diophantine equation -

\( x^3 + y^4 = 7 \)

The solution which was given in the book had argument starting like - "Consider the residue class of \(x^3\) modulo 13"

From where does one get motivation to check the residue class of that particular modulo?

Easy ones can be seen directly like checking residue class of modulo 3 in case of squares, modulo 7 in case of cubes, but what about others?

And yes, is there any list available of frequently used residue classes of modulo x? I think that might help many students. :)

## Comments

Sort by:

TopNewestYou are looking for prime numbers that have a lot of cube roots and fourth roots of unity. Modulo \(13\), there are \(3\) cube roots of unity (\(1,3,9\)) and \(4\) fourth roots of unity (\(1,5,8,12\)), and so there are exactly \(4\) cubes and \(3\) fourth powers modulo \(13\). This cuts down the number of possible residues of \(x^3+y^4\) down to size (and, specifically, misses \(7\), even if that is the only residue that gets missed out). – Mark Hennings · 3 years, 8 months ago

Log in to reply

And if 13 didn't work, what would be the next number we try, given the same motivation? – Calvin Lin Staff · 3 years, 8 months ago

Log in to reply

– Mark Hennings · 3 years, 8 months ago

\(37\), being the next prime of the form \(12n+1\).Log in to reply

I think for cubes always check modulo 7,9, and 13 because the cubes leave very less numbers of distinct remainders modulo these numbers. – Kishan K · 3 years, 8 months ago

Log in to reply