Question

using euclids division algorith,find hcf of 165 and 395

Answer 1

I HOPE THIS HELPS YOU.

IF IT HELPS MARK ME AS BRAINLIST

Answer 2

Answer:

To find:

  H.C.F of 165 and 395

according to euclid's division algorithm,

for any positive integer 'a'

a = bq +r ; and proceed algorithm for 'b' and 'r' till r becomes zero

395 = 165 * 2 +65

r≠0 , hence proceed further ,apply algorithm to 165 and 65

⇒ 165 = 65 *2 +35

r≠0 , hence proceed further ,apply algorithm to 65 and 35

⇒ 65 = 35*1 +30

r≠0 , hence proceed further , apply algorithm to 35 and 30

⇒ 35 = 30*1 +5

r≠0 , hence proceed further , apply algorithm to 30 and 5

⇒ 30 = 5*6 +0

Here, r = 0 ,hence the H.C.F is 5