using Euclid division algorithm find the whether the pair of numbers 360 and 840 are co prime or not
Answers
Answered by
40
By Euclid's division lemma:
360 = 2 × 2 × 2 × 3 × 3 × 5
840 = 2 × 2 × 2 × 3 × 7 × 5
so they are non co- prime nos.
360 = 2 × 2 × 2 × 3 × 3 × 5
840 = 2 × 2 × 2 × 3 × 7 × 5
so they are non co- prime nos.
Answered by
16
hope this will help u......
Attachments:
Rohit56452:
i wrote 360 and 840
sry
i read the question wrong
its okay
sry once again
hwy
why
wait
i will give u the answer
Similar questions