For each integer , let be the number of solutions to the equation on the interval . What is ?
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.
F ( 2 ) = 3
By looking at various graphs, we obtain that, for most of the graphs
F ( n ) = n + 1
However, when n ≡ 1 ( m o d 4 ) , the middle apex of the sine curve touches the sine curve at the top only one time (instead of two), so we get here F ( n ) = n . 3 + 4 + 5 + 5 + 7 + 8 + 9 + 9 + ⋯ + 2 0 0 8 = ( 1 + 2 + 3 + 4 + 5 + ⋯ + 2 0 0 8 ) − 3 − 5 0 1 = 2 ( 2 0 0 8 ) ( 2 0 0 9 ) − 5 0 4 = 2 0 1 6 5 3 2