Create the page "Discrete math" on this wiki! See also the search results found.
- [[Category:math]] *[[MathInternships|Internships and Other Opportunities for Math Students (postings Fall 2013 -- today)]]2 KB (223 words) - 21:41, 4 March 2015
- [[Category:math]] [[Category:discrete math]]1 KB (186 words) - 08:39, 20 May 2013
- [[Category:math]] [[Category:discrete math]]647 B (73 words) - 18:04, 14 December 2015
- [[Category:math]] [[Category:discrete math]]1 KB (167 words) - 09:33, 20 May 2013
- [[Category:math]] [[Category:discrete math]]942 B (115 words) - 13:53, 3 April 2015
- * Subspaces of <math>R^n</math> *[[Jacobian|Jacobians and their Applications]], by [[Math_squad|Math Squad]] member [[user:ruanj|Joseph Ruan]]2 KB (293 words) - 12:25, 27 March 2015
- [[Category:math]] <math>E[aX + bY] = aE[X] + bE[Y] \ </math> <br/>3 KB (585 words) - 14:15, 13 June 2013
- *[[How to Enter Math in Rhea|Cheat Sheet for Rhea Math]] ...09midterm2.pdf midterm2] Note: in question one, x[n] should be <math> 3^n</math> for negative n's.8 KB (1,096 words) - 06:44, 14 December 2013
- ...such as: the Brams and Taylor envy free procedure, The Selfridge–Conway discrete procedure, and the Stromquist moving-knife procedure. '''Selfridge-Conway Discrete Procedure'''13 KB (2,363 words) - 09:02, 1 December 2013
- Origami, despite what many math believe, is orignally thought to have roots in China (PBS, 2009). This art ...role in the creation of origami figures, there is a practical use for this math at a high school level relating to several different mathematical fields. &14 KB (2,387 words) - 11:04, 30 November 2013
- '''Definition''' <math>\qquad</math> An '''outcome''' is a possible result of a random experiment. '''Definition''' <math>\qquad</math> An '''event''' is a set of outcomes of an experiment to which a probabilit20 KB (3,448 words) - 12:11, 21 May 2014
- *[[Discrete_Fourier_transform_ECE438F10|Discrete Fourier transform]] *[[How to Enter Math in Rhea|Cheat sheet]] for writing ECE438 related equations on Rhea4 KB (471 words) - 19:34, 9 February 2015
- [[Category:math]] [[Category:discrete math]]5 KB (724 words) - 11:13, 27 April 2014
- ...few important assumptions. The first of which is the Markov Assumption: A discrete stochastic process is a Markov Chain if and only if P(Xn = jn| Xn-1=jn-1 , ...another state the next day. A continuous Markov chain closely resembles a discrete one, however the transitions are no longer represented by probabilities. Tr19 KB (3,004 words) - 09:39, 23 April 2014
- [[1]] Found in Discrete Mathematics and Its Applications, Kenneth H. Rosen.<br> [[Category:MA375Spring2014Walther]] [[Category:Math]] [[Category:Project]]5 KB (856 words) - 18:15, 27 April 2014
- Rosen, K. H. (2012). 10. Discrete Mathematics and its Applications (7th ed., ). Boston: WCB/McGraw-Hill.<br> [[Category:MA375Spring2014Walther]] [[Category:Math]] [[Category:Project]]5 KB (1,016 words) - 15:13, 1 May 2014
- This page is built based on MediaWiki + LaTeX math package parser. Some of contents were modified due to its limited compatibi ...sigma)</math>. Otherwise, the sample belongs to <math>[Prob(\omega_2), 1]</math> and should be labeled as class 2, then, move onto the normal random number18 KB (2,852 words) - 10:40, 22 January 2015
- by: [[user:Hansen12 | Robert Hansen]], proud member of [[Math squad|the math squad]]. not in a discrete math class or textbook, but on a book on geometry, called '''Elementary Geometry5 KB (846 words) - 03:54, 16 May 2014
- *[[How to Enter Math in Rhea|Cheat Sheet for Rhea Math]] *'''Topic 4''': Discrete-time Fourier transform (DTFT): definition, periodicity property, example (c13 KB (1,944 words) - 16:51, 13 March 2015
- <font size="4">[[DTFT of a sampled cosine Yijun ECE438 slecture|Discrete-time Fourier transform (DTFT) of a sampled cosine]] </font> ...r some of the math sections could use better explanations to accompany the math.2 KB (396 words) - 05:39, 15 October 2014
- ...en going yours. And maybe you could try to show the difference between the discrete time sampling and the continous time sampling. And maybe a more clear graph ...anner to import the good handwriting on the graphs and sketches. While the math followed a good logical order and the Nyquist theorem was emphasized enough4 KB (649 words) - 05:41, 15 October 2014
- ...numbers and integers. Cryptosystems however are often based on finite and discrete sets and modular arithmetic is at the heart of many cryptosystems. We need ...math>\ 10+5=15 </math>. How we write this is <math> 15 \equiv 3 \bmod 12 </math>.6 KB (886 words) - 05:16, 24 June 2015
- This page refers to the "Lecture Notes in Discrete Mathematics" of MA 375 in Spring of 2016, by [[user:walther|Uli Walther]]. *[http://www.math.purdue.edu/~mathclub/ Math Club Homepage]4 KB (722 words) - 18:20, 4 May 2016
- <math>\ \text{Definitions} </math> .../math> is the set of vertices (or "dots") in the graph and <math>\ E_{G} </math> is the set of edges (or "lines") for the graph.13 KB (2,051 words) - 22:06, 24 April 2016
- ...<math>E_\infty</math> and the power <math>P_\infty</math> of the following discrete-time signal <math> x[n] =2 KB (263 words) - 11:13, 22 January 2018
- ...mpts to exploit the properties of quantum mechanics, rather than difficult math problems, to protect data from quantum threats. Finally, Post-Quantum Crypt ...at random two large prime numbers ''p'' and ''q'' such that <math>p ≠ q</math>.31 KB (5,039 words) - 17:31, 6 December 2022
