Given that
f
(
x
)
=
cos
2
x
and
g
(
x
)
=
sin
x
, find all possible real number
a
and positive integer
n
, such that
f
(
x
)
+
a
g
(
x
)
=
0
has
exactly
2
0
1
3
roots on the interval
(
0
,
n
π
)
.
How to submit:
-
First, find the number of all possible solutions
(
a
,
n
)
. Let
N
denote the number of solutions.
-
Then sort the solutions by
a
from smallest to largest, if
a
is the same, then sort by
n
from smallest to largest.
-
Let the sorted solutions be:
(
a
1
,
n
1
)
,
(
a
2
,
n
2
)
,
(
a
3
,
n
3
)
,
⋯
,
(
a
N
,
n
N
)
, then
M
=
k
=
1
∑
N
k
(
a
k
+
n
k
)
.
For instance, if the solution is
(
−
1
,
2
)
,
(
−
1
,
1
)
,
(
1
,
3
)
,
(
0
,
4
)
, the sorted solution will be:
(
−
1
,
1
)
,
(
−
1
,
2
)
,
(
0
,
4
)
,
(
1
,
3
)
, then
N
=
4
and
M
=
k
=
1
∑
4
k
(
a
k
+
n
k
)
=
1
×
(
−
1
+
1
)
+
2
×
(
−
1
+
2
)
+
3
×
(
0
+
4
)
+
4
×
(
1
+
3
)
=
3
0
.
For this problem,
submit
⌊
M
+
N
⌋
.
Have a look at my problem set:
SAT 1000 problems
Since f ( x ) = cos 2 x , it has a period of π . The a in a g ( x ) = a sin x changes the amplitude of the sin x curve. When a = 1 , f ( x ) = g ( x ) = − 1 when x = 2 k π + 2 3 π , where k is a positive integer. Therefore, when a = 1 , f ( x ) + a g ( x ) = 0 has 3 roots every 2 π cycle. Similarly, when a = − 1 , f ( x ) + a g ( x ) = 0 also has 3 roots every 2 π cycle. Therefore the n π cycles that give 2 0 1 3 roots is n π = 3 2 0 1 3 × 2 π ⟹ n = 1 3 4 2 .
When ∣ a ∣ < 1 , we note that there are 2 roots for every π cycle. Since 2 0 1 3 is not divisible by 2 , there is no solution for n for ∣ a ∣ < 1 . When ∣ a ∣ > 1 , there are 2 roots in the n th π cycle when n is odd and 0 root when n is even. Therefore the number of roots for n π cycles is always even so there is no solution.
This means there are solutions when a = ± 1 and n = 1 3 4 2 . Therefore N = 2 , M = 1 ( − 1 + 1 3 4 2 ) + 2 ( 1 + 1 3 4 2 ) = 4 0 2 7 , and ⌊ M + N ⌋ = 4 0 2 9 .