+ + + + + + 1 1 2 1 3 1 4 1 5 1 . . . . . . + + + + + + + 1 1 4 1 9 1 1 6 1 2 5 1 . . . . . . + + + + + + + 1 2 8 2 2 7 2 6 4 2 1 2 5 2 . . . . . . + + + + + + + 1 3 1 6 3 8 1 3 2 5 6 3 6 2 5 3 . . . . . . + + + + + + + 1 5 3 2 5 2 4 3 5 1 0 2 4 5 3 1 2 5 5 . . . . . . + + + + + + + . . . . . . . . . . . . . . . . . . . . .
The sum above as shown diverges. However, when the column and row in red is removed, the sum converges to A . Find ⌊ 1 0 5 A ⌋ .
Details:
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.
Define S such that
S = x 1 + x 2 1 + x 3 2 + x 4 3 + x 5 5 + . . .
so
x S = x 2 1 + x 3 1 + x 4 2 + x 5 3 + x 6 5 + . . .
Subtract the two and we get
S − x S = x 1 + x 2 1 ( x 1 + x 2 1 + x 3 2 + x 4 3 + x 5 5 + . . . )
S − x S = x 1 + x 2 S
Multiplying x 2 on both sides,
x 2 S − x S = x + S
so
S = x 2 − x − 1 x
The array above can now be condensed to
x = 1 ∑ ∞ x 2 − x − 1 x
which, by the way, diverges. Note: I'm sorry I cannot give an in depth explanation to this as I am not very well versed with the different series convergence tests available. However, on an intuitive notion, we can see that the first row (the one in red) consists of plainly infinite 1s (which means this will blow up to infinity), while the first column is the famous divergent series ∑ n = 1 ∞ n 1 . Since these two take part in the array in question, then it can be said that this array series indeed diverges.
So, to make for adjustments by removing the divergent parts, we get
x = 2 ∑ ∞ x 2 − x − 1 x − x 1
We now start at x = 2 because the first row (where x = 1 ) is removed, and the subtracted expression takes into account the removal of the first column.
I'll stop here for now.
Problem Loading...
Note Loading...
Set Loading...
Denoting by F n , the n th Fibonacci number , note that we can write the sum as S = k ≥ 2 ∑ n ≥ 2 ∑ k n F n = k ≥ 2 ∑ n ≥ 2 ∑ 2 ϕ − 1 ϕ n − ( 1 − ϕ ) n where ϕ = 2 1 + 5 , is the golden ratio. Then, noting that 1 < ϕ < 2 , we can simplify the sum as ( 2 ϕ − 1 ) S = n ≥ 2 ∑ k ≥ 2 ∑ ( k n ϕ n − k n ( 1 − ϕ ) n ) = k ≥ 2 ∑ ( 1 − ϕ / k ( ϕ / k ) 2 − 1 − ( 1 − ϕ ) / k ( ( 1 − ϕ ) / k ) 2 ) = ϕ k ≥ 2 ∑ ( k − ϕ 1 − k 1 ) − ( 1 − ϕ ) k ≥ 2 ∑ ( k − 1 + ϕ 1 − k 1 ) Now, the digamma function satisfies the following property: ψ ( x + 1 ) = − γ + k ≥ 1 ∑ ( k 1 − x + k 1 ) where γ is the Euler-Mascheroni constant. Then, it follows after a little bit of mainipulation, S = 2 ϕ − 1 ( 1 − ϕ ) ψ ( ϕ ) − ϕ ψ ( 1 − ϕ ) − γ + 2 We can further simplify the expression using the reflection formula satisfied by ψ ( ⋅ ) ψ ( 1 − x ) − ψ ( x ) = π cot ( π x ) to obtain S = 2 − γ + 2 ϕ − 1 π ( ϕ − 1 ) cot ( π ϕ ) − ψ ( 1 − ϕ ) which evaluates to ≈ 2 . 1 6 5 2 2 . Thus the answer is 2 1 6 5 2 2 .