View part-1. note that by the möbius inversion we have \[Aa=ya*1\] By the dirichlet series : \[\sum_{n=1}^\infty \dfrac{Aa(n)}{n^s}=\left(\sum_{n=1}^\infty \dfrac{ya(n)}{n^s}\right)\left(\sum_{n=1}^\infty \dfrac{1}{n^s}\right)\] \[P(s)=\zeta(s)\sum_{n=1}^\infty \dfrac{ya(n)}{n^s}\] Prime zeta and zeta function being used.

If we can find \(\sum_{n=1}^\infty \dfrac{ya(n)}{n^s}\) then we can maybe have a new equation(or the old one) for the prime zeta. This concludes this note, in part three i will attempt the summation.

Feel free to leave your comments, and reshare if you enjoyed this.

No vote yet

1 vote

×

Problem Loading...

Note Loading...

Set Loading...

Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

Sort by:

TopNewestI think this sum will be very hard to evaluate because it is neither additive nor multiplicative. Here's my progress so far:

The sum can be expressed as

\[\sum _{ n=1 }^{ \infty } \frac { ya(n) }{ n^{ s } } =\sum _{ n=1 }^{ \infty } \frac { \mu \left( n \right) }{ n^{ s } } \left( \sum _{ p|n }^{ } \frac { 1 }{ p^{ s } } \right) -\sum _{ n=1 }^{ \infty } \frac { \mu \left( n \right) \omega \left( n \right) }{ n^{ s } } \]

For the second sum:

\[\mu \omega \ast 1=\begin{cases} 1\text{ if }n=p^a \\ 0 \text{ otherwise}\end{cases}\]

\[\zeta (s)\sum _{ n=1 }^{ \infty } \frac { \mu \left( n \right) \omega \left( n \right) }{ n^{ s } } =\sum _{ a\ge 1 }{ \sum _{ p }{ \frac { 1 }{ { p }^{ as } } } } =\sum _{ p }{ \frac { 1 }{ { p }^{ s }-1 } } \]

Log in to reply

I did a similar thing! I easily worked out summation#1 but got stuck at summation#2(i got something similar but it was school and i didnt have time and focus). Let me show you what i did in summation one:

we want it to be of the form \(p^2 n\) such that n is square free with no prime factor=p.then, \(Ya(p^{2}n)=\mu(n)\). so lets write the summation as \[\sum_{p=prime}\sum_{p\not\mid n} \dfrac{\mu(n)}{(p^2n)^s}=\sum_{p=prime}\dfrac{1}{p^{2s}}\left(\sum_{n=1}^\infty \dfrac{\mu(n)}{n^s}-\dfrac{1}{p}\sum_{n=1}^\infty \dfrac{\mu(n)}{n^s}\right)\\ =\sum_{p=prime}\left(\dfrac{1}{p^{2s}}-\dfrac{1}{p^{2s+1}}\right) \sum_{n=1}^\infty\dfrac{\mu(n)}{n^s}\\ =\dfrac{1}{\zeta(s)} (P(2s)-P(2s+1))\] We derive a beautiful result from this, i will perhaps include this in part 3.

Log in to reply

For the first sum, \(s=2\), I am getting \(-0.060460284021\) numercially, summing from \(n=1\) to \(n=100\).

However, with your formula, I am getting \(0.0250697720228\).

Mind if you elaborate on your first step?

Edit: Shouldn't the first equation be

\[\sum_{n=1}\sum_{p\not\mid n} \dfrac{\mu(n)}{(p^2n)^s}\]

Log in to reply

Log in to reply

Log in to reply

Log in to reply

Log in to reply

Log in to reply

\[\sum_{p=prime}\sum_{p\not\mid n} \dfrac{\mu(n)}{(p^2n)^s}\]

Should be

\[\sum_{n=1}\sum_{p\not\mid n} \dfrac{\mu(n)}{(p^2n)^s}\]

Log in to reply

Log in to reply

\[\sum_{n=prime}\sum_{p\not\mid n} \dfrac{\mu(n)}{(p^2n)^s}\]

?

Or else, what domain are you summing \(n\) over?

Log in to reply

Log in to reply

I am getting a different answer though'

\[\sum_{p=prime}\sum_{p\not\mid n} \dfrac{\mu(n)}{(p^2n)^s}=\sum_{p=prime}\dfrac{1}{p^{2s}}\left(\sum_{n=1}^\infty \dfrac{\mu(n)}{n^s}-\sum_{n=1}^\infty \dfrac{\mu(pn)}{(pn)^s}\right)=\sum_{p=prime}\dfrac{1}{p^{2s}}\left(\sum_{n=1}^\infty \dfrac{\mu(n)}{n^s}+\frac{1}{p^s}\sum_{n=1}^\infty \dfrac{\mu(n)}{(n)^s}\right)\]

\[=\frac{1}{\zeta(s)} \left(P(2s)+P(3s)\right)\]

Also, since

\[\sum _{ n=1 }^{ \infty } \frac { \mu \left( n \right) }{ n^{ s } } \left( \sum _{ p|n }^{ } \frac { 1 }{ p^{ s } } \right)=-\sum_{p=prime}\sum_{p\not\mid n} \dfrac{\mu(n)}{(p^2n)^s}\]

\[\sum _{ n=1 }^{ \infty } \frac { \mu \left( n \right) }{ n^{ s } } \left( \sum _{ p|n }^{ } \frac { 1 }{ p^{ s } } \right)=-\frac{1}{\zeta(s)} \left(P(3s)+P(2s)\right)\]

Though I am sure there is problems with this working too since it doesn't match numerically

Log in to reply

Log in to reply

\[\sum_{p\text{ is prime}}\sum_{p\not\mid n} \dfrac{\mu(n)}{(p^2n)^s}=\sum_{p\text{ is prime}}\dfrac{1}{p^{2s}}\left(\prod_{p_i \neq p,p_i \text{ is prime}}\left(1-\frac{1}{p_i^s}\right)\right)=\sum_{p\text{ is prime}}\dfrac{1}{p^{2s}}\left(\frac{\prod_{p_i\text{ is prime}}\left(1-\frac{1}{p_i^s}\right)}{1-\frac{1}{p^s}}\right)\]

\[=\sum_{p\text{ is prime}}\dfrac{1}{p^{2s}}\left(\frac{1}{\zeta(s)}\frac{1}{1-\frac{1}{p^s}}\right)=\frac{1}{\zeta(s)}\sum_{p}\frac{1}{p^{2s}(1-p^{-s})}\]

\[=\frac{1}{\zeta(s)}\left(\sum_p\frac{1}{p^s-1}-P(s)\right)\]

It matches numerically. This equation is disappointing... It gives neither insight into the original problem nor on the evaluation of the sum \(\sum_p\frac{1}{p^s-1}\)

Log in to reply

Log in to reply

Extra, might be useful (derived from conversation below):

\[\sum _{ n=1 }^{ \infty } \frac { \mu \left( n \right) }{ n^{ s } } \left( \sum _{ p|n }^{ } \frac { 1 }{ p^{ s } } \right)=\sum _{ n=1 }^{ \infty } \frac { \mu \left( n \right) }{ n^{ s } } \left( \sum _{ p|n }^{ } \frac { 1 }{ p^{ 2s } } \right)-\frac{P(2s)}{\zeta(s)}\]

Log in to reply

More extra, in case my numerical calculation is off: I used desmos to calculate \(\sum _{ p|n }^{ } \frac { 1 }{ p^{ s } }\)

\[\sum _{ p|n }^{ } \frac { 1 }{ p^{ s } }=\sum _{j=1}^n\frac{P_{rime}\left(j\right)}{j^s}\left(\frac{\left|\gcd \left(n,j\right)-1.1-\left|\gcd \left(n,j\right)-1.1\right|\right|}{2\gcd \left(n,j\right)-2.2}+1\right)\]

\[P_{rime}\left(x\right)=G\left(P\left(x\right)\right)\]

\[P\left(x\right)=\left(\sum _{k=1}^{\operatorname{floor}\left(x\right)}\gcd \left(x,k\right)\right)-\left(2x\right)\]

\[G\left(x\right)=\left(\frac{\left|x+0.9-\left|x+0.9\right|\right|}{-2x-1.8}+\frac{\left|-x-1.1-\left|-x-1.1\right|\right|}{2x+1.1\cdot 2}-1\right)\]

\[\mu{(n)}=\sum _{k=1}^{\operatorname{floor}\left(x\right)}\frac{\left|\gcd \left(k,\operatorname{floor}\left(x\right)\right)-1.1-\left|\gcd \left(k,\operatorname{floor}\left(x\right)\right)-1.1\right|\right|}{-2\gcd \left(k,\operatorname{floor}\left(x\right)\right)+2.2}\cos \left(\frac{2\pi k}{\operatorname{floor}\left(x\right)}\right)\]

Essentially, \(P_{rime}(x)\) outputs 1 if x is prime, and outputs 0 otherwise.

Log in to reply

I can't help but notice that the function's name is the letters in your name. :P. gtg, got to do hw.

Log in to reply

I have verified the above numerically with the method shown below.

Log in to reply