Combinatorics of numbers

If \(\alpha =\overline{abc} \) and \(\beta = \overline{def} \) be two three digit positive integers, then find the number of pairs of \(\alpha\) and \(\beta\) that can be formed so that \(\alpha \) can be subtracted from \(\beta\) without borrowing.

×

Problem Loading...

Note Loading...

Set Loading...