Answers>Maths>IB>Article

How does Euclid's algorithm give solutions to equations?

Euclid's algorithm is really useful to be able to, firstly, see if two numbers are co-prime, in other words to see if they share any common factors, but also to find solutions to equations. Say we have two integers that satisfy: 32x + 24y = 16 Then we use Euclid's algorithm to first calculate the greatest common divisor (gcd) of 32 and 24. Hopefully, the method of this is ok? So we get gcd(32,24) = 8. Now, we can reverse what we did to get our solutions to the equation above. But don't forget that we had the equation equal to 16, not 8. This is often used in exams to trip up students, so look out for that.

Answered by Abby R. Maths tutor

1250 Views

See similar Maths IB tutors

Related Maths IB answers

All answers ▸

(a) Find the set of values of k that satisfy the inequality k^2 - k - 12 < 0. (b) We have a triangle ABC, of lengths AC = 4 and BC = 2. Given that cos B < 1/4 , find the range of possible values for AB:


Given two functions f and g where f(x)=3x-5 and g(x)=x-2. Find: a) the inverse f^-1(x), b) given g^-1(x)=x+2, find (g^-1 o f)(x), c) given also that (f^-1 o g)(x)=(x+3)/3, solve (f^-1 o g)(x)=(g^-1 o f)(x)


dy/dx = 10exp(2x) - 4; when x = 0, y = 6. Find the value of y when x = 2.


Find integer solutions for m - n(log3(2)) = 10(log9(6)).


We're here to help

contact us iconContact usWhatsapp logoMessage us on Whatsapptelephone icon+44 (0) 203 773 6020
Facebook logoInstagram logoLinkedIn logo

© MyTutorWeb Ltd 2013–2024

Terms & Conditions|Privacy Policy