# Searching for RH Counterexamples -- Search Strategies

DevFeed: [Searching for RH Counterexamples -- Search Strategies](<https://devfeed.tech/articles/searching-for-rh-counterexamples-search-strategies-40439.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2020/09/28/searching-for-rh-counterexamples-search-strategies/>)

Published: 2020-09-28T20:48:00Z

Content type: tutorial

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [Software Engineering](<https://devfeed.tech/topics/software-engineering.md>), [Algorithm](<https://devfeed.tech/topics/algorithm.md>), [Code](<https://devfeed.tech/topics/code.md>), [implementation](<https://devfeed.tech/topics/implementation.md>), [Testing](<https://devfeed.tech/topics/testing.md>)

Tags: [code](<https://devfeed.tech/tags/code.md>), [engineering](<https://devfeed.tech/tags/engineering.md>), [git](<https://devfeed.tech/tags/git.md>), [implementation](<https://devfeed.tech/tags/implementation.md>), [interface](<https://devfeed.tech/tags/interface.md>), [riemann-hypothesis](<https://devfeed.tech/tags/riemann-hypothesis.md>), [software](<https://devfeed.tech/tags/software.md>), [software-engineering](<https://devfeed.tech/tags/software-engineering.md>), [superabundant-numbers](<https://devfeed.tech/tags/superabundant-numbers.md>), [testing](<https://devfeed.tech/tags/testing.md>)

## AI overview

A tutorial episode that uses a search for counterexamples to the Riemann Hypothesis to teach software engineering. It develops a more efficient enumeration strategy based on superabundant numbers, prime exponents, and integer partitions, while connecting the implementation to testing, interfaces, and repository commits.

## Source excerpt

We're glibly searching for counterexamples to the Riemann Hypothesis, to trick you into learning about software engineering principles. In the first two articles we configured a testing framework and showed how to hide implementation choices behind an interface. Next, we'll improve the algorithm's core routine. As before, I'll link to specific git commits in the final code repository to show how the project evolves. Superabundant numbers A superabundant number $ n$ is one which has "maximal relative divisor sums" in the following sense: for all $ m < n$,