According to Euclid’s division algorithm, using Euclid’s division lemma for any two positive integers a and b with a > b enables us to find the -

see full answer

High-Paying Jobs That Even AI Can’t Replace — Through JEE/NEET

🎯 Hear from the experts why preparing for JEE/NEET today sets you up for future-proof, high-income careers tomorrow.

An Intiative by Sri Chaitanya

H.C.F

L.C.M

Decimal expansion

Probability

answer is B.

(Unlock A.I Detailed Solution for FREE)

Best Courses for You

JEE

NEET

Foundation JEE

Foundation NEET

CBSE

Detailed Solution

Concept- This question uses the basic definition of the Euclidean division lemma and applies it to special conditions. That is, if the unique integer that satisfies the division lemma is assumed to be zero.
According to Euclid's division lemma
For any pair of positive integers a and b, you can find unique integers p and q that satisfy the relationship.

, where

0
So if

. From

and

. The basis of the Euclidean division algorithm is the Euclidean division lemma. To calculate the greatest common divisor (H.C.F) of two positive integers

and

, use Euclid's division algorithm. H.C.F is the maximum number that exactly divides two or more positive integers. To be precise, dividing the two integers

and

means that the remainder is zero.
Hence, the correct answer is option 2) LCM

Watch 3-min video & get full concept clarity