Number Theory: Proofs and Definitions, Study notes of Discrete Structures and Graph Theory

Various proof methods and definitions in number theory, including even and odd integers, prime and composite numbers, constructive proof of existence, and disproof by counterexample. It also discusses division definitions and the quotient remainder theorem.

Typology: Study notes

Pre 2010

Uploaded on 02/13/2009

koofers-user-tgf-1
koofers-user-tgf-1 🇺🇸

10 documents

1 / 8

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
1
Proof Must Have
Statement of what is to be proven.
"Proof:" to indicate where the proof starts
Clear indication of flow
Clear indication of reason for each step
Careful notation, completeness and order
Clear indication of the conclusion
Number Theory - Ch 3 Definitions
Z--- integers
Q- rational numbers (quotients of integers)
rQ a,bZ, (r = a/b) ^ (b 0)
Irrational = not rational
R --- real numbers
superscript of +--- positive portion only
superscript of ---- negative portion only
other superscripts: Zeven, Zodd , Q>5
"closure" of these sets for an operation
Integer Definitions
even integer
n Zeven k
Z n = 2k
odd integer
n Zodd k
Z n = 2k+1
prime integer (Z>1)
n Zprime r,sZ+, (n=r*s) (r=1)v(s=1)
composite integer (Z>1)
n Zcomposite r,sZ+, n=r*s ^(r1)^(s1)
pf3
pf4
pf5
pf8

Partial preview of the text

Download Number Theory: Proofs and Definitions and more Study notes Discrete Structures and Graph Theory in PDF only on Docsity!

Proof Must Have

  • Statement of what is to be proven.
  • "Proof:" to indicate where the proof starts
  • Clear indication of flow
  • Clear indication of reason for each step
  • Careful notation, completeness and order
  • Clear indication of the conclusion

Number Theory - Ch 3 Definitions

  • Z --- integers
  • Q - rational numbers (quotients of integers)
    • r∈ Q ↔ ∃a,b∈ Z , (r = a/b) ^ (b ≠ 0)
  • Irrational = not rational
  • R --- real numbers
  • superscript of +^ --- positive portion only
  • superscript of -^ --- negative portion only
  • other superscripts: Zeven, Zodd^ , Q>
  • "closure" of these sets for an operation

Integer Definitions

  • even integer
    • n ∈ Zeven^ ↔ ∃k ∈∈∈∈ Z n = 2k
  • odd integer
    • n ∈ Zodd^ ↔ ∃k ∈∈∈∈ Z n = 2k+
  • prime integer (Z>1)
    • n ∈ Zprime^ ↔ ∀r,s∈ Z+ , (n=r*s) →(r=1)v(s=1)
  • composite integer (Z>1)
    • n ∈ Zcomposite^ ↔ ∃r,s∈ Z+ , n=r*s ^(r≠1)^(s≠1)

Constructive Proof of Existence

If we want to prove:

  • ∃n∈ Zeven , ∃p,q, r,s∈ Zprime^ n = p+q ^ n = r+s ^p≠r^ p≠s^ q≠r^ q≠s
  • let n=
  • n ∈ Zeven^ by definition of even
  • Let p = 5 and the q = 5
  • p,q ∈ Zprime^ by definition of prime
  • 10 = 5+
  • Let r = 3 and s = 7
  • r,s ∈ Zprime^ by definition of prime
  • 10 = 3+
  • and all of the inequalities hold

Methods of Proving

Universally Quantified Statements

  • Method of Exhaustion
    • prove for each and every member of the domain
    • ∀r∈ Z+^ where 23<r<29 → ∃ p,q ∈ Z+ ( r = p*q)^(p<=q)
  • Generalizing from the "generic particular"
    • suppose x is a particular but arbitrarily chosen element of the domain
    • show that x satisfies the property
    • i.e. ∀r∈ Z, r ∈Zeven^ → r^2 ∈Zeven

Examples of Generalizing from

the "Generic Particular"

  • For any pair of integers where the first of them is even, the product of those integers is also even. - ∀m,n∈ Z , m∈ Zeven^ →m*n∈ Zeven
  • The product of any two odd integers is also odd.
    • ∀m,n∈ Zodd , m*n∈ Zodd
  • The product of any two rationals is also rational.
    • ∀m,n∈ Q , m*n∈ Q

Proof by Contrapositive

For all positive integers, if n does not divide a number to which d is a factor, then n can not divide d.

∀n,d,c∈Z+, ndc → nd

Proof by Contrapositive

For all positive integers, if n does not

divide a number to which d is a factor,

then n can not divide d.

∀n,d,c∈Z+, ndc → nd

∀n,d,c∈Z+, n|d → n|dc

proof:

more integer definitions

  • div and mod operators
    • n div d --- integer quotient for
    • n mod d --- integer remainder for
    • (n div d = q) ^ (n mod d = r) ↔ n = d*q+r where n ∈ Z ≥≥≥≥^0 , d ∈ Z+ , r ∈ Z , q ∈ Z , 0 ≤r<d
  • relating “mod” to “divides”
    • d|n ↔ 0 = n mod d ↔ 0 ≡d n
  • equivalence in a mod
    • x ≡d y ↔ d|(x-y) [note: their remainders are equal]
    • sometimes written as x ≡ y mod d meaning (x ≡ y) mod d

d

n d

n

Quotient Remainder Theorem

∀n∈Z ∀d∈Z+^ ∃q,r∈Z

(n=dq+r) ^ (0  r < d)

Proving definition of equiv in a mod by

using the quotient remainder theorem

Prove that if [m ≡d n], then [d|(n-m)]

where m,n∈Z and d∈Z+

Proofs using this definition

  • ∀m∈Z+^ ∀a,b∈Z

a ≡m b ↔ ∃ k ∈ Z a=b+km

  • ∀m∈Z+^ ∀a,b,c,d∈Z

a ≡m b ^ c ≡m d → a+c ≡m b+d

Floor and Ceiling Definitions

  • n is the floor of x where x ∈∈∈∈ R ^ n ∈∈∈∈ Z

x = n ↔ n ≤ x < n+

  • n is the ceiling of x where x ∈∈∈∈ R ^ n ∈∈∈∈ Z

x = n ↔ n-1 < x ≤ n

Steps Toward Proving the

Unique Factorization Theorem

  • Every integer greater than or equal to 2 has at least one prime that divides it
  • For all integers greater than 1,

if a|b, then a (b+1)

  • There are an infinite number of primes

Using the Unique Factorization

Theorem

  • Prove that the
  • Prove:

∀a∈Z+∀q∈Zprime^ q|a^2 → q |a

3 ∉ Q

Summary of Proof Methods

  • Constructive Proof of Existence
  • Proof by Exhaustion
  • Proof by Generalizing from the Generic Particular
  • Proof by Contraposition
  • Proof by Contradiction
  • Proof by Division into Cases

Errors in Proofs

  • Arguing from example for universal proof.
  • Misuse of Variables
  • Jumping to the Conclusion (missing steps)
  • Begging the Question
  • Using "if" about something that is known