This set is so odd
Number Theory
Level
1
A set contains 100 numbers.
How many ways are there to choose any 3 distinct numbers from the set such that there sum is divisible by 2.
4
0
3
2
1
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.
1 solution
since every element of the set is an odd number and sum of three odd numbers is always odd.....hence there is no way to choose 3 numbers such that there sum is divisible by 2