Difference between revisions of "2013 Mock AIME I Problems/Problem 14"
(I am new to latex, but briefed the solution.) |
(No difference)
|
Revision as of 02:24, 31 January 2016
Problem
Let are its roots, then compute the remainder when
is divided by 997.
Solution
Since 997 is prime, we have equals to
mod 997, which by Vieta's equals -4. Thus our answer is 993 mod 997.