Line 27: Line 27:
  
 
[[Image:100 3.jpg|left|500x700px]]  
 
[[Image:100 3.jpg|left|500x700px]]  
 
+
[[Image:100 4.jpg|right|500x700px]]
 +
[[Image:100 5.jpg|left|500x700px]]
 
<br>  
 
<br>  
  

Revision as of 06:13, 15 April 2013

Note: this is the first of many pages to be uploaded.



1/9/13

If S is discrete and finite S = {s1,s2,s3} S = {head,tail}, S = {win, lose}, S = {1,2,3,4,5,6}

If S is discrete but infinite,

S = {s1,s2,s3,...} ex. S = {1,2,3,4,...}

    S = {sin(2π*440t),sin(2π*880t),sin(2π*1320t),...}
  Observe $ _{S = \mathbb{R}} $ is not routable; S = [0,1] is not routable
  S = {sin(2π*f*t)} f $ \in \mathbb{R} \geq $ 0 
    = {sin(2π*f*t)|0$ \leq f < \infty $}

$ \mathbb{Z} $ is all integers $ -\infty $ to $ \infty $

Is $ \mathbb{Z} $ routable? yes.

  $ \mathbb{Z} $={0,1,-1,2,-2,3,-3, }as opposed to $ \mathbb{R} $

$ \mathbb{R} $= {0,3,e,π,-1,1.14,$ \sqrt{2} $}

Many different ways to write a set [0,1] = {x $ \in \mathbb{R} $such that(s. t.) 0$ \leq x \leq $ 1} ={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

Alumni Liaison

Correspondence Chess Grandmaster and Purdue Alumni

Prof. Dan Fleetwood