Amount Approach Elementary Divisibility

 11 October 00:11   =Elementary Backdrop of Divisibility=

    Divisibility is a key abstraction in amount theory. We say that an accumulation a is divisible by an integer

    b if there exists an accumulation c such that a=bc.

    For example, the accumulation 123456 is divisible by 643 back there exists an integer, namely 192,

    such that

    $123456=643cdot192,$.

    We denote divisibility using a vertical bar: $a|b$ agency a divides b.

    For example, we can address $643|123456\; ,$.

    The afterward theorems allegorize a amount of important backdrop of divisibility.

    Suppose $a,b,d,r,,$ and $s,$ are integers, $d$
eq 0 and $d|a,d|b\; ,$. Then

    $d|(ra+sb)\; ,$.

    Proof:

    There exists $e\; ,$ and $f\; ,$ such that $a=de\; ,$ and $b=df\; ,$. Thus

    $ra+sb=rde+sdf\; =d\; (re+sf)\; .,$

    We understand that $re\; +\; sf\; ,$ is aswell an integer, appropriately $d|(ra+sb)\; ,$.

    Suppose $a,b,d,$ and $r\; ,$ are integers, $d$
eq 0 ,, and $d|a,d|b,$.

    Then $d|(a+b),\; d|(a-b),\; ,$ and $d|ra\; ,$.

    Proof:

    Letting $r=1$ and $s=1$ in Assumption 1 yields

    $d\; |\; (a+b)\; ,$. Similarly, absolution $r=1$ and $s=-1$

    yields $d\; |\; (a-b)\; ,$. Finally, ambience s=0, yields $d|ra\; ,$.

    If $a,\; b,\; c\; ,$ are integers, $a$
eq 0, b
eq 0, c
eq 0 , and $a|b,\; b|c\; ,$ then $a|c\; ,$

    Proof:

    Let us address b as

    $b=ad\; ,$ and c as $c=be\; ,$ for some integers $d,$ and $e,$.

    It follows that

    $c=ade=aleft(de$
ight) , , and appropriately $a|c\; ,$.

    If $a,b,c\; ,$ are integers, $a$
eq 0, c
eq 0 then $a|b\; ,$ if and alone if $ac|bc\; ,$

    Proof:

    $a|b\; ,$ implies that there exists an accumulation d such that

    $b=ad\; ,$

    So it follows that

    $bc=left(ac$
ight)d and appropriately $ac|bc\; ,$.

    For the revese direction, we agenda that $ac|bc\; ,$ implies there exists an accumulation $d\; ,$ such that

    $bc=left(ac$
ight)d.

    We understand that c is non-zero, hence

    $b=ac\; ,$

    This proves the theorem.

    If $n\; ,$ is an accumulation greater than 1, then n is a prime or a artefact of primes.

    Proof:

    This is a affidavit by contradiction.

    If the account is false there exists blended numbers which are not the artefact of primes, beneath N be the aboriginal such number. Let $p\; ,$ be a prime divisor of N.

    

    However we understand that the assumption is true for $frac$ because $N,$ was the aboriginal counterexample, appropriately there are primes $p\_1,p\_2,...,p\_k\; ,$ such that:

    $frac=p\_1p\_2...p\_k\; ,$

    Hence

    $N\; =\; pp\_1p\_2,...p\_k\; ,$

    This is a bucking and implies the assumption is true for all $n\; ,$

    There are always some primes.

    Proof:

    Suppose that there are alone $k\; ,$ primes.

    Let these primes be: $p\_1,p\_2,...,p\_k\; ,$.

    Let $n=p\_1p\_2...p\_k+1.\; ,$

    Then either $n$ is prime, or it is a artefact of primes.

    If is is a artefact of primes, it haveto be divisible by a prime $p\_i$ for some $i$.

    However,

    $frac\; =\; frac\; =\; p\_1p\_2...p\_p\_...p\_k\; +\; frac$

    which is acutely not an integer: $n$ is not divisible by $p\_i$.

    Hence, $n$ is not a artefact of primes.

    Thus, $n$ is prime. However, it is not one of $p\_1,p\_2,...,p\_k\; ,$, back $n$ is larger

    than all of these, so our

    assumption that this was the complete account of primes haveto be false.

    Thus there is not a bound amount of primes, i.e., there are always some primes.