Search results

Page title matches

• Finite set
  In mathematics, a '''finite set''' simply is [[set]] which has finitely many elements,
  1 KB (222 words) - 16:36, 4 January 2013
• Finite set/Definition
  97 bytes (12 words) - 18:46, 6 July 2009
• Finite set/Related Articles
  172 bytes (23 words) - 18:48, 6 July 2009

Page text matches

• Finite and infinite
  [[finite set|'''finite''' sets]] have finitely many elements, i.e., 0 or 1 or 2 or 3 ...
  1 KB (191 words) - 17:30, 15 July 2009
• Cofinite topology
  ...[[set (mathematics)|set]] in the the [[open set]]s are those which have [[finite set|finite]] [[complement (set theory)|complement]], together with the empty se
  1,007 bytes (137 words) - 22:52, 17 February 2009
• Finite set
  In mathematics, a '''finite set''' simply is [[set]] which has finitely many elements,
  1 KB (222 words) - 16:36, 4 January 2013
• Infinite set
  #REDIRECT [[finite set]]
  24 bytes (3 words) - 19:01, 6 July 2009
• Infinite set/Definition
  The number of its elements is larger than any natural number. (See: [[Finite set]].)
  121 bytes (17 words) - 19:09, 6 July 2009
• Cardinality/Related Articles
  {{r|finite set}}
  91 bytes (11 words) - 18:29, 26 June 2009
• Order (mathematics)
  {{r|Cardinality|Order of a finite set or algebraic structure}}
  248 bytes (33 words) - 17:37, 14 April 2010
• Finite and infinite/Related Articles
  {{r|finite set}}
  149 bytes (18 words) - 18:35, 15 July 2009
• Discrete space
  * A discrete space is [[compact space|compact]] if and only if it is [[finite set|finite]].
  872 bytes (125 words) - 15:57, 4 January 2013
• Galileo's paradox/Related Articles
  {{r|Finite set}}
  515 bytes (67 words) - 16:45, 11 January 2010
• Bijective function
  Two [[finite set]]s have the same number of elements if and only if there exists a bijection
  4 KB (618 words) - 22:24, 7 February 2010
• Extreme value
  ...By [[iteration]] we may define the maximum and minimum of any (non-empty) finite set. ...the set); similarly an infimum need not be a minimum. As noted above, any finite set has a maximum and minimum which are thus its supremum and infimum.
  3 KB (538 words) - 18:17, 17 January 2010
• Permutation group
  ...mposition as the group operation. For example, let <math>A</math> denote a finite set of <math>n</math> distinct objects, and let <math>S_A</math> denote the set
  2 KB (244 words) - 20:34, 1 July 2009
• Partition (mathematics)
  The number of partitions of a finite set of size ''n'' into ''k'' parts is given by a [[Stirling number]] of the sec
  2 KB (336 words) - 07:17, 16 January 2009
• Cardinal number
  ...''' is a property of [[set]]s that generalises the notion of the size of a finite set. Because of this, it is often thought of as the “size” of a (possibly [
  11 KB (1,808 words) - 17:50, 26 June 2009
• Isogeny
  .... The kernel of φ is a proper subvariety of ''E''₁ and hence a finite set of order ''d'', the ''degree'' of φ. Conversely, every finite subgroup of
  4 KB (647 words) - 15:51, 7 February 2009
• Hall polynomial
  A [[finite set|finite]] [[abelian group|abelian]] [[p-group|''p''-group]] ''M'' is a direc
  2 KB (264 words) - 22:53, 19 February 2010
• Hutchinson operator
  Formally, let ''f''_''i'' be a finite set of ''N'' functions from a set ''X'' to itself. We may regard this as defin
  2 KB (327 words) - 15:52, 27 October 2008
• Countable set
  For instance, given the finite set
  10 KB (1,462 words) - 17:25, 25 August 2013
• Countable set/Citable Version
  For instance, given the finite set
  10 KB (1,462 words) - 17:24, 25 August 2013