Question

i need step by step ans.

Answer 1

heya !
here's your answer
hope u like please follow me

Answer 2

By Euclid's Algorithm,
$1170 = 650 \times 1 + 520 \\ 650 = 520 \times 1 + 130 \\ 520 = 130 \times 4 + 0$
therefore,HCF=130
therefore, the required largest no. is 130