Welcome! Today we're looking at Special Cases and Common Traps in EDA — the edge cases that separate students who truly understand from those who just memorize.

You can now execute Euclid's Division Algorithm on a standard pair of numbers. But exams are designed to test the edge cases — the situations where students who only know the standard case get tripped up.

Questions we'll tackle:

What happens when one number divides the other exactly?
What if the numbers are given in the 'wrong' order?
What if a remainder looks small and you declare it the HCF too early?

These are not rare scenarios — they appear regularly in board exams.

Marks are lost not because of missing knowledge but because of hasty assumptions.

Spending time on these traps now is an investment that pays off directly in your exam performance.

Now	Later
Learn the traps	Avoid losing easy marks
Practice edge cases	Confidence in exams

1. One-step termination when one number divides the other

We're now exploring the simplest special case of Euclid's Division Algorithm:

What happens when you divide and the remainder is zero right away?

This is the fastest possible outcome, and we need to recognise it clearly when it appears — instead of trying to continue dividing when the algorithm has already finishedstop here.

📋 Given Info

Sometimes the algorithm finishes in just one step.

Consider finding HCF(196, 38220).

Since $38220 > 196$ , we start by dividing $38220$ by $196$ .

✍️ Question

Find HCF(196, 38220) using Euclid's Division Algorithm.

How many steps does it take, and why does it terminate so quickly?

When one number divides the other exactlyZero remainder means you're done, the algorithm finishes in a single stepImmediate result for H C F.

$38220 \div 196$ : Since $196 \times 195 = 38220$ exactly, we get:

38220 = 196 \times 195 + 0

✍️ MCQ

Choose one

When we apply Euclid's Division Algorithm and get a remainder of

0

in the very first step, what does this tell us about the relationship between the two numbers?

✓

The remainder is 0 right awayStop here, the divisor is your answer. By the algorithm's rule, when $r = 0$ , the divisor is the HCF. So $\text{HCF}(196, 38220) = 196$ AnswerFastest possible scenario.

This is the special caseOne number divides the other exactly — when one number is a factor of the otherSpot it early in exams to save time, we're done in just one step!

This makes perfect sense: 196 divides 38220, so 196 is certainly a common divisor.

And no number bigger than 196Nothing larger can divide evenly can divide 196 (except 196 itself). So 196 is the greatestThe divisor at that step is the GCD common divisor.

✍️ MCQ

Choose one

If we're finding

\text{HCF}(45, 9000)

and

9000 = 45 \times 200 + 0

, how many steps does the algorithm take?

✓

⚠️ A common trap:A common mistake students make Some students report 195Wrong!They see it and quickly write it down (the quotient) as the HCF.

In our calculation: $38220 = 196 \times 195 + 0$

The number 195It looks prominent but it's wrong appears prominently, and it's tempting to pick it as the answer.

Remember — the HCF is the divisorThe divisor at zero remainder is the answer when remainder becomes zero, not the quotientThe quotient is not what we want.

Term	Value	Is it HCF?
Quotient	195It tells you how many times something fits	❌ No
Divisor	196This is your HCF	✅ Yes

HCF(196, 38220) = 196 (the divisor, not 195)

✍️ MCQ

Choose one

In the equation

38220 = 196 \times 195 + 0

, which number is the HCF?

✓

2. Correct initial arrangement of the pair

Having handled one-step termination, the next trap to address is the starting arrangement.

When the two numbers are given with the smaller one first, some students divide the smaller by the larger and get a quotient of zerotrap.

We need to understand what happens and whether it matters.

📋 Given Info

Here's the situation:

When asked to find HCF(272, 1032), the numbers might not be given in decreasing order.

A student starts computing HCF(272, 1032) by writing:

272 = 1032 \times 0 + 272

q=0

They then swap to (1032, 272) and proceed normally.

✍️ Question

Think about this: 🤔

A student starts computing HCF(272, 1032) by writing:

$272 = 1032 \times 0 + 272$

They then swap to (1032, 272) and proceed normally.

Is this wrong? What's the better approach, and why?

If you divide a smaller number by a larger oneThis setup gives quotient zero, the quotient is 0Zero times anything is zero and the remainder is the smaller number itselfNothing changes from the original:

272 = 1032 \times 0 + 272

key case(Recognize this pattern immediately)

See what happened? 272 goes into 1032 zero times, and the entire 272 is left over as the remainder.

This is technically correct, and after swapping to (1032, 272), the algorithm proceeds normally. But it wastes a step.No useful progress made The quotient of 0 tells you nothingBackwards setup wastes time — it just means the divisor was bigger than the dividend.

Better approach: Always start with the larger number as the dividendStart with larger number first. Write (1032, 272) from the beginning, not (272, 1032).

✍️ MCQ

Choose one

If a student writes

45 = 120 \times 0 + 45

as their first step in finding HCF(45, 120), what mistake have they made?

✓

The standard approach: always start with the larger number as the dividendPut the bigger number first when dividing. If given HCF(272, 1032), mentally rewrite as HCF(1032, 272) and begin:

$1032 = 272 \times 3 + 216$

This isn't a rule of the algorithm — the algorithm works either way — but it's the efficient practiceGets you to the answer faster with fewer steps.

3. The 'stopping too early' trap

So far we've handled the cases of immediate termination and wrong initial order. Now let's look at the most dangerous trap — terminating too early.

When a remainder comes out small, the temptation is to declare it the HCF without finishing the algorithm.

We need to see why 'small' is not the same as 'zero'.

📋 Given Info

Here's a situation:

In computing HCF(1032, 272), after a few steps you reach:

$56 = 48 \times 1 + 8$

The remainder is 8key value.

A student says: "I got 8. That's a small number, so it must be the HCF."

✍️ Question

What's wrong with the student's reasoning?

What should they do instead? Give the next step that would actually confirm or deny whether 8 is the HCF.

The stopping condition is remainder = 0This tells you when the algorithm is complete. Not 'remainder is small'. Not 'remainder looks like it could be the answer'. Exactly 0.

This is the rule you must follow every single time:

\text{STOP when remainder} = 0

RULE(Use this to know when you've finished)

The student got 8 and thought, 'That's small enough, I'm done.' But 8 is NOT zeroA non-zero remainder means you're not done yet. The algorithm hasn't finished yet!

✍️ Yes/No

Yes or No?

In the step

56 = 48 \times 1 + 8

, the remainder is

8

. Should we stop here?

✓

To actually confirm whether $8$ is the HCF, we need to perform the next step:

48 = 8 \times \, ? \, + \, ?

next(Do one more division to confirm)

Divide $48$ by $8$ . If the remainder is $0$ Zero remainder confirms your answer, THEN $8$ is the HCFThen you've verified the HCF. If not, we keep goingContinue with more steps if needed!

After getting $56 = 48 \times 1 + 8$ , the remainder is 8Non-zero remainder means keep going. The student needs to continueEDA only stops when remainder is exactly zero: swap to the pair $(48, 8)$ Swap and divide again and divide.

48 = 8 \times 6 + 0

(This is the stopping condition)

NOW the remainder is 0done!The stopping condition you need to remember, and the divisor is 8. So $\text{HCF} = 8$ The divisor from that step is your answer. This step confirms it.

✍️ MCQ

Choose one

The student stopped when they got remainder

8

because it was 'small'. What is the actual stopping condition for Euclid's algorithm?

✓

But suppose the numbers had been different and 48 was not a multiple of 8 — say we got $49 = 8 \times 6 + 1$ A small remainder changes everything. Then the algorithm would continue with $(8, 1)$ , and HCF would turn out to be 1, not 8The answer becomes 1, not 8.

The point: you can't tell the HCF from a non-zero remainderAny remainder means continue the algorithm, no matter how small it looks. Only $r = 0$ STOPZero remainder is your stopping signal ends the story.

✍️ Yes/No

Yes or No?

If at some step you get

35 = 8 \times 4 + 3

, can you conclude that 3 is the HCF?

✓

4. Correct pair-swapping between steps

The immediate-termination, ordering, and early-stopping traps are now accounted for. The last common error is mechanical: getting the pair-swap wrong between steps.

We need to confirm that the old divisor becomes the new dividend and the old remainder becomes the new divisor — not any other combination.

📋 Given Info

Given Information:

After the step $1032 = 272 \times 3 + 216$ , the next division uses a new pair.

A student writes the next step as:

1032 = 216 \times 4 + 168

Wrong!

✍️ Question

What is the new pair after the step $1032 = 272 \times 3 + 216$ ?

A student writes the next step as $1032 = 216 \times 4 + 168$ .

What mistake did they make?

The Swap Rule in Euclid's Division Algorithm:

After each step, the old divisor becomes the new dividendThe divisor moves down to become what you divide next, and the old remainder becomes the new divisorThe remainder takes over as the new divisor.

This is the heart of why the algorithm worksThis swap mechanism powers the entire process — we keep reducing the problem to smaller and smaller pairsEach step shrinks the numbers you're working with.

After $1032 = 272 \times 3 + 216$ :

Old divisor: 272divisor
Old remainder: 216remainder
New pair: (272, 216)
Next step: divide 272 by 216

✍️ MCQ

Choose one

The student wrote

1032 = 216 \times 4 + 168

as their next step. What mistake did they make?

✓

What went wrong:

The student divided $1032$ by $216$ — they kept the original dividend $1032$ instead of dropping it.

They forgot the swap ruleAfter each division, drop the old dividend completely! After getting remainder $216$ , the student should have moved on from $1032$ entirely. Instead, they stubbornly held onto the original dividendYou'll keep dividing the wrong thing and never reach the HCF.

✍️ MCQ

Choose one

In the step

1032 = 272 \times 3 + 216

, which number should become the new dividend for the next step?

✓

The correct next step:

After $1032 = 272 \times 3 + 216$ , the new pairThe old divisor and the old remainder become your new pair becomes $(272, 216)$ .

So the next step is: $272 = 216 \times 1 + 56$

Remember: Always drop the largest numberAlways drop the largest number from your pair and bring down the divisor and remainder as your new pairThat's your new pair.

✍️ MCQ

Choose one

After the step

272 = 216 \times 1 + 56

, what is the new pair for the next step?

✓

A way to remember:

After each step, you drop the biggest numberThe dividend you just divided gets dropped and bring in the remainderRemainder becomes the new divisor.

The equation $a = b q + r$ has three key numbers: $a$ , $b$ , $r$ . For the next step, you drop $a$ and use $b$ and $r$ . So $(a, b)$ becomes $(b, r)$ .

$1032 = 272 \times 3 + 216$ → drop $1032$ , keep $272$ and $216$ → next: $272 = 216 \times ? + ?$