Revision as of 20:26, 13 May 2014 by Rwayner (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)


1/9/13
$ \mathbb{}\text{If S is discrete and finite S = } \{S_1, S_2, S_3\}, \text{ S = } \{head,tail\}, S = \{win, lose\}, S = \{1,2,3,4,5,6\} $
$ \mathbb{}\text{If S is discrete but infinite, S = } \{S_1,S_2,S_3,...\}. \text{ Example: S = }\{1,2,3,4,...\} $
$ \mathbb{}\text{S = }\{\sin(2\pi*440t),\sin(2\pi*880t),\sin(2\pi*1320t),...\} $
$ \mathbb{}\text{Observe }\text{S = }\{\mathbb{R}\} \text{ is not routable; S = }\{0,1\} \text{ is not routable.} $
$ \mathbb{}\text{S = } f \in \mathbb{R} \geq 0 $
$ \mathbb{}\text{S = }\{\sin(2\pi*f*t) \mid 0 \leq f \leq \infty \} $
$ \mathbb{Z} \text{ is all integers -}\infty \text{ to } \infty $
$ \text{Is } \mathbb{Z} \text{ routable? yes.} $
$ \mathbb{Z} = \{ 0,1,-1,2,-2,3,-3,... \} \text{ as opposed to } \mathbb{R} $
$ \mathbb{R} = \{0,3,e,\pi ,-1,1.14,\sqrt{2}\} $
$ \mathbb{}\text{Many different ways to write a set } [0,1] \text{ = } \{ x \in \mathbb{R} \text{ such that (s. t.) } 0\leq x \leq 1 \} $
$ \mathbb{} = \{ \text{real positive numbers no greater than 1 as well as 0} \} $

100 3.jpg 100 4.jpg 100 5.jpg


Go to lecture notes: 2 3 4 6 7 8 9 10 12 18 20 32 35 37 38 39 40 41 42 43 44

Alumni Liaison

Basic linear algebra uncovers and clarifies very important geometry and algebra.

Dr. Paul Garrett