gcd(a,b) = 1 and a|m and b|m. How to prove ab|m without using unique-prime-factorization theorem?
Follow Math Help Forum on Facebook and Google+
Hello, Originally Posted by rf0 gcd(a,b) = 1 and a|m and b|m. How to prove ab|m without using unique-prime-factorization theorem? Therefore and hence a divides By Gauss theorem, if and , then So here, we can conclude that . So we can write So Therefore
Thanks a bunch, I understand it now
View Tag Cloud