n = 0 ∑ ∞ ( 2 n ) ! 1 = e ( a + erf ( b ) )
The equation above holds true for positive integers a and b . Find a + b .
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.
Problem Loading...
Note Loading...
Set Loading...
Firstly nice problem.
Rearranging, ∑ n = 0 ∞ ( 2 n ) ! 1 = ( 2 0 ) ! 1 + ( 2 1 ) ! 1 + ( 2 2 ) ! 1 + ⋯ = 0 ! 1 + ( 2 1 ) ! 1 + 1 ! 1 + ( 1 + 2 1 ) ! 1 + ⋯ = 0 ! 1 + 1 ! 1 + 2 ! 1 + 3 ! 1 + ⋯ + ( 2 1 ) ! 1 + ( 1 + 2 1 ) ! 1 + ( 2 + 2 1 ) ! 1 + ⋯ = ∑ n = 0 ∞ n ! 1 + ∑ m = 0 ∞ ( m + 2 1 ) ! 1
The left sum is well-known and the sum would be e . The proof is here .
The right sum is ∑ m = 0 ∞ ( m + 2 1 ) ! 1 = ( 2 1 ) ! 1 + ( 1 + 2 1 ) ! 1 + ( 2 + 2 1 ) ! 1 + ⋯
Now if we use gamma functions, Γ ( n + 1 ) = n !
( 2 1 ) ! 1 + ( 1 + 2 1 ) ! 1 + ( 2 + 2 1 ) ! 1 + ⋯ = Γ ( 2 3 ) 1 + Γ ( 2 5 ) 1 + Γ ( 2 7 ) 1 + ⋯ = 2 1 Γ ( 2 1 ) 1 + 2 3 Γ ( 2 3 ) 1 + 2 5 Γ ( 2 5 ) 1 = 2 1 × Γ ( 2 1 ) 1 + 2 1 × 2 3 × Γ ( 2 1 ) 1 + 2 1 × 2 3 × 2 5 × Γ ( 2 1 ) 1 + ⋯
Using the Euler's Reflection Formula,
Γ ( 2 1 ) Γ ( 1 − 2 1 ) = s i n ( 2 π ) π = π
Γ ( 2 1 ) 2 = π Γ ( 2 1 ) = π
So the sum becomes this,
π 1 ( 2 1 1 + 2 1 × 2 3 1 + 2 1 × 2 3 × 2 5 1 + ⋯ )
π 1 ( 2 1 1 + 2 1 × 2 3 1 + 2 1 × 2 3 × 2 5 1 + ⋯ ) = π 1 ( 1 2 1 + 1 × 3 2 2 + 1 × 3 × 5 2 3 + ⋯ ) = π 1 ∑ n = 0 ∞ ( 2 n + 1 ) ! ! 2 2 n + 1
e r f ( x ) = π e − x 2 ∑ n = 0 ∞ ( 2 n + 1 ) ! ! ( 2 x ) 2 n + 1
So this sum is e × e r f ( 1 )
Not forgeting to add the earlier e ,
makes e + e × e r f ( 1 ) = e ( 1 + e r f ( 1 ) )
so 1 + 1 = 2 .