in reply to Re: OT: Finding Factor Closest To Square Root
in thread OT: Finding Factor Closest To Square Root
Although exact solutions are exponential, heuristics can sometimes generate good answers with minimal effort. One example of a heuristic that might work well is the greedy heuristic. To fill a box of size log(N)/2, put the largest factor into the box. Then put the next largest factor that still fits in the box and insert it. Keep doing this until no more factors fit.
The above will get you the largest factor <= sqrt(N). To get the smallest factor >= sqrt(N), put all the factors in a box, and take them out again largest to smallest, until no more can be taken out. Finally, comapre the two answers to find the closest.
Update: fixed a typo.
-Mark
|
---|
Replies are listed 'Best First'. | |
---|---|
Re^3: OT: Finding Factor Closest To Square Root
by QM (Parson) on Feb 20, 2005 at 05:33 UTC | |
by kvale (Monsignor) on Feb 20, 2005 at 07:02 UTC |