Search Results for ""

A method for computing the prime counting function. Define the function T_k(x,a)=(-1)^(beta_0+beta_1+...+beta_(a-1))|_x/(p_1^(beta_0)p_2^(beta_1)...p_a^(beta_(a-1)))_|, (1) ...

The sawtooth wave, called the "castle rim function" by Trott (2004, p. 228), is the periodic function given by S(x)=Afrac(x/T+phi), (1) where frac(x) is the fractional part ...

The Gram series is an approximation to the prime counting function given by G(x)=1+sum_(k=1)^infty((lnx)^k)/(kk!zeta(k+1)), (1) where zeta(z) is the Riemann zeta function ...

The kth power of a graph G is a graph with the same set of vertices as G and an edge between two vertices iff there is a path of length at most k between them (Skiena 1990, ...

A unit is an element in a ring that has a multiplicative inverse. If a is an algebraic integer which divides every algebraic integer in the field, a is called a unit in that ...

The G-transform of a function f(x) is defined by the integral (Gf)(x)=(G_(pq)^(mn)|(a_p); (b_q)|f(t))(x) (1) =1/(2pii)int_sigmaGamma[(b_m)+s, 1-(a_n)-s; (a_p^(n+1))+s, ...

In the theory of special functions, a class of functions is said to be "of the third kind" if it is similar to but distinct from previously defined functions already defined ...

Erfc is the complementary error function, commonly denoted erfc(z), is an entire function defined by erfc(z) = 1-erf(z) (1) = 2/(sqrt(pi))int_z^inftye^(-t^2)dt. (2) It is ...

Let z=x+iy and f(z)=u(x,y)+iv(x,y) on some region G containing the point z_0. If f(z) satisfies the Cauchy-Riemann equations and has continuous first partial derivatives in ...

A modification of Legendre's formula for the prime counting function pi(x). It starts with |_x_| = (1) where |_x_| is the floor function, P_2(x,a) is the number of integers ...