Recent content by mcspammle

  1. M

    Abstract Algebra Proof: gcd(s,t)=r and st=r+v

    If r+v=r(1+a) couldn't I do r+v=v(1+c) saying r=vc instead. With that r=v+vc-v. Sa+Tb=r... (dr)a+Tb=r... dv(c)a+Tb=r... So V(other int)+T(other int)=r so gcd(v,t)=r. Was that possible?
  2. M

    Abstract Algebra Proof: gcd(s,t)=r and st=r+v

    I understand what you did. V is some random integer times A. I just didn't see how that could play out to my advantage later. This is only my second homework and we only learned the division theorem (AKA. f divides c so, f=cx) and the GCD theorem which I did below. I am sure you are heading down...
  3. M

    Abstract Algebra Proof: gcd(s,t)=r and st=r+v

    I see how you did that but we usually can only do those "clearly" moments when we have a theorem or lemma to reference to, yet there is none for that. I still can't work from der=(1+a) anyway... I don't see how the "a" is going to help in anyway. I feel like I need to just get V*(any...
  4. M

    Abstract Algebra Proof: gcd(s,t)=r and st=r+v

    Homework Statement Let r,s,t and v be integers with r>0. If st=r+v and gcd(s,t)=r, then gcd(v,t)=r Homework Equations Just stumped. I am not sure what to do next.The Attempt at a Solution There are 2 integers d and e such that S=dR and T=eR, and 2 integers a and b such that Sa+Tb=R. I know I...
Back
Top