離散數學›Ch2 關係與函數
第 13 題/共 25 題
◀ LS 13/25
13. 鴿籠原理
#LS-02-013中鴿籠原理
  1. (10%) A self-organizing ad-hoc satellite network consists of multiple satellites placed at arbitrary integer coordinates in 3-dimensional space. Each satellite is modeled as a point Ai∈Z3A_i \in \mathbb{Z}^3. A secure communication link may be established between satellites AiA_i and AjA_j only if the midpoint of the segment AiAjA_iA_j also lies on an integer lattice point. Equivalently, all three coordinate-wise averages must be integers:
xi+xj2,yi+yj2,zi+zj2∈Z.\frac{x_i+x_j}{2}, \frac{y_i+y_j}{2}, \frac{z_i+z_j}{2} \in \mathbb{Z}.

The Space Agency wants to guarantee that even without knowing the positions of the satellites beforehand, there must exist at least one secure link. (a) Determine the smallest integer NN such that: No matter how the NN satellites are placed in Z3\mathbb{Z}^3, there is always at least one pair whose midpoint is a lattice point (i.e., at least one secure link always exists). (b) Now modify the secure-link condition: A link is allowed if the total coordinate sum of the two satellites is even, i.e.

xi+xj+yi+yj+zi+zj≡0(mod2).x_i+x_j+y_i+y_j+z_i+z_j \equiv 0 \pmod{2}.

Under this new rule, determine the new minimum number of satellites guaranteeing that at least one secure link must exist.

📄 成大115
跳轉到第題
▤完整推導請見《WH 資工筆記 · 離散數學》Ch2 關係與函數
本章題號 · 1–20 / 25