Q. 1 B4.2( 55 Votes )

<span lang="EN-US

Answer :

Euclid’s Division is a method for finding the HCF (highest common factor) of two given integers. According to Euclid’s Division Algorithm, For any two positive integers, ‘a’ and ‘b’, there exists a unique pair of integers ‘q’ and ‘r’ which satisfy the relation:

a = bq + r , 0 ≤ r ≤ b

Given integers 196 and 38220. Clearly 38220>196.

By applying division lemma

38220 = 196×195 + 0

Since remainder 0

the HCF of 196 and 38220 is 195.

Rate this question :

How useful is this solution?
We strive to provide quality solutions. Please rate us to serve you better.
Try our Mini CourseMaster Important Topics in 7 DaysLearn from IITians, NITians, Doctors & Academic Experts
Dedicated counsellor for each student
24X7 Doubt Resolution
Daily Report Card
Detailed Performance Evaluation
view all courses

<span lang="EN-USAP- Mathematics

<span lang="EN-USAP- Mathematics

<span lang="EN-USAP- Mathematics