Skip to content
Philoid
Browse Saved
Back to chapter
Maths
1. Euclids Algorithm and Real Numbers
Home · Class 10 · Maths · Ref. Book · 1. Euclids Algorithm and Real Numbers
Prev
Next
Q43 of 128 Page 25

If p, q, r are distinct primes, their l.c.m.. is ……

p,q and r are distinct primes.

So, they have no common factor other than 1.


Then their g. c. d is 1.


Therefore, l.c.m. of two numbers =


= = pqr

More from this chapter

All 128 →
43

If l.c.m.. of two numbers (greater than 1) is the product of them, then their g. c. d is ……

43

If p1 and p2 are distinct primes, their g. c. d is

43

g. c. d (15, 24, 40) = …….

43

l.c.m. (15, 24, 40) = …….

Questions · 128
1. Euclids Algorithm and Real Numbers
1 2 3 4 5 6 1 1 1 2 3 4 1 1 1 1 2 2 2 2 3 3 3 4 4 4 4 4 5 6 7 8 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 1 1 1 1 1 1 1 1 2 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43
Back to chapter
ADVERTISEMENT
About Contact Privacy Terms
Philoid · 2026
  • Home
  • Search
  • Browse
  • Quiz
  • Saved