Could a massive number break the Mertens Conjecture?
Mathematics often relies on patterns that appear unbreakable, until they aren't. This video explores the Mertens Conjecture and the staggering scale of the numbers required to potentially disprove it.
Dr. Holly Krieger examines the Mertens Conjecture, a mathematical proposition concerning the distribution of prime numbers. While the conjecture has held up under scrutiny, mathematicians search for a counterexample that would invalidate the theory.
The scale of this search is immense. While a counterexample is not expected to appear before approximately 10^10^23, it is mathematically established that the first instance of a failure cannot occur later than roughly 10^10^40.
Source: A Prime Surprise (Mertens Conjecture) - Numberphile
