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.

Let $a,b\in\mathbb Z$ be squarefree with $a>0$. Suppose that I know that there exist $(0,0,0)\neq (x,y,z) \in \mathbb Z^3$ s.t. $x^2-by^2-az^2=0$. Is there any known algorithm to find any such a triple?

share|improve this question
Maybe en.wikipedia.org/wiki/Integer_relation_algorithm but you might not get squares. –  xavierm02 Sep 2 '13 at 11:55

1 Answer 1

Hint: Since your equation is homogeneous, an integer solution can be interpreted as a rational point on the corresponding projective curve. Note that this curve has genus $0$.

Useful link: http://www.risc.jku.at/publications/download/risc_1355/Rational%20Points%20on%20Conics.pdf

In particular, you can use Magma to solve your problem, here is an example.


Try this code in the magma calculator (http://magma.maths.usyd.edu.au/calc/) and find that $(50,9,5)$ is an integer solution to $x^2-25y^5-19z^2=0.$

share|improve this answer

Your Answer


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

Not the answer you're looking for? Browse other questions tagged or ask your own question.