Search Results for ""
301 - 310 of 730 for Rising Factorial PowerSearch Results
Stirling's approximation gives an approximate value for the factorial function n! or the gamma function Gamma(n) for n>>1. The approximation can most simply be derived for n ...
The Lambert W-function, also called the omega function, is the inverse function of f(W)=We^W. (1) The plot above shows the function along the real axis. The principal value ...
The triangle coefficient is function of three variables written Delta(abc)=Delta(a,b,c) and defined by Delta(abc)=((a+b-c)!(a-b+c)!(-a+b+c)!)/((a+b+c+1)!), (Shore and Menzel ...
The function defined by U(n)=(n!)^(n!). The values for n=0, 1, ..., are 1, 1, 4, 46656, 1333735776850284124449081472843776, ... (OEIS A046882).
The polynomials G_n(x;a,b) given by the associated Sheffer sequence with f(t)=e^(at)(e^(bt)-1), (1) where b!=0. The inverse function (and therefore generating function) ...
The Catalan numbers on nonnegative integers n are a set of numbers that arise in tree enumeration problems of the type, "In how many ways can a regular n-gon be divided into ...
A factorion is an integer which is equal to the sum of factorials of its digits. There are exactly four such numbers: 1 = 1! (1) 2 = 2! (2) 145 = 1!+4!+5! (3) 40585 = ...
Let t(m) denote the set of the phi(m) numbers less than and relatively prime to m, where phi(n) is the totient function. Then if S_m=sum_(t(m))1/t, (1) then {S_m=0 (mod m^2) ...
An algorithm originally described by Barnsley in 1988. Pick a point at random inside a regular n-gon. Then draw the next point a fraction r of the distance between it and a ...
Find the figure bounded by a line which has the maximum area for a given perimeter. The solution is a semicircle. The problem is based on a passage from Virgil's Aeneid: "The ...
...
View search results from all Wolfram sites (321063 matches)

