Forgot password? New user? Sign up
Existing user? Log in
A set S={1,3,5,7,…,199}S=\{1,3,5,7,\ldots, 199\}S={1,3,5,7,…,199} 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.
Problem Loading...
Note Loading...
Set Loading...