Let m and n be 2 digit numbers. The number of pairs (m,n) such that n can be subtracted from m without borrowing is
2350
2425
2450
2475
a c b d ∴(a,c)pairs=1+2+⋯⋯9=451 1 0 0 (b,d)pairs=1+2+3+⋯+10=553 1,2,3 2 0,1,2. .. .. .9 1,2⋯9 0,1,⋯9 ∴Total=45×55)