Let M = { 1 , 2 , 3 , ......} and N ( k ) = { k 1 , k 2 , k 3 , .....} where k is a positive integer greater than 1. Let Q ( k ) be the list (repetition of values allowed, which means it is only a list and not a set) of all possible fractions whose numerator is an element of M and denominator is an element of N ( k ) . Let S ( k ) be the mean of the list Q ( k ) .
Now, let T ( n ) = ∑ k = 2 ∞ n S ( k ) − 1 . Find the sum U = ∑ r = 2 ∞ T ( r ) and submit your answer as ∑ p = 1 ∞ p 3 − 8 U correct to 3 decimal places.
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.
s ( n , p ) = 2 p 2 ( p ( p + 1 ) ) ∑ z = 1 p n − z which is comparable to the S ( k ) of the problem considering the as the dimension of the square matrix.
⎝ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎛ 1 2 3 4 5 6 7 8 9 1 0 ∞ 2 1 4 1 6 1 8 1 1 0 1 1 2 1 1 4 1 1 6 1 1 8 1 ⎠ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎞
Therefore, a simpler limited form is s ( n ) = 2 ( n − 1 ) 1 .
t = ∑ k = 2 ∞ n − s ( k ) 1 ⇒ n 2 − 1 1
∑ n = 2 ∞ t ⇒ 4 3
∑ p = 1 ∞ p − 4 3 8 3 ⇒ 6 π 2 ≈ 1 . 6 4 4 9 3 4 0 6 6 8 4 8 2 3
I didn't know this problem could be solved this easily. Great job ! My long method is about using GP sums, partial fractions and the Riemann zeta function.
Your problem was interesting enough. Some of those infinite sums are not all that easy to do. For example, the last sum is most easily done using the zeta function.
I DONT UNDERSTAND
Problem Loading...
Note Loading...
Set Loading...
You should specifiy what you mean by "the mean of the list Q ( k ) ", which has no meaning in itself. Refering to the inspiration, let , for x ∈ N , M x = 1 , 2 , 3 , . . . , x and N x ( k ) = k 1 , k 2 , . . , k x . Then let Q x ( k ) = ( k j i ) 1 ≤ i ≤ x , 1 ≤ j ≤ x be the x by x matrix whose entries are the fractions you described whose numerators are less than x and whose denominators are less than k x . Now the mean coefficient of this matrix, say μ x ( k ) , is well-defined to be μ x ( k ) = x 2 1 ∑ 1 ≤ i , j ≤ x k j i = 2 x 2 x ( x + 1 ) ∑ 1 ≤ j ≤ x k j 1 = 2 x 2 x ( x + 1 ) ( k − 1 1 − k x + 1 1 ) → x → ∞ 2 ( k + 1 ) 1 , which we define to be S ( k ) .
Now, T ( n ) = ∑ k = 2 ∞ n S ( k ) − 1 = ∑ k ≥ 1 ( n 2 ) k 1 = n 2 − 1 1 . From here, we compute U = ∑ r ≥ 2 T ( r ) = ∑ r ≥ 2 r 2 − 1 1 . First, let U n = ∑ r = 2 n T ( r ) . Notice r 2 − 1 1 = 2 1 ( r − 1 1 − r + 1 1 ) , so U n = 2 1 ( ∑ r = 2 n [ r − 1 1 − r + 1 1 ] = 2 1 ( ∑ r = 1 n − 1 r 1 − ∑ r = 3 n + 1 r 1 ) = 2 1 ( 1 + 2 1 − n 1 − n + 1 1 ) → n → ∞ 4 3 . So U = 4 3 , and ∑ p = 1 ∞ p 3 − 8 U = ∑ p = 1 ∞ p 2 1 = ζ ( 2 ) , which everyone knows is 6 π 2 .