Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Functions and Sequences: Concepts and Examples, Assignments of Discrete Mathematics

This reading assignment covers the concepts of functions and sequences, focusing on injective, surjective, and bijective functions, as well as arithmetic and geometric progressions. Students are expected to understand the difference between functions and sequences, and to provide examples of functions that are injective but not surjective, surjective but not injective, both injective and surjective, and neither injective nor surjective.

Typology: Assignments

2009/2010

Uploaded on 02/25/2010

koofers-user-se4
koofers-user-se4 🇺🇸

10 documents

1 / 1

Toggle sidebar

Related documents


Partial preview of the text

Download Functions and Sequences: Concepts and Examples and more Assignments Discrete Mathematics in PDF only on Docsity! Reading Assignment, Due Sep 17 1. A function f : A → B describes a particular kind of relationship between two sets A and B; it maps a unique element of B to every element of A. As was the case for sets, you must be already familiar with functions. There are some concepts, however, that may be new. E.g., injective, surjective, and bijective functions; and the composition of functions. Please read the entire §2.3 “Functions.” 2. Recall that sets do not care about the order of elements. When order is important, we use a discrete structure called a sequence. Read §2.4 “Sequences and Summations” till end of Example 17 on page 158. A lot of this should also be already familiar. Two kinds of sequences of numbers are very common: arithmetic pro- gressions and geometric progressions. The subsection on “Special Integer Sequences” is interesting, and you must have seen puzzles such as in Ex- amples 5 – 8 earlier; but there will not be any such puzzles asked in this course. Table 2 (pg 157) has a list of summation formulae. E.g., the sum of the first n terms of the form k3 is n2(n + 1)2/4. We will later learn of an elegant tool called Induction that will help us prove that this is really so. 3. Turn in answers to the following: (a) Give an interesting example of a function which is — i. Injective but not surjective. ii. Surjective but not injective. iii. Both injective and surjective. iv. Neither injective nor surjective. My answer is a function that — i. Maps each song on an ipod to the memory address where the song’s first byte is stored. Note that all memory addresses don’t necessarily contain the first byte of some song. ii. Maps each student to the major they are enrolled in. (Assume no one is double-majoring, and every major has some enrollment.) iii. Maps each person to their finger prints. iv. Maps each student to their favourite song. (b) Definition 1 on page 150 defines a sequence as a function from (a subset of) the set of integers to some set of interest S. What is the intuitive reason behind doing this? Could we instead say a sequence is a function from the set of interest S to the set of integers? 1
Docsity logo



Copyright © 2024 Ladybird Srl - Via Leonardo da Vinci 16, 10126, Torino, Italy - VAT 10816460017 - All rights reserved