Search results
Jump to navigation
Jump to search
- {{short description|Function that interpolates the factorial}} ...rawn through those points. Such a curve, namely one which interpolates the factorial but is not equal to the gamma function, is known as a pseudogamma function. ...3 KB (354 words) - 01:46, 2 March 2025
- {{short description|Mathematical result on arithmetic properties of binomial coefficients}} ...) = 5) equals the greatest common divisor of the second, fourth, and sixth of them (gcd(10, 35, 15) = 5). --> <!-- That's a ...4 KB (591 words) - 07:29, 31 December 2024
- {{short description|Identity involving binomial coefficients, first established by Zhi-Wei Sun in 2002}} ...entity''' is the following [[Identity (mathematics)|identity]] involving [[binomial coefficient]]s, first established by [[Zhi-Wei Sun]] in 2002: ...3 KB (419 words) - 15:09, 2 February 2024
- ...on methods have been studied.<ref>Shah S.M. (1971) "The displaced negative binomial distribution", ''Bulletin of the Calcutta Statistical Association'', 20, 14 ...istribution appeared in its general form in a paper by K. Hess, A. Liewald and K.D. Schmidt<ref name="Schmidt">{{cite journal ...4 KB (527 words) - 15:35, 6 May 2021
- | name = Beta Negative Binomial ...^{(r)} = \frac{\Gamma(x+r)}{\Gamma(x)}</math> is the [[Pochhammer symbol]] and <math>{}_{2}F_{1}</math> is the [[hypergeometric function]]. ...10 KB (1,483 words) - 16:29, 5 November 2024
- In [[mathematics]], the '''Fibonomial coefficients''' or '''Fibonacci-binomial coefficients''' are defined as ... ≤ ''n'', ''F<sub>j</sub>'' is the ''j''-th [[Fibonacci number]] and ''n''!<sub>F</sub> is the ''n''th [[Fibonorial]], i.e. ...5 KB (712 words) - 15:58, 12 September 2021
- ...Springer-Verlag]]|year=1994|isbn=978-0387208602|location=|pages=79|chapter=Factorial n as the Product of n Large Factors}}</ref> ...ath display="inline">n!</math> grows with <math display="inline">n</math>, and is given by the sequence ...6 KB (796 words) - 21:34, 27 August 2023
- {{short description|Array of partial sums of the binomial coefficients}} ...any integer ''k'' included between 0 and ''n'', the component in row ''n'' and column ''k'' is given by: ...4 KB (550 words) - 03:30, 18 January 2025
- ...of the largest power of a [[Prime number|prime]] ''p'' that divides the [[factorial]] ''n''<nowiki>!</nowiki>. It is named after [[Adrien-Marie Legendre] For any prime number ''p'' and any positive integer ''n'', let <math>\nu_p(n)</math> be the exponent of th ...5 KB (767 words) - 17:24, 21 February 2025
- ...,''n''</sub> counts the ways that ''n'' + ''m'' open parentheses and ''n'' − ''m'' close parentheses can be arranged to form the start ...up>th</sup> Lobb number ''L''<sub>''m'',''n''</sub> is given in terms of [[binomial coefficient]]s by the formula ...3 KB (448 words) - 00:07, 13 December 2024
- {{Short description|Generalization of the mathematical factorial}} ...'' !<sub><math>\mathbb{Z}</math> </sub>, would turn out to be the ordinary factorial of ''k''.<ref name=MAA>{{cite journal ...12 KB (1,704 words) - 07:58, 25 January 2024
- ...ort description|On finite sums of products of three binomial coefficients, and a hypergeometric sum}} ...]. These identities famously follow from the [[MacMahon Master theorem]], and can now be routinely proved by computer algorithms {{harv|Ekhad|1990}}. ...4 KB (573 words) - 02:31, 13 September 2024
- ...t vertex, 2 ways of permuting the two children of the upper middle vertex, and 5! = 120 ways of permuting the five children of the upper right vertex, for ...rphism group]] of a tree. These numbers are named after [[Camille Jordan]] and [[George Pólya]], who both wrote about them in the context of symmetries of ...6 KB (817 words) - 23:54, 12 December 2024
- ...ribution, samples are drawn until <math>r</math> failures have been found, and the distribution describes the probability of finding <math>k</math> succes ...math>N</math> elements, of which <math>K</math> are defined as "successes" and the rest are "failures". ...10 KB (1,597 words) - 19:44, 12 February 2024
- ...negative multinomial distribution''' is a generalization of the [[negative binomial distribution]] (NB(''x''<sub>0</sub>, ''p'')) to more than two outco ...ub>+...+''X''<sub>''m''</sub> is not fixed, being a draw from a [[negative binomial distribution]]. ...8 KB (1,112 words) - 08:57, 5 February 2023
- ...spective. For instance, the integrand is usually a [[rational function]], and the sum of the residues of a rational function is zero, yielding a new expr * First binomial coefficient integral ...10 KB (1,554 words) - 04:10, 24 December 2024
- ...h>n</math>-th row are indexed starting with <math>-n</math> from the left, and the middle entry has index 0. The symmetry of the entries of a row about th where <math>{n\choose k}_2=0</math> for <math>\ k<-n</math> and <math>\ k>n</math>. ...6 KB (1,006 words) - 00:31, 30 October 2024
- {{Short description|Recurrence relations of binomial coefficients in Pascal's triangle}} ...ick identity''',<ref>CH Jones (1996) ''Generalized Hockey Stick Identities and N-Dimensional Block Walking.'' [[Fibonacci Quarterly]] '''34'''(3), 280-288 ...7 KB (1,159 words) - 20:29, 21 February 2025
- ==Definition and applications== ...iver starts looking for a space after already passing the only free space, and will be unable to park.{{r|riordan}} ...6 KB (823 words) - 21:05, 23 May 2024
- In 1693 [[Samuel Pepys]] and [[Isaac Newton]] corresponded over a problem posed to Pepys by a school tea :A. Six fair dice are tossed independently and at least one "6" appears. ...5 KB (843 words) - 18:37, 20 December 2024