Question

Find the largest number which divides 735 and 1155 exactly leaving no remainder

Answer 1

Answer:

Step-by-step explanation:

by using euclids division lemma

a=bq+r where 0_<r<b

let a=1155 and b=735

1155= 735*1 + 420

735= 420*1+ 315

420= 315 * 1+ 105

315= 105* 3+ 0

thus, hcf= 105

there fore 105 is the largest number that divides 735 and 1155 leaving no remainder

Answer 2

Take the HCF of both

HCF of both is 105

Ans is 105