• ...09midterm2.pdf midterm2] Note: in question one, x[n] should be <math> 3^n</math> for negative n's. *[[How to Enter Math in Rhea|Cheat Sheet for Rhea Math]]
    10 KB (1,359 words) - 03:50, 31 August 2013
  • [[Category:discrete Dirac delta]] <math>\sum_{n=-\infty}^\infty n \delta [n] </math>
    6 KB (928 words) - 09:25, 11 November 2013
  • *Please help! We need a [[Discrete_Fourier_Transform_table|table of Discrete Fourier transform pairs and properties]]! ...09midterm2.pdf midterm2] Note: in question one, x[n] should be <math> 3^n</math> for negative n's.
    9 KB (1,273 words) - 20:52, 15 October 2011
  • [[Category:math]] ...p;<math>B= \left(\begin{array}{cccc}b1\\b2\\.\\.\\.\\bn\end{array}\right)</math>
    11 KB (1,835 words) - 09:06, 11 April 2013
  • [[Category:discrete math]] [[Category:math]]
    6 KB (1,006 words) - 06:43, 21 March 2013
  • == Fun and Challenging Games Directly Related to [[MA375|Discrete Mathematics]] == ...understanding some of the chapters within our book, coming from our book, Discrete Mathematics and Its Applications: See [http://highered.mcgraw-hill.com/site
    16 KB (2,679 words) - 06:52, 21 March 2013
  • So as I ponder the possibility of teaching a new Discrete Math course at the high school next year, and think about how I would go about e <math>
    9 KB (1,523 words) - 15:22, 30 January 2012
  • So as I ponder the possibility of teaching a new Discrete Math course at the high school next year, and think about how I would go about e <math>
    9 KB (1,553 words) - 06:14, 17 July 2012
  • [[Category:math]] [[Category:discrete math]]
    3 KB (418 words) - 06:38, 21 March 2013
  • [[Category:math]] [[Category:discrete math]]
    1 KB (154 words) - 09:42, 20 May 2013
  • [[Category:discrete math]] [[Category:math]]
    15 KB (2,621 words) - 06:54, 21 March 2013
  • = '''Discrete Probability'''<br> = ...re several terms one must familiarize themselves with before talking about discrete probability, which are listed below:<br>
    12 KB (2,113 words) - 06:50, 21 March 2013
  • If the Cantor Set was composed of discrete points, then every point would be “separate” from every other point. really don’t have segments nor do we have “stand alone” discrete points.
    4 KB (693 words) - 15:19, 20 September 2012
  • [[Category:math]] = [[Peer_legacy |Peer Legacy]] for [[MA375]]: "Discrete Mathematics" =
    2 KB (250 words) - 09:38, 20 May 2013
  • *Discrete Random Variables ...rmalization_ECE302S13Boutin|Normalizing the probability mass function of a discrete random variable]]
    10 KB (1,422 words) - 20:14, 30 April 2013
  • [[Category:math]] [[Category:math squad]]
    11 KB (1,904 words) - 13:08, 25 November 2013
  • [[Category:math]] [[Category:math squad]]
    4 KB (649 words) - 13:08, 25 November 2013
  • [[Category:math squad]] [[Category:discrete math]]
    10 KB (1,656 words) - 13:08, 25 November 2013
  • [[Category:math]] [[Category:math squad]]
    3 KB (494 words) - 13:08, 25 November 2013
  • <!-- \mathbb{} is used to get the "mathbook" font introduced within the math function--> ..._3\}, \text{ S = } \{head,tail\}, S = \{win, lose\}, S = \{1,2,3,4,5,6\}</math>
    2 KB (243 words) - 21:26, 13 May 2014

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)

Alumni Liaison

Correspondence Chess Grandmaster and Purdue Alumni

Prof. Dan Fleetwood