Compute the value of .
Inspired by @Charlton Teo
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.
Let S = ( 3 − 3 2 + 3 3 − ⋯ + 3 2 0 1 9 ) ( m o d 1 0 0 ) and 3 n ( m o d 1 0 0 ) ∈ { 3 , 9 , 2 7 , 8 1 , 4 3 , 2 9 , 8 7 , 6 1 , 8 3 , 4 9 , 4 7 , 4 1 , 2 3 , 6 9 , 7 , 2 1 , 6 3 , 8 9 , 6 7 , 1 }
Notice each remainder can be paired with another to make ± 9 0 , if we keep the signs alternated, then writing in a table looks like this,
− 1 7 − 9 3 2 7 4 3 − 2 9 − 2 1 − 4 1 2 3 − 8 9 8 3 − 8 1 8 7 6 3 4 7 − 6 1 − 6 9 − 4 9 6 7
As the remainders are in cycles of 2 0 and each cycle, C , has property C ≡ 0 ( m o d 1 0 0 ) as there are an equal amount of positive pairings as negative.
2 0 1 9 ( m o d 2 0 ) = 1 9 so only the 2 0 t h element in the cycle, or 1 is excluded. We have S ≡ 1 ( m o d 1 0 0 )
⟹ ∫ 0 π S d x = ∫ 0 π d x = π