This is what I've done so far. Don't know what to do from here.
You can just apply Bezout's once more. You know that there exist integers s,t such that md=(am)s+(bm)t... so what does Bezout's say about this? How are md, am, and bm related?
You can just apply Bezout's once more. You know that there exist integers s,t such that md=(am)s+(bm)t... so what does Bezout's say about this? How are md, am, and bm related?
That means that gcd(am,bm)=md but that still doesn't show that rule 2 is satisfied