Find all values of the parameter for which the equation
has exactly roots.
Translate the cosine equation into a list of levels. exactly when for an integer , and here , so only are possible:
The equation has become a family of simple quadratics, one per .
Count how many roots each level contributes. For a fixed :
Different give different values of , so no root is ever double-counted.
Rule out the boundary cases immediately. If for some integer , the total is , an odd number. Since is even, no such can work, and every level must be strictly cleared.
Require exactly four usable values of . With no equalities, the count is . Setting this to means must all satisfy the strict inequality while must fail:
Trim the closed endpoint. The right end is one of the excluded boundary values (it gives roots), so it must be dropped, and gives . The answer is the open interval
Check the ends by counting. At (inside the interval) the levels all clear and does not, giving roots. At the count drops to and at it jumps to , so the strict inequalities on both ends are essential.
Need to solve a different problem like this? Open the solver →