Find the least number which when divided by 6,7,8,9 and 12 leaves the remainder 2 in each case
Answers
Answered by
63
Given numbers,
6 , 7 , 8, 9 and 12
Prime factorization of,
6=2×3
7=1×7
8=2³
9=3²
12=2²×3
LCM=product of each prime factor of highest power
LCM=2³×3²×7=504
504 is the least number exactly divisible by 6,7,8,9 and 12.
Hence,
least number which when divided by 6,7,8,9 and 12 leaves remainder 2 in each case=504+2=506.
6 , 7 , 8, 9 and 12
Prime factorization of,
6=2×3
7=1×7
8=2³
9=3²
12=2²×3
LCM=product of each prime factor of highest power
LCM=2³×3²×7=504
504 is the least number exactly divisible by 6,7,8,9 and 12.
Hence,
least number which when divided by 6,7,8,9 and 12 leaves remainder 2 in each case=504+2=506.
Answered by
2
Answer:
Step-by-step explanation:
Given:
, and
To find the least number.
Step 1
The prime factors are:
Step 2
The least common multiple (LCM) of a set of numbers exists as the smallest number that leaves 0 as the remainder each time when divided by any of those digits.
Step 3
So, exists the least number that leaves 0 as the remainder each time when divided by any of and
So, the required number
Therefore will be the least number which when divided by , leaves the remainder each time.
#SPJ2
Similar questions
Science,
7 months ago
India Languages,
1 year ago
Math,
1 year ago
Math,
1 year ago
Math,
1 year ago