PUMaC 2007 · 组合（A 组） · 第 3 题
PUMaC 2007 — Combinatorics (Division A) — Problem 3
题目详情
- Find the minimum number n such that for any coloring of the integers from 1 to n into two colors, one can find monochromatic a , b , c , and d (not necessarily distinct) such that a + b + c = d .
解析
暂无解答链接。
Original Explanation
No solutions link available.