Demuestre: Si a | b y b | c, entonces a | c.
Demuestre: Si a | b y b | c, entonces a | c.
This theorem is usually written as follows:
Teorema: Let a, b, and c be integers with a ne 0 and b ne 0. If a|b and b|c, then a|c.
In order to prove this statement, we first need to understand what the math notation […]
Buscar
