. The search targets "witness values"—ratios of the divisor sum to the upper bound—where a value >1is greater than 1 would disprove RH.
: By plotting the best witness values found so far, Kun uses logarithmic models to estimate where a counterexample might actually exist. Current data suggests that if a counterexample exists, it would likely have between 1,000 and 10,000 prime factors . it would likely have between 1
: Even with specialized enumeration, the search space grows exponentially. The post highlights the necessity of using unbounded integer arithmetic (often implemented in Python as a "ripple-carry" style system) because the numbers being tested quickly exceed 64-bit limits. Searching for RH Counterexamples — Exploring Data 000 and 10