Search results

Page title matches

• Discrete mathematics
  '''Discrete mathematics''' is a branch of mathematics that focuses on the properties and manipulati
  214 bytes (26 words) - 22:19, 15 January 2008
• Discrete mathematics/Approval
  12 bytes (1 word) - 17:40, 20 December 2007
• Discrete mathematics/Definition
  167 bytes (18 words) - 09:28, 18 June 2009
• Discrete mathematics/Related Articles
  245 bytes (29 words) - 09:38, 18 June 2009

Page text matches

• Discrete mathematics
  '''Discrete mathematics''' is a branch of mathematics that focuses on the properties and manipulati
  214 bytes (26 words) - 22:19, 15 January 2008
• Combinatorics/Related Articles
  {{r|Discrete mathematics}}
  610 bytes (72 words) - 10:57, 18 June 2009
• Graph theory/Related Articles
  {{r|Discrete mathematics}}
  797 bytes (101 words) - 16:58, 11 January 2010
• Pigeonhole principle
  In [[discrete mathematics]], the '''Pigeonhole Principle''' states "if you have ten pigeons and only
  502 bytes (84 words) - 08:47, 31 December 2007
• Number theory/Related Articles
  {{r|Discrete mathematics}}
  2 KB (262 words) - 19:07, 11 January 2010
• Multinomial coefficient
  In [[discrete mathematics]], the '''multinomial coefficient''' arises as a generalization of the [[bi
  2 KB (365 words) - 06:50, 22 January 2009
• Computer engineering
  ...this mathematics and focus on systems which can be easily described with [[discrete mathematics]]. This method allows a digital engineer to create larger systems, more co
  4 KB (608 words) - 13:08, 17 April 2013
• Computer simulation
  * [[Continuous function|Continuous]] or [[discrete mathematics|discrete]] (and as an important special case of discrete, discrete event or
  14 KB (1,986 words) - 17:07, 22 March 2024
• Mathematics
  ===Discrete mathematics=== [[Discrete mathematics]] is the common name for the fields of mathematics most generally useful in
  30 KB (4,289 words) - 16:03, 20 January 2023
• Set (mathematics)
  See, for example, {{cite book |title=Discrete Mathematics |author=N. Chandrasekaran, M. Umaparvathi |pages=p. 11 |chapter=§1.3.3 Rep
  17 KB (2,828 words) - 10:37, 24 July 2011
• Theory (mathematics)
  Imagine a theory able to describe the whole discrete mathematics (the set theory?) or, at least, arbitrary algorithmic computations, in othe
  34 KB (5,174 words) - 21:32, 25 October 2013
• Biology/Catalogs
  ...icians, and computer scientists eager to learn about this emerging area of discrete mathematics.
  19 KB (2,662 words) - 11:46, 2 February 2023
• Quantum mechanics/Advanced
  ...[[Continuous function|continuous]] (e.g., the position of a particle) or [[Discrete mathematics|discrete]] (e.g., the energy of an electron bound to a hydrogen atom).
  37 KB (5,578 words) - 04:54, 21 March 2024