Question

Using occludes division algorithm find HCF of 255 1309 and 1326

Answer 1

Hello my dear friend .
answer is here ✓✓
-----------------------------------------

By Euclid's division lemma on 255 and 1309
For every point of integer a and b there since exist unique integer q and r
such that a = bq + r

where 0 ≤ r < b
so here a > b
a = 1309 and b = 255

=> 1309 = 255 × 5 + 34
=> 255 = 34 × 7 + 17
=> 34 = 17 × 2 + 0

here r = 0 H.C.F of 1309 and 255 is 17

Now apply Euclid's division lemma on 17 and 1326
Here ,
a = 1326 and b = 17
so That a > b

=> 1326 = 17 × 78 + 0
Here, r = 0 , so HCF of 17 and 1326 is 17 .
--------------------------------------------------------
HCF OF 255 , 1309 AND 1326 IS 17 .
_______________________________

$hope \: \: its \: helps \: \: u$
<<<☺☺>>>

Answer 2

Answer:

Step-by-step explanation:

Euclid's division lemma on 255 and 1309

For every point of integer a and b there since exist unique integer q and r

such that a = bq + r

where 0 ≤ r < b

so here a > b

a = 1309 and b = 255

=> 1309 = 255 × 5 + 34

=> 255 = 34 × 7 + 17

=> 34 = 17 × 2 + 0

here r = 0 H.C.F of 1309 and 255 is 17

Now apply Euclid's division lemma on 17 and 1326

Here ,

a = 1326 and b = 17

so That a > b

=> 1326 = 17 × 78 + 0

Here, r = 0 , so HCF of 17 and 1326 is 17 .

--------------------------------------------------------

HCF OF 255 , 1309 AND 1326 IS 17 .

_______________________________