Functions Functions Huynh Tuong Nguyen, Tran Vinh Tan Contents Functions One to one and Onto Functions Sequences and Summation Recursion 4 1 Chapter 4 Functions Discrete Structures for Computing on 13[.]
Functions Huynh Tuong Nguyen, Tran Vinh Tan Chapter Functions Discrete Structures for Computing on 13 March 2012 Contents Functions One-to-one and Onto Functions Sequences and Summation Recursion Huynh Tuong Nguyen, Tran Vinh Tan Faculty of Computer Science and Engineering University of Technology - VNUHCM 4.1 Contents Functions Huynh Tuong Nguyen, Tran Vinh Tan Functions Contents Functions One-to-one and Onto Functions One-to-one and Onto Functions Sequences and Summation Recursion Sequences and Summation Recursion 4.2 Introduction Functions Huynh Tuong Nguyen, Tran Vinh Tan • Each student is assigned a grade from set {0, 0.1, 0.2, 0.3, , 9.9, 10.0} at the end of semester Contents Functions One-to-one and Onto Functions Sequences and Summation Recursion 4.3 Introduction Functions Huynh Tuong Nguyen, Tran Vinh Tan • Each student is assigned a grade from set Contents {0, 0.1, 0.2, 0.3, , 9.9, 10.0} at the end of semester • Function is extremely important in mathematics and computer science Functions One-to-one and Onto Functions Sequences and Summation Recursion 4.3 Introduction Functions Huynh Tuong Nguyen, Tran Vinh Tan • Each student is assigned a grade from set Contents {0, 0.1, 0.2, 0.3, , 9.9, 10.0} at the end of semester • Function is extremely important in mathematics and computer science Functions • linear, polynomial, exponential, logarithmic, One-to-one and Onto Functions Sequences and Summation Recursion 4.3 Introduction Functions Huynh Tuong Nguyen, Tran Vinh Tan • Each student is assigned a grade from set Contents {0, 0.1, 0.2, 0.3, , 9.9, 10.0} at the end of semester • Function is extremely important in mathematics and computer science Functions • linear, polynomial, exponential, logarithmic, One-to-one and Onto Functions Sequences and Summation Recursion • Don’t worry! For discrete mathematics, we need to understand functions at a basic set theoretic level 4.3 Function Definition Functions Huynh Tuong Nguyen, Tran Vinh Tan Let A and B be nonempty sets A function f from A to B is an assignment of exactly one element of B to each element of A Contents Functions One-to-one and Onto Functions Sequences and Summation Recursion 4.4 Function Definition Functions Huynh Tuong Nguyen, Tran Vinh Tan Let A and B be nonempty sets A function f from A to B is an assignment of exactly one element of B to each element of A • f :A→B Contents Functions One-to-one and Onto Functions Sequences and Summation Recursion 4.4 Function Definition Functions Huynh Tuong Nguyen, Tran Vinh Tan Let A and B be nonempty sets A function f from A to B is an assignment of exactly one element of B to each element of A • f :A→B • A: domain (miền xác định) of f Contents Functions One-to-one and Onto Functions Sequences and Summation Recursion 4.4 Function Definition Functions Huynh Tuong Nguyen, Tran Vinh Tan Let A and B be nonempty sets A function f from A to B is an assignment of exactly one element of B to each element of A • f :A→B • A: domain (miền xác định) of f • B: codomain (miền giá trị) of f Contents Functions One-to-one and Onto Functions Sequences and Summation Recursion 4.4