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.

This is my another question on Diophantine equations. Prove the following great and special problem.

Let $D$ and $k$ be positive integers and $p$ be a prime number such that $gcd(D, kp) = 1$. Prove that there is an absolute constant $C$ such that the Diophantine equation $x^2 + D = kp^n$ has at most $C$ solutions $(x, n)$. Also prove that $x^2 + 119 = 15\cdot2^n$ has only six solutions.

share|improve this question
A little more information, please. How do you know there is an absolute constant $C$ such that $x^2+D=kp^n$ has at most $C$ solutions? How do you know $x^2+119=15\cdot2^n$ has only six solutions? And what is great and special about these problems? –  Gerry Myerson Mar 23 '12 at 5:41

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.