返回题库

HMMT 二月 2004 · 团队赛 · 第 5 题

HMMT February 2004 — Team Round — Problem 5

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

题目详情

  1. [15] Prove that the number of switch pairs in row n is at most twice the number of odd numbers in row n .
解析
  1. Prove that the number of switch pairs in row n is at most twice the number of odd numbers in row n . Solution: Each switch pair contains an odd number, and each odd number can belong to at most two switch pairs (since it has only two neighbors).