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 g. c. d (a, b) = 8, l.c.m.. (a, b) = 64 and a > b then a = ……..

We know that g. c. d. (a, b) × l.c.m.. (a, b) = ab


8 × 64 = ab


ab = 512 = 2 × 2 × 2 × 2 × 2 × 2 × 2 × 2 × 2


Given, g. c. d (a, b) = 8 = 2 × 2 × 2


So, greatest divisor is 8.


Therefore, one of the number is 8.


Therefore the other number is

More from this chapter

All 128 →
43

g. c. d (136, 221, 391) = …….

43

l.c.m.. (136, 221, 391) = ………

43

If g. c. d (a, b) = 1, then g. c. d (a — b, a b) = ………

43

1f n > 1, n4 + 4 is. n E N

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