Let, S = 1 − 2 4 1 − 3 4 1 + 4 4 1 − 5 4 1 + 6 4 1 − 7 4 1 − 8 4 1 + 9 4 1 + . . . . . . . . . + 1 5 4 1 + 1 6 4 1 − 1 7 4 1 − 1 8 4 1 − . . . . . . . . + 1 0 0 4 1 − 1 0 1 4 1 − 1 0 2 4 1 − 1 0 3 4 1 + 1 0 4 4 1 − . . . . . . . . .
Say the answer S = c π a . Find the value of a + c .
S = ∑ n 4 ( − 1 ) λ ( n ) . ( − 1 ) λ ( ⋅ ) is the Liouville function.
Obviously the series seems to be unpatterned ,but the pattern is hide in the series and the Title .
Hint: All prime~n have -(minus) before them. 1 5 = 3 ∗ 5 ; 1 0 0 = 2 ∗ 2 ∗ 5 ∗ 5 .
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.
Slightly different approach:
Firstly, I define λ ( n ) = ( − 1 ) Ω ( n ) to be Liouville function (as defined here ). Your definition is a bit faulty as Liouville function can be either 1 or − 1 , then ( − 1 ) λ ( n ) would be always − 1 .
If S is multiplied by function ζ ( 4 ) = ∑ n = 1 ∞ n 4 1 , we get
G = S × ζ ( 4 ) = n = 1 ∑ ∞ n 4 λ ∗ 1 ( n ) = n = 1 ∑ ∞ n 4 ∑ d ∣ n λ ( d )
Note that ∗ indicates Dirichlet convolution. A property of Liouville function is
λ ( n ) = { 1 0 n p e r f e c t s q u a r e o t h e r w i s e
Therefore G = ∑ n = 1 ∞ ( n 2 ) 4 1 = ζ ( 2 × 4 ) = ζ ( 8 )
finally
G = ζ ( 8 ) = S × ζ ( 4 ) ⟹ S = ζ ( 4 ) ζ ( 8 ) = 9 0 π 4 9 4 5 0 π 8
Sorry. But I claimed λ ( n ) differently.
Log in to reply
It is ok. I just noticed you edited the question
Let, Λ is a function of s . Now,
Λ ( s ) = 1 − 2 s 1 − 3 s 1 + 4 s 1 − 5 s 1 + 6 s 1 − 7 s 1 − 8 s 1 + 9 s 1 + . . . . . . . . . + 1 5 s 1 + 1 6 s 1 − 1 7 s 1 − 1 8 s 1 − . . . . . . . . .
Notice, Λ = ∑ n s ( − 1 ) λ ( n ) . Where, λ ( n ) = ∑ n a i . Where a i s are the power of prime elements of n .
Or, λ ( n ) is the sum of the powers of the prime factors of n
For example , λ ( 5 0 0 ) = 2 2 5 3 = 2 + 3 = 5 .
See, ( 1 + 2 s 1 ) Λ ( s ) = 1 − 3 s 1 − 5 s 1 − . . . . . . .
And continuing like this we get....
Λ ( s ) = ∏ p r i m e s ( 1 + p s 1 ) 1 .
Likely we get Λ ( s ) = ζ ( s ) ζ ( 2 s ) .
Replacing s by 4 in above equation we get Λ ( 4 ) = ζ ( 4 ) ζ ( 8 ) = 1 0 5 π 4 .
Hence, a + c = 1 0 9 .
Nice solution! Just as a small note, I think you should define χ ( n ) more precisely, or just say it is the Liouville function , usually represented as λ ( n ) . The function you called λ ( n ) in this solution also is very well-known: It's the big prime omega function .
Log in to reply
Thanks. I've updated the problem statement to reflect this.
I didn't know the name. I just found it. And by the way solver has to find the χ ( n ) . Thanks for giving the link. I heard about Poyla conjecture. But now I have known what it was.
Problem Loading...
Note Loading...
Set Loading...
Note: χ ( n ) is actually the Liouville function , typically represented as λ ( n ) .
Since λ ( n ) is completely multiplicative , we can factor S :
S = ( ( 2 0 ) 4 1 − ( 2 1 ) 4 1 + ( 2 2 ) 4 1 + . . . ) ( ( 3 0 ) 4 1 − ( 3 1 ) 4 1 + ( 3 2 ) 4 1 + . . . ) ( ( 5 0 ) 4 1 − ( 5 1 ) 4 1 + ( 5 2 ) 4 1 + . . . ) . . .
Using the sum of a geometric progression and the Euler product formula :
S = primes ∏ ( 1 + p 4 1 1 ) = primes ∏ ( 1 + p 4 1 ) 1 ⋅ ( 1 − p 4 1 ) ( 1 − p 4 1 ) = primes ∏ ( 1 − p 8 1 ) primes ∏ ( 1 − p 4 1 ) = ζ ( 4 ) ζ ( 8 ) = 9 4 5 0 π 8 ⋅ π 4 9 0 = 1 0 5 π 4
Thus, the sum is 1 0 5 + 4 = 1 0 9