consider the arithmetic function
Aa(n)={10,n is prime,otherwise
Read dirichlet convolution and dirichlet series . we have
ya=μ∗Aa=p∣n∑μ(pn) This is because Aa disappears over non-primes. Consider the case
n is square free.then μ(pn)=−μ(n) and when we add over all prime factors we get −ω(n)μ(n).
Not squarefree but only one prime factor is squared. then it's möbius will be zero everywhere except the repeated prime factor. so we get (−1)ω(n).
more than one prime factor is squared. then it will simply be zero.
so:
ya(n)=⎩⎪⎨⎪⎧−k(−1)k(−1)k0,n=p1p2p3...pk,n=p1p2p3...pk−1pk2,otherwise
I will continue this in part 2. Reshare if you enjoyed this.
btw ω(n) is the nmber of prime factors of n and μ(n) is the möbius function
part-2
#Calculus
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
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
I am writing part two now, where i will show the connection to prime zeta.