When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Factorial - Wikipedia

    en.wikipedia.org/wiki/Factorial

    For example, 9!! = 1 × 3 × 5 × 7 × 9 = 945. Double factorials are used in trigonometric integrals, [92] in expressions for the gamma function at half-integers and the volumes of hyperspheres, [93] and in counting binary trees and perfect matchings. [91] [94] Exponential factorial

  3. Factorial number system - Wikipedia

    en.wikipedia.org/wiki/Factorial_number_system

    From this it follows that the rightmost digit is always 0, the second can be 0 or 1, the third 0, 1 or 2, and so on (sequence A124252 in the OEIS).The factorial number system is sometimes defined with the 0! place omitted because it is always zero (sequence A007623 in the OEIS).

  4. Kempner function - Wikipedia

    en.wikipedia.org/wiki/Kempner_function

    In number theory, the Kempner function [1] is defined for a given positive integer to be the smallest number such that divides the factorial!. For example, the number 8 {\displaystyle 8} does not divide 1 ! {\displaystyle 1!} , 2 ! {\displaystyle 2!} , or 3 ! {\displaystyle 3!} , but does divide 4 ! {\displaystyle 4!} , so S ( 8 ) = 4 ...

  5. List of mathematical series - Wikipedia

    en.wikipedia.org/wiki/List_of_mathematical_series

    2.1 Low-order polylogarithms. 2.2 Exponential function. ... 2.4 Modified-factorial denominators. 2.5 Binomial coefficients. 2.6 Harmonic numbers. 3 Binomial coefficients.

  6. Legendre's formula - Wikipedia

    en.wikipedia.org/wiki/Legendre's_formula

    As one special case, it can be used to prove that if n is a positive integer then 4 divides () if and only if n is not a power of 2. It follows from Legendre's formula that the p -adic exponential function has radius of convergence p − 1 / ( p − 1 ) {\displaystyle p^{-1/(p-1)}} .

  7. Stirling's approximation - Wikipedia

    en.wikipedia.org/wiki/Stirling's_approximation

    [1] [2] [3] One way of stating the approximation involves the logarithm of the factorial: ⁡ (!) = ⁡ + (⁡), where the big O notation means that, for all sufficiently large values of , the difference between ⁡ (!

  8. Primorial - Wikipedia

    en.wikipedia.org/wiki/Primorial

    The n-compositorial is equal to the n-factorial divided by the primorial n#. The compositorials are The compositorials are 1 , 4 , 24 , 192 , 1728 , 17 280 , 207 360 , 2 903 040 , 43 545 600 , 696 729 600 , ...

  9. Falling and rising factorials - Wikipedia

    en.wikipedia.org/wiki/Falling_and_rising_factorials

    The value of each is taken to be 1 (an empty product) when =. These symbols are collectively called factorial powers. [2] The Pochhammer symbol, introduced by Leo August Pochhammer, is the notation (), where n is a non-negative integer.