CameraIcon

SearchIcon

MyQuestionIcon

193

You visited us 193 times! Enjoying our articles? Unlock Full Access!

Divisibility by 3

29. Use Eucli...

Question

29. Use Euclid's division algorithm to find whether 897 and 2160 are co-primes or not.

Open in App

Solution

Suggest Corrections

thumbs-up

0

Similar questions

Using euclids division algorithm find whether 847 and 2160 are co prime or not.

Using euclid's division algorithm find whether the pair of numbers 847 and 2160 are co primes or not

Q. Using Euclid's division algorithm, check whether

231, 396

are co-prime or not. justify your answer.

Q. Using Euclid's division algorithm prove that

847, 2160

are Co-primes relatively prime ?

Q. Use Euclids division algorithm to find the HCF of:

867

225

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Why Divisibility Rules?

MATHEMATICS

Watch in App

explore_more_icon

Explore more

Divisibility by 3

Standard VIII Mathematics

Join BYJU'S Learning Program

CrossIcon