Q. Number of ways of selecting numbers form integers to if their sum is divisible by are

 3041  222 Permutations and Combinations Report Error

Solution:

The numbers can be categorized as
(a)
(b)
(c)
(d)
(e)
Now, sum of two numbers is divisible by 5 then we can have following cases
(i) both the numbers from the list (a) - number of selection ways are
(ii) one number from list (b) and other from list (e) - number of selection ways are
(iii) one number from list (c) and other from list (d) - number of selection ways are
Hence, total number of ways are