Question
Question: For $k = 1, 2, ..., $ let $f_k$ be the number of times $\sin(\frac{k \pi x}{2})$ attains its maxim...
For k=1,2,..., let fk be the number of times
sin(2kπx)
attains its maximum value on the interval x∈[0,1]. Compute
limk→∞kfk.

1/4
Solution
To find the number of times sin(2kπx) attains its maximum value on the interval x∈[0,1], we first identify the maximum value of the sine function, which is 1.
The sine function attains its maximum value when its argument is of the form 2π+2nπ, where n is an integer.
So, we set the argument equal to this form:
2kπx=2π+2nπ
Divide by π:
2kx=21+2n
Multiply by 2:
kx=1+4n
Solve for x:
x=k1+4n
Now, we apply the given interval constraint x∈[0,1]:
0≤k1+4n≤1
Since k is a positive integer (k=1,2,...), we can multiply the inequality by k without changing its direction:
0≤1+4n≤k
We need to find the number of integer values of n that satisfy this compound inequality.
From the left side of the inequality:
1+4n≥0
4n≥−1
n≥−41
Since n must be an integer, the smallest possible value for n is 0.
From the right side of the inequality:
1+4n≤k
4n≤k−1
n≤4k−1
Since n must be an integer, the largest possible value for n is ⌊4k−1⌋.
So, the integer values of n for which the maximum is attained are 0,1,2,…,⌊4k−1⌋.
The number of such values, fk, is given by:
fk=(⌊4k−1⌋)−0+1=⌊4k−1⌋+1
We need to compute the limit limk→∞kfk.
limk→∞k⌊4k−1⌋+1
We use the property of the floor function: for any real number y, y−1<⌊y⌋≤y.
Let y=4k−1. Then:
4k−1−1<⌊4k−1⌋≤4k−1
Adding 1 to all parts of the inequality:
4k−1−1+1<⌊4k−1⌋+1≤4k−1+1
4k−1<fk≤4k−1+4
4k−1<fk≤4k+3
Now, divide all parts of the inequality by k (since k>0):
4kk−1<kfk≤4kk+3
Finally, take the limit as k→∞:
limk→∞4kk−1=limk→∞41−k1=41−0=41
limk→∞4kk+3=limk→∞41+k3=41+0=41
By the Squeeze Theorem, since both the lower and upper bounds approach 41, the limit of kfk must also be 41.