A discrete mathematics problem by Raymond Park

Discrete Mathematics Level pending

Let \(S \) be a set of counting numbers up to 30. What is the least number of numbers in the subset \(N\) so that the sum of any two numbers in \(N\) is guaranteed to be 41?

×

Problem Loading...

Note Loading...

Set Loading...