71st St. NYC | 纽约第71街的数学问题

📚 71st St. NYC | 纽约第71街的数学问题

What does a typical New York City address like "71st Street" have to do with mathematics? At first glance, it is just a location on the grid of Manhattan. However, for an IB Mathematics student, 71st Street serves as a perfect entry point into the fascinating world of taxicab geometry, combinatorial path counting, and the contrast between different ways of measuring distance. The rigid street layout of Manhattan, where avenues run north-south and streets run east-west, creates a natural laboratory for exploring non-Euclidean distance, optimisation problems and the binomial coefficients that govern shortest‑path counts. In this article, we will use the example of a journey from 71st Street to another famous intersection, unpacking the core concepts that frequently appear in IB Analysis & Approaches and Applications & Interpretation papers.

一个典型的纽约地址“第71街”和数学有什么关系？乍一看，它只是曼哈顿网格上的一个地点。但对 IB 数学的学生来说，第71街是进入出租车几何、组合路径计数以及不同距离度量方式对比的绝佳入口。曼哈顿严格的街道布局——大道南北延伸、街道东西走向——为探索非欧几里得距离、最优化问题和支配最短路径计数的二项式系数提供了一个天然实验室。在本文中，我们将以从第71街到另一个著名交叉口的行程为例，深入剖析 IB 分析与方法和应用与解释试卷中经常出现的核心概念。

1. The Perfect Grid of Manhattan | 曼哈顿的完美网格

Manhattan's street plan north of Houston Street is famously organised as a rectangular grid. Avenues (such as 5th Avenue, 6th Avenue) run in a north‑south direction, while numbered Streets run east‑west. Each block between consecutive streets is roughly 80 metres long, whereas the distance between consecutive avenues is about 280 metres. This anisotropy immediately tells us that moving diagonally through buildings is not possible; any journey must follow the grid lines. The geometry that arises from this constraint is called taxicab geometry, because a taxi driver navigating from one address to another can only travel along streets and avenues.

曼哈顿休斯顿街以北的街道规划以矩形网格著称。大道（如第五大道、第六大道）呈南北走向，而编号的街道则东西延伸。两条相邻街道之间的街区长度约为 80 米，而相邻大道之间的距离大约为 280 米。这种各向异性立即告诉我们，无法斜穿大楼行走；任何行程都必须沿着网格线进行。由这一约束产生的几何学被称为出租车几何，因为出租车司机从一个地址前往另一个地址只能沿街道和大道行驶。

2. Taxicab Distance Defined | 出租车距离的定义

taxicab geometry, the distance is the sum of the absolute differences in coordinates: d = |x₂ − x₁| + |y₂ − y₁| is also known as the Manhattan distance or L₁ norm. It represents the total number of east‑west and north‑ e shortest path is not unique under this metric is key to tackling combinatorial problems.

在标准的欧几里得几何中，两点 (x₁, y₁) 和 (x₂, y₂) 之间的最短路径是直线段，其长度由毕达哥拉斯公式 √((x₂ − x₁)² + (y₂ − y₁)²) 给出。在出租车几何中，距离是坐标差的绝对值之和：d = |x₂ − x₁| + |y₂ − y₁|。这一度量也称为曼哈顿距离或 L₁ 范数。它表示必须穿越的东西向和南北向街区的总数。对 IB 学生而言，理解在这一度量下最短路径并不唯一，是解决组合问题的关键。

3. Why 71st Street? A Concrete Starting Point | 为什么是第71街？一个具体起点

ms: East 71st Street and 5th Avenue. The coordinates can be assigned by using streets as y‑coordinates and avenues as x‑ tance 42nd Street and Lexington Avenue (which lies between 3rd and 4th Avenues; we can assign it an appropriate x‑ 1) to (8, 42) requires moving 3 avenues east and 29 streets south. The taxicab distance is |8 − 5| + |42 − 71| = 3 + 29 = 32 blocks.

让我们选择一个在大多数教科书问题中经常出现的交叉口：东71街和第五大道。可以将街道编号作为 y 坐标，将大道编号作为 x 坐标。假设第五大道对应于 x = 5，第71街对应于 y = 71。另一个热门目的地是中央车站附近区域，例如第42街和列克星敦大道（位于第三和第四大道之间，我们可以分配 x 值为 3.5，但为简单起见使用同属网格的第42街和第八大道）。从 (5, 71) 到 (8, 42) 的行程需要向东移动 3 个大道，向南移动 29 条街。出租车距离为 |8 − 5| + |42 − 71| = 3 + 29 = 32 个街区。

4. Counting the Number of Shortest Paths | 对最短路径进行计数

In a grid of streets, how many distinct shortest paths are there between two intersections? rd moves among the 32 total moves. This is given by the binomial coefficient C(32, 3) = 32! / (3! × 29! × 2 × 1) = 4960. So there are 4960 equally short routes from 71st and 5th to 42nd and 8th.

组合数学中一个基本问题，也是 IB 考题的主打内容，是：在一个街道网格中，两个交叉口之间有多少条不同的最短路径？每条最短路径恰好由 3 个向东 (E) 移动和 29 个向南 (S) 移动组成，顺序可以任意排列。因此，路径总数等于从 32 步总移动中选择 3 个向东移动的位置数。这由二项式系数 C(32, 3) = 32! / (3! × 29!) 给出。数值上，C(32, 3) = (32 × 31 × 30) / (3 × 2 × 1) = 4960。所以从71街第五大道到42街第八大道共有 4960 条等距的最短路线。

5. Generalising the Path‑Counting Formula | 推广路径计数公式

For any two grid points separated by Δx horizontal steps and Δy vertical steps, the number of shortest paths is C(Δx + Δy, Δx) or equivalently C(Δx + Δy, Δy). This emerges directly from the fact that we are arranging Δx objects of one type and Δy objects of another. IB syllabi often expect students to recognise this connection and apply it to problems involving lattice paths, word arrangements, and even probability calculations. The binomial coefficient can also be generated by Pascal’s triangle, which gives a visual method for small values of Δx and Δy.

对于横向相距 Δx 步、纵向相距 Δy 步的任意两个网格点，最短路径的数量为 C(Δx + Δy, Δx)，或等价地 C(Δx + Δy, Δy)。这直接源自我需排列 Δx 个一类对象和 Δy 个另一类对象的事实。IB 教学大纲通常期望学生能够识别这种联系，并将其应用于网格路径、单词排列甚至概率计算等问题。二项式系数还可以通过帕斯卡三角形生成，为较小的 Δx 和 Δy 提供了一个直观的方法。

6. Euclidean vs. Manhattan Distance: A Comparison | 欧几里得距离与曼哈顿距离的比较

e the Manhattan distance between (5, 71) and (8, 42) is 32 blocks, the Euclidean (straight‑line) distance is √((8−5)² + (42−71)²) = √9 + 841 = √850 ≈ 29.15 blocks. If we scale the block lengths to actual metres—80 m per street block and 280 m per avenue block—the real‑ nues × 280 m + 29 streets × 80 m = 840 m + 2320 m = 3160 m. A bird would fly approximately √840² + 2320² es why pilots and pedestrians live in different geometric universes, a concept frequently tested through optimisation and modelling questions in IB.

广告 / Sponsored

虽然 (5, 71) 和 (8, 42) 之间的曼哈顿距离是 32 个街区，但欧几里得（直线）距离为 √((8−5)² + (42−71)²) = √9 + 841 = √850 ≈ 29.15 个街区。如果我们将街区的长度按米计算——每个街块 80 米，每个大道块 280 米——实际距离差距更大。以米为单位的出租车距离是 3 大道 × 280 米 + 29 街道 × 80 米 = 840 米 + 2320 米 = 3160 米。而鸟儿飞行的直线距离约为 √840² + 2320² ≈ 2468 米。这一差异说明了为什么飞行员和行人生活在不同的几何世界中，这一概念在 IB 的优化和建模问题中经常考查。

7. Pascal’s Triangle on the Streets of NYC | 纽约街头的帕斯卡三角形

e number of shortest paths to each intermediate intersection matches the entries of Pascal' ern 1, 3, 3, 1 forms the third row of Pascal’s triangle. Recognising this structure helps students solve grid problems without repeatedly using the factorial formula, and it deepens the link between algebra and geometry.

如果我们将行程限制在一个小区域内，比如从第71街出发向南仅 3 条街、向东 3 个大道，那么到达每个中间交叉口的最短路径数量与帕斯卡三角形中的数字完全一致。例如，向东 3 个大道、向南 0 街的交叉口只有 1 条路径，而向东 2 个大道、向南 1 街有 C(3,1) = 3 条路径。数列 1, 3, 3, 1 构成帕斯卡三角形的第三行。识别出这种结构有助于学生在不反复使用阶乘公式的情况下解决网格问题，并加深代数与几何之间的联系。

8. One‑Way Streets and Obstacles: IB Modelling Challenges | 单行道与障碍物：IB 建模挑战

Real‑world Manhattan is not a perfect grid; there are one‑ rced turns, requiring students to subtract invalid paths or use the principle of inclusion– ments of the journey, and it must be subtracted from the total. This tests a deeper understanding of combinatorial independence.

现实中的曼哈顿并非完美网格；这里存在单行道、中央公园这样的障碍物，还有百老汇大街斜向穿过。IB 考题经常引入被封锁的交叉口或强制转弯，要求学生减去无效路径或使用容斥原理。例如，如果第59街与第五大道的交叉口因施工而封闭，那么任何经过该节点的路径都必须排除。经过被封锁节点的路径数量等于旅程两段所对应的 C(12, Δx₁) × C(20, Δx₂) 的乘积，并需要从总数中减去。这考查了对组合独立性的更深层理解。

9. From Grid Paths to Binomial Probability | 从网格路径到二项概率

ly k east moves is pᵏ qⁿ⁻ᵏ. The number of such paths multiplies this to give the binomial probability distribution. This direct bridge between taxi routes and binomial expansion frequently appears in IB Applications and Interpretation papers, where students might model a taxi driver’s random route selection.

选择向东和向南移动的机械过程，相当于在每一步投掷一枚有偏硬币。如果旅行者在每个交叉口以概率 p 向东、以概率 q = 1 − p 向南随机选择，那么任何一条恰好包含 k 次向东移动、总步数为 n = Δx + Δy 的特定路径的概率为 pᵏ qⁿ⁻ᵏ。此路径数与之相乘形成二项概率分布。这种出租车路线与二项展开式之间的直接桥梁频繁出现在 IB 应用与解释试卷中，学生可能需要模拟出租车司机的随机路线选择。

10. The L₂ vs L₁ Optimisation Problem | L₂ 与 L₁ 的最优化问题

IB Analysis & Approaches students may be asked to find a point that minimises the sum of Manhattan distances to several fixed points—this is the geometric median problem. Unlike the Euclidean case, where the centroid minimises the sum of squared distances, the optimal point in L₁ metric is found via coordinate medians. For three points (x₁, y₁), (x₂, y₂), (x₃, y₃), the minimising point has its x‑coordinate equal to the median of the x‑values and y‑coordinate equal to the median of the y‑values. This property has real‑world relevance in locating a fire station or delivery hub on a grid like Manhattan’s.

IB 分析与方法课程的学生可能会被要求找到一个点，使其到几个已知点的曼哈顿距离之和最小——这便是几何中位数问题。与欧几里得情况下重心最小化平方距离之和不同，L₁ 度量下的最优点是通过坐标中位数求得的。对于三个点 (x₁, y₁), (x₂, y₂), (x₃, y₃)，最小化点的 x 坐标等于 x 值的中位数，y 坐标等于 y 值的中位数。这一性质在网格上（如曼哈顿）选择消防站或配送中心等现实场景中具有实际意义。

11. Recap of Key Formulae for IB Exams | IB 考试关键公式回顾

tion hall, ensure you have these relationships at your fingertips. Manhattan distance: d = |Δx| + |Δy|. Euclidean distance: d = √Δx² + Δy² cles block certain nodes, use the multiplication principle for paths through a given point, and apply subtraction or inclusion– (n, k) pᵏ (1−p)ⁿ⁻ᵏ applies. Being able to switch fluently between the geometry of the grid and the algebra of combinations is a mark of a strong IB mathematician.

走进考场前，确保你对以下关系了如指掌。曼哈顿距离：d = |Δx| + |Δy|。欧几里得距离：d = √Δx² + Δy²。最短网格路径数：N = C(Δx + Δy, Δx) = C(Δx + Δy, Δy)。当障碍物阻挡某些节点时，利用乘法原理计算经过给定点的路径，并应用减法或容斥原理。对于随机游走，二项概率公式 P(X = k) = C(n, k) pᵏ (1−p)ⁿ⁻ᵏ 适用。能够在网格几何和组合代数之间顺畅切换，是一位优秀 IB 数学人的标志。

12. The Legacy of 71st Street in Your Mathematical Toolkit | 第71街在你数学工具箱中的传承

What began as a simple address on Manhattan's Upper East Side has taken us through taxicab geometry, combinatorial path counting, binomial probability, coordinate medians, and obstacle‑handling techniques. The 71st Street problem is more than a textbook exercise; it encapsulates the IB philosophy of linking abstract mathematics to authentic contexts. Next time you look at a city map, see the grid not just as streets and avenues, but as a canvas of binomial coefficients, waiting to be explored with the tools of discrete mathematics.

从曼哈顿上东区一个简单的地址开始，我们经历了出租车几何、组合路径计数、二项概率、坐标中位数以及障碍物处理技巧。第71街问题不仅仅是教科书上的练习；它凝结了 IB 将抽象数学与真实情境联系起来的理念。下次你查看城市地图时，不要仅仅把网格看成街道和大道，而要把它看作一块布满二项式系数的画布，等待着用离散数学的工具去探索。

Published by TutorHao | Maths Revision Series | aleveler.com

更多咨询请联系16621398022（同微信）