Mertens Conjecture

Cumulative sums of the Möbius mu function—which is essentially the parity of the number of factors in an integer, or zero if factors are repeated—follow an approximation to a random walk. The Mertens Conjecture from 1897 stated that this walk would always stay within But in 1985 it was proved that this is not so—although it is not known at what value of the first exception occurs.

 
Powered by Wolfram Mathematica
Give us your feedback
Give us your feedback

Source page:




 often  occasionally  never

Note: Please do not include anything you consider confidential or proprietary. Your message and contact information may be shared with the author of any specific Demonstration for which you give feedback, but will not otherwise be published or distributed.
Privacy Policy »

Note: To run this Demonstration you need the free
Mathematica Player
or Mathematica 7+
Download or upgrade to Mathematica Player 7
I already have Mathematica Player or Mathematica 7+