olymmath

Putnam 2003 A1

  • Session A

Let nn be a fixed positive integer. How many ways are there to write nn as a sum of positive integers, n=a1+a2+⋯+ak,n = a_1 + a_2 + \cdots + a_k, with kk an arbitrary positive integer and a1≤a2≤⋯≤ak≤a1+1a_1 \le a_2 \le \cdots \le a_k \le a_1 + 1? For example, with n=4n=4 there are four ways: 4, 2+2, 1+1+2, 1+1+1+1.

Curated text Kedlaya Putnam archive. Quoted with source.

Solutions

Human solution Solution 1 by Manjul Bhargava, Kiran Kedlaya and Lenny Ng

The terms of the source let olymmath link to this solution but not copy it. Read the solution (Kedlaya Putnam archive).

Similar problems

These problems have the most words in common with this statement.

Locator putnam/2003/a1 · Tag MS6J3Z755Y · Edit this page on GitHub · Keys: j next, k previous