(a2−b2) is divisible by 3
i.e (a−b)(a+b) is divisible by 3.
Case(1) (a+b) is divisible by 3
If a is chosen from (3k+1) set ,then b must be from (3k+2) set and viceversa.
If a is chosen from (3k) set, then b must be from (3k).
So, number of ways = 10*10
Note that when a is from 3k and b is from 3k,
then (a−b) is also divisible by 3.
Case(2)(a−b) but not (a+b) is divisible by 3
If a is chosen from (3k+1) set ,then b must be from (3k+1) set .
Same for (3k+2) set.
So, number of ways = 2* 10*10
Number of ways of choosing such that a,b such that (a2−b2) is divisible by 3
=30*30
Probability
=5×10×1030×30=59