Let { a i } i = 1 2 0 1 4 be a sequence of 2 0 1 4 angles satisfying 0 ≤ a i ≤ 2 π for all i = 1 → 2 0 1 4 . Let the number of ordered 2 0 1 4 -tuplets of solutions to the equation
c y c ∑ sin 2 ( a 1 + a 2 ) = c y c ∑ ( sin a 1 + sin a 2 ) ( cos a 1 + cos a 2 )
be N . What is the last 3 digits of N ?
Details and Assumptions
c y c ∑ denotes the cyclic sum . For example,
c y c ∑ a 1 a 2 = a 1 a 2 + a 2 a 3 + ⋯ + a n − 1 a n + a n a 1
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.
I was going to be more devious and add a few surds (it doesn't really affect the solution) but then I thought the problem would be too hard to approach. Thank me later :P
I have a small doubt.Can we apply Euler's theorem when the two numbers are not coprime (like in this case 2 and 1000)
Log in to reply
You raised a valid point, that Euler's Theorem doesn't apply immediately, and we need to consider relatively prime indices.
Note that the answer of 384 is (luckily) correct.
Thankfully in the case of 2's and 5's which are special when finding the last three digits, Euler's theorem works anyways :P
By mistake, I interpreted the equation as c y c ∑ sin 2 ( a 1 + a 2 ) = c y c ∑ ( sin a 1 + cos a 1 ) ( sin a 2 + cos a 2 ) How many solutions are there ?
wow nice solution @daniel Liu this problem is so messey
Problem Loading...
Note Loading...
Set Loading...
This problem is a mess; we have such a complicated equation to solve with 2 0 1 4 variables, we have to find all solutions, then find the last three digits. Where should we start?
Well, let's first break the equation up into little parts and look at one of those parts:
sin 2 ( a 1 + a 2 ) = ( sin a 1 + sin a 2 ) ( cos a 1 + cos a 2 )
Let's expand the left side:
( sin a 1 cos a 2 + sin a 2 cos a 1 ) 2 = ( sin a 1 + sin a 2 ) ( cos a 1 + cos a 2 )
Hey, wait a sec. This looks awfully familiar to the Cauchy Schwarz inequality. Let's apply Cauchy Schwarz on the LHS:
( sin a 1 cos a 2 + sin a 2 cos a 1 ) 2 ≤ ( sin 2 a 1 + sin 2 a 2 ) ( cos 2 a 1 + cos 2 a 2 )
Thankfully, since sin 2 α ≤ sin α and cos 2 α ≤ cos α if 0 ≤ α ≤ 2 π , we have
( sin 2 a 1 + sin 2 a 2 ) ( cos 2 a 1 + cos 2 a 2 ) ≤ ( sin a 1 + sin a 2 ) ( cos a 1 + cos a 2 )
Thus,
sin 2 ( a 1 + a 2 ) = ( sin a 1 cos a 2 + sin a 2 cos a 1 ) 2 ≤ ( sin a 1 + sin a 2 ) ( cos a 1 + cos a 2 )
But what are the equality cases? In the Cauchy Schwarz inequality, the equality case is when cos a 2 sin a 1 = cos a 1 sin a 2 . This simplifies to sin 2 a 1 = sin 2 a 2 which means either a 1 = a 2 or a 1 , a 2 = 0 or 2 π .
The equality case for sin 2 a 1 ≤ sin a 1 is a 1 = 0 or 2 π (and ditto for a 2 and the cos functions). Thus, the equality case of the inequality overall is only a 1 , a 2 = 0 or 2 π .
But now we've basically solved the question: a i = 0 or 2 π for all i = 1 → 2 0 1 4 ; thus, there are 2 2 0 1 4 different ordered 2 0 1 4 -tuples of solutions. All we need to do is find the last three digits of 2 2 0 1 4 .
This is not hard with Euler's theorem: since ϕ ( 1 0 0 0 ) = 4 0 0 , we have that 2 2 0 1 4 ≡ 2 5 ⋅ 4 0 0 + 1 4 ≡ 2 1 4 ≡ 1 6 3 8 4 ≡ 3 8 4 ( m o d 1 0 0 0 ) and we are done.