Harmonic number

The harmonic number $H_n$ with $n=\lfloor x\rfloor$ (red line) with its asymptotic limit $\gamma +\ln (x)$ (blue line) where $\gamma$ is the Euler–Mascheroni constant.

In mathematics, the Template:Mvar-th harmonic number is the sum of the reciprocals of the first Template:Mvar natural numbers: $$H_n=1+\frac{1}{2}+\frac{1}{3}+\cdots +\frac{1}{n}=\sum _{k=1}^n\frac{1}{k}.$$

Starting from Template:Math, the sequence of harmonic numbers begins: $$1,\frac{3}{2},\frac{11}{6},\frac{25}{12},\frac{137}{60},\dots$$

Harmonic numbers are related to the harmonic mean in that the Template:Mvar-th harmonic number is also Template:Mvar times the reciprocal of the harmonic mean of the first Template:Mvar positive integers.

Harmonic numbers have been studied since antiquity and are important in various branches of number theory. They are sometimes loosely termed harmonic series, are closely related to the Riemann zeta function, and appear in the expressions of various special functions.

The harmonic numbers roughly approximate the natural logarithm functionTemplate:Rp and thus the associated harmonic series grows without limit, albeit slowly. In 1737, Leonhard Euler used the divergence of the harmonic series to provide a new proof of the infinity of prime numbers. His work was extended into the complex plane by Bernhard Riemann in 1859, leading directly to the celebrated Riemann hypothesis about the distribution of prime numbers.

When the value of a large quantity of items has a Zipf's law distribution, the total value of the Template:Mvar most-valuable items is proportional to the Template:Mvar-th harmonic number. This leads to a variety of surprising conclusions regarding the long tail and the theory of network value.

Counting the number of factors Template:Math in the numerator and denominator of the harmonic numbers written as a fraction shows that, except for the case Template:Math, the harmonic numbers have even denominators and thus are never integers. The Bertrand-Chebyshev theorem can also be used to show that the denominator of the Template:Mvarth harmonic number is divisible by the largest prime not larger than Template:Math.

List

The first 40 harmonic numbers, H_n

n
	Hn a fraction	decimal Hn	relative size
1	1	Template:Figure spaceTemplate:Bartable
2	3 / 2	Template:Figure spaceTemplate:Bartable
3	11 / 6	~Template:Bartable
4	25 / 12	~Template:Bartable
5	137 / 60	~Template:Bartable
6	49 / 20	Template:Figure spaceTemplate:Bartable
7	363 / 140	~Template:Bartable
8	761 / 280	~Template:Bartable
9	7 129 / 2 520	~Template:Bartable
10	7 381 / 2 520	~Template:Bartable
11	83 711 / 27 720	~Template:Bartable
12	86 021 / 27 720	~Template:Bartable
13	1 145 993 / 360 360	~Template:Bartable
14	1 171 733 / 360 360	~Template:Bartable
15	1 195 757 / 360 360	~Template:Bartable
16	2 436 559 / 720 720	~Template:Bartable
17	42 142 223 / 12 252 240	~Template:Bartable
18	14 274 301 / 4 084 080	~Template:Bartable
19	275 295 799 / 77 597 520	~Template:Bartable
20	55 835 135 / 15 519 504	~Template:Bartable
21	18 858 053 / 5 173 168	~Template:Bartable
22	19 093 197 / 5 173 168	~Template:Bartable
23	444 316 699 / 118 982 864	~Template:Bartable
24	1 347 822 955 / 356 948 592	~Template:Bartable
25	34 052 522 467 / 8 923 714 800	~Template:Bartable
26	34 395 742 267 / 8 923 714 800	~Template:Bartable
27	312 536 252 003 / 80 313 433 200	~Template:Bartable
28	315 404 588 903 / 80 313 433 200	~Template:Bartable
29	9 227 046 511 387 / 2 329 089 562 800	~Template:Bartable
30	9 304 682 830 147 / 2 329 089 562 800	~Template:Bartable
31	290 774 257 297 357 / 72 201 776 446 800	~Template:Bartable
32	586 061 125 622 639 / 144 403 552 893 600	~Template:Bartable
33	53 676 090 078 349 / 13 127 595 717 600	~Template:Bartable
34	54 062 195 834 749 / 13 127 595 717 600	~Template:Bartable
35	54 437 269 998 109 / 13 127 595 717 600	~Template:Bartable
36	54 801 925 434 709 / 13 127 595 717 600	~Template:Bartable
37	2 040 798 836 801 833 / 485 721 041 551 200	~Template:Bartable
38	2 053 580 969 474 233 / 485 721 041 551 200	~Template:Bartable
39	2 066 035 355 155 033 / 485 721 041 551 200	~Template:Bartable
40	2 078 178 381 193 813 / 485 721 041 551 200	~Template:Bartable

Identities involving harmonic numbers

By definition, the harmonic numbers satisfy the recurrence relation $$H_{n+1}=H_n+\frac{1}{n+1}.$$

The harmonic numbers are connected to the Stirling numbers of the first kind by the relation $$H_n=\frac{1}{n!}\left[\genfrac{}{}{0ex}{}{n+1}{2}\right].$$

The harmonic numbers satisfy the series identities $$\sum _{k=1}^n{H}_k=(n+1)H_n-n$$ and $$\sum _{k=1}^n{H}_k^2=(n+1)H_n^2-(2n+1)H_n+2n.$$ These two results are closely analogous to the corresponding integral results $${\int }_0^x\log ydy=x\log x-x$$ and $${\int }_0^x(\log y{)}^{2}dy=x(\log x{)}^2-2x\log x+2x.$$

Identities involving Template:Pi

There are several infinite summations involving harmonic numbers and powers of [[Pi|Template:Pi]]:Template:Better source $$\begin{array}{cc}\sum _{n=1}^{\mathrm{\infty }}\frac{H_n}{n\cdot 2^n}& =\frac{{\pi }^2}{12}\\ \sum _{n=1}^{\mathrm{\infty }}\frac{H_n^2}{n^2}& =\frac{17}{360}{\pi }^4\\ \sum _{n=1}^{\mathrm{\infty }}\frac{H_n^2}{(n+1{)}^2}& =\frac{11}{360}{\pi }^4\\ \sum _{n=1}^{\mathrm{\infty }}\frac{H_n}{n^3}& =\frac{{\pi }^4}{72}\end{array}$$

Calculation

An integral representation given by Euler is $$H_n={\int }_0^1\frac{1-x^n}{1-x}dx.$$

The equality above is straightforward by the simple algebraic identity $$\frac{1-x^n}{1-x}=1+x+\cdots +x^{n-1}.$$

Using the substitution Template:Math, another expression for Template:Math is $$\begin{array}{cc}{H}_n& ={\int }_0^1\frac{1-x^n}{1-x}dx={\int }_0^1\frac{1-(1-u{)}^n}{u}du\\ & ={\int }_0^1[\sum _{k=1}^n(\genfrac{}{}{0ex}{}{n}{k})(-u{)}^{k-1}]du=\sum _{k=1}^n(\genfrac{}{}{0ex}{}{n}{k}){\int }_0^1(-u{)}^{k-1}du\\ & =\sum _{k=1}^n(\genfrac{}{}{0ex}{}{n}{k})\frac{(-1{)}^{k-1}}{k}.\end{array}$$

Graph demonstrating a connection between harmonic numbers and the natural logarithm. The harmonic number Template:Math can be interpreted as a Riemann sum of the integral: ${\int }_1^{n+1}\frac{dx}{x}=\ln (n+1).$

The Template:Mvarth harmonic number is about as large as the natural logarithm of Template:Mvar. The reason is that the sum is approximated by the integral $${\int }_1^n\frac{1}{x}dx,$$ whose value is Template:Math.

The values of the sequence Template:Math decrease monotonically towards the limit $$\underset{n\to \mathrm{\infty }}{lim}(H_n-\ln n)=\gamma ,$$ where Template:Math is the Euler–Mascheroni constant. The corresponding asymptotic expansion is $$\begin{array}{cc}{H}_n& \sim \ln n+\gamma +\frac{1}{2n}-\sum _{k=1}^{\mathrm{\infty }}\frac{B_{2k}}{2k{n}^{2k}}\\ & =\ln n+\gamma +\frac{1}{2n}-\frac{1}{12n^2}+\frac{1}{120n^4}-\cdots ,\end{array}$$ where Template:Math are the Bernoulli numbers.

Generating functions

A generating function for the harmonic numbers is $$\sum _{n=1}^{\mathrm{\infty }}{z}^n{H}_n=\frac{-\ln (1-z)}{1-z},$$ where ln(z) is the natural logarithm. An exponential generating function is $$\sum _{n=1}^{\mathrm{\infty }}\frac{z^n}{n!}{H}_n=e^z\sum _{k=1}^{\mathrm{\infty }}\frac{(-1{)}^{k-1}}{k}\frac{z^k}{k!}=e^z\mathrm{Ein}(z)$$ where Ein(z) is the entire exponential integral. The exponential integral may also be expressed as $$\mathrm{Ein}(z)={\mathrm{E}}_1(z)+\gamma +\ln z=\mathrm{\Gamma }(0,z)+\gamma +\ln z$$ where Γ(0, z) is the incomplete gamma function.

Arithmetic properties

The harmonic numbers have several interesting arithmetic properties. It is well-known that $H_n$ is an integer if and only if $n=1$, a result often attributed to Theisinger. Indeed, using 2-adic valuation, it is not difficult to prove that for $n\ge 2$ the numerator of $H_n$ is an odd number while the denominator of $H_n$ is an even number. More precisely, $$H_n=\frac{1}{2^{\lfloor {\log }_2(n)\rfloor }}\frac{a_n}{b_n}$$ with some odd integers $a_n$ and $b_n$.

As a consequence of Wolstenholme's theorem, for any prime number $p\ge 5$ the numerator of $H_{p-1}$ is divisible by $p^2$. Furthermore, Eisenstein proved that for all odd prime number $p$ it holds $$H_{(p-1)/2}\equiv -2q_p(2)(\mathrm{mod}p)$$ where $q_p(2)=(2^{p-1}-1)/p$ is a Fermat quotient, with the consequence that $p$ divides the numerator of $H_{(p-1)/2}$ if and only if $p$ is a Wieferich prime.

In 1991, Eswarathasan and Levine defined $J_p$ as the set of all positive integers $n$ such that the numerator of $H_n$ is divisible by a prime number $p.$ They proved that $$\{p-1,p^2-p,p^2-1\}\subseteq J_p$$ for all prime numbers $p\ge 5,$ and they defined harmonic primes to be the primes $p$ such that $J_p$ has exactly 3 elements.

Eswarathasan and Levine also conjectured that $J_p$ is a finite set for all primes $p,$ and that there are infinitely many harmonic primes. Boyd verified that $J_p$ is finite for all prime numbers up to $p=547$ except 83, 127, and 397; and he gave a heuristic suggesting that the density of the harmonic primes in the set of all primes should be $1/e$. Sanna showed that $J_p$ has zero asymptotic density, while Bing-Ling Wu and Yong-Gao Chen proved that the number of elements of $J_p$ not exceeding $x$ is at most $3x^{\frac{2}{3}+\frac{1}{25\log p}}$, for all $x\ge 1$.

Applications

The harmonic numbers appear in several calculation formulas, such as the digamma function $$\psi (n)=H_{n-1}-\gamma .$$ This relation is also frequently used to define the extension of the harmonic numbers to non-integer n. The harmonic numbers are also frequently used to define Template:Mvar using the limit introduced earlier: $$\gamma =\underset{n\to \mathrm{\infty }}{lim}(H_n-\ln (n)),$$ although $$\gamma =\underset{n\to \mathrm{\infty }}{lim}(H_n-\ln (n+\frac{1}{2}))$$ converges more quickly.

In 2002, Jeffrey Lagarias proved that the Riemann hypothesis is equivalent to the statement that $$\sigma (n)\le H_n+(\log H_n)e^{H_n},$$ is true for every integer Template:Math with strict inequality if Template:Math; here Template:Math denotes the sum of the divisors of Template:Mvar.

The eigenvalues of the nonlocal problem on $L^2([-1,1])$ $$\lambda \phi (x)={\int }_{-1}^1\frac{\phi (x)-\phi (y)}{|x-y|}dy$$ are given by $\lambda =2H_n$, where by convention $H_0=0$, and the corresponding eigenfunctions are given by the Legendre polynomials $\phi (x)=P_n(x)$.

Generalizations

Generalized harmonic numbers

The nth generalized harmonic number of order m is given by $$H_{n,m}=\sum _{k=1}^n\frac{1}{k^m}.$$

(In some sources, this may also be denoted by $H_n^{(m)}$ or $H_m(n).$)

The special case m = 0 gives $H_{n,0}=n.$ The special case m = 1 reduces to the usual harmonic number: $$H_{n,1}=H_n=\sum _{k=1}^n\frac{1}{k}.$$

The limit of $H_{n,m}$ as Template:Math is finite if Template:Math, with the generalized harmonic number bounded by and converging to the Riemann zeta function $$\underset{n\to \mathrm{\infty }}{lim}{H}_{n,m}=\zeta (m).$$

The smallest natural number k such that kⁿ does not divide the denominator of generalized harmonic number H(k, n) nor the denominator of alternating generalized harmonic number H′(k, n) is, for n=1, 2, ... :

77, 20, 94556602, 42, 444, 20, 104, 42, 76, 20, 77, 110, 3504, 20, 903, 42, 1107, 20, 104, 42, 77, 20, 2948, 110, 136, 20, 76, 42, 903, 20, 77, 42, 268, 20, 7004, 110, 1752, 20, 19203, 42, 77, 20, 104, 42, 76, 20, 370, 110, 1107, 20, ... Template:OEIS

The related sum $\sum _{k=1}^n{k}^m$ occurs in the study of Bernoulli numbers; the harmonic numbers also appear in the study of Stirling numbers.

Some integrals of generalized harmonic numbers are $${\int }_0^a{H}_{x,2}dx=a\frac{{\pi }^2}{6}-H_a$$ and $${\int }_0^a{H}_{x,3}dx=aA-\frac{1}{2}{H}_{a,2},$$ where A is Apéry's constant ζ(3), and $$\sum _{k=1}^n{H}_{k,m}=(n+1)H_{n,m}-H_{n,m-1}\text{ for }m\ge 0.$$

Every generalized harmonic number of order m can be written as a function of harmonic numbers of order $m-1$ using $$H_{n,m}=\sum _{k=1}^{n-1}\frac{H_{k,m-1}}{k(k+1)}+\frac{H_{n,m-1}}{n}$$   for example: $H_{4,3}=\frac{H_{1,2}}{1\cdot 2}+\frac{H_{2,2}}{2\cdot 3}+\frac{H_{3,2}}{3\cdot 4}+\frac{H_{4,2}}{4}$

A generating function for the generalized harmonic numbers is $$\sum _{n=1}^{\mathrm{\infty }}{z}^n{H}_{n,m}=\frac{{\mathrm{Li}}_m(z)}{1-z},$$ where ${\mathrm{Li}}_m(z)$ is the polylogarithm, and Template:Math. The generating function given above for Template:Math is a special case of this formula.

A fractional argument for generalized harmonic numbers can be introduced as follows:

For every $p,q>0$ integer, and $m>1$ integer or not, we have from polygamma functions: $$H_{q/p,m}=\zeta (m)-p^m\sum _{k=1}^{\mathrm{\infty }}\frac{1}{(q+pk{)}^m}$$ where $\zeta (m)$ is the Riemann zeta function. The relevant recurrence relation is $$H_{a,m}=H_{a-1,m}+\frac{1}{a^m}.$$ Some special values are$$\begin{array}{cc}{H}_{\frac{1}{4},2}& =16-\frac{5}{6}{\pi }^2-8G\\ H_{\frac{1}{2},2}& =4-\frac{{\pi }^2}{3}\\ H_{\frac{3}{4},2}& =\frac{16}{9}-\frac{5}{6}{\pi }^2+8G\\ H_{\frac{1}{4},3}& =64-{\pi }^3-27\zeta (3)\\ H_{\frac{1}{2},3}& =8-6\zeta (3)\\ H_{\frac{3}{4},3}& ={\left(\frac{4}{3}\right)}^3+{\pi }^3-27\zeta (3)\end{array}$$where G is Catalan's constant. In the special case that $p=1$, we get $$H_{n,m}=\zeta (m,1)-\zeta (m,n+1),$$

where $\zeta (m,n)$ is the Hurwitz zeta function. This relationship is used to calculate harmonic numbers numerically.

Multiplication formulas

The multiplication theorem applies to harmonic numbers. Using polygamma functions, we obtain $$\begin{array}{cc}{H}_{2x}& =\frac{1}{2}(H_x+H_{x-\frac{1}{2}})+\ln 2\\ H_{3x}& =\frac{1}{3}(H_x+H_{x-\frac{1}{3}}+H_{x-\frac{2}{3}})+\ln 3,\end{array}$$ or, more generally, $$H_{nx}=\frac{1}{n}(H_x+H_{x-\frac{1}{n}}+H_{x-\frac{2}{n}}+\cdots +H_{x-\frac{n-1}{n}})+\ln n.$$

For generalized harmonic numbers, we have $$\begin{array}{cc}{H}_{2x,2}& =\frac{1}{2}(\zeta (2)+\frac{1}{2}(H_{x,2}+H_{x-\frac{1}{2},2}))\\ H_{3x,2}& =\frac{1}{9}(6\zeta (2)+H_{x,2}+H_{x-\frac{1}{3},2}+H_{x-\frac{2}{3},2}),\end{array}$$ where $\zeta (n)$ is the Riemann zeta function.

Hyperharmonic numbers

The next generalization was discussed by J. H. Conway and R. K. Guy in their 1995 book The Book of Numbers.Template:Rp Let $$H_n^{(0)}=\frac{1}{n}.$$ Then the nth hyperharmonic number of order r (r>0) is defined recursively as $$H_n^{(r)}=\sum _{k=1}^n{H}_k^{(r-1)}.$$ In particular, $H_n^{(1)}$ is the ordinary harmonic number $H_n$.

Roman harmonic numbers

The Roman harmonic numbers, named after Steven Roman, were introduced by Daniel Loeb and Gian-Carlo Rota in the context of a generalization of umbral calculus with logarithms. There are many possible definitions, but one of them, for $n,k\ge 0$, is$$c_n^{(0)}=1,$$and$$c_n^{(k+1)}=\sum _{i=1}^n\frac{c_i^{(k)}}{i}.$$Of course,$$c_n^{(1)}=H_n.$$

If $n\ne 0$, they satisfy$$c_n^{(k+1)}-\frac{c_n^{(k)}}{n}=c_{n-1}^{(k+1)}.$$Closed form formulas are$$c_n^{(k)}=n!(-1{)}^{k}s(-n,k),$$where $s(-n,k)$ is Stirling numbers of the first kind generalized to negative first argument, and$$c_n^{(k)}=\sum _{j=1}^n(\genfrac{}{}{0ex}{}{n}{j})\frac{(-1{)}^{j-1}}{j^k},$$which was found by Donald Knuth.

In fact, these numbers were defined in a more general manner using Roman numbers and Roman factorials, that include negative values for $n$. This generalization was useful in their study to define Harmonic logarithms.

Harmonic numbers for real and complex values

Template:Unreferenced section The formulae given above, $$H_x={\int }_0^1\frac{1-t^x}{1-t}dt=\sum _{k=1}^{\mathrm{\infty }}(\genfrac{}{}{0ex}{}{x}{k})\frac{(-1{)}^{k-1}}{k}$$ are an integral and a series representation for a function that interpolates the harmonic numbers and, via analytic continuation, extends the definition to the complex plane other than the negative integers x. The interpolating function is in fact closely related to the digamma function $$H_x=\psi (x+1)+\gamma ,$$ where Template:Math is the digamma function, and Template:Math is the Euler–Mascheroni constant. The integration process may be repeated to obtain $$H_{x,2}=\sum _{k=1}^{\mathrm{\infty }}\frac{(-1{)}^{k-1}}{k}(\genfrac{}{}{0ex}{}{x}{k})H_k.$$

The Taylor series for the harmonic numbers is $$H_x=\sum _{k=2}^{\mathrm{\infty }}(-1{)}^k\zeta (k)x^{k-1}\text{ for }|x|<1$$ which comes from the Taylor series for the digamma function ($\zeta$ is the Riemann zeta function).

Alternative, asymptotic formulation

There is an asymptotic formulation that gives the same result as the analytic continuation of the integral just described. When seeking to approximate Template:Math for a complex number Template:Math, it is effective to first compute Template:Math for some large integer Template:Math. Use that as an approximation for the value of Template:Math. Then use the recursion relation Template:Math backwards Template:Math times, to unwind it to an approximation for Template:Math. Furthermore, this approximation is exact in the limit as Template:Math goes to infinity.

Specifically, for a fixed integer Template:Math, it is the case that $$\underset{m\to \mathrm{\infty }}{lim}[H_{m+n}-H_m]=0.$$

If Template:Math is not an integer then it is not possible to say whether this equation is true because we have not yet (in this section) defined harmonic numbers for non-integers. However, we do get a unique extension of the harmonic numbers to the non-integers by insisting that this equation continue to hold when the arbitrary integer Template:Math is replaced by an arbitrary complex number Template:Math,

$$\underset{m\to \mathrm{\infty }}{lim}[H_{m+x}-H_m]=0.$$ Swapping the order of the two sides of this equation and then subtracting them from Template:Math gives $$\begin{array}{cc}{H}_x& =\underset{m\to \mathrm{\infty }}{lim}[H_m-(H_{m+x}-H_x)]\\ & =\underset{m\to \mathrm{\infty }}{lim}[\left(\sum _{k=1}^m\frac{1}{k}\right)-\left(\sum _{k=1}^m\frac{1}{x+k}\right)]\\ & =\underset{m\to \mathrm{\infty }}{lim}\sum _{k=1}^m(\frac{1}{k}-\frac{1}{x+k})=x\sum _{k=1}^{\mathrm{\infty }}\frac{1}{k(x+k)}.\end{array}$$

This infinite series converges for all complex numbers Template:Math except the negative integers, which fail because trying to use the recursion relation Template:Math backwards through the value Template:Math involves a division by zero. By this construction, the function that defines the harmonic number for complex values is the unique function that simultaneously satisfies (1) Template:Math, (2) Template:Math for all complex numbers Template:Math except the non-positive integers, and (3) Template:Math for all complex values Template:Math.

This last formula can be used to show that $${\int }_0^1{H}_{x}dx=\gamma ,$$ where Template:Math is the Euler–Mascheroni constant or, more generally, for every Template:Math we have: $${\int }_0^n{H}_{x}dx=n\gamma +\ln (n!).$$

Special values for fractional arguments

There are the following special analytic values for fractional arguments between 0 and 1, given by the integral $$H_{\alpha }={\int }_0^1\frac{1-x^{\alpha }}{1-x}dx.$$

More values may be generated from the recurrence relation $$H_{\alpha }=H_{\alpha -1}+\frac{1}{\alpha },$$ or from the reflection relation $$H_{-\alpha }-H_{\alpha -1}=\pi \cot (\pi \alpha ).$$

For example: $$\begin{array}{cc}{H}_{\frac{1}{2}}& =2-2\ln 2\\ H_{\frac{1}{3}}& =3-\frac{\pi }{2\sqrt{3}}-\frac{3}{2}\ln 3\\ H_{\frac{2}{3}}& =\frac{3}{2}+\frac{\pi }{2\sqrt{3}}-\frac{3}{2}\ln 3\\ H_{\frac{1}{4}}& =4-\frac{\pi }{2}-3\ln 2\\ H_{\frac{1}{5}}& =5-\frac{\pi }{2}\sqrt{1+\frac{2}{\sqrt{5}}}-\frac{5}{4}\ln 5-\frac{\sqrt{5}}{2}\ln \left(\frac{1+\sqrt{5}}{2}\right)\\ H_{\frac{3}{4}}& =\frac{4}{3}+\frac{\pi }{2}-3\ln 2\\ H_{\frac{1}{6}}& =6-\frac{\sqrt{3}}{2}\pi -2\ln 2-\frac{3}{2}\ln 3\\ H_{\frac{1}{8}}& =8-\frac{1+\sqrt{2}}{2}\pi -4\ln 2-\frac{1}{\sqrt{2}}(\ln (2+\sqrt{2})-\ln (2-\sqrt{2}))\\ H_{\frac{1}{12}}& =12-(1+\frac{\sqrt{3}}{2})\pi -3\ln 2-\frac{3}{2}\ln 3+\sqrt{3}\ln (2-\sqrt{3})\end{array}$$

Which are computed via Gauss's digamma theorem, which essentially states that for positive integers p and q with p < q $$H_{\frac{p}{q}}=\frac{q}{p}+2\sum _{k=1}^{\lfloor \frac{q-1}{2}\rfloor }\cos \left(\frac{2\pi pk}{q}\right)\ln \left(\sin \left(\frac{\pi k}{q}\right)\right)-\frac{\pi }{2}\cot \left(\frac{\pi p}{q}\right)-\ln \left(2q\right)$$

Relation to the Riemann zeta function

Some derivatives of fractional harmonic numbers are given by $$\begin{array}{cc}\frac{d^n{H}_x}{d{x}^n}& =(-1{)}^{n+1}n![\zeta (n+1)-H_{x,n+1}]\\ \frac{d^n{H}_{x,2}}{d{x}^n}& =(-1{)}^{n+1}(n+1)![\zeta (n+2)-H_{x,n+2}]\\ \frac{d^n{H}_{x,3}}{d{x}^n}& =(-1{)}^{n+1}\frac{1}{2}(n+2)![\zeta (n+3)-H_{x,n+3}].\end{array}$$

And using Maclaurin series, we have for x < 1 that $$\begin{array}{cc}{H}_x& =\sum _{n=1}^{\mathrm{\infty }}(-1{)}^{n+1}{x}^n\zeta (n+1)\\ H_{x,2}& =\sum _{n=1}^{\mathrm{\infty }}(-1{)}^{n+1}(n+1)x^n\zeta (n+2)\\ H_{x,3}& =\frac{1}{2}\sum _{n=1}^{\mathrm{\infty }}(-1{)}^{n+1}(n+1)(n+2)x^n\zeta (n+3).\end{array}$$

For fractional arguments between 0 and 1 and for a > 1, $$\begin{array}{cc}{H}_{1/a}& =\frac{1}{a}(\zeta (2)-\frac{1}{a}\zeta (3)+\frac{1}{a^2}\zeta (4)-\frac{1}{a^3}\zeta (5)+\cdots )\\ H_{1/a,2}& =\frac{1}{a}(2\zeta (3)-\frac{3}{a}\zeta (4)+\frac{4}{a^2}\zeta (5)-\frac{5}{a^3}\zeta (6)+\cdots )\\ H_{1/a,3}& =\frac{1}{2a}(2\cdot 3\zeta (4)-\frac{3\cdot 4}{a}\zeta (5)+\frac{4\cdot 5}{a^2}\zeta (6)-\frac{5\cdot 6}{a^3}\zeta (7)+\cdots ).\end{array}$$

See also

• Watterson estimator
• Tajima's D
• Coupon collector's problem
• Jeep problem
• 100 prisoners problem
• Riemann zeta function
• List of sums of reciprocals
• False discovery rate#Benjamini–Yekutieli procedure
• Block-stacking problem

References

• Template:Cite journal
• Template:Cite book
• Ed Sandifer, How Euler Did It — Estimating the Basel problem Template:Webarchive (2003)
• Template:Cite journal
• Template:Cite journal

External links

• Template:MathWorld