Question

quick answer please with full explanation​

Answer 1

Answer:

2

Step-by-step explanation:

For finding the greatest number we subtract 3 from both 625&1433 as they are leaving the remainder 3.

1433-3=1430

625-3=622

Now

We divide the new numbers, i.e, 1430 and 622

Applying Euclid's division algorithm on 1430 and 622,we get,

1430=622×2+196

Here, we didn't got the remainder as zero.

We further apply Euclid's division algorithm on 622&196. We get,

622= 196×3+34

We further apply Euclid's division algorithm on 196&34.

196=34×5+26

Further applying the division algorithm on 34&26, we get,

34=26×1+8

Further applying the division algorithm on 26&8, we get,

26=8×3+2

Further applying Euclid's division algorithm on 8&2, we get,

8=2×4+0

Here, we get the remainder as zero, therefore the largest number which divides 1433 and 625 leaving remainder 3 is 2.

Hope it helps you!

Answer 2

Step-by-step explanation:

625-5=620

1433-3=1430

greatest number =hcf

hcf of 620,1430

620= 2×2×5×31

1430= 5×2×11×13

hcf=5×2=10