Search Results for ""

If f(x) is an even function, then b_n=0 and the Fourier series collapses to f(x)=1/2a_0+sum_(n=1)^inftya_ncos(nx), (1) where a_0 = 1/piint_(-pi)^pif(x)dx (2) = ...

If f(x) is an odd function, then a_n=0 and the Fourier series collapses to f(x)=sum_(n=1)^inftyb_nsin(nx), (1) where b_n = 1/piint_(-pi)^pif(x)sin(nx)dx (2) = ...

The Fourier transform of the generalized function 1/x is given by F_x(-PV1/(pix))(k) = -1/piPVint_(-infty)^infty(e^(-2piikx))/xdx (1) = ...

Define the abundancy Sigma(n) of a positive integer n as Sigma(n)=(sigma(n))/n, (1) where sigma(n) is the divisor function. Then a pair of distinct numbers (k,m) is a ...

Gabriel's horn, also called Torricelli's trumpet, is the surface of revolution of the function y=1/x about the x-axis for x>=1. It is therefore given by parametric equations ...

The Gallatly circle is the circle with center at the Brocard midpoint X_(39) and radius R_G = Rsinomega (1) = (abc)/(2sqrt(a^2b^2+a^2c^2+b^2c^2)), (2) where R is the ...

A gamma distribution is a general type of statistical distribution that is related to the beta distribution and arises naturally in processes for which the waiting times ...

Wirsing (1974) showed, among other results, that if F_n(x) is the Gauss-Kuzmin distribution, then lim_(n->infty)(F_n(x)-lg(1+x))/((-lambda)^n)=Psi(x), (1) where ...

A genetic algorithm is a class of adaptive stochastic optimization algorithms involving search and optimization. Genetic algorithms were first used by Holland (1975). The ...

A number given by the generating function (2t)/(e^t+1)=sum_(n=1)^inftyG_n(t^n)/(n!). (1) It satisfies G_1=1, G_3=G_5=G_7=...=0, and even coefficients are given by G_(2n) = ...