Möbius function and prime numbers

  • Thread starter rrronny
  • Start date
  • #1
7
0
Let [tex]p_i[/tex] denote the i-th prime number. Prove or disprove that:
[tex]1)\quad \displaystyle S(n) : = \sum_{i = 1}^n \mu(p_i + p_{i + 1}) < 0 \quad \forall n \in \mathbb{N}_0 : = \left\{1,2,3,...\right\};[/tex]
[tex] 2)\quad \displaystyle S(n) \sim C \frac {n}{\log{n}},[/tex]
where [tex]C[/tex] is a negative real constant.

In the graph attached are represended the functions [tex]-S(n)[/tex] (red)
and [tex]f (x) : = 0.454353 * x / \log{x}[/tex] (green), with [tex]n,x \in [1, 3 \cdot 10^6].[/tex]
 

Attachments

  • Plot_Möbius.jpg
    Plot_Möbius.jpg
    43.9 KB · Views: 339

Answers and Replies

  • #2
CRGreathouse
Science Advisor
Homework Helper
2,824
0
The pattern holds up to 4e9 - 21, where S(189961812) = -4681611, which suggests C ~= -0.46979.

But somehow with the failure of the Mertens conjecture I would expect this one to fail eventually.
 
  • #3
7
0
Hi CRGreathouse, thanks for your reply.
Just one question: how is the trend of [tex]C(n)[/tex] in the variation of [tex]n[/tex]?
 

Related Threads on Möbius function and prime numbers

  • Last Post
Replies
11
Views
3K
  • Last Post
Replies
4
Views
3K
  • Last Post
Replies
6
Views
3K
  • Last Post
Replies
4
Views
5K
  • Last Post
Replies
1
Views
2K
  • Last Post
2
Replies
44
Views
11K
  • Last Post
Replies
24
Views
6K
  • Last Post
2
Replies
28
Views
7K
  • Last Post
Replies
3
Views
5K
Top