Scribd
Upload
1K views10 pages

Solving LCM HCF Remainder Problems

The document discusses problems involving the highest common factor (HCF) and lowest common multiple (LCM) of numbers. It outlines 4 types of problems each for HCF and LCM, providing examples of each type. For HCF, the types are: finding the greatest number that divides sets of numbers, divides numbers leaving a given remainder, divides numbers leaving the same remainder, and divides numbers leaving given remainders. For LCM, the types are: finding the smallest number divisible by sets of numbers, the smallest number of a given digit length, the smallest number leaving a given remainder, and the smallest number leaving given remainders. It provides examples and summaries to illustrate the different problem types.

Uploaded by

hadhai
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
1K views10 pages

Solving LCM HCF Remainder Problems

The document discusses problems involving the highest common factor (HCF) and lowest common multiple (LCM) of numbers. It outlines 4 types of problems each for HCF and LCM, providing examples of each type. For HCF, the types are: finding the greatest number that divides sets of numbers, divides numbers leaving a given remainder, divides numbers leaving the same remainder, and divides numbers leaving given remainders. For LCM, the types are: finding the smallest number divisible by sets of numbers, the smallest number of a given digit length, the smallest number leaving a given remainder, and the smallest number leaving given remainders. It provides examples and summaries to illustrate the different problem types.

Uploaded by

hadhai
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

10/13/2015

These slides accompany the YouTube Video Tutorial: https://www.youtube.com/watch?v=CMLB4QN801Q

Remainder
Problems
with HCF and LCM
10/13/2015

www.doorsteptutor.com

Recap

Method:

Prime Factorization
Divisibility tests

Problem Keywords

LCM: Minimum number, Least amount, Smallest


duration etc.
HCF: Maximum number, Most amount, Longest
duration etc.
10/13/2015

www.doorsteptutor.com

www.examrace.com www.doorsteptutor.com

10/13/2015
These slides accompany the YouTube Video Tutorial: https://www.youtube.com/watch?v=CMLB4QN801Q

HCF Remainder Problems

4 Types
10/13/2015

www.doorsteptutor.com

Greatest Number Which Divides x, y and z?


HCF Type 1 (Simple)
Lets start with a simple example: 12, 18, 30

10/13/2015

www.doorsteptutor.com

www.examrace.com www.doorsteptutor.com

10/13/2015
These slides accompany the YouTube Video Tutorial: https://www.youtube.com/watch?v=CMLB4QN801Q

Greatest Number Which Divides x, y and z


Leaves Same Remainder r (Given)?
HCF Type 2 (Same Remainder- Given)
Lets find a number which divides all 14, 20 and 32
leaving remainder 2

10/13/2015

www.doorsteptutor.com

Greatest Number Which Divides x, y and z


Leaves Same Remainder r (Not Given)?
HCF Type 3 (Same Remainder- Not Given)
Number which divides all 14, 20 and 32 leaving
same remainder

10/13/2015

www.doorsteptutor.com

www.examrace.com www.doorsteptutor.com

10/13/2015
These slides accompany the YouTube Video Tutorial: https://www.youtube.com/watch?v=CMLB4QN801Q

Greatest Number Which Divides x, y and z,


Leaving Remainders a, b and c (Respectively)
HCF Type 4 (Different Remainder- Given)
Number which divides 12, 18 and 30 leaving
remainder 2, 3 and 0.

10/13/2015

www.doorsteptutor.com

HCF Problems 4 Types Summary


Understand and Remember
1. Greatest number which divides x, y and z = HCF (x, y, z)
2. Greatest number which divides x, y and z and leaves
remainder r = HCF(x - r, y - r, z - r)
3. Greatest number which divides x, y and z and leaves
same remainder = HCF( , , )
4. Greatest number which divides x, y and z and leaves
remainder a, b, c = HCF(x - a, y - b, z - c)
10/13/2015

www.doorsteptutor.com

www.examrace.com www.doorsteptutor.com

10/13/2015
These slides accompany the YouTube Video Tutorial: https://www.youtube.com/watch?v=CMLB4QN801Q

LCM Remainder Problems

4 Types
10/13/2015

www.doorsteptutor.com

Smallest Number Divisible by x, y and z?


LCM Type 1 (Simple)
Lets start with a simple example: 6, 9, 12

10/13/2015

www.doorsteptutor.com

10

www.examrace.com www.doorsteptutor.com

10/13/2015
These slides accompany the YouTube Video Tutorial: https://www.youtube.com/watch?v=CMLB4QN801Q

Smallest/Largest Number of n Digits Divisible by


x, y, z? LCM Type 2 (Multiples of LCM)
Smallest/Largest number of 3 digits divisible by 6, 9,
12

10/13/2015

www.doorsteptutor.com

11

Smallest Number When Divided by x, y and z


Leaves Same Remainder r (Given)?
LCM Type 3 (Same Remainder)
Number divisible by 6, 9, 12 leaves remainder 2

10/13/2015

www.doorsteptutor.com

12

www.examrace.com www.doorsteptutor.com

10/13/2015
These slides accompany the YouTube Video Tutorial: https://www.youtube.com/watch?v=CMLB4QN801Q

Smallest Number When Divided by x, y and z


Leaves Remainder a, b, c?
LCM Type 4 (Different Remainder)

x - a = y - b = z - c = common
difference d
Smallest number divided by 2, 3, 4, 5, 6 leaves
remainder 1, 2, 3, 4, 5
10/13/2015

www.doorsteptutor.com

13

LCM Problems 4 Types Summary


Understand and Remember
1. Smallest number divisible by x, y and z = LCM(x, y, z)
2. Smallest number of n digits divisible by x, y and z = Multiple
of LCM(x, y, z)
3. Smallest number when divided by x, y and z leaves same
remainder r = LCM(x, y, z) + r
4. Smallest number when divided by x, y and z leaves
remainder a, b, c
x - a = y - b = z - c = common difference d
LCM (a, b, c) - d
10/13/2015

www.doorsteptutor.com

14

www.examrace.com www.doorsteptutor.com

10/13/2015
These slides accompany the YouTube Video Tutorial: https://www.youtube.com/watch?v=CMLB4QN801Q

Variations of LCM (Understand)


Smallest/Largest number of n digits when divided by
x, y and z leaves same remainder r = Multiple of
LCM(x, y, z) + r
Smallest/Largest number of n digits when divided by x, y
and z leaves remainder a, b, c = Multiple of LCM(x, y, z)
d (x-a = y-b = z-c = common difference d)
10/13/2015

www.doorsteptutor.com

15

Example - 1

Find the greatest number of 5-digits which on being


divided by 9, 12, 24 and 45 leaves 3, 6, 18 and 39 as
remainders respectively.

10/13/2015

www.doorsteptutor.com

16

www.examrace.com www.doorsteptutor.com

10/13/2015
These slides accompany the YouTube Video Tutorial: https://www.youtube.com/watch?v=CMLB4QN801Q

Example - 2

Find the smallest number which, on being added 23


to it, is exactly divisible by 32, 36, 48 and 96.

10/13/2015

www.doorsteptutor.com

17

Example 3 (Advanced)

When dividing a number by 12, 15 or 48 there will


always be a remainder of 10. If the number is the
least possible, how many divisors does the number
have?

Number of divisors of paqb (p, q primes) is (a + 1) (b


+ 1): Application of Combination
10/13/2015

www.doorsteptutor.com

18

www.examrace.com www.doorsteptutor.com

10/13/2015
These slides accompany the YouTube Video Tutorial: https://www.youtube.com/watch?v=CMLB4QN801Q

Generalization Chinese Remainder Theorem


Next Class!!

Find the smallest number which when divided by 7, 9,


11 produces 1, 2, 3 as reminders
71=6
92=7
11 3 = 8

But

721=5
922=5
11 2 3 = 5

10/13/2015

www.doorsteptutor.com

19

www.examrace.com www.doorsteptutor.com

10

You might also like