Correcting the link:
http://acm.uva.es/p/v100/10023.html
2007/8/12, kuper <[EMAIL PROTECTED]>:
>
>
> there is the same problem on the on-line judge (http://online-
> judge.uva.es/p/v100/10023.html)
>
>
> >
>
--~--~-~--~~~---~--~~
You received this message because y
there is the same problem on the on-line judge (http://online-
judge.uva.es/p/v100/10023.html)
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@
How about using newton raphson method ?
On 8/10/07, Alfredo Cruz <[EMAIL PROTECTED]> wrote:
>
>
> pradeep reguri wrote:
> > hi friends can any one help in finding square root of a big algebraic
> > number of 1000 digits
> >
> > >
> >
> >
> I think that maybe Newton method could help you... But
pradeep reguri wrote:
> hi friends can any one help in finding square root of a big algebraic
> number of 1000 digits
>
> >
>
>
I think that maybe Newton method could help you... But if you want to
see serious Numerical Analysis algorithms and their implementation you
should
check SciLab'
For how many 1000 digits number you need to find the square root?
How about implementing a program to calculate the square root based on high
school maths?
regards
Arunachalam.
On 8/9/07, pradeep reguri <[EMAIL PROTECTED]> wrote:
>
>
> hi friends can any one help in finding square root of a big
