Let $n$ be a positive integer, and let $[n]=\{1,2,\dots,n\}$. Find the maximum posible cardinality of a subset $S$ of $[n]$ with the property that there aren't any distinct $a,b,c\in S$ such that $a+b=c$.
Source: PErA 2024/1
Tags: combinatorics
Let $n$ be a positive integer, and let $[n]=\{1,2,\dots,n\}$. Find the maximum posible cardinality of a subset $S$ of $[n]$ with the property that there aren't any distinct $a,b,c\in S$ such that $a+b=c$.