Line 1: Line 1:
 
If S is discrete and finite
 
If S is discrete and finite
S = {,,}
+
S = <math>{s_1,s_2,s_3}</math>
 
S = {head,tail}
 
S = {head,tail}
 
S = {win, lose}
 
S = {win, lose}
Line 7: Line 7:
 
1/9/13
 
1/9/13
  
Quizzes: use {}
 
  
S = <math> s\exp{1} <\math>
+
S = <math>{s_1,s_2,s_3}</math>
  
IF S is discrete but infinite,
+
If S is discrete but infinite,
  
S = {,,,....}
+
S = <math>{s_1,s_2,s_3}</math>,...}
 
ex.  S = {1,2,3,4,...}
 
ex.  S = {1,2,3,4,...}
 
       S = {sin(2*440t),sin(2*880t),sin(2*1320t),...}
 
       S = {sin(2*440t),sin(2*880t),sin(2*1320t),...}

Revision as of 16:06, 14 April 2013

If S is discrete and finite S = $ {s_1,s_2,s_3} $ S = {head,tail} S = {win, lose} S = {1,2,3,4,5,6}

1/9/13


S = $ {s_1,s_2,s_3} $

If S is discrete but infinite,

S = $ {s_1,s_2,s_3} $,...} ex. S = {1,2,3,4,...}

      S = {sin(2*440t),sin(2*880t),sin(2*1320t),...}

Observe S = is not routable; S = [0,1] is not routable S = {sin(2*f*t)} = {sin(2*f*t)|0}

is all integers -to 

Is routable? yes. ={0,1,-1,2,-2,3,-3, }as opposed to 

= {0,3,e,,-1,1.14,, }

Many different ways to write a set [0,1] = {xsuch that(s. t.) 0x 1} ={real positive numbers no greater than 1 as well as 0}

Alumni Liaison

Abstract algebra continues the conceptual developments of linear algebra, on an even grander scale.

Dr. Paul Garrett