Scribd
Upload
87 views2 pages

Lecture Notes For 2021-01-28

This document provides an overview of the components of a mathematical proof, including definitions, axioms, theorems, and proofs. It then presents several number theory theorems with their proofs as examples. The theorems cover topics like prime numbers, divisibility rules, and the division algorithm. The document establishes the framework and notation needed to understand the proofs presented.

Uploaded by

Serkan Doruk Hazinedar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
87 views2 pages

Lecture Notes For 2021-01-28

This document provides an overview of the components of a mathematical proof, including definitions, axioms, theorems, and proofs. It then presents several number theory theorems with their proofs as examples. The theorems cover topics like prime numbers, divisibility rules, and the division algorithm. The document establishes the framework and notation needed to understand the proofs presented.

Uploaded by

Serkan Doruk Hazinedar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Remember from Math 123

In a mathematical text in other words a piece of mathematical writing to do


a proof we use the following:
1)Methods of proof (Rules of inference, rules to write proofs,...).
2)Notation and definitions assumed to be given before the text.
3)Notation and definitions given in the text.
4) Axioms given before the text.
5)Axioms given in the text.
6)Statements proved before the text.
7)Statements proved in the text.
Example:
Number Theory
Number theory is that area of mathematics dealing with integers and their
properties.
(From here we understand we will assume axioms, definitions, notation about
integers)
Definition: A prime is an integer p ≤2 ,whose only positive integer divisor are 1 and p.
(It is assumed that before the text positive, divisors,etc are defined)
Definition:
An integer n ≤2,that is not a prime number, is called a composite number.
(Here we are using a definition given in the text.)
Theorem:
There exist an odd number which is not a prime.
Proof:
9 is an odd number and 9 is not a prime number.
(In this proof, we are using Existential Generalization.)
Theorem 1:
An integer n ≤2 that is composite if and only if there exist integers x and y
such that n=xy where;
1<x< n and 1<y< n.
Proof of ”if” Part:
Assume there exist integers x and y such that n=xy where 1 < x < nand
1 < y < n. Then x is a positive integer divisor of n. Also notice that x is not
equal to 1 and n. So, n is not a prime number. We also know n ≤2 because
1<n. Hence, n is a composite number.
Proof of ”only if” Part:
Assume n is smaller or equal to 2 and n is a composite number. Then n is
not a prime number. So, n is smaller than 2 or n has a positive integer divisor
x such that x is not equal to 1 and n. We already assume n ≤2. So, there exist
a positive integer x such that there exist x 6=1 and x 6=n , and, n=xy.
For some integer y. Notice that x is greater than 1 because x is positive and
x is not equal to n. Also notice y is positive because x and n are both positive.
So, 1<y because x is not equal to n.Since, 1 is smaller than y and n=xy and x,n
are positive, we have x<n. Similarly, y<n.
Theorem 2: Let x,y,z be integers.Then,
i)If x|y then x|yz.

1
ii)If x|y and y|z then x|z.
iii)If x|y and x|z then x|yk+zs for all integers k and s.
Proof of i: Assume x|y. Then there exists an integer k such that xk=y. So
yz=xkz. Hence, x|yz because kz is also an integer.
Proof of ii: Assume x|y and y|z. So there exist integers k and s such that
xk=y and ys=z. So z=xks and ys=z. So z=xks. Hence, x—z.
Proof of iii: Assume x|y and x|z and k,s are two integers. Then there
exist integers u and w such that xu=y and xw=z. So yk+zs=x(uk+ws). Hence,
x|yk+zs.
Theorem 3 (The Division Algorithm):
For positive integers x and y, there exist unique integers q and r such that
y=xq+r and,0≤r < x.
Proof:
Assume x and y are two positive integers. Then define, S={y-wz| Z 3 w and
y-xw≥0}. Notice S ⊆ N, where N={0,1,2,3,...}. Moreover y∈S because we can
choose w=0. So S is a non empty subset of N. Hence, well-ordering principle
there exist a minimum element in S. Say r=minS. Then notice r= y-xw for some
w∈Z because r∈S. Moreover, r≥0 because r∈S. So y=xw+r and r≥0. Suppose
r≥x. Then r-x≥0 and r-x=y-xw-x=y-x(w+1). So r-x∈S. But r-x<r. This is a
contradiction. So r<x. Assume y=xw*+r* and 0≤r*< x for some integers w*
and r*. To prove uniqueness it is enough to show w*=w and r*=r. Suppose
w*6=w or r*6=r. In both cases r*6=r because (w*6=w) =⇒ (xw*6=xw) =⇒ (y-
xw*6=y-xw) because x is positive.
Notice r≤r* because r=min(S). So r≤r*. Also notice r*-r=(y-xw*)-(y-xw)=x(w-
w*). We also know r*< x. So 0≤r*-r< x. So w-w*=o. Hence r*=r.
Theorem 3 (The General Form Of Division Algorithm):
For positive integers x and y, there exist unique integers q and r such that
y=xq+r and,0≤r< |x|.
Proof: Exercise

You might also like