Question

find the largest no. which divides 245 and 1029 and reminder 5 in each case

Answer 1

Hey there !!

==================================

Given, remainder = 5
So, we have to subtract 5 from both nos.
Now, 245–5 = 240 and 1029–5 = 1024

By Euclid's division Lemma, HCF (240, 1024) in the form a = bq + r

1024 = 240 × 4 + 64
240 = 64 × 3 + 48
64 = 48 × 1 + 16
48 = 16 × 3 + 0

HCF (240, 1024) = 16

Thus, the required no. is 16.

==================================

Hope my ans.'s satisfactory.☺

Answer 2

Hey !!

Here is your answer.. ⬇⬇

Given :- Remainder is 5.

Solution :- To find largest no. which divides 245 and 1029 by leaving 5 subtract 5 from 245 and 1029.

Given to find Largest no. hence we will find H.C.F.


1029 - 5 = 1024
245 - 5 = 240

According to Euclid's Algorithm..,

1024 = 240 × 4 + 64
240 = 64 × 3 + 48
64 = 48 × 1 + 16
48 = 16 × 3 + 0

H.C.F = 16

According to fundamental Theorem of Arithmetic..

1024 = 2^10
240 = 2^4 × 3 × 5

H.C.F = 2^4
= 16

HOPE IT HELPS..

THANKS ^-^