0

Theorem 1.1

  1. $a|b$ implies $a|bc$ for any integer $c$;
  2. $a|b$ and $b|c$ imply $a|c$;
  3. $a|b$ and $a|c$ imply $a|(bx + cy)$ for any integers $x$ and $y$;
  4. $a|b$ and $b|a$ imply $a=±b$;
  5. $a|b$, $a>0$, $b>0$, imply $a\leq b$;
  6. if $m ≠ 0$, $a|b$ implies and is implied by $ma|mb$.

Proof: The proofs of these results follow at once from the definition of divisibility. Property 3 admids an obvious extension to an finite set, thus:

$a|b_1$, $a|b_2$,...$a|b_n$ imply $a|\sum_{j=1}^{n}{b_jx_j}$ for any integers $x_j$

p.5

Is "Property 3" a mistake? Shouldn't it be Property 2?

Property 2 can be extended similarly.

To give a sample proof, consider item 3. Since $a|b$ and $a|c$ are given, this implies that there are integers $r$ and $s$ such that $a|b$ and $b = ar$ and $c = as$. Hence, $bx + cy$ can be written as $a(rx +sy)$, and this proves that $a$ is a divisor of $bx + cy$.

p.5

Is "Property 2" a mistake? Shouldn't it be Property 3?

I hope to completely understand this (it is not initially obvious as the book often proclaims i.e. it would be nice to know why something is obvious). Could somebody elaborate on the proofs please?


Ivan Niven; Herbert Zuckerman; Hugh Montgomery. An Introduction to The Theory of Numbers. Copyright 1991. Fifth Edition. 2017 reprint.

  • @KaviRamaMurthy Corrected. Thanks. – Jonathan Komar Oct 09 '18 at 07:29