Question:

Using Euclid division algorithm find the HCF of 148 and 185.

Show Hint

HCF using Euclid’s Algorithm: Divide the larger number by the smaller number, take the remainder, and repeat until the remainder is 0.
Updated On: Oct 27, 2025
Hide Solution
collegedunia
Verified By Collegedunia

Solution and Explanation

Using Euclid’s division algorithm, we divide 185 by 148:
\[ 185 = 148 \times 1 + 37 \] Now, divide 148 by 37:
\[ 148 = 37 \times 4 + 0 \] Since the remainder is 0, the HCF is \( \mathbf{37} \).
Correct Answer: \( 37 \)
Was this answer helpful?
0
0

Questions Asked in Bihar Class X Board exam

View More Questions