Search Results for ""
1741 - 1750 of 3397 for Hurwitz zeta functionSearch Results
Consider the sequence of partial sums defined by s_n=sum_(k=1)^n(-1)^kk^(1/k). (1) As can be seen in the plot above, the sequence has two limit points at -0.812140... and ...
A curve which may pass through any region of three-dimensional space, as contrasted to a plane curve which must lie in a single plane. Von Staudt (1847) classified space ...
There are (at least) two mathematical constants associated with Theodorus. The first Theodorus's constant is the elementary algebraic number sqrt(3), i.e., the square root of ...
By analogy with the divisor function sigma_1(n), let pi(n)=product_(d|n)d (1) denote the product of the divisors d of n (including n itself). For n=1, 2, ..., the first few ...
The asymptotic series for the gamma function is given by (1) (OEIS A001163 and A001164). The coefficient a_n of z^(-n) can given explicitly by ...
The scalar form of Laplace's equation is the partial differential equation del ^2psi=0, (1) where del ^2 is the Laplacian. Note that the operator del ^2 is commonly written ...
The integer sequence 1, 0, 1, 1, 2, 1, 3, 2, 4, 3, 5, 4, 7, 5, 8, 7, 10, 8, 12, 10, 14, 12, 16, 14, 19, 16, 21, 19, ... (OEIS A005044) given by the coefficients of the ...
An Eisenstein series with half-period ratio tau and index r is defined by G_r(tau)=sum^'_(m=-infty)^inftysum^'_(n=-infty)^infty1/((m+ntau)^r), (1) where the sum sum^(') ...
A divisor, also called a factor, of a number n is a number d which divides n (written d|n). For integers, only positive divisors are usually considered, though obviously the ...
The Kaprekar routine is an algorithm discovered in 1949 by D. R. Kaprekar for 4-digit numbers, but which can be generalized to k-digit numbers. To apply the Kaprekar routine ...
...
View search results from all Wolfram sites (415873 matches)

