(i) a=b=c( all distinct and c=0)⇒ Total cases =2(9C3) e.g. 1,2,3
(ii) a=b,c=0(a<b>0)⇒ Total cases =9C2
(iii) a=b,c=0(a=b>c)⇒ Total cases =9C2
(iv) a=b,c=0(a=b>0)⇒ Total cases =9C1
(v) a=c=0(a<b>c)⇒ Total cases =9C2 e.g. 1,4⇒141 (formed) ∴ Number of such 3 digit numbers =2⋅(9C3)+3⋅(9C2)+9C1=285.