MathDB
Counting subset sizes

Source: Malaysia National Math Olympiad - Sulong Problem 4

October 26, 2019
number theory

Problem Statement

Let A={1,2,...,100}A=\{1,2,...,100\} and f(k),k∈Nf(k), k\in N be the size of the largest subset of AA such that no two elements differ by kk. How many solutions are there to f(k)=50f(k)=50?