Lemma di Euclide

Euclid's Lemma If a number n, a positive integer, divides the product of two positive integers a and b, and is coprime to one of them, then it divides the other. Proposition 30 If a prime number divides the product of two positive integers, then the prime number divides at least one of the two positive integers. For the proof, we will use Bezout's identity:    • Esempi sull'identità di Bezout   🎓Want a lesson just for you? Contact me here! https://schoolr.net/it/profile/agosti... 📌Want access to http://www.illogicomatematico.it? Email me at [email protected] First-grade playlist:    • CLASSI PRIME   Second-grade playlist:    • CLASSI SECONDE   🎯 Visit my Facebook page:   / illogicomatematico   Join the IllogicoMatematico group   / 646940382035749   eLearning AREA: http://www.illogicomatematico.it/