Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

S.E board! This is a Diophantine equations problem, which is so interesting one can do by plugging the suitable values in unknown. When it comes for finding set of all solutions is may be tough. I would like to learn to find all solutions of this equations with the help of m.s.e.

If $t \geq 3$ be prime and consider $y^2$ - $x^t$ = $k$ for some fixed number is $k$ from set of integers. This equation has a solution in $Z_P$ for all $p$ if and only if it has one for primes $p$ of the form $p = 2qt + 1$ with $1 $$\leqslant$$ q $$\leqslant$$ (t-3)/2$

Please prove the validity of the above cited statement!

Advanced thanks.

share|improve this question

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.