prove for any 2 non negative integers x and y, where x>y, if their gcd IS Y, THEN THEIR LCM is x

Elements Of Modern Algebra
8th Edition
ISBN:9781285463230
Author:Gilbert, Linda, Jimmie
Publisher:Gilbert, Linda, Jimmie
Chapter2: The Integers
Section2.4: Prime Factors And Greatest Common Divisor
Problem 24E: Let (a,b)=1. Prove that (a,bn)=1 for all positive integers n.
icon
Related questions
Topic Video
Question
100%

prove for any 2 non negative integers x and y, where x>y, if their gcd IS Y, THEN THEIR LCM is x

Expert Solution
Step 1

The objective is to show that LCM(x,y)=x, given GCD(x,y)=y; where x and y are non-negative integers such that x>y.

steps

Step by step

Solved in 2 steps

Blurred answer