Join the DZone community and get the full member experience.
Join For Free
Learn about how to rapidly iterate data applications, while reusing existing code and leveraging open source technologies, brought to you in partnership with Exaptive.
The famous Riemann hypothesis is equivalent to the following not-so-famous conjecture:
For every N ≥ 100, | log( lcm(1, 2, …, N) ) – N | ≤ 2 log(N) √N.
Here “lcm” stands for “least common multiple” and “log” means natural log.
Source: Andrew Granville’s chapter on analytic number theory in Princeton Companion to Mathematics.
The Big Data Zone is brought to you in partnership with Exaptive. Learn how Rapid Application Development powers business.
Published at DZone with permission of
, DZone MVB
Opinions expressed by DZone contributors are their own.