Riemann Greedy Rearrangement

The alternating harmonic series converges conditionally to ln(2). Riemann's Rearrangement Theorem states that by rearranging its terms, we can make the series converge to any finite real number, or diverge. The greedy algorithm provides a concrete way to construct such a rearrangement by taking from the positive and negative subseries.

Experiment

You can interactively explore the greedy rearrangement process.

1. Open the Riemann Greedy Rearrangement module.
2. Select a Target value (e.g., 1 or 0) and the number of Terms to process.
3. Observe how the algorithm picks from the positive or negative queues based on whether the current sum is less than or equal to the target.
4. Compare the rearranged partial sum to the original alternating partial sum for the same number of terms.