Get 2 FREE Instant-Explanations on Filo with code FILOAPP

{n}_{{1}}{a}{n}{d}{n}_{{2}} are four-digit numbers, find the t

Question

$n_{1} a n d n_{2}$ are four-digit numbers, find the total number of ways of forming $n_{1} a n d n_{2}$ so that $n_{2}$ can be subtracted from $n_{1}$ without borrowing at any stage.

Views: 812 students

Found 6 tutors discussing this question

Liam Discussed

n_{1} a n d n_{2}

are four-digit numbers, find the total number of ways of forming

n_{1} a n d n_{2}

so that

n_{2}

can be subtracted from

n_{1}

without borrowing at any stage.

7 mins ago

Discuss this question LIVE

7 mins ago

One destination to cover all your homework and assignment needs

Learn Practice Revision Succeed

Instant 1:1 help, 24x7

60, 000+ Expert tutors

Textbook solutions

Big idea maths, McGraw-Hill Education etc

Essay review

Get expert feedback on your essay

Schedule classes

High dosage tutoring from Dedicated 3 experts

Trusted by 4 million+ students

Stuck on the question or explanation?

Connect with our math tutors online and get step by step solution of this question.

231 students are taking LIVE classes

Question Text

n_{1} a n d n_{2}

are four-digit numbers, find the total number of ways of forming

n_{1} a n d n_{2}

so that

n_{2}

can be subtracted from

n_{1}

without borrowing at any stage.

Filo tutor solution