期刊论文详细信息
| Crux mathematicorum with mathematical mayhem | |
| Contest Corner Solutions: CC321–CC330 | |
| 1 | |
| DOI : | |
| 学科分类：数学（综合） | |
| 来源: Canadian Mathematical Society | |
 PDF
|
|
【 摘 要 】
Six boxes are numbered 1; 2; 3; 4; 5 and 6. Suppose that there are Nballs distributed among these six boxes. Find the least N for which it is guaranteedthat for at least one k, box number k contains at least k2 balls.Originally Problem 4 from the 2015 Purple Comet! Math Meet.【 授权许可】
CC BY
【 预 览 】
| Files | Size | Format | View |
|---|---|---|---|
| RO201910281473227ZK.pdf | 799KB |  download |
878987797
028-85220240
