A community for students.
Here's the question you clicked on:
 0 viewing
anonymous
 one year ago
Given a,b,n are positive integers. If an and bn with gcd(a,b) = 1, prove abn
anonymous
 one year ago
Given a,b,n are positive integers. If an and bn with gcd(a,b) = 1, prove abn

This Question is Closed

ikram002p
 one year ago
Best ResponseYou've already chosen the best response.1an>n=ak bn>n=bh Since gcd(a,b)=1 then there exist g =kh s.t n=abg thus abn

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0why does gcd(a,b) = 1 implies there is an integer g such that g = kh? @ikram002p

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0do u still need help

xapproachesinfinity
 one year ago
Best ResponseYou've already chosen the best response.3gcd(a,b)=1 then there is some integers l and s such that al+bs=1 so nal+nbs=n but then we know that an: n=ak bn: n=bh bahl+abks=n from left we can deduce that ba divides it so must be true for the right too

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0@xapproachesinfinity Awesome! thank you! Didn't think gcd(a,b) = 1 = al+bs would be used in this case.

xapproachesinfinity
 one year ago
Best ResponseYou've already chosen the best response.3yeah! didn't understand what ikram did too i was trying to see through that for awhile

ikram002p
 one year ago
Best ResponseYou've already chosen the best response.1i guess i made mistake it not like g=kh xD that is wrong
Ask your own question
Sign UpFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.