Re^5: Closest factor less than sqrt(N) [proof]

by hv (Prior)

on Feb 21, 2005 at 09:45 UTC ( [id://432985]=note: print w/replies, xml )

Need Help??

Here's an easier way: take n = m^2, and a factor greater than the square root m + d, then the other factor is:

  m^2/(m + d) = m - dm/(m + d)
              = m - d + d^2/(m + d)
[download]

Now d^2/(m + d) is greater than zero, so the cofactor is greater than m - d and hence closer to the square root.

Hugo

Comment on Re^5: Closest factor less than sqrt(N) [proof] Select or Download Code

Domain Nodelet^?

Node Status^?

node history
Node Type: note [id://432985]
help

Chatterbox^?

How do I use this? • Last hour • Other CB clients

Other Users^?

Others musing on the Monastery: (6)

As of 2024-04-16 17:02 GMT

Sections^?

Information^?

Find Nodes^?

Leftovers^?

Voting Booth^?

No recent polls found