## Re: qfbsolve

Expand Messages
• ... The Cornacchia-Smith algorithm is given by Henri Cohen as CCANT 1.5.2 and by also by Crandall and Pomerance 2.3.12. David
Message 1 of 5 , Oct 2, 2010
"Aldrich" <aldrich617@...> wrote:

> This is interesting material, but it does not really answer
> any of my questions. I'll check to see if any of references
> are more illuminating.

The Cornacchia-Smith algorithm is given by Henri Cohen
as CCANT 1.5.2 and by also by Crandall and Pomerance 2.3.12.

David
• ... Exercise: Find two pairs of positive integers (x,y) such that 5*x^2 + 5*x*y + y^2 = (137^137 + 1992)*(137^137 + 3464) Comment: This exercise may solved in
Message 2 of 5 , Oct 2, 2010

> The Cornacchia-Smith algorithm is given by Henri Cohen
> as CCANT 1.5.2 and by also by Crandall and Pomerance 2.3.12.

Exercise: Find two pairs of positive integers (x,y) such that
5*x^2 + 5*x*y + y^2 = (137^137 + 1992)*(137^137 + 3464)

Comment: This exercise may solved in 10 milliseconds.

David
• ... Looks like a special case, a put-up job as the posties say. quibble, quibble. a.
Message 3 of 5 , Oct 5, 2010
>
>
>
>
> > The Cornacchia-Smith algorithm is given by Henri Cohen
> > as CCANT 1.5.2 and by also by Crandall and Pomerance 2.3.12.
>
> Exercise: Find two pairs of positive integers (x,y) such that
> 5*x^2 + 5*x*y + y^2 = (137^137 + 1992)*(137^137 + 3464)
>
> Comment: This exercise may solved in 10 milliseconds.
>
> David
>

Looks like a special case, a put-up job as the posties
say. quibble, quibble.

a.
Your message has been successfully submitted and would be delivered to recipients shortly.