My Math Forum I need help!

 Elementary Math Fractions, Percentages, Word Problems, Equations, Inequations, Factorization, Expansion

 December 8th, 2016, 06:56 AM #1 Newbie   Joined: Aug 2016 From: Santos-SP / BRASIL Posts: 15 Thanks: 0 I need help! Be a = 3n and b = 6n +3 with n ∈ N. Using the Euclidean algorithm and properties of the mdc, show that gcd (a, b) = 3.
 December 8th, 2016, 10:29 AM #2 Newbie   Joined: Dec 2016 From: Geneva Posts: 5 Thanks: 0 This is pretty simple. Using Euclid's algorithm, you find that: (3n, 6n + 3) = (3n, 6n + 3 - 2*3n) = (3n, 3) (3, 3n) = (3, 3n - n*3) = (3, 0) = 3

 Thread Tools Display Modes Linear Mode

 Contact - Home - Forums - Top