If the prime factorization of n is n = p 1 k 1 p 2 k 2 . . . p i k i , Let χ ( n ) = j = 1 ∑ i H k j
Then, consider the sum:
n ≥ 2 ∑ n 4 χ ( n )
The sum above can be expressed as π a ln ( b d π c ) , where a , b , c and d are positive integers. Answer the smallest possible value of a + b + c + d
Notation: H n denotes the n th harmonic number
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.
χ ( n ) = j = 1 ∑ i H k j = d ∣ n ∑ lo g d Λ ( d ) = lo g n Λ ( n ) ∗ 1 n = 2 ∑ ∞ n 4 χ ( n ) = n = 1 ∑ ∞ n 4 1 n = 2 ∑ ∞ lo g n Λ ( n ) n 4 1 = ζ ( 4 ) lo g ζ ( 4 ) = 9 0 π 4 lo g ( 9 0 π 4 )
Note: See first comment and it's reply for some visual help and more details.
From the definition, we can see χ ( n ) is additive . This means we can group the multiples of each prime and break the sum into:
p prime ∑ i ≥ 1 ∑ ( p i ) 4 χ ( p k )
Where k is the exponent of p in the prime factorization of p i . Also, χ ( p k ) = H k , which allows us to break this sum even further into:
p prime ∑ k ≥ 1 ∑ j ≥ 1 ∑ k ( p k j ) 4 1
p prime ∑ k ≥ 1 ∑ k p 4 k 1 j ≥ 1 ∑ j 4 1 = ζ ( 4 ) p prime ∑ k ≥ 1 ∑ k p 4 k 1
From the taylor expansion of ln ( 1 − x ) we get:
− ζ ( 4 ) p prime ∑ ln ( 1 − p 4 1 ) = − ζ ( 4 ) ln ⎝ ⎛ p prime ∏ ( 1 − p 4 1 ) ⎠ ⎞ − ζ ( 4 ) ln ( ζ ( 4 ) 1 ) = ζ ( 4 ) ln ( ζ ( 4 ) )
Which gives us:
9 0 π 4 ln ( 9 0 π 4 ) = π 4 ln ( 9 0 9 0 π 4 )
And the sum is 9 0 + 9 0 + 4 + 4 = 1 8 8
Bonus: In general n ≥ 2 ∑ n s χ ( n ) = ζ ( s ) ln ( ζ ( s ) )
The first and second expressions might be tricky to visualize just reading, so here are their first terms:
p prime ∑ i ≥ 1 ∑ ( p i ) 4 χ ( p k ) = ( 2 4 1 + 4 4 ( 1 + 2 1 ) + 6 4 1 + 8 4 ( 1 + 2 1 + 3 1 ) + . . . ) + ( 3 4 1 + 6 4 1 + 9 4 ( 1 + 2 1 ) + 1 2 4 1 + . . . ) + . . .
p prime ∑ k ≥ 1 ∑ j ≥ 1 ∑ k ( p k j ) 4 1 = ( ( 2 4 1 + 4 4 1 + 6 4 1 + . . . ) + 2 1 ( 4 4 1 + 8 4 1 + . . . ) + 3 1 ( 8 4 1 + 1 6 4 1 + . . . ) . . . ) + ( ( 3 4 1 + 6 4 1 + . . . ) + 2 1 ( 9 4 1 + 1 8 4 1 + . . . ) + . . . ) + . . .
Log in to reply
Also, here is some code to calculate the answer:
it prints 0 . 0 8 5 6 2 2 4 5 3 6 3 5 7 5 2 7 3 and π 4 ln ( 9 0 9 0 π 4 ) ≈ 0 . 0 8 5 6 2 2 4 5 3 6 3 6 7
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 |
|
Problem Loading...
Note Loading...
Set Loading...
A slightly different proof. For any prime p and real s > 0 define G p , s ( t ) = k = 0 ∑ ∞ p k s e − t H k t ≥ 0 (recall that H 0 = 0 ). Then G p , s is differentiable, and G p , s ( 0 ) G p , s ′ ( 0 ) = k = 0 ∑ ∞ p − k s = ( 1 − p − s ) − 1 = − k = 0 ∑ ∞ p k s H k = − k = 1 ∑ ∞ j = 1 ∑ k j p k s 1 = − j = 1 ∑ ∞ j p j s 1 k = j ∑ ∞ p ( k − j ) s 1 = − j = 1 ∑ ∞ j p ( j − 1 ) s 1 ( 1 − p − s ) − 1 = ( 1 − p − s ) − 1 ln ( 1 − p − s ) and hence G p , s ( 0 ) G p , s ′ ( 0 ) = ln ( 1 − p − s ) Now χ is additive, and hence X t ( n ) = e − t χ ( n ) is multiplicative. Thus, if we define F s ( t ) = n = 1 ∑ ∞ n s X t ( n ) t ≥ 0 then F s ( t ) = p ∏ ( k = 0 ∑ ∞ p k s X t ( p k ) ) = p ∏ G p , s ( t ) so that F s ( 0 ) F s ( t ) F s ′ ( t ) F s ( 0 ) F s ′ ( 0 ) = p ∏ G p , s ( 0 ) = p ∏ ( 1 − p − s ) − 1 = ζ ( s ) = p ∑ G p , s ( t ) G p , s ′ ( t ) = p ∑ G p , s ( 0 ) G p , s ′ ( 0 ) = p ∑ ln ( 1 − p − s ) = ln ( p ∏ ( 1 − p − s ) ) = − ln ζ ( s ) and hence F s ′ ( 0 ) = − ζ ( s ) ln ζ ( s ) .But this implies that n = 1 ∑ ∞ n s χ ( n ) = ζ ( s ) ln ζ ( s ) s > 0 In the case n = 4 we obtain the sum 9 0 1 π 4 ln ( 9 0 1 π 4 ) = π 4 ln ( 9 0 9 0 π 4 ) making the answer 4 + 9 0 + 4 + 9 0 = 1 8 8 .