SAT1000 - P333

Geometry Level 4

Given that f ( x ) = cos 2 x f(x)=\cos 2x and g ( x ) = sin x g(x)=\sin x , find all possible real number a a and positive integer n n , such that f ( x ) + a g ( x ) = 0 \\ f(x)+a g(x)=0 has exactly 2013 2013 roots on the interval ( 0 , n π ) (0,n \pi) .

How to submit:

  • First, find the number of all possible solutions ( a , n ) (a,n) . Let N N denote the number of solutions.
  • Then sort the solutions by a a from smallest to largest, if a a is the same, then sort by n 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 ) (a_1,n_1), (a_2,n_2), (a_3,n_3), \cdots ,(a_N,n_N) , then M = k = 1 N k ( a k + n k ) M=\displaystyle \sum_{k=1}^N k(a_k+n_k) .

For instance, if the solution is ( 1 , 2 ) , ( 1 , 1 ) , ( 1 , 3 ) , ( 0 , 4 ) (-1,2), (-1,1), (1,3), (0,4) , the sorted solution will be: ( 1 , 1 ) , ( 1 , 2 ) , ( 0 , 4 ) , ( 1 , 3 ) (-1,1), (-1,2), (0,4), (1,3) , then N = 4 N=4 and M = k = 1 4 k ( a k + n k ) = 1 × ( 1 + 1 ) + 2 × ( 1 + 2 ) + 3 × ( 0 + 4 ) + 4 × ( 1 + 3 ) = 30 \\ M=\displaystyle \sum_{k=1}^4 k(a_k+n_k)= 1 \times (-1+1) + 2 \times (-1+2) + 3 \times (0+4) + 4 \times (1+3) =30 .

For this problem, submit M + N \lfloor M+N \rfloor .


Have a look at my problem set: SAT 1000 problems


The answer is 4029.

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.

1 solution

Chew-Seong Cheong
Aug 15, 2020

Since f ( x ) = cos 2 x f(x) = \cos 2x , it has a period of π \pi . The a a in a g ( x ) = a sin x ag(x) = a\sin x changes the amplitude of the sin x \sin x curve. When a = 1 a=1 , f ( x ) = g ( x ) = 1 f(x) = g(x) = -1 when x = 2 k π + 3 2 π x = 2k\pi + \frac 32\pi , where k k is a positive integer. Therefore, when a = 1 a=1 , f ( x ) + a g ( x ) = 0 f(x) + ag(x) = 0 has 3 3 roots every 2 π 2\pi cycle. Similarly, when a = 1 a=-1 , f ( x ) + a g ( x ) = 0 f(x) + ag(x) = 0 also has 3 3 roots every 2 π 2\pi cycle. Therefore the n π n \pi cycles that give 2013 2013 roots is n π = 2013 3 × 2 π n = 1342 n \pi = \frac {2013}3 \times 2 \pi \implies n=1342 .

When a < 1 |a| < 1 , we note that there are 2 2 roots for every π \pi cycle. Since 2013 2013 is not divisible by 2 2 , there is no solution for n n for a < 1 |a| < 1 . When a > 1 |a| > 1 , there are 2 2 roots in the n n th π \pi cycle when n n is odd and 0 0 root when n n is even. Therefore the number of roots for n π n\pi cycles is always even so there is no solution.

This means there are solutions when a = ± 1 a = \pm 1 and n = 1342 n=1342 . Therefore N = 2 N=2 , M = 1 ( 1 + 1342 ) + 2 ( 1 + 1342 ) = 4027 M = 1(-1+1342) + 2(1+1342) = 4027 , and M + N = 4029 \lfloor M+N \rfloor = \boxed{4029} .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...