# Question 9

$$N_{1}$$ and $$N_{2}$$ are two 4 digit numbers. Total number of ways of forming $$N_{1}$$ and $$N_{2}$$ so that $$N_{2}$$ can be subtracted from $$N_{1}$$ without borrowing at any stage, is equal to:

$$\bullet$$ This question is part of the set For the JEE-nius;P

×