
Elementary Math Fractions, Percentages, Word Problems, Equations, Inequations, Factorization, Expansion 
 LinkBack  Thread Tools  Display Modes 
December 8th, 2016, 05:56 AM  #1 
Newbie Joined: Aug 2016 From: SantosSP / 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, 09: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 
January 11th, 2017, 06:46 PM  #3 
Newbie Joined: Jan 2017 From: canada Posts: 1 Thanks: 0 
(3n, 6n + 3) = (3n, 6n + 3  2*3n) = (3n, 3) (3, 3n) = (3, 3n  n*3) = (3, 0) = 3 this what the math is, just practice practice and practice. and go through this WELCOME TO GALAXY TOPPERS  UCMAS Brain development program, based on Mental Math and Abacus techniques School it will help you 