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

Start JEE / NEET / Foundation preparation at rupees 99/day !!

21% of IItians & 23% of AIIMS delhi doctors are from Sri Chaitanya institute !!

An Intiative by Sri Chaitanya

H.C.F

L.C.M

Decimal expansion

Probability

answer is B.

(Unlock A.I Detailed Solution for FREE)

Ready to Test Your Skills?

Check your Performance Today with our Free Mock Test used by Toppers!

Take Free Test

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

Result Producing online coaching for JEE/NEET of south India

Largest All India Test Series for JEE/NEET

Best Books for IIT JEE

Best Books for NEET

How to Join IIT after 10th

🔥 Start Your JEE/NEET Prep at Just ₹1999 / month - Limited Offer! Check Now!

Get Expert Academic Guidance – Connect with a Counselor Today!

Result Producing online coaching for JEE/NEET of south India

Largest All India Test Series for JEE/NEET

Best Books for IIT JEE

Best Books for NEET

How to Join IIT after 10th