Difference between revisions of "1971 AHSME Problems/Problem 12"
Tecilis459 (talk | contribs) (Add statement) |
(→Solution: (page was previously only a restatement of the problem)) |
||
Line 2: | Line 2: | ||
For each integer <math>N>1</math>, there is a mathematical system in which two or more positive integers are defined | For each integer <math>N>1</math>, 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 <math>69,90</math>, and <math>125</math> are | + | to be congruent if they leave the same non-negative remainder when divided by <math>N.</math> If <math>69,90</math>, and <math>125</math> are |
− | congruent in one such system, then in that same system, | + | congruent in one such system, then in that same system, <math>81</math> is congruent to |
<math>\textbf{(A) }3\qquad | <math>\textbf{(A) }3\qquad | ||
Line 10: | Line 10: | ||
\textbf{(D) }7\qquad | \textbf{(D) }7\qquad | ||
\textbf{(E) }8 </math> | \textbf{(E) }8 </math> | ||
+ | |||
+ | == Solution == | ||
+ | The "mathematical system" being alluded to is [[modulo]] <math>N</math>, so we shall be using such notation for convenience. | ||
+ | From the problem, we know that <math>69 \equiv 90 \equiv 125 \mod N</math>, so the difference between each of these numbers must be a multiple of <math>N</math>. <math>90-69=21=3\cdot7</math>, and <math>125-90=35=5\cdot7</math>. The only common factors between these two numbers are <math>1</math> and <math>7</math>, but we know from the problem that <math>N\neq1</math>. Thus, <math>N=7</math>. Now, <math>81 \equiv 77+4 \equiv 4 \mod 7</math>, so our answer is <math>\boxed{\textbf{(B) }4}</math>. | ||
+ | |||
+ | == See Also == | ||
+ | {{AHSME 35p box|year=1971|num-b=11|num-a=13}} | ||
+ | {{MAA Notice}} | ||
+ | [[Category:Introductory Number Theory Problems]] |
Latest revision as of 11:15, 1 August 2024
Problem
For each integer , 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 If , and are congruent in one such system, then in that same system, is congruent to
Solution
The "mathematical system" being alluded to is modulo , so we shall be using such notation for convenience. From the problem, we know that , so the difference between each of these numbers must be a multiple of . , and . The only common factors between these two numbers are and , but we know from the problem that . Thus, . Now, , so our answer is .
See Also
1971 AHSC (Problems • Answer Key • Resources) | ||
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.