
Number Theory Number Theory Math Forum 
 LinkBack  Thread Tools  Display Modes 
April 5th, 2012, 09:39 AM  #1 
Senior Member Joined: Jan 2011 Posts: 560 Thanks: 1  Mertens function and prime counting function
Hi everybody, I want you to check this conjecture if it is true. I computed a sieved Mertens function on the basis that the composite number are valued to 1 and the prime number valued to zero. So the sum of the new function M'(n) will be : M'(n)=Sigma (mu(n)*c(n)) with c(n)=1 if c(n) is composite and c(n)=0 otherwise (prime) When n >3607 M'(n) is amost equal to pi(n) (+ or  3,6%) pi(n) is the prime counting function. mu(n) the mobius function I do not know if it holds after n>10000. If the conjecture is true then we can go forward to something more interesting. 
April 5th, 2012, 09:51 AM  #2 
Global Moderator Joined: Nov 2006 From: UTC 5 Posts: 16,046 Thanks: 938 Math Focus: Number theory, computational mathematics, combinatorics, FOM, symbolic logic, TCS, algorithms  Re: Mertens function and prime counting function
The conjecture is implied by (but does not itself imply) the Riemann Hypothesis. So yes, it's true, subject to the RH. It may be known to be true unconditionally; I'd have to see what the bestknown bounds on M are. 
April 5th, 2012, 10:22 AM  #3  
Senior Member Joined: Jan 2011 Posts: 560 Thanks: 1  Re: Mertens function and prime counting function Quote:
The Mertens function proposed do not take onto account the prime numbers. You compute the Mertens function ONLY for the composite numbers. Is M'(n) asymptotic to Pi(n)? That is my question. It has nothing to do with Riemann hypothesis. Nothing!  
April 5th, 2012, 11:27 AM  #4 
Senior Member Joined: Jan 2011 Posts: 560 Thanks: 1  Re: Mertens function and prime counting function
Between n=10000 and n=50000 M'(n)=pi(n)+c c= min 2.98% c= max 2.76% I can not check for n>50000. It maybe holds when n is infinite. I'm not sure. I need confirmation .... 
April 5th, 2012, 11:32 AM  #5 
Global Moderator Joined: Nov 2006 From: UTC 5 Posts: 16,046 Thanks: 938 Math Focus: Number theory, computational mathematics, combinatorics, FOM, symbolic logic, TCS, algorithms  Re: Mertens function and prime counting function
I answered your question. It doesn't bother me if you can't see the connection between it and the Riemann hypothesis.

April 5th, 2012, 11:38 AM  #6  
Senior Member Joined: Jan 2011 Posts: 560 Thanks: 1  Re: Mertens function and prime counting function Quote:
WHO ARE YOU????? IS YOUR ANSWER A GOD'S ANSWER??????????????????? YOU ARE A PROGRAMMER NOT A MATHEMATICIAN!!!! YOU KNOW NOTHING ABOUT MATHEMATICS SO STOP TREATING OTHERS WITH DEEP CONTEMPT. GOOD BYE!!!  
April 5th, 2012, 11:40 AM  #7 
Global Moderator Joined: Nov 2006 From: UTC 5 Posts: 16,046 Thanks: 938 Math Focus: Number theory, computational mathematics, combinatorics, FOM, symbolic logic, TCS, algorithms  Re: Mertens function and prime counting function
Do you really want me to spoil it? The proof is so simple that you could surely find it on your own.

April 5th, 2012, 11:50 AM  #8 
Senior Member Joined: Nov 2011 Posts: 595 Thanks: 16  Re: Mertens function and prime counting function
Hi Bogauss, When you talk about the behaviour of at infinite, it has always somehow a relation with RH. Ok , so here, si je ne m'abuse, you have is that true? So your M'(n) jumpsas M(n) everywhere but at the primes. Now if RH is TRUE then you have that (roughly because this is a bit stronger than RH but almost the same). So since it is known from the PNT that (sorry I don't manage to do a descent equivalent sign in Latex!) and since of course from the above condition (assuming RH) you have then you finally get and the relative precision here of is . For n=50000 it gives 4.8% 
April 5th, 2012, 04:09 PM  #9  
Global Moderator Joined: Nov 2006 From: UTC 5 Posts: 16,046 Thanks: 938 Math Focus: Number theory, computational mathematics, combinatorics, FOM, symbolic logic, TCS, algorithms  Re: Mertens function and prime counting function Quote:
 
April 5th, 2012, 04:11 PM  #10  
Global Moderator Joined: Nov 2006 From: UTC 5 Posts: 16,046 Thanks: 938 Math Focus: Number theory, computational mathematics, combinatorics, FOM, symbolic logic, TCS, algorithms  Re: Mertens function and prime counting function Quote:
So assuming the RH, this M' function varies as the primecounting function.  

Tags 
counting, function, mertens, prime 
Search tags for this page 
mertens function,prime counting function,latex prime counting function,is mertens function bounded above,fonction de Mobius
Click on a term to search for related topics.

Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Zeta function of prime numbers  fastandbulbous  Number Theory  5  March 17th, 2014 11:23 AM 
Question on prime counting function \pi  fafa  Number Theory  24  June 22nd, 2013 12:55 AM 
Lower Bound for the Prime Counting Function  guynamedluis  Number Theory  2  April 21st, 2012 12:48 PM 
Möbius function and prime numbers  rrronny  Number Theory  0  September 18th, 2009 06:16 AM 
relation of totient(Euler's) and prime counting function  fucktor  Number Theory  3  April 13th, 2009 11:34 AM 