Möbius Function - Merten's conjecture

Loading...

Sign in or sign up now!
Alert icon
Upgrade to the latest Flash Player for improved playback performance. Upgrade now or more info.
2,112
Loading...
Alert icon
Sign in or sign up now!
Alert icon

Uploaded by on Sep 4, 2007

The Mertens function is simply the cumulative sum of the Möbius function. There a whole line of conjectures in its history. We shall briefly look at them here.

Check out www.gaussianmath.com for more mysterious math topics and calculus related content.

Category:

People & Blogs

Tags:

License:

Standard YouTube License

  • likes, 1 dislikes

Link to this comment:

Share to:
see all

All Comments (11)

Sign In or Sign Up now to post a comment!
  • @Blackmaildesigns at least you are honest with yourself. i don't understand any of this.

  • ah apologies. I didn't watch the video pertaining to Merten's Function.

  • Pretty fascinating stuff. You've impressed me. However: why isn't the sum of the Möbius function 0?

  • It must suck for people like this guy to have to live in a world with people like, well, me, who probably think he is just talking nonsense. I understand from your comments that he is brilliant. But it's truly amazing to go through life as a pretty bright guy and yet be so bewildered by another human's intellect.

    Congratulations to you all - respect.

  • wow . . . what? O_O

  • Additionally, a certain assertion on the Mertens function's rate of growth is exactly equivalent to the Riemann Hypothesis.

    Finally, one of my own observations (which is easily derived from Ramanujan's sum for the Mobius function) is that the Mertens function is exactly equal to the sum of the cosine function at points corresponding to fractions of one wavelength that are in the Farey sequence of order n.

  • This is a great video. Just in case anyone was wondering, the Mobius function mu(n) is defined in this way:

    It is equal to 0 if n is divisible by a perfect square greater than 1.

    It is equal to 1 if n is the product of an even number of distinct prime numbers.

    (Note that mu(1) = 1)

    It is equal to -1 if n is the product of an odd number of distinct prime numbers.

  • i get it now thanks

  • cause he's not graphing the absolute value, so if abs(f)<1 then -1<f<1 .

  • this is very interesting, i have a question still, if you use the absolute values of the function, shouldn't the graphic be only above 0?

Loading...

Alert icon
0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more