Define endid's divison lemma with example

ex

Explanation:

Euclid's lemma — If a prime p divides the product ab of two integers a and b, then p must divide at least one of those integers a and b. For example, if p = 19, a = 133, b = 143, then ab = 133 × 143 = 19019, and since this is divisible by 19, the lemma implies that one or both of 133 or 143 must be as well

..

si no quieres comer en un restaurante, puedes ordenar comida por el restaurante del hotel.