I've been thinking about this for a while and I just wanted somebody to show me where my proof becomes faulty. This was my attempt to find an asymptotic formula for Mertens' function (the sum of the Mobius function). Oh, and if you aren't clear of my reasoning behind something, just ask...and in case it isn't obvious, I used p(adsbygoogle = window.adsbygoogle || []).push({}); _{n}to denote the nth prime number. Sorry about the cheap scan...I don't know how to use Latex...

http://home.comcast.net/~shane_stephenson/mertens1.jpg [Broken]

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Asymptotic formula for Mertens function

Loading...

Similar Threads for Asymptotic formula Mertens | Date |
---|---|

Asymptotic formula for the sum of log(p)/p | Jan 19, 2012 |

Asymptotic expansion for Mertens function | Feb 20, 2008 |

Proving asymptotics to sequences | Mar 21, 2007 |

Primorial: asymptotics and bounds | Sep 14, 2006 |

A trick to proof RH using asymptotic Analysis | Jun 5, 2006 |

**Physics Forums - The Fusion of Science and Community**