Past exam of the mathematics course of the University of Oxford / 2021 / Prelims / Mathematics II / 3 / c / ii

Place the single term in $N_0$ first. For $n=0,1,2,\dots$ in order, append $2^{n+1}$ copies of the pairThis uses all of $P_n$ and all of $N_{n+1}$ exactly once, so it is an explicit rearrangement of a series. Its beginning isEvery completed pair leaves the partial sum at $-1$. Within a level-$n$ pair the partial sum differs from $-1$ by at most $2^{-(n+1)}$. As $n\to \infty$ this tends to zero, proving that the rearranged series has sum $\boxed{-1}$.