I'm pretty sure that Cornacchia's algorithm is part of Pari (though I
don't remember what the function is called).
Victor
On Feb 9, 5:54 am, Alasdair wrote:
> Do a google search on "Cornacchia's algorithm". Shouldn't be too hard
> to program in Sage (if it isn't there already).
>
> Alasdair
>
>
Alasdair, Thanks!
On 9 feb, 11:54, Alasdair wrote:
> Do a google search on "Cornacchia's algorithm". Shouldn't be too hard
> to program in Sage (if it isn't there already).
>
> Alasdair
>
> On Feb 8, 4:07 pm, Rolandb wrote:
>
> > Thanks William,
>
> > Actually I try to solve it for different x
Do a google search on "Cornacchia's algorithm". Shouldn't be too hard
to program in Sage (if it isn't there already).
Alasdair
On Feb 8, 4:07 pm, Rolandb wrote:
> Thanks William,
>
> Actually I try to solve it for different x and n. A typical example of
> (x,n) is:
>
> %time
> bruteforce(7^10*2
Thanks William,
Actually I try to solve it for different x and n. A typical example of
(x,n) is:
%time
bruteforce(7^10*29^5,973)
[(3899224, 2437015)]
CPU time: 25.88 s, Wall time: 26.12 s
Roland
On 7 feb, 22:29, William Stein wrote:
> On Sun, Feb 7, 2010 at 12:35 PM, Rolandb wrote:
> > Hi,
>
