Searching For Rh Counterexamples Вђ” Exploring Data Вђ“ Math В€© Programming -

. The search targets "witness values"—ratios of the divisor sum to the upper bound—where a value >1is greater than 1 would disprove RH.

: To narrow the search space, the exploration looks for patterns in the prime factorizations of high-performing witness values. This involves jumping ahead in the superabundant number enumeration to specific "level sets" that are more likely to yield extreme values. it would likely have between 1

: 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 . 000 and 10