Skip to main content
OlympiadHQ

Browse · harp

Print

smc

number theory intermediate

Problem

If , the number of integers which can possibly be negative, is, at most:
(A)
(B)
(C)
(D)
(E)
Solution
Assume , and WLOG, assume and . This also takes into account when is negative. That means Multiply both sides by to get Note that both sides are integers. If , then the right side is even while the left side is odd, so equality can not happen. If , then , and since , and . No nonnegative value of and works, so equality can not happen. Thus, and can not be negative when . Assume , and WLOG, assume and . This also takes into account when is negative. That means Multiply both sides by to get That makes both sides integers. The left side is congruent to modulo while the right side is congruent to or modulo , so equality can not happen. Thus, and can not be negative when . Assume , and WLOG, let and . This also takes into account when or is negative. That means Multiply both sides by to get That makes both sides integers. The left side is congruent to modulo while the right side is congruent to or modulo , so equality can not happen. Thus, and can not be negative. Putting all the information together, none of can be negative, so the answer is .
Final answer
E