Successive Division & Ladder Algorithms
Master the mechanics of successive division where the quotient of one step becomes the dividend of the next, and reverse-engineer the original number.
1. The Story & Mental Model
Imagine a relay race of division.
In normal division, you divide a number by a divisor , get a quotient and a remainder . The game ends there.
In successive division, the quotient grabs the baton and keeps running! The quotient becomes the new starting number for the next divisor.
Suppose a number is successively divided by 4, then 5.
-
Divide by 4 you get Quotient and Remainder .
-
Take , divide it by 5 you get Quotient and Remainder .
To reconstruct the original number , you have to walk backwards. You start with the final quotient, multiply by the last divisor, add the last remainder, and pass that result backwards up the ladder until you reach .
2. The CAT Question Blueprint
This is a niche but highly standardized topic. The questions will look exactly like:
-
"A number when successively divided by 3, 5, and 8 leaves remainders 1, 4, and 7 respectively. Find the least such number."
-
"If the same number is divided by the same divisors but in reverse order, what will the remainders be?"
-
"Find the general form of all such numbers."
3. Core Concepts, Formulae & Derivations
A. The Ladder Method (Reconstruction)
To find the smallest original number given divisors and remainders :
-
Assume the final quotient is (this yields the absolutely smallest valid number).
-
Start from the bottom:
Quotient .
-
Step up:
Quotient .
-
Final step:
Number .
Visualizing the Ladder:
| Divisor | Dividend | Remainder |
|---|---|---|
| 0 |
(Multiply left-down, add right: . Then . Then ).
B. The General Form
Once you find the smallest number , the general form of all such numbers is:
where is any whole number ().
C. Reversing the Divisors
If the question asks for remainders when divisors are reversed (e.g., divided by 8, then 5, then 3), you MUST find first, and then perform actual successive division using the new order of divisors. You cannot just reverse the remainders!
4. Common Pitfalls & Speed Shortcuts
-
Pitfall: Assuming "successive division" just means dividing the original number multiple times. No! That's LCM/HCF model territory. Successive division strictly means dividing the quotients.
-
Shortcut: For finding , you can use this linear formula instead of drawing the ladder:
(Notice how the remainders are multiplied by the accumulation of previous divisors).
Formulas
| Linear Minimum Number | |
|---|---|
| General Form |
Traps and tips
- Always assume the final quotient is 0 to find the least possible number.
- Do not confuse successive division with simultaneous division (LCM models). Look for the word 'successively'.
- When divisors are reversed, you must re-calculate. The remainders do not simply reverse.
Solved examples
The Basic Ladder
A number when successively divided by 4, 5, and 6 leaves remainders 2, 3, and 4 respectively. Find the least such number.
Show solution
Let's use the Ladder Method. Assume the final quotient is 0.
Divisors: 4, 5, 6.
Remainders: 2, 3, 4.
Step 1 (Bottom): .
Step 2 (Middle): .
Step 3 (Top): .
The least such number is 94.
Let's verify using the Linear Shortcut:
.
Both methods yield 94 effortlessly.
Takeaway: The linear formula N min = r1 + d1 r2 + d1 d2 r3 is the fastest way to solve standard successive division problems.
The Reverse Run
A number when successively divided by 3, 4, and 7 leaves remainders 2, 1, and 4 respectively. What will be the remainders if the same number is divided successively by 7, 4, and 3?
Show solution
First, find the least original number .
Using the shortcut: .
Here, and .
.
Now, perform successive division on 53 using the reversed divisors: 7, 4, 3.
-
Divide 53 by 7:
with remainder 4.
New dividend is 7.
-
Divide 7 by 4:
with remainder 3.
New dividend is 1.
-
Divide 1 by 3:
with remainder 1.
The remainders in the reverse order are 4, 3, and 1.
Takeaway: Never assume the remainders reverse when the divisors reverse. You must calculate N min and manually divide again.
Scaling the Multiples
A number when successively divided by 5 and 6 leaves remainders 3 and 2 respectively. What is the largest 3-digit number that satisfies this condition?
Show solution
First, find the least such number .
Divisors: 5, 6.
Remainders: 3, 2.
.
Next, find the general form of the number.
The product of divisors is .
The general form is .
We need the largest 3-digit number, so .
.
The largest integer value for is 32.
Substitute into the general form:
.
The largest 3-digit number is 973.
Takeaway: The interval between valid numbers in successive division is always the product of all the divisors (d1 d2 d3...).
The True Remainders
A number is successively divided by 6, 7, and 8, leaving remainders 3, 4, and 5. What would be the remainder if the number was directly divided by 336?
Show solution
Let's find the general form of the number.
First, find using the linear formula:
.
The general form is .
.
The question asks for the remainder when the number is divided by 336.
By looking at the general form , it is obvious that any such number, when divided by 336, will leave a perfect quotient of and a remainder of 237.
So, the remainder is simply , which is 237.
Takeaway: The remainder when dividing the original number by the product of all divisors is exactly equal to the N min calculated from the ladder.
Final Quotient Non-Zero
A number when successively divided by 2, 3, and 5 leaves remainders 1, 2, and 3. If the final quotient is 4, what is the number?
Show solution
Usually we assume the final quotient is 0 to find the minimum number. Here, the final quotient is explicitly given as 4.
Let's use the ladder method.
Divisors: 2, 3, 5.
Remainders: 1, 2, 3.
Final Quotient: 4.
Step 1 (Bottom): .
Step 2 (Middle): .
Step 3 (Top): .
The number is 143.
(Check: R1; R2; R3. Correct).
Takeaway: If the final quotient is specified, simply substitute it instead of 0 at the bottom of the ladder and climb up normally.
Algebraic Successive Division
When is successively divided by and , the remainders are and . Express the minimum value of algebraically.
Show solution
This is a straight application of the linear formula or ladder method.
Divisors:
Remainders:
Final Quotient: (for minimum value).
Ladder:
.
.
Using the linear formula:
Here , , .
.
The algebraic expression is .
Takeaway: The structural logic of successive division applies seamlessly to variables. N min for two layers is simply (second remainder first divisor) + first remainder.
Practice questions
Question 1 · CAT Level
A positive integer when divided successively by and leaves remainders and respectively. If the order of the divisors is reversed (i.e., is divided successively by and ), what are the respective remainders obtained?
Show answer and explanation
Answer: (A) 4, 0, 3
By the ladder algorithm for successive division, the number can be expressed as:
, where is the final quotient.
The minimum positive value occurs at , giving .
Now divide successively by the reversed sequence of divisors :
(remainder ); (remainder ); (remainder ).
For any higher value , the remainders remain identically because is divisible by .
Hence, the respective remainders are .
Question 2 · CAT Level
A positive integer when divided successively by and leaves remainders and respectively. If is a four-digit number strictly between and and is completely divisible by , what is the sum of the digits of ?
Show answer and explanation
Answer: (C) 22
Unfolding the successive division ladder: .
We are given that is a multiple of , so .
Reducing modulo : , and .
The congruence becomes .
Thus , which gives .
We are given that .
For : (which lies in ).
Summing the digits of : .
Question 3 · CAT Level
A positive integer when divided successively by and leaves remainders and respectively. What is the remainder when is divided directly by ?
Show answer and explanation
Answer: (C) 58
Write out the algebraic structure of the successive division:
.
Expanding step-by-step gives , so .
We wish to find the remainder when is divided directly by .
Since is an exact multiple of (), the term contributes to the remainder.
Therefore, .
Dividing by : , giving a unique remainder of .
Question 4 · CAT Level
Let be the smallest positive integer that leaves remainders and when divided simultaneously by and respectively. Let be the smallest positive integer that leaves remainders and when divided successively by and respectively. What is ?
Show answer and explanation
Answer: (B) 70
For simultaneous division, the difference is constant: .
Thus .
The smallest positive integer is obtained for : .
For successive division, unfolding the ladder gives with final quotient .
The smallest positive integer occurs at : .
Therefore, .
Question 5 · CAT Level
A positive integer when divided successively by and leaves remainders and respectively. How many three-digit integers satisfy this property?
Show answer and explanation
Answer: (C) 8
Express the successive division recursively: with .
Unfolding step-by-step from inside out:
, and .
Thus .
For to be a three-digit integer, .
Since is an integer, , giving exactly valid values ().
Study this concept with interactive practice in PrepSoc.
Open the concept library