2 ms·
How much CPU time and number theory do problems in that range generally require? Brute force search of 10^10 (with some automatic monitoring of how wide a rang
by lonelappde 7y ago
How much CPU time and number theory do problems in that range generally require?
Brute force search of 10^10 (with some automatic monitoring of how wide a range of 'm' to scan at each candidate) is a lot but not a lot of a lot, if you code in a CPU efficient language and maybe use parallel computation and are willing to wait a while.
- gordaco 7y agoThe difficulty and the required run time vary a lot starting from problem 150 or so. This one seems particularly difficult (it's rated at 85% difficulty, which is also the highest I've managed to solve). The problem here is that the search space is not 10^10, but higher, since if you iterate over k you don't know which values of m or n need to be tested. For m=1 it's clear that you can just use Pythagorean triples, but for bigger values I don't know if there is a reliable procedure to generate solutions.