Search Results for ""

Number theory is a vast and fascinating field of mathematics, sometimes called "higher arithmetic," consisting of the study of the properties of whole numbers. Primes and ...

_0F_1(;a;z)=lim_(q->infty)_1F_1(q;a;z/q). (1) It has a series expansion _0F_1(;a;z)=sum_(n=0)^infty(z^n)/((a)_nn!) (2) and satisfies z(d^2y)/(dz^2)+a(dy)/(dz)-y=0. (3) It is ...

The spherical Hankel function of the second kind h_n^((1))(z) is defined by h_n^((2))(z) = sqrt(pi/(2x))H_(n+1/2)^((2))(z) (1) = j_n(z)-in_n(z), (2) where H_n^((2))(z) is the ...

The inhomogeneous Helmholtz differential equation is del ^2psi(r)+k^2psi(r)=rho(r), (1) where the Helmholtz operator is defined as L^~=del ^2+k^2. The Green's function is ...

The decimal period of a repeating decimal is the number of digits that repeat. For example, 1/3=0.3^_ has decimal period one, 1/11=0.09^_ has decimal period two, and ...

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) = ...

Riemann defined the function f(x) by f(x) = sum_(p^(nu)<=x; p prime)1/nu (1) = sum_(n=1)^(|_lgx_|)(pi(x^(1/n)))/n (2) = pi(x)+1/2pi(x^(1/2))+1/3pi(x^(1/3))+... (3) (Hardy ...

A sieving procedure that can be used in conjunction with Dixon's factorization method to factor large numbers n. Pick values of r given by r=|_sqrt(n)_|+k, (1) where k=1, 2, ...

A public-key cryptography algorithm which uses prime factorization as the trapdoor one-way function. Define n=pq (1) for p and q primes. Also define a private key d and a ...

Let f(x,y) be a homogeneous function of order n so that f(tx,ty)=t^nf(x,y). (1) Then define x^'=xt and y^'=yt. Then nt^(n-1)f(x,y) = ...