1970 AMC 12 第 34 题

先试着解答 1970 AMC 12 第 34 题,然后核对你的答案与精心整理的解答,解答来自 LIVE by Po-Shen Loh。你也可以参加完整限时模拟考试、查看全部 1970 AMC 12 解答,或核对答案

所有题目均经美国数学协会(MAA)官方合法授权使用。

34.

13,51113{,}51113,90313{,}90314,58914{,}589 后所得余数相同的最大整数是:

The greatest integer that will divide 13,511,13{,}511, 13,903,13{,}903, and 14,58914{,}589 and leave the same remainder is:

2828

4949

9898

大于 494977 的奇数倍

an odd multiple of 77 greater than 4949

大于 989877 的偶数倍

an even multiple of 77 greater than 9898

答案:C
知识点:最大公约数整除性代数变形
难度评级:1650
小提示:

余数相同意味着除数能整除每两个数之差

A common remainder means the divisor divides every pairwise difference

大提示:

139031351113903-13511145891390314589-13903 的最大公因数

Find the GCD of 139031351113903-13511 and 145891390314589-13903

解答:

一个除数除这三个数所得余数相同,当且仅当它能整除这些数之间的差。相邻两个差为 1390313511=392,1458913903=686 \begin{gathered} 13903-13511=392,\\ 14589-13903=686 \end{gathered}\text{。}因此最大的可能除数为 gcd(392,686)=gcd(392,294)=gcd(294,98)=98 \begin{gathered} \gcd(392,686)\\ =\gcd(392,294)\\ =\gcd(294,98)=98 \end{gathered}\text{。}

因此,正确答案是 C

A divisor leaves the same remainder on all three numbers exactly when it divides their differences. The two successive differences are 1390313511=392,1458913903=686. \begin{gathered} 13903-13511=392,\\ 14589-13903=686. \end{gathered} Therefore the greatest possible divisor is gcd(392,686)=gcd(392,294)=gcd(294,98)=98. \begin{gathered} \gcd(392,686)\\ =\gcd(392,294)\\ =\gcd(294,98)=98. \end{gathered}

Therefore, the correct answer is C.

← 第 33 题#33
完整试卷

其他年份的第 34 题

1950 AMC 12 · 1951 AMC 12 · 1952 AMC 12 · 1953 AMC 12 · 1954 AMC 12 · 1955 AMC 12 · 1956 AMC 12 · 1957 AMC 12 · 1958 AMC 12 · 1959 AMC 12 · 1960 AMC 12 · 1961 AMC 12 · 1962 AMC 12 · 1963 AMC 12 · 1964 AMC 12 · 1965 AMC 12 · 1966 AMC 12 · 1967 AMC 12 · 1968 AMC 12 · 1969 AMC 12 · 1971 AMC 12 · 1972 AMC 12 · 1973 AMC 12