e. If gcd(m,p) = 1 and p is prime, show that gcd(m,pk) = 1 for all k2 1.

Business, Finance, Economics, Accounting, Operations Management, Computer Science, Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Algebra, Precalculus, Statistics and Probabilty, Advanced Math, Physics, Chemistry, Biology, Nursing, Psychology, Certifications, Tests, Prep, and more.
Post Reply
answerhappygod
Site Admin
Posts: 899603
Joined: Mon Aug 02, 2021 8:13 am

e. If gcd(m,p) = 1 and p is prime, show that gcd(m,pk) = 1 for all k2 1.

Post by answerhappygod »

E If Gcd M P 1 And P Is Prime Show That Gcd M Pk 1 For All K2 1 1
E If Gcd M P 1 And P Is Prime Show That Gcd M Pk 1 For All K2 1 1 (5.71 KiB) Viewed 36 times
If gcd(m,p) = 1 and p is prime, show that gcd(m,p^k) = 1 for allk≥ 1.
e. If gcd(m,p) = 1 and p is prime, show that gcd(m,pk) = 1 for all k2 1.
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!
Top
Post Reply

Return to “Archived Questions & Answers”