TOPICS
Search

Search Results for ""


5061 - 5070 of 6485 for Finite Group D 4Search Results
Let n>=0 and alpha_1, alpha_2, ...be the positive roots of J_n(x)=0, where J_n(z) is a Bessel function of the first kind. An expansion of a function in the interval (0,1) in ...
Because the Legendre polynomials form a complete orthogonal system over the interval [-1,1] with respect to the weighting function w(x)=1, any function f(x) may be expanded ...
The Fourier sine transform is the imaginary part of the full complex Fourier transform, F_x^((s))[f(x)](k) = I[F_x[f(x)](k)] (1) = int_(-infty)^inftysin(2pikx)f(x)dx. (2) The ...
The Fourier transform of a Gaussian function f(x)=e^(-ax^2) is given by F_x[e^(-ax^2)](k) = int_(-infty)^inftye^(-ax^2)e^(-2piikx)dx (1) = ...
The "Foxtrot series" is a mathematical sum that appeared in the June 2, 1996 comic strip FoxTrot by Bill Amend (Amend 1998, p. 19; Mitchell 2006/2007). It arose from a ...
The term "fractal dimension" is sometimes used to refer to what is more commonly called the capacity dimension of a fractal (which is, roughly speaking, the exponent D in the ...
The maximum possible weight of a fractional clique of a graph G is called the fractional clique number of G, denoted omega^*(G) (Godsil and Royle 2001, pp. 136-137) or ...
The fractional derivative of f(t) of order mu>0 (if it exists) can be defined in terms of the fractional integral D^(-nu)f(t) as D^muf(t)=D^m[D^(-(m-mu))f(t)], (1) where m is ...
The Franel numbers are the numbers Fr_n=sum_(k=0)^n(n; k)^3, (1) where (n; k) is a binomial coefficient. The first few values for n=0, 1, ... are 1, 2, 10, 56, 346, ... (OEIS ...
In 1750, Benjamin Franklin constructed the above 8×8 semimagic square having magic constant 260. Any half-row or half-column in this square totals 130, and the four corners ...
1 ... 504|505|506|507|508|509|510 ... 649 Previous Next

...