MathDB

All sufficiently large integers have k representations as subset sum

Source: APMO 2020 Problem 3

June 9, 2020

combinatoricsnumber theoryAPMO

Problem Statement

Determine all positive integers

k

for which there exist a positive integer

m

and a set

S

of positive integers such that any integer

n > m

can be written as a sum of distinct elements of

S

in exactly

k

ways.