Timeline for Efficiently finding the largest divisor of N less than sqrt(N)
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 28, 2023 at 14:45 | comment | added | Mats Granvik | @Mark These two Mathematica programs: chat.stackexchange.com/transcript/message/63872730#63872730 find the divisors of 9 and 12 respectively, as subsets of the solutions to a knapsack problem. | |
| Apr 6, 2022 at 13:06 | comment | added | Max Alekseyev | A related question about practical issues with ILP solvers for this problem: mathoverflow.net/q/419722 | |
| Mar 22, 2022 at 17:08 | comment | added | Max | I have tested this approach to compute this sequence (upper/lower central divisior) for the primorials, it's not practicable beyond ~25 or 30. The epsilon must be extremely small to be only close to the exact result, and computation time explodes. | |
| Mar 18, 2022 at 3:16 | comment | added | Charles | This is great information, thank you! I am looking for an exact answer, though. | |
| Mar 18, 2022 at 3:14 | history | answered | Mark Schultz-Wu | CC BY-SA 4.0 |