Hcf of 693 and 1078 with solution
Answers
Answered by
13
Hey dear!
Here is yr answer....
HCF of 693 & 1078 -----
According to Euclid's division algorithm-------
a = bq+r
1078>693
1078 = 693 × 1 + 385
693 = 385 × 1 + 308
385 = 308 × 1 + 77
308 = 77 × 4 + 0
Here, remainder is 0.
Therefore, HCF of 693 & 1078 = 77
Hope it hlpz...
Here is yr answer....
HCF of 693 & 1078 -----
According to Euclid's division algorithm-------
a = bq+r
1078>693
1078 = 693 × 1 + 385
693 = 385 × 1 + 308
385 = 308 × 1 + 77
308 = 77 × 4 + 0
Here, remainder is 0.
Therefore, HCF of 693 & 1078 = 77
Hope it hlpz...
Answered by
7
Heya !!!
Prime factorisation of 693 = 3 × 3 × 11 × 7
Prime factorisation of 1078 = 7 × 7 × 11 × 2
HCF of 693 and 1078 = 11 × 7 = 77.
HOPE IT WILL HELP YOU........ :-)
Prime factorisation of 693 = 3 × 3 × 11 × 7
Prime factorisation of 1078 = 7 × 7 × 11 × 2
HCF of 693 and 1078 = 11 × 7 = 77.
HOPE IT WILL HELP YOU........ :-)
Similar questions