Question 121
Let $n$ be a positive integer. A set $A$ of positive integers is $n$-size complete if the set of all the remainders obtained when dividing an element of $A$ by an element of $A$ is $\{0, 1, 2, \dots, n\}$. For example, the set $\{3, 4, 5\}$ is a 4-size complete set.
Determine the minimum number of elements of a 100-size complete set.
Determine the minimum number of elements of a 100-size complete set.