A probability problem by Raymond Park
Let be a set of counting numbers up to 30. What is the least number of numbers in the subset so that the sum of any two numbers in is guaranteed to be 41?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
0 solutions
No explanations have been posted yet. Check back later!