Search Results for ""
1041 - 1050 of 4435 for Triangle FunctionSearch Results
Krall and Fink (1949) defined the Bessel polynomials as the function y_n(x) = sum_(k=0)^(n)((n+k)!)/((n-k)!k!)(x/2)^k (1) = sqrt(2/(pix))e^(1/x)K_(-n-1/2)(1/x), (2) where ...
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 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 ...
Bertelsen's number is an erroneous name erroneously given to the erroneous value of pi(10^9)=50847478, where pi(x) is the prime counting function. This value is 56 lower than ...
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 ...
The Hermite polynomials H_n(x) are set of orthogonal polynomials over the domain (-infty,infty) with weighting function e^(-x^2), illustrated above for n=1, 2, 3, and 4. ...
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 ...
...
View search results from all Wolfram sites (417657 matches)

