You're reading: Posts Tagged: Paul Erdős

Small gaps between large gaps between primes results

The big news last year was the quest to find a lower bound for the gap between pairs of large primes, started by Yitang Zhang and carried on chiefly by Terry Tao and the fresh-faced James Maynard.

Now that progress on the twin prime conjecture has slowed down, they’ve both turned their attentions toward the opposite question: what’s the biggest gap between subsequent small primes?

Erdős’s discrepancy problem now less of a problem

Boris Konev and Alexei Lisitsa of the University of Liverpool have been looking at sequences of $+1$s and $-1$s, and have shown using an SAT-solver-based proof that every sequence of $1161$ or more elements has a subsequence which sums to at least $2$. This extends the existing long-known result that every such sequence of $12$ or more elements has a subsequence which sums to at least $1$, and constitutes a proof of Erdős’s discrepancy problem for $C \leq 2$.

The Chris Tarrant Problem

This is a puzzle I presented at the MathsJam conference. It’s a problem that gave me a headache for a week or so, and I thought others might enjoy it, too. I do know the answer, but I’m not going to give it away — you can tweet me @icecolbeveridge if you want to discuss your theories! (As Colin Wright says: don’t tell people the answer).

You’ve heard of the Monty Hall Problem, right?