Answers

2016-05-07T11:30:54+05:30
First subtract 5 from both the nos take hcf of 240, and1024 u get the answer
0
can u complete the anser
find the HCF of 240 n 1024 using euclid algorith
or else i'll report ur answer
yes using Euclid
2016-05-07T11:40:09+05:30
245 - 5 = 240
1029-5 = 1024

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

16 is the largest no which divides 245 and 1029 living remainder 5 in each case 
0