Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask
 
PerlMonks  

Re^2: OT: Finding Factor Closest To Square Root

by QM (Parson)
on Feb 20, 2005 at 07:00 UTC ( [id://432843]=note: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
    F(k*n) = L(k)*F(k*(n-1)) - ((-1)**k)*F(k*(n-2))
  2. or download this
    L(k) = F(n-1) + F(n+1)
  3. or download this
    F(k*n) = (F(n-1)+F(n+1))*F(k*(n-1)) 
          - ((-1)**k)*F(k*(n-2))
  4. or download this
    F(n**2) = (F(n-1)+F(n+1))*F(n*(n-1)) 
          - ((-1)**n)*F(n*(n-2))
  5. or download this
    F(2*k+1) = F(k+1)**2 + F(k)**2

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?

www.com | www.net | www.org
Node Status?
node history
Node Type: note [id://432843]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? • Last hour • Other CB clients
Other Users?
Others imbibing at the Monastery: (6)
As of 2024-04-19 11:00 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found