Know a great AI tool or AI news source? Submit it to AiByts
IBM Research5 min read

Ponder This Challenge - September 2026 - Loeschian Arithmetic Progressions

In a now-famous 2004 article, Ben Green and Terence Tao proved that arbitrarily long arithmetic progressions exist in the primes. This holds true analogously for other sets of numbers if their density is sufficiently high, for example, numbers that are the sum of two squares.

By Gadi AleksandrowiczIBM Research Blog
Ponder This Challenge - September 2026 - Loeschian Arithmetic Progressions

Read the full story

Originally published by IBM Research Blog on Sep 1, 2026.

Read on IBM Research Blog(opens in a new tab)

Comments

Sign in to join the discussion.

No comments yet — be the first to share your thoughts.