**Problem of the Week**

**BUGCAT**

**Zassenhaus Conference**

**Hilton Memorial Lecture**

**BingAWM**

**Math Club**

**Actuarial Association**

pow:problem2s24

Problem 2 (due Monday, February 17)

Let $d(n)$ be the smallest number such that among any $d(n)$ points inside a regular $n$-gon with side of length 1 there are two points whose distance from each other is at most 1. Prove that

(a) $d(n)=n$ for $4\leq n\leq 6$.

(b) $\displaystyle \lim_{n\to \infty} \frac{d(n)}{n}=\infty $.

For a complete solution see the following link Solution.

pow/problem2s24.txt · Last modified: 2024/03/08 03:04 by mazur

Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 3.0 Unported