The next issue of the Carnival of Mathematics, rounding up blog posts from the month of February, and compiled by John Golden, is now online at Math Hombre. The Carnival rounds up maths blog posts from all over the internet, including some from our own Aperiodical. See our Carnival of Mathematics page for more information.
Enormous Sierpiński tetrahedron made of balloons, take 2

Caroline Ainslie has written in to tell us that she and her associates at Pyraloons are having another go at making the world’s largest Sierpiński tetrahedron… from balloons.
Beautiful Science at the British Library

The British Library has an exhibition on at the moment that you might like to see. Beautiful Science: Picturing Data, Inspiring Insight is all about data visualisation. Here’s the blurb: Turning numbers into pictures that tell important stories and reveal the meaning held within is an essential part of what it means to be a…
Elsevier maths journals up to 2009 are available for free, and in a convenient format
A year and a bit ago, we posted about Elsevier’s possibly-generous, possibly-cynical move to make all papers in its maths journals free to access four years after their publication. I lamented at the time that the only way to access the free papers was through Elsevier’s sanity-sapping ScienceDirect portal. Well, not any more! The Mathematics…
John Conway on Numberphile!
Numberphile, the supremum over all YouTube channels, has scored a bit of a coup – Brady has sat down and recorded an interview with the famously Internet-reclusive John Conway. In this first video (there’s a bonus one linked at the end of this one, and I hope there’ll be more) John talks about his love/hate…
Puzzlebomb – March 2014
Puzzlebomb is a monthly puzzle compendium. Issue 27 of Puzzlebomb, for March 2014, can be found here: Puzzlebomb – Issue 27 – March 2014 The solutions to Issue 27 can be found here: Puzzlebomb – Issue 27 – March 2014 – Solutions Previous issues of Puzzlebomb, and their solutions, can be found here.
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…