Search Results for ""

A function f is said to be an entire modular form of weight k if it satisfies 1. f is analytic in the upper half-plane H, 2. f((atau+b)/(ctau+d))=(ctau+d)^kf(tau) whenever [a ...

The Fourier transform of e^(-k_0|x|) is given by F_x[e^(-k_0|x|)](k)=int_(-infty)^inftye^(-k_0|x|)e^(-2piikx)dx = ...

If f(x) is piecewise continuous and has a generalized Fourier series sum_(i)a_iphi_i(x) (1) with weighting function w(x), it must be true that ...

Let T(x,y,z) be the number of times "otherwise" is called in the TAK function, then the Takeuchi numbers are defined by T_n(n,0,n+1). A recursive formula for T_n is given by ...

e^(izcostheta)=sum_(n=-infty)^inftyi^nJ_n(z)e^(intheta), where J_n(z) is a Bessel function of the first kind. The identity can also be written ...

The Gregory series is a pi formula found by Gregory and Leibniz and obtained by plugging x=1 into the Leibniz series, pi/4=sum_(k=1)^infty((-1)^(k+1))/(2k-1)=1-1/3+1/5-... ...

A 4×4 magic square in which the elements in each 2×2 corner have the same sum. Dürer's magic square, illustrated above, is an example of a gnomon magic square since the sums ...

f(z)=k/((cz+d)^r)f((az+b)/(cz+d)) where I[z]>0.

The symbol tau (the lower case Greek letter tau) has many common uses in mathematics, as summarized in the following table. 1. tau(n) is an alternate notation for the divisor ...

SNTP(n) is the smallest prime such that p#-1, p#, or p#+1 is divisible by n, where p# is the primorial of p. Ashbacher (1996) shows that SNTP(n) only exists 1. If there are ...