Scribd Logo
Upload

Welcome to Scribd!

  • 16 views

    Lecture Notes MATH 244.2: Nathan Francisco Nu Nez September 4, 2018

    Uploaded by

    Nathan Nunez
    This document provides lecture notes on various mathematical concepts including: 1) Function terminology such as one-to-one, onto, and bijective functions. 2) Proof techniques including direct proofs, proofs by contradiction, and mathematical induction. Examples of each technique are provided. 3) An example proof using mathematical induction to show a formula for the sum of the first n natural numbers. 4) Additional examples of proofs using techniques like contradiction and induction are given to prove other mathematical statements.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Lecture Notes MATH 244.2: Nathan Francisco Nu Nez September 4, 2018

    Uploaded by

    Nathan Nunez
    16 views3 pages
    This document provides lecture notes on various mathematical concepts including: 1) Function terminology such as one-to-one, onto, and bijective functions. 2) Proof techniques including direct proofs, proofs by contradiction, and mathematical induction. Examples of each technique are provided. 3) An example proof using mathematical induction to show a formula for the sum of the first n natural numbers. 4) Additional examples of proofs using techniques like contradiction and induction are given to prove other mathematical statements.

    Original Title

    F18_AMTH_244_2_Lecture

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document provides lecture notes on various mathematical concepts including: 1) Function terminology such as one-to-one, onto, and bijective functions. 2) Proof techniques including direct proofs, proofs by contradiction, and mathematical induction. Examples of each technique are provided. 3) An example proof using mathematical induction to show a formula for the sum of the first n natural numbers. 4) Additional examples of proofs using techniques like contradiction and induction are given to prove other mathematical statements.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    16 views3 pages

    Lecture Notes MATH 244.2: Nathan Francisco Nu Nez September 4, 2018

    Uploaded by

    Nathan Nunez
    This document provides lecture notes on various mathematical concepts including: 1) Function terminology such as one-to-one, onto, and bijective functions. 2) Proof techniques including direct proofs, proofs by contradiction, and mathematical induction. Examples of each technique are provided. 3) An example proof using mathematical induction to show a formula for the sum of the first n natural numbers. 4) Additional examples of proofs using techniques like contradiction and induction are given to prove other mathematical statements.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 3

    Lecture Notes MATH 244.

    2
    Nathan Francisco Nuñez
    September 4, 2018
    Today:
    Finish explaining function terminology (1.4) Proof Techniques (1.3 ) -See Canvas link
    f : X− > Y

    one-to-one / also called injective if f (x1 ) = f (x2 ) → x1 = x2

    onto / also called surjective if for any y ∈ Y there exists some x ∈ X such that f (x) = y

    Bijective if both injective and surjective these properties depends not only on ”action”, but also
    on the domain and codomain

    Proofs really just a form of rigorous argument method for establishing truth of a proposition
    ex. A child multiplies natural numbers and notices that multiplying odds gives you an odd product
    3*5 = 15, 9*9 = 81 etc

    BUT noticing pattern/ checking cases 6= proof Say a, b odd. Then by definition a = 2k + 1 and
    b = 2l + 1 where k, l ∈ Z
    ab = (2k + 1)(2l + 1) = 4kl + 2k + 2l + 1 = 2(2kl + k + l) + 1 This is odd by definition

    Theorem: :
    n
    X n(n + 1)
    i=
    i=1
    2

    Proof: !
    n
    X 1 + 2 + 3 + ... + n
    2 i =
    n + (n − 1) + (n − 2) + ... + 1
    i=1

    = (n + 1) + (n + 1) + (n + 1) + . . . + (n + 1) this happens n times


    This gives the result:
    n(n + 1) = 2S
    where S is the sum of the first n natural numbers

    Mathematical Induction Imagine p(n) is some statement about the natural number n.
    e.g. !
    Xn
    p(n) = n(i + 1)/2
    i=1

    Sample p(n) statements 1. Every tree on n vertices has n − 1 edges


    2. Every set of n pieces of candy is delicious
    3. Want to show p(n) is true for all n ∈ N

    Induction argument (1) Base case: establish P (1) is true


    (2) Inductive step establish P (n) implies P (n + 1) for all n ∈ N
    Pictorially this is like Dominoes: A domino falling will get the next domino to fall, and to get
    dominoes to fall you need to push down the first one.
    P1
    Example: Gauss’s theorem step 1 i=1 i = 1(2)/2 = 1X
    Pn
    step 2 assume i=1 i = n(n+1)
    2 X
    n+1 n
    X X n(n + 1) n(n + 1) 2(n + 1) (n + 1)(n + 2)
    i= i + (n + 1) = +n+1= + =
    i=1 i=1
    2 2 2 2
    

    Induction formalizes idea of recovery to simpler cases

    Problem: In Florence there are only 3¢coins and 5¢coins What sums can you make?
    Answer: all amounts greater than 8¢

    Proof(Induction) Base cases: n = 8 = 3+5


    n=9=3+3+3
    n = 10 = 5 + 5
    Inductive step: P (n) → P (n + 3)

    Claim: any square can divided into n smaller squares P (n) → P (n + 3)


    Prove: p(6) p(7) P (8)

    Proof by contradiction Prove statement P is true.


    Lets say its false, then we derive a contradiction,
    if it cannot be false it must be true this is equivalent to P + !P = true

    E.g. Today is a weekday Assume for contradiction that today is a weekend but if it were a weekend
    I would be at home on my couch.
    But I’m not at home in my couch, I’m uncomfortable in the lecture hall Thus it is not the weekend
    √
    2 is irrational
    √ Assume that it is rational
    then 2 = ab s.t. {a, b ∈ N} and gcd(a, b) = 1
    2
    Then 2 = ab2 = 2b2 = a2
    Thus a is even and a can be written as a = 2k
    We have 2b2 = (2k)2 = 4k 2 → 2a2 = b2
    this implies that b is even
    but now gcd(a, b) = 2 6= 1
    This is a direct contradiction.
    Assumption was false.

    The Contrapostive We have a conditional statement A → B Contrapostive not B → not A

    You might also like