Question

Find the greatest number that can divide 69 and 115 leaving the remainder zero

Answer 1

so here we have to find HCF
by division algorithm , HCF is
115=69*1+46
69=46*1+23
46=23*2+0
hence the remainder comes 0 on multiplied 23
so the HCF is 23

you can also do by prime factorisation!
hope it helps!