n = 2 ∑ ∞ n 2 ln ( ς ( n ) )
Let ς ( n ) be the greatest squarefree divisor of n . For example, ς ( 8 ) = 2 , ς ( 1 0 ) = 1 0 , ς ( 1 2 ) = 6 . Evaluate the summation above.
Give your answer to 3 decimal places.
You may use a calculator such as WolframAlpha for the final calculation.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Nice application of the Dirichlet convolution to calculate such sums. One could also see it directly, by asking "When does the term ln p appear in the numerator?" and realize that we collect terms of the form
p 2 1 + ( 2 p ) 2 1 + ( 3 p ) 2 1 + …
It is slightly unfortunate that there isn't a nice way to deal with ∑ p 2 ln p , which is essentially the equivalent problem.
As an aside, my favorite proof of the convergence of ∑ n 2 ln n is using the integral test. (Can you evaluate ∫ n 2 ln n ? It shows that the value is bounded above by 1.
In fact, this works for n a ln n , where a > 1 .
i reached the part where this was 6 π 2 p = p r i m e ∑ p 2 ln ( p ) then it became 6 π 2 n = 1 ∑ ∞ n 2 Λ ( n ) by its connection to zeta function we have it equal to − 6 π 2 ∗ ζ ( 2 ) ζ ′ ( 2 ) ≈ . 9 3 7 can you help me @Julian Poon
Log in to reply
Why would turn into Λ ( n ) since Λ ( p a ) = p instead of 0 ?
Log in to reply
oh! thats where stuff went wrong! damn i knew i should have used dirtchlet... nice solution btw.
Nice! Exactly as intended. In fact, the closed form is − ζ ( 2 ) P ′ ( 2 ) where P is the prime zeta function, which makes it easier to calculate.
Log in to reply
Is there a way of calculating P'(x) with Mr. wolf? Because I just used
− ζ ( 2 ) ζ ′ ( 2 ) + k = 2 ∑ ∞ ζ ( 2 k ) ζ ′ ( 2 k )
EDIT: Oh wait, just type d/dx PrimeZetaP(x), x=2
1 2 3 |
|
And yet here we have
0 . 8 1 1 0 8 … ≈ 6 π 2 p prime , 2 ≤ p ≤ 1 0 0 0 0 0 ∑ p 2 ln p < 6 π 2 p prime ∑ p 2 ln p = p prime ∑ k = 1 ∑ ∞ ( p k ) 2 ln p = n = 2 ∑ ∞ p prime , p ∣ n ∑ n 2 ln p = n = 2 ∑ ∞ n 2 ln ς ( n ) ≈ 0 . 8 0 5 7 6 …
Considering you multiplied with 6 π 2 like me, I just assume you made a mistake somewhere in computing the one that gave you 0 . 4 8 9 … .
Log in to reply
Wait, I'm confused, isn't the sum ∑ n 2 ln ς ( n ) rather than ∑ n 2 ς ( n ) ? Also, the true value of ∑ p p 2 ln p is -0.493091 if I'm not wrong, so Julian made an underestimation.
Log in to reply
Sorry, that last line was a typo. It is indeed ∑ n 2 ln ς ( n ) ; I just typed incorrectly.
I think Wolfram Alpha made an understatement in calculating
i just realised i would have gotten this right if i "numerically" calculated the last part instead of using zeta function... damn.
Problem Loading...
Note Loading...
Set Loading...
Convergence proof:
n > 1 ∑ n 2 ln ς ( n ) < n > 1 ∑ n 2 ln n < n > 1 ∑ n 2 n = ζ ( 1 . 5 )
Of which ζ ( 1 . 5 ) is known to converge.
First thing to notice is that
ln ς ( n ) = p ∣ n ∑ ln p = ∣ μ ∣ Λ ∗ 1 ( n )
Where μ is the Mobius function , Λ is the Von Mangoldt function and f ∗ g is the Dirichlet convolution.
So the sum that we are finding is the Dirichlet series :
D G ( ∣ μ ∣ Λ ∗ 1 ; 2 )
Using the multiplication of Dirichlet series, D G ( f ; s ) D G ( g ; s ) = D G ( f ∗ g ; s )
D G ( ∣ μ ∣ Λ ∗ 1 ; 2 ) = D G ( ∣ μ ∣ Λ ; 2 ) × 6 π 2
Calculating numerically,
D G ( ∣ μ ∣ Λ ; 2 ) = p is prime ∑ p 2 ln p = − 0 . 4 9 3 0 9 1 . . .
Hence the sum is equal to − 0 . 4 9 3 0 9 1 . . . ⋅ 6 π 2 = 0 . 8 1 1 1 0 . . .