CSCE 222 Lecture 11

From Notes
Jump to navigation Jump to search

« previous | Monday, February 14, 2011 | next »


Functions

f is surjective iff range(f) = B

f is injective iff f(a)=f(b) implies a=b

thus a≠b implies f(a)≠f(b)

f is bijective iff surjective and injective


Example

f:ℤ→ℤ,f(x)=x+1 is bijective

f(x)=x+1=y+1=f(y) implies x=y, so f is injective
∀y∈ℤ ∃x∈ℤ:y=f(x);x=y−1, so f is surjective


Inverse Functions

f:A→B

f−1:B→A is a function that reverses the direction of mappings so f(a)=b≡f−1(b)=a

Floor

floor (⌊x⌋)
maps and argument x to the largest integer that doesn't exceed x
EX: ⌊1/2⌋=0

Properties

given x∈ℝ and n∈ℤ,

⌊x⌋=nn≤x<n+1 and x−1<n≤x

Addition and subtraction of integers:

⌊x+m⌋=n+m(m∈ℤ)

Multiplication:

⌊mx⌋=⌊x⌋+⌊x+1m⌋+…+⌊x+m−1m⌋


Ceiling

ceil (⌈x⌉)
maps an argument x to the smallest integer ≥x
EX: ⌈−1.1⌉=−1

Properties

given x∈ℝ and n∈ℤ,

⌈x⌉=nn−1<x≤nx≤n<x+1
Note: ⌈x+y⌉≠⌈x⌉+⌈y⌉


Sum Notation

∑j=mnaj

Important Sums to Know

∑j=1nk=n(n+1)2