2005 AMC 8 第 20 题

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

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

20.

Alice 和 Bob 玩一个圆上的游戏,圆周被 1212 个等距点分成若干段。这些点按顺时针方向编号为 111212。两人都从点 1212 开始。Alice 顺时针移动,Bob 逆时针移动。每轮游戏中,Alice 顺时针移动 55 个点,Bob 逆时针移动 99 个点。当他们停在同一点时游戏结束。需要多少轮?

Alice and Bob play a game involving a circle whose circumference is divided by 1212 equally-spaced points. The points are numbered clockwise, from 11 to 12.12. Both start on point 12.12. Alice moves clockwise and Bob, counterclockwise. In a turn of the game, Alice moves 55 points clockwise and Bob moves 99 points counterclockwise. The game ends when they stop on the same point. How many turns will this take?

66

88

1212

1414

2424

答案:A
知识点:模运算最小公倍数
难度评级:1450
解答:

一轮后,Alice 顺时针移动 55 个点,Bob 逆时针移动 99 个点。他们的相对移动为每轮 5+9=145+9=14 个点。

14k14k1212 的倍数时他们相遇,其中 kk 是轮数。

因为 14k2k(mod12)14k\equiv2k\pmod{12},满足 122k12\mid2k 的最小正整数 kk66

所以正确答案是 A

After one turn, Alice has moved 55 points clockwise and Bob has moved 99 points counterclockwise. Their relative movement is 5+9=145+9=14 points per turn.

They meet when 14k14k is a multiple of 1212, where kk is the number of turns.

Since 14k2k(mod12)14k\equiv2k\pmod{12}, the smallest positive kk with 122k12\mid2k is 66.

Thus, A is the correct answer.

← 第 19 题#19
完整试卷

其他年份的第 20 题

1985 AMC 8 · 1986 AMC 8 · 1987 AMC 8 · 1988 AMC 8 · 1989 AMC 8 · 1990 AMC 8 · 1991 AMC 8 · 1992 AMC 8 · 1993 AMC 8 · 1994 AMC 8 · 1995 AMC 8 · 1996 AMC 8 · 1997 AMC 8 · 1998 AMC 8 · 1999 AMC 8 · 2000 AMC 8 · 2001 AMC 8 · 2002 AMC 8 · 2003 AMC 8 · 2004 AMC 8 · 2006 AMC 8 · 2007 AMC 8 · 2008 AMC 8 · 2009 AMC 8 · 2010 AMC 8 · 2011 AMC 8 · 2012 AMC 8 · 2013 AMC 8 · 2014 AMC 8 · 2015 AMC 8 · 2016 AMC 8 · 2017 AMC 8 · 2018 AMC 8 · 2019 AMC 8 · 2020 AMC 8 · 2022 AMC 8 · 2023 AMC 8 · 2024 AMC 8 · 2025 AMC 8 · 2026 AMC 8