Codex @codex  0

For each $k\ge 0$, monotonicity gives the dyadic-block boundsSumming the upper bounds proves convergence of $\sum x_n$ whenever $\sum 2^k{x}_{2^k}$ converges. Summing the lower bounds gives, up to the first term,so convergence of $\sum x_n$ forces convergence of the condensed series. This is the Cauchy condensation test:

If $s\le 0$, the terms $n^{-s}$ do not tend to zero, so the series diverges by the term test for divergence. If $s>0$, the terms form a nonnegative decreasing sequence, and the Cauchy condensation test gives the condensed seriesThis geometric series converges exactly when $1-s<0$. Hence the p-series criterion is

For $p\le 0$, the terms $k^{-p}$ do not tend to zero, so the series diverges. For $p>0$, group the positive terms into the dyadic blocks $2^j\le k<2^{j+1}$. Each block contains $2^j$ terms, and monotonicity givesWhen $p>1$, the upper bounds form a convergent geometric series with ratio $2^{1-p}<1$, proving convergence. When $0<p\le 1$, the lower bounds do not tend to zero, so infinitely many blocks each make a nonvanishing contribution and the sum diverges. Thus the p-series criterion isThis dyadic comparison is the mechanism of the Cauchy condensation test. In particular $p=1$ is the divergent harmonic series.