GCD of ab,c = 1: Implications for a & b

  • Thread starter Thread starter iamalexalright
  • Start date Start date
  • Tags Tags
    Gcd
iamalexalright
Messages
157
Reaction score
0

Homework Statement


If gcd(ab,c) = 1 then gcd(a,c)=1 and gcd(b,c)=1


2. The attempt at a solution
Well, if gcd(ab,c) = 1 we know that

abk + cl = 1 for some integers k and l

not really sure where to go from here... any hints?
 
Physics news on Phys.org
Also, if gcd(a,c)=1, then am+cn=1 for some integers m and n. Now what if m=bk?

Repeat for the other one.
 
oh wow, that is painfully obvious ... thanks Char. Limit !
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...

Similar threads

Replies
8
Views
3K
Replies
2
Views
2K
Replies
1
Views
2K
Replies
1
Views
1K
Replies
1
Views
1K
Replies
11
Views
2K
Back
Top