Total number of ways of selecting two numbers from the set `{1, 2, 3, ..., 90}` so that their sum is divisible by 3, is

If the total number of ways of selecting two numbers from the set {1, 2, 3, ……….., 89, 90} such that their sum is divisible by 3 is k, then (k)/(500) is

If the total number of ways of selecting two numbers from the set {1, 2, 3, ……….., 89, 90} such that their sum is divisible by 3 is k, then (k)/(500) is

The total number of ways of selecting two numbers from the set {1,2, 3, 4, ........3n} so that their sum is divisible by 3 is equal to a. (2n^2-n)/2 b. (3n^2-n)/2 c. 2n^2-n d. 3n^2-n

The total number of ways of selecting two numbers from the set {1,2, 3, 4, ........3n} so that their sum is divisible by 3 is equal to a. (2n^2-n)/2 b. (3n^2-n)/2 c. 2n^2-n d. 3n^2-n

The total number of ways of selecting two numbers from the set {1,2,3,4,........3n} so that their sum is divisible by 3 is equal to a.(2n^(2)-n)/(2) b.(3n^(2)-n)/(2) c.2n^(2)-n d.3n^(2)-n

the total number of ways of selecting two number from the set {1,2,3,4,…..3n} so that their sum divisible by 3 is equal to -

The number of ways of selecting two numbers from the set {1,2,……………12} whose sun is divisible by 3 is (A) 66 (B) 16 (C) 6 (D) 22

The number of ways of selecting two numbers from the set {1,2,……………12} whose sun is divisible by 3 is (A) 66 (B) 16 (C) 6 (D) 22