I have in my notes:
a divides y, b divides y, gcd(a,b) = 1 thus ab divides y.
Can someone explain this to me.
x Turn on thread page Beta
Could someone explain this please watch
- Thread Starter
- 21-01-2010 13:33
- 21-01-2010 13:44
Suppose and . Then since , we have that each of the are distinct (for all i,j). If then and if then (for some constant integers ), but because of unique prime factorisation we must have (for some constant integer ), and hence (for some constant integer , and hence .
This is a bit messy and there's probably a neater way of showing it than this, but you get the idea.