PUMaC 2008 · 数论(A 组) · 第 10 题
PUMaC 2008 — Number Theory (Division A) — Problem 10
题目详情
- (7 points)What is the smallest number n such that you can choose n distinct odd integers 1 1 1 a , a , . . . a , none of them 1, with + + . . . + = 1? 1 2 n a a a 1 2 n 1
解析
暂无解答链接。
Original Explanation
No solutions link available.