Search results

Jump to navigation Jump to search
View ( | ) (20 | 50 | 100 | 250 | 500)
  • ...ching it. The '''Left limit''' is any value that approaches the limit from numbers less than the number, and the '''Right limit''' is any value that approache ...
    2 KB (355 words) - 20:25, 6 October 2015
  • ...th>k</math>. Let <math>S</math> be a set with <math>|S|=n</math>. Find the numbers of <math>k</math>-tuples <math>(T_1,T_2,\dots,T_k)</math> of subsets <math> ...
    2 KB (334 words) - 09:11, 5 May 2023
  • ...n|exponential functions]], and are useful in multiplying or dividing large numbers. Logarithms can make multiplication and division of large numbers easier because adding logarithms is the same as multiplying, and subtractin ...
    13 KB (1,977 words) - 14:34, 21 July 2017
  • It is a [[computation]] process that uses random numbers to produce an outcome(s). Instead of having fixed inputs, [[probability dis ...
    2 KB (307 words) - 14:25, 25 June 2017
  • * State and prove an analogous result for Stirling numbers of the first kind. ...
    2 KB (315 words) - 12:14, 20 March 2024
  • * State and prove an analogous result for Stirling numbers of the first kind. ...
    2 KB (315 words) - 13:05, 14 May 2024
  • ...variables, and see negative association in action by considering occupancy numbers in the balls and bins model. ...and only if ball <math>k</math> lands in bin <math>i</math>. The occupancy numbers are <math>B_i=\sum_{k\in[m]}B_{i,k}</math>. That is, <math>B_i</math> denot ...
    9 KB (1,698 words) - 10:59, 3 November 2018
  • ...t time period when the whole group covers a longer time. In this case, the numbers in the sample are not independent. Then special equations are used to try t ...imit theorem]] shows that the numbers in the sample are very much like the numbers in the whole group (they have a [[normal distribution]]). ...
    9 KB (1,463 words) - 03:47, 2 July 2016
  • ...input a set <math>S</math> of <math>n</math> numbers, we want to sort the numbers in <math>S</math> in increasing order. One of the most famous algorithm for ...re all numbers in <math>S_1</math> are smaller than <math>x</math> and all numbers in <math>S_2</math> are larger than <math>x</math>; ...
    19 KB (3,431 words) - 06:53, 14 April 2014
  • ...an [[wikt:extend|extension]] of the [[factorial]] function to all complex numbers except negative, integers. The argument of the function is shifted down by The gamma function is defined for all [[complex numbers]]. But it is not defined for negative integers and zero. For a complex numb ...
    8 KB (1,133 words) - 09:45, 26 June 2017
  • ...of a real-valued argument ''x''. (This means both the input and output are numbers.) ...''x''&sup2; is <nowiki>[0,+∞) </nowiki>, that is, the set of non-negative numbers. (Also, this function is not an injection.) ...
    10 KB (1,438 words) - 06:38, 8 October 2016
  • Let <math>a_n</math> be a sequence of numbers satisfying the recurrence relation: ...
    3 KB (374 words) - 14:36, 27 September 2016
  • Let <math>a_n</math> be a sequence of numbers satisfying the recurrence relation: ...
    4 KB (346 words) - 13:14, 17 September 2017
  • Where the letters are the corresponding numbers of the original equation, {{math|1=''ax''<sup>2</sup> + ''bx'' + ''c'' = 0} ...
    3 KB (423 words) - 13:48, 30 September 2016
  • ...ame place to react in the opposite direction. The ratio between those two numbers represents how popular each side of the reaction will be when equilibrium i ...
    2 KB (386 words) - 03:46, 18 October 2014
  • ...</math> remains as a '''formal variable''' without assuming any value. The numbers that we want to count are the coefficients carried by the terms in the form === Fibonacci numbers === ...
    20 KB (3,444 words) - 04:53, 7 October 2010
  • [[Category:Prime numbers]] ...
    2 KB (275 words) - 11:04, 28 April 2016
  • ...nd method, we consider the number of choices in one step, and multiply the numbers of choices in all steps. This is done as follows. Multiplying the numbers of choices in all steps, the number of sequences of adding directed edges t ...
    21 KB (3,832 words) - 15:23, 7 October 2011
  • ...</math> remains as a '''formal variable''' without assuming any value. The numbers that we want to count are the coefficients carried by the terms in the form === Fibonacci numbers === ...
    24 KB (4,298 words) - 05:54, 20 March 2013
  • ...</math> remains as a '''formal variable''' without assuming any value. The numbers that we want to count are the coefficients carried by the terms in the form === Fibonacci numbers === ...
    24 KB (4,298 words) - 06:51, 26 February 2014
View ( | ) (20 | 50 | 100 | 250 | 500)