News for hackers. Stuff that matters.
Re:The Easiest Hard Problem (2002) by phkahler on Friday August 07, 2015 @02:14PM (#10024000)
>> It's an interesting heuristic, but I think your limitation that it be less than the square of the Nth prime is a case of overfitting.

Maybe, but the result is obviously guaranteed to not be a multiple of any of the N primes. Since the smallest factor has to be greater than N, that means prime for up to N^2 (or (N+1)^2 I suppose).

Re:The Easiest Hard Problem (2002) by phkahler on Friday August 07, 2015 @04:18PM (#10024746)
Confused N for P_n in that.