1971 AHSME Problems/Problem 12

Revision as of 11:15, 1 August 2024 by Thepowerful456 (talk | contribs) (Solution: (page was previously only a restatement of the problem))
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

For each integer $N>1$, there is a mathematical system in which two or more positive integers are defined to be congruent if they leave the same non-negative remainder when divided by $N.$ If $69,90$, and $125$ are congruent in one such system, then in that same system, $81$ is congruent to

$\textbf{(A) }3\qquad \textbf{(B) }4\qquad \textbf{(C) }5\qquad \textbf{(D) }7\qquad  \textbf{(E) }8$

Solution

The "mathematical system" being alluded to is modulo $N$, so we shall be using such notation for convenience. From the problem, we know that $69 \equiv 90 \equiv 125 \mod N$, so the difference between each of these numbers must be a multiple of $N$. $90-69=21=3\cdot7$, and $125-90=35=5\cdot7$. The only common factors between these two numbers are $1$ and $7$, but we know from the problem that $N\neq1$. Thus, $N=7$. Now, $81 \equiv 77+4 \equiv 4 \mod 7$, so our answer is $\boxed{\textbf{(B) }4}$.

See Also

1971 AHSC (ProblemsAnswer KeyResources)
Preceded by
Problem 11
Followed by
Problem 13
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35
All AHSME Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png