返回题库

PUMaC 2024 · 团队赛 · 第 5 题

PUMaC 2024 — Team Round — Problem 5

专题
Discrete Math / 离散数学
难度
L3
来源
PUMaC

题目详情

  1. The Minkowski sausage is constructed as follows. M is the line segment from (0 , 0) to (1 , 0). 0 M is constructed by replacing each segment in M with eight segments, each of length i +1 i i +1 1 / 4 (see figure below, where we have provided M through M ). 0 3 Let M be the limiting shape of M , M , . . . . The area of the smallest convex polygon which ∞ 0 1 a encloses M can be written as for relatively prime positive integers a and b . Find a + b . ∞ b
解析

暂无解答链接。


Original Explanation

No solutions link available.