Message Boards Message Boards

How does Reduce solve Bivariate Diophantine quadratic equations?

Posted 7 years ago
POSTED BY: man t
2 Replies
Posted 7 years ago

Hi Frank,

Thanks for the link; it's very informative.

I found that in this particular scenario (i.e., when determinant is perfect square), Reduce factorizes the RHS which, in this case, is the prime number itself (2^n - 1). Since I'm using this equation to factorize the prime number, I can't use this algorithm.

I was hoping something similar to the solution to Pell's equation which indeed is used by Reduce in other cases (when determinant is not a perfect square).

If you are aware of any other algo to solve this equation, please do let me know.

Accept my gratitude in advance.

manoj

POSTED BY: man t
Reply to this discussion
Community posts can be styled and formatted using the Markdown syntax.
Reply Preview
Attachments
Remove
or Discard

Group Abstract Group Abstract