Search results

Page title matches

• Binomial coefficient
  The '''binomial coefficient''' is a part of [[combinatorics]]. The binomial coefficient represent the number of possible choices of ''k'' elements out of ''n'' lab ...has a system, where you can choose 6 numbers from the numbers 1 to 49. The binomial coefficient <math>\tbinom{49}{6}</math> is 13,983,816, so the probability to choose the
  3 KB (438 words) - 15:03, 30 November 2009
• Binomial Coefficient
  #Redirect [[Binomial coefficient]]
  34 bytes (3 words) - 10:41, 19 May 2008
• Binomial coefficient/Definition
  127 bytes (17 words) - 12:13, 14 June 2008
• Binomial coefficient/Related Articles
  233 bytes (28 words) - 06:45, 15 July 2008

Page text matches

• Binomial Coefficient
  #Redirect [[Binomial coefficient]]
  34 bytes (3 words) - 10:41, 19 May 2008
• Binomial co-efficient
  #Redirect [[Binomial coefficient]]
  34 bytes (3 words) - 22:07, 30 May 2008
• Binomial Co-efficient
  #Redirect [[Binomial coefficient]]
  34 bytes (3 words) - 22:08, 30 May 2008
• Pascal's triangle/Definition
  A convenient tabular presentation for the [[binomial coefficient]]s.
  104 bytes (12 words) - 17:55, 12 September 2009
• Binomial coefficient
  The '''binomial coefficient''' is a part of [[combinatorics]]. The binomial coefficient represent the number of possible choices of ''k'' elements out of ''n'' lab ...has a system, where you can choose 6 numbers from the numbers 1 to 49. The binomial coefficient <math>\tbinom{49}{6}</math> is 13,983,816, so the probability to choose the
  3 KB (438 words) - 15:03, 30 November 2009
• Multinomial coefficient
  ...s]], the '''multinomial coefficient''' arises as a generalization of the [[binomial coefficient]]. It follows that the multinomial coefficient is equal to the binomial coefficient for the partition of ''n'' into two integer numbers. However, the two coef
  2 KB (365 words) - 06:50, 22 January 2009
• Pascal's triangle/Related Articles
  {{r|Binomial coefficient}}
  540 bytes (68 words) - 19:23, 11 January 2010
• Binomial theorem/Related Articles
  {{r|Binomial coefficient}}
  263 bytes (35 words) - 06:59, 15 July 2008
• Binomial theorem
  is a [[binomial coefficient]]. Another useful way of stating it is the following:
  3 KB (507 words) - 07:34, 9 August 2010
• Combinatorics/Related Articles
  {{r|Binomial coefficient}}
  610 bytes (72 words) - 10:57, 18 June 2009
• Gamma function/Related Articles
  {{r|Binomial coefficient}}
  684 bytes (86 words) - 16:46, 11 January 2010
• Leibniz rule
  is a [[binomial coefficient]].
  579 bytes (99 words) - 09:42, 6 May 2010
• Factorial/Related Articles
  {{r|Binomial coefficient}}
  971 bytes (150 words) - 10:45, 4 October 2013
• Combinatorics
  ...rally, the number of ways you can choose ''k'' objects out of ''n'' is a [[binomial coefficient]].
  1 KB (165 words) - 10:24, 18 June 2009
• Special function/Catalogs/List
  {{r|Binomial coefficient}}
  2 KB (260 words) - 08:13, 9 December 2009
• Hermite polynomial
  where <math>\binom{n}{k} </math> is a [[binomial coefficient]].
  4 KB (580 words) - 06:31, 31 May 2009
• Recurrence relation
  ...ple of a recurrence relation with more than one variable is given by the [[binomial coefficient]]s
  3 KB (462 words) - 15:50, 14 December 2008
• Pascal's triangle
  '''Pascal's triangle''' is a convenient tabular representation of the [[binomial coefficient]]s. Already known in the 11th century,<ref>[http://www-gap.dcs.st-and.ac.uk is the ''k''th binomial coefficient in the [[binomial expansion]] of <math>\scriptstyle (x + y)^n</math>, then
  32 KB (4,192 words) - 18:42, 3 March 2024
• Special function/Catalogs/Catalog
  |[[Binomial coefficient]]
  8 KB (1,184 words) - 14:58, 8 December 2009
• Factorial
  ...tion is found in many combinatorial counting problems. For example, the [[binomial coefficient]]s, which count the number of subsets size ''r'' drawn from a set of ''n''
  22 KB (3,358 words) - 09:31, 10 October 2013