返回题库

PUMaC 2008 · 数论(B 组) · 第 10 题

PUMaC 2008 — Number Theory (Division B) — Problem 10

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

题目详情

  1. (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.