Scribd
Upload
8 views

Notes

Statistics notes

Uploaded by

Valpro
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
8 views

Notes

Statistics notes

Uploaded by

Valpro
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 3

functions

f: x -> Y if every element of x is related to some element in y and no element in x


is related to more than one element in y
x - domain
y - co-domain

log b of x = y - logarithmic function


b^y = x

Encoding functions and decoding functions

Boolean functions - true or false

Checking whether a function is well defined. Real number to real number.

F (m/n) = m for all integers m and n with n not equal 0.

The function is not well defined. Fractions have more than one representation as
quotients of integers
so F(1/2) = f(3/6) and F(1/2) = 1 and F(3/6) = 3. So Its not well defined.

Functions Acting on Sets

A subset of X and C subset of Y ( C with a line underneath) and f: X -> Y

F(a) = {y includes Y | y = f(x) for some x in A.

X = {1,2,3,4} Y = {a, b,, c, d, e}


f: X -> Y

Let A = {1,4} C= a,b} and D = {c, e}


F(A) = {b}
F(x) =

One to one and Onto, Inverse Functions

One-to-one

If F(x1) = F(x2) then x1 = x2


Implication: Hash Functions -

Onto Functions or surjective.


F is onto if and only if any given element y in Y it is possible to find an element
of X

Onto Function on an infinite set - suppose that y is any element of Y and show
there is an element X of X with F(x) = y.
f(x) = 4x - 1 for all x in R
y = 4x - 1
x = (y + 1) / 4
so for every y there is a corresponding x. OR NOT?? TF??

One-to-One Correspondences

A function can be both one-to-one and onto.


Composition of Functions

f^-1 (y) = x <=> f(x) = y

Composition of One-To-One functions


[][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][]
[][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][]
[][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][]
[][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][]
[][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][]
[][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][]
[][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][]
[][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][]
[][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][]
[][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][]
[][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][]
[][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][]
[][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][]
[][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][][]
[][][][][][][][][][][][][][][][][][][][][]
Cardinality of functions
Countable functions and countability

1. Logic: Compound & quantified


Compounds: True/False
Composed with T/F predicates
Combined with and, or, not and exclusive or
True tables
Equivalency A -> B, A <=> B
Conditional statement if p then q p->q
valid arguments
modus ponens: if p then q, p is true, q is true
modus tollens: if p then q, q is NOT true, p is Not true
Invalid
Converse error
Inverse error

Quantified statement

Universal for all (inverse A)


Existential "exists at least once" (reverse E)
De Morgan's law:
True by default: When the hypothesis is false therefore we cannot say anything
about the conclusion, then the statement is true

2. Number systems
Positioning systems: Polynomial representation in given base
Decimal. binary, hexadecimal
Conversion
changing a number given in one base into another
Computer works with binary number ONLY (there is no -)
If bit == 1 integer is negative.
2-s complement
Hexadecimal

3. Algorithms

Pseudocoode
Assignment: ":="
Block of operations:
Loops
Forks
4. Sequences
Sum and Product capital greek sigma and pi. Compact formulas for sums and products
mathematical induction - method to prove a property of a sequence
1.Check that the property for the base case is correct
2.Write the inductive hypothesis that the property is correct for an arbitrary
element
3.Show that the property is true for the next element under the condition that the
hypothesis is correct

Recursion
Recursively defined sequences

Important sequences and sums


Tower of Hanoi
5. Sets
Operations on sets:
Union U
Intersection n
difference -
complemennt x^c
universal U
Empty /0

Venn diagrams

Cartesian Product
Set identities
Power set
Partition of a set
Disjoined sub-sets
Integers rational real numbers
6. Functions: One to one, onto, inverse, hesh-functions

y = F(x)
Domain set X = {xi} and co-doomain set Y = {yi}
Every xj included in X has an image yi included in Y
No xj in X has two or more images in Y
draw arrow diagrams
Important functions: lx(x) = x; bolean; y = logbasex; Hash

You might also like