The Aperiodical 

You're reading: Columns

Integer sequence review: A005114

By Christian Lawson-Perfect and David Cushing. Posted May 20, 2013

The Online Encyclopedia of Integer Sequences contains over 200,000 sequences. It contains classics, curios, thousands of derivatives entered purely for completeness’s sake, short sequences whose completion would be a huge mathematical achievement, and some entries which are just downright silly.

For a lark, David and I have decided to review some of the Encyclopedia’s sequences. We’re rating sequences on four axes: Novelty, Aesthetics, Explicability and Completeness.

Following last week’s palaver, we’re going to do our best to be serious this time. Game faces on. David promises there will actually be some maths in this sequence.

A005114
Untouchable numbers: impossible values for sum of aliquot parts of $n$.

2, 5, 52, 88, 96, 120, 124, 146, 162, 188, 206, 210, 216, 238, 246, 248, 262, 268, 276, 288, 290, 292, 304, 306, 322, 324, 326, 336, 342, 372, 406, 408, 426, 430, 448, 472, 474, 498, 516, 518, 520, 530, 540, 552, 556, 562, 576, 584, 612, 624, 626, 628, 658, ...

Axes to Axes

By Colin Beveridge. Posted May 19, 2013

In which the intrepid maths-crime-fighting duo of Gale and Beveridge find themselves thrust back to a time before people could do maths properly.

---

It had been a quiet night at the Aperiodical police station. Apart from a few cases of broken scheduling in Excel formulas – nothing a bit of TIME() in the cells wouldn’t put right – there was nothing.

At 11pm, the phone rang. I looked at Sergeant Gale. Sergeant Gale pointedly looked at the phone, raised an eyebrow, and returned to his sudoku.

“Maths Police, bad graphs department. Constable Beveridge speaking, how can I help?”

On equivalent forms of the weak Goldbach conjecture

By Peter Rowlett. Posted May 17, 2013

Harald Helfgott has announced a proof of the odd Goldbach conjecture (also known as the ternary or weak Goldbach conjecture). This is big news. Like a good maths newshound, Christian Perfect promptly wrote this up for The Aperiodical as “All odd integers greater than 7 are the sum of three odd primes!”

Wait, though, there’s a problem. As Relinde Jurrius pointed out on Twitter, the formulation used in the paper abstract was not quite the same.

The ternary Goldbach conjecture, or three-primes problem, asserts that every odd integer $N$ greater than $5$ is the sum of three primes. The present paper proves this conjecture.

The version Christian used makes the assertion using odd primes, whereas the paper abstract only claims “the sum of three primes”. The latter version includes $7$ because $7$ can be written as the sum of three primes, but not odd ones ($7 = 3+2+2$). Certainly, you can see both statements of the weak Goldbach conjecture used (for example, here’s the $\gt 5$ version and here’s the $\gt 7$ version). Are they equivalent?

2² number theory tricks

By Katie Steckles. Posted May 17, 2013

Here are some nice number facts and tricks you can try out on your friends. They will work without understanding how, but with a little investigation you should be able to figure out how each one works.

Dynamo by Felice Varini

By Christian Lawson-Perfect. Posted May 16, 2013

[youtube url=http://www.youtube.com/watch?v=2_P-8rArDnE]

More pictures at streetartnews.net

All odd integers greater than 7 are the sum of three odd primes!

By Christian Lawson-Perfect. Posted May 14, 2013

It seems that big mathematical advances are like buses – you wait ages for one, and then two come along at once. Also revealed yesterday was a proof of the odd Goldbach conjecture: that all odd numbers greater than 7 can be written as the sum of exactly three odd primes. The proof is contained in Major arcs for Goldbach’s theorem, a paper submitted to the arXiv by Harald Helfgott, who’s a mathematician at the École Normale Supérieure in Paris. This new paper completes the work started in Helfgott’s previous paper, Minor arcs for Golbach’s problem, published last year.

The strong Goldbach conjecture states that every even number can be written as the sum of two primes. This is still unproven, and remains one of the long-standing unproven results in number theory. Sadly, it’s the opinion of Terence Tao, among others, that the method used to prove the weak conjecture probably won’t work on the strong conjecture.

The paper: Major arcs for Goldbach’s theorem by Harald Helfgott

via Terry Tao on Google+

Integer sequence review: A051200

By Christian Lawson-Perfect and David Cushing. Posted May 13, 2013

The Online Encyclopedia of Integer Sequences contains over 200,000 sequences. It contains classics, curios, thousands of derivatives entered purely for completeness’s sake, short sequences whose completion would be a huge mathematical achievement, and some entries which are just downright silly.

For a lark, David and I have decided to review some of the Encyclopedia’s sequences. We’ll be rating sequences on four axes: Novelty, Aesthetics, Explicability and Completeness.

A051200
Except for initial term, primes of form “n 3’s followed by 1”.

3, 31, 331, 3331, 33331, 333331, 3333331, 33333331, 333333333333333331, 3333333333333333333333333333333333333331, 33333333333333333333333333333333333333333333333331, ...