3 ms·
AFAICT, the best strategy is to get each factor to 2 as quickly as possible. At least in the area of 10^15, it takes about N to click on 2x10^i and 4N to click
by bryanlarsen 12y ago
AFAICT, the best strategy is to get each factor to 2 as quickly as possible.
At least in the area of 10^15, it takes about N to click on 2x10^i and 4N to click on 1x10^(i+1). Since clicking on 2x10^i approximately halves the time to get to 1x10^(i+1), then it takes N + 4N/2 to get to 1x10^(i+1) if you click on 2x10^i first. 3x10^i is an additional 3N. N + 3N/2 + 4N/3 = 3.8N.