2026 AMC 10B 第 22 题
先试着解答 2026 AMC 10B 第 22 题,然后核对你的答案与精心整理的解答,解答来自 LIVE by Po-Shen Loh。你也可以参加完整限时模拟考试、查看全部 2026 AMC 10B 解答,或核对答案。
所有题目均经美国数学协会(MAA)官方合法授权使用。
22.
Belinda 在平面上沿一条完全位于正方形区域 且 内的路径行走。称她的路径为合格路径,当且仅当它满足以下所有条件。
• 每一步向上、向下或向右移动一个单位。
• 路径不重复经过任何顶点。
• 路径从 出发,到 结束,其中 和 是满足 的整数,且路径只在这两点接触 轴。
下图左上方的例子是合格路径,另外两条是不合格路径。
Belinda 一共可以走出多少条合格路径?
Belinda follows a path on the plane that is entirely contained within the square region and Call her path dignified if and only if all of the following conditions are satisfied.
• Each step is one unit up, down, or to the right.
• The path does not revisit any vertex.
• The path starts at and ends at where and are integers with and touches the -axis only at these two points.
The following figure shows some examples of dignified and not dignified paths.
How many dignified paths can Belinda follow?
小提示:
按水平距离 分类计数
Count by the horizontal distance
大提示:
选定每一步向右移动时的高度,竖直部分就随之确定
Choose the height of each rightward step; the vertical parts are then forced
解答:
先固定向右移动的步数。每一步的高度都必须是 、、 或 ,因为路径始终在正方形内,而且只有起点和终点位于 轴上。
例如,向右移动两步,高度依次为 和 ,起点为 。路径必须先上升到高度 ,向右走,再上升到高度 ,向右走,最后下降到横轴。
一旦选定起点和各步的高度,竖直部分就确定了。在相邻的向右步之间,直接上升或下降到下一个高度即可。如果中途反向,就会重复经过某个顶点。每组高度都能给出一条合格路径:各步高度始终为正,而且向右移动之后不会再回到之前的列。
向右移动两步时,起点的 坐标可以是 、 或 ,共有 个起点位置。每一步各有 种独立的高度选择,因此这种情况共有 条路径。
一般地,设向右移动的步数为 。它可以是 、、 或 。起点的 坐标可以是从 到 的任意整数,因此有 个起点位置。各步高度共有 种选择。
路径总数为
因此,正确答案是 C。
Fix the number of rightward steps. Each must be at height or because the path stays in the square and touches the -axis only at its endpoints.
For example, take two rightward steps at heights and starting at The path must go up to height right, up to height right, then down to the axis.
Once the start and heights are chosen, the vertical parts are forced. Between rightward steps, go straight up or down to the next height. Reversing direction would revisit a vertex. Every choice of heights gives a valid path: the heights stay positive, and after moving right the path never returns to an earlier column.
With two rightward steps, the starting -coordinate can be or there are starting positions. Each step independently has height choices, so this case contributes paths.
In general, let be the number of rightward steps. It can be or The starting -coordinate can be any integer from through giving positions. There are choices for the heights.
The total number of paths is
Thus, the correct answer is C.
其他年份的第 22 题
- 2000 AMC 10
- 2001 AMC 10
- 2002 AMC 10A
- 2002 AMC 10B
- 2003 AMC 10A
- 2003 AMC 10B
- 2004 AMC 10A
- 2004 AMC 10B
- 2005 AMC 10A
- 2005 AMC 10B
- 2006 AMC 10A
- 2006 AMC 10B
- 2007 AMC 10A
- 2007 AMC 10B
- 2008 AMC 10A
- 2008 AMC 10B
- 2009 AMC 10A
- 2009 AMC 10B
- 2010 AMC 10A
- 2010 AMC 10B
- 2011 AMC 10A
- 2011 AMC 10B
- 2012 AMC 10A
- 2012 AMC 10B
- 2013 AMC 10A
- 2013 AMC 10B
- 2014 AMC 10A
- 2014 AMC 10B
- 2015 AMC 10A
- 2015 AMC 10B
- 2016 AMC 10A
- 2016 AMC 10B
- 2017 AMC 10A
- 2017 AMC 10B
- 2018 AMC 10A
- 2018 AMC 10B
- 2019 AMC 10A
- 2019 AMC 10B
- 2020 AMC 10A
- 2020 AMC 10B
- 2021 AMC 10A Spring
- 2021 AMC 10B Spring
- 2021 AMC 10A Fall
- 2021 AMC 10B Fall
- 2022 AMC 10A
- 2022 AMC 10B
- 2023 AMC 10A
- 2023 AMC 10B
- 2024 AMC 10A
- 2024 AMC 10B
- 2025 AMC 10A
- 2025 AMC 10B
- 2026 AMC 10A