. 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:
Best Answer
Ans: B
Related questions
/* MARKETING SCRIPT */ ?>
{1, 2, 3, 4, …., 3n} so that their sum is divisible by 3 is equal to:
Ans: B