Ask a New Question

Asked by George

This is a problem concerning GCD.

I need to prove gcd(a,b) = gcd(a,b+a).

I always get like like halfway then hit a roadblock (e.g. i can prove gcd(a,b) <= gcd(a,b+a) but not gcd(a,b) >= gcd(a,b+a).
16 years ago

Answers

Answered by George
By the way what ive got so far is:

gcd(a,b) = d, so d|a and d|b, so d|(a+b). Since d|(a+b) and d|a d <= gcd(a,b+a), which means gcd(a,b) <= gcd(a,b+a).

Its the other half that im stumped for.
16 years ago
There are no AI answers yet. The ability to request AI answers is coming soon!

Related Questions

Problem #1 Number problem. If one-half of one integer is subtracted from three-fifths of the next... Did I do this problem right? (3^3/3)^2= 3^6/3^2= 3^4= 81. need help with this problem someone please help meeeeeeeeeeeeeeeeeeee!!!!!!! 15-(2x+7)=14... There was this problem on a test that I took recently. But, I never learned how to solve this.... I need help with this problem. Factoring with Two Variables h^2  9hs + 9s^2 I am having problem with this one you are going to help a neighbor build a ramp so he can easily go... Problem A: 6a + (8b + 2a) e1. = 6a + (2a + 8b) Asymmetric Bdistributive Cmultiplicative iden... PROBLEM 4: PARKING LOT PROBLEM (3 points possible) Mary and Tom park their cars in an empty parkin... Think about the problem you chose for the service project. Was it difficult to put into effect? (If... Problem statement about problems faced when planning school trips
Ask a New Question
Archives Contact Us Privacy Policy Terms of Use