Open-access mathematical research insights
About Contact
Home / Erdos Problems / Problem #361

Problem #361: Let $c>0$ and $n$ be some large integer

Let $c>0$ and $n$ be some large integer. What is the size of the largest $A\subseteq \{1,\ldots,\lfloor cn\rfloor\}$ such that $n$ is not a sum of a...

Problem Statement

Let $c>0$ and $n$ be some large integer. What is the size of the largest $A\subseteq \{1,\ldots,\lfloor cn\rfloor\}$ such that $n$ is not a sum of a subset of $A$? Does this depend on $n$ in an irregular way?
Categories: Number Theory

Progress

Source: erdosproblems.com/361 | Last verified: January 14, 2026

Stay Updated

Get weekly digests of new research insights delivered to your inbox.