Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things
 
PerlMonks  

Re: [Study]: Searching for square roots

by jimbojones (Friar)
on Nov 14, 2006 at 14:07 UTC ( [id://583966]=note: print w/replies, xml ) Need Help??


in reply to [Study]: Searching for square roots

Hi,

I think your problem is in your assumption of the maximum possible value for the square root of numbers in the range of 0 to 1.

I managed to fix your code with one line to handle the 0.5 case, but I'll leave it to you to find it.

a number between 0 and 1 can be written as 1/x, where x > 1. Then the sqrt(1/x) is sqrt(1)/sqrt(x) = 1/sqrt(x). Now sqrt(x) is < x, so the max value of sqrt(1/x) is 1/x.
- j

  • Comment on Re: [Study]: Searching for square roots

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://583966]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others learning in the Monastery: (5)
As of 2024-04-19 02:07 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found