Problem 3. Let a, b and n be positive integers. Prove that (a) gcd(a", br) = gcd(a, b)" and lcm(a", br) = lcm(a, b)"; (b) gcd (a • n, b. n) = gcd(a, b) · n and lcm(a · n, b⋅n) = lcm(a, b) · n;
Problem 3. Let a, b and n be positive integers. Prove that (a) gcd(a", br) = gcd(a, b)" and lcm(a", br) = lcm(a, b)"; (b) gcd (a • n, b. n) = gcd(a, b) · n and lcm(a · n, b⋅n) = lcm(a, b) · n;
Algebra & Trigonometry with Analytic Geometry
13th Edition
ISBN:9781133382119
Author:Swokowski
Publisher:Swokowski
Chapter2: Equations And Inequalities
Section2.1: Equations
Problem 62E
Related questions
Question
![Problem 3. Let a, b and n be positive integers. Prove that
(a) gcd(a", br) = gcd(a, b)” and lcm(a^, b") = lcm(a, b)”;
(b) gcd(a-n, b.n) = gcd(a, b) · n and lcm(an, b⋅ n) = lcm(a, b) . n;](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F029f6964-db88-4f29-818c-83a6e31791c3%2Ff37bc57a-f310-47bd-aaa3-2b63dc29d8c7%2F42rtizs_processed.png&w=3840&q=75)
Transcribed Image Text:Problem 3. Let a, b and n be positive integers. Prove that
(a) gcd(a", br) = gcd(a, b)” and lcm(a^, b") = lcm(a, b)”;
(b) gcd(a-n, b.n) = gcd(a, b) · n and lcm(an, b⋅ n) = lcm(a, b) . n;
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps with 2 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage