Laws of mathematics not as immutable as we thought, in Australia

Australian PM Malcolm Turnbull said, as part of a speech proposing a law to force tech companies to give the government access to encrypted messages,

“The laws of mathematics are very commendable, but the only law that applies in Australia is the law of Australia.”

The problem is that the end-to-end encryption schemes used by messaging apps make it practically impossible for the makers of the app to read messages, even if they really want to.

New Scientist writer Jacob Aron has seen the positive side of Turnbull’s comments:

Square wheels in an Italian maths exam

There have been various stories in the Italian press and discussion on a Physics teaching mailing list I’m accidentally on about a question in the maths exam for science high schools in Italy last week.

The paper appears to be online.

(Ed. – Here’s a copy of the first part of this four-part question, reproduced for the purposes of criticism and comment)

The question asks students to confirm that a given formula is the shape of the surface needed for a comfortable ride on a bike with square wheels. (Asking what the formula was with no hints would clearly have been harder.) It then asks what shape of polygon would work on another given surface.

What do people think? Would this be a surprising question at A-level in the UK or in the final year of high school in the US or elsewhere? Of course, I don’t know how similar this question might be to anything in the syllabus in licei scientifici.

The following links give a flavour of the reaction to the question:

6 hours, 1 question out of 2 in section 1, 5 out of 10 in section 2. My own initial reaction is that if I had to do this exam right now I’d do question 2 in section 1 but I’ve not actually attempted question 1 yet.

The curious mathmo talks to David Roberts

Way back at the end of last year I put out a call to mathematicians I know: hop on Skype and chat to me for a while about the work you’re doing at the moment. The first person to answer was David Roberts, a pure mathematician from Adelaide. 

We had a fascinating talk about one thread of David’s current work, which involves all sorts of objects I know no more about than their names. I had intended to release this as a podcast, but the quality of my recording was very poor and it turns out I’m terrible at audio editing, so instead here’s a transcription. Assume all mistakes are mine, not David’s.

If you’ve ever wanted to know what it’s like to work in the far reaches of really abstract maths, this is an excellent glimpse of it.

DR: I’m David Roberts, I’m a pure mathematician, currently between jobs. I work – as far as research goes – generally on geometry and category theory, and the interplay between those two. And also a little bit of logic stuff, which I thought I’d talk about.

Patterns and code to make your own cellular automaton scarves now online

If you remember our post about Fabienne Serrière’s amazing Cellular Automaton Scarves Kickstarter back in 2015, you’ll be pleased to hear Fabienne has now put the patterns, and all the code you need to make your own scarves, online on her Ravelry page.

If you have a knitting machine and are prepared to hack it to take code input (you can read Fabienne’s blog to find out how she’s done that), you can use JPG files to generate knitting patterns of your own, or use Fabienne’s code to create cellular automata from a seed row of pixels of your choice. She’s included the code for Rule 110, but I’m sure you could work out your own automata and knit those too. The patterns can also be knitted by hand, if you’re incredibly patient.

via KnitYak on Twitter.

Shaw Prize 2017 awarded to two algebraic geometers

The announcement of the Shaw Prize was posted on 23rd May, reading:

The Shaw Prize in Mathematical Sciences 2017 is awarded in equal shares to János Kollár and Claire Voisin for their remarkable results in many central areas of algebraic geometry, which have transformed the field and led to the solution of long-standing
problems that had appeared out of reach.

The prize is awarded annually to “individuals who are currently active in their respective fields and who have recently achieved distinguished and significant advances, who have made outstanding contributions in academic and scientific research or applications, or who in other domains have achieved excellence”.

The two joint winners this year, Kollár and Voisin, are both professors of algebraic geometry, at Princeton and Collège de France respectively, and have made major contributions to the effort to characterise rational varieties – solution sets of polynomials which differ from a projective space only by a low-dimensional subset.

Kollár’s work relates to the Minimal Model Program, which concerns moduli of higher-dimensional varieties – spaces whose points represent equivalence classes of varieties. These spaces, which Kollár has extensively worked on and developed the field dramatically, have applications in topology, combinatorics and physics. Voisin’s achievements have included solving the Kodaira problem (on complex projective manifolds), developing a technique for showing that a variety is not rational, and even finding a counterexample to an extension of the Hodge conjecture (one of the Clay prize problems), which rules out several approaches to the main conjecture.

More information

Shaw Prize announcement, laureate biographies and press release

János Kollár’s homepage

Claire Voisin’s homepage

13532385396179 doesn’t climb to a prime

Someone called James Davis has found a counterexample to John H. Conway’s “Climb to a Prime” conjecture, for which Conway was offering \$1,000 for a solution.

The conjecture goes like this, as stated in Conway’s list of \$1,000 problems:

Let $n$ be a positive integer. Write the prime factorization in the usual way, e.g. $60 = 2^2 \cdot 3 \cdot 5$, in which the primes are written in increasing order, and exponents of $1$ are omitted. Then bring exponents down to the line and omit all multiplication signs, obtaining a number $f(n)$. Now repeat.

So, for example, $f(60) = f(2^2 \cdot 3 \cdot 5) = 2235$. Next, because $2235 = 3 \cdot 5 \cdot 149$, it maps, under $f$, to $35149$, and since $35149$ is prime, we stop there forever.

The conjecture, in which I seem to be the only believer, is that every number eventually climbs to a prime. The number 20 has not been verified to do so. Observe that $20 \to 225 \to 3252 \to 223271 \to \ldots$, eventually getting to more than one hundred digits without reaching a prime!

Well, James, who says he is “not a mathematician by any stretch”, had a hunch that a counterexample would be of the form $n = x \cdot p = f(x) \cdot 10^y+p$, where $p$ is the largest prime factor of $n$, which in turn motivates looking for $x$ of the form $x=m \cdot 10^y + 1$, and $m=1407$, $y=5$, $p=96179$ “fell out immediately”. It’s not at all obvious to me where that hunch came from, or why it worked.

The number James found was $13\,532\,385\,396\,179 = 13 \cdot 53^2 \cdot 3853 \cdot 96179$, which maps onto itself under Conway’s function $f$ – it’s a fixed point of the function. So, $f$ will never map this composite number onto a prime, disproving the conjecture. Finding such a simple counterexample against such stratospherically poor odds is like deciding to look for Lord Lucan and bumping into him on your doorstep as you leave the house.

A lovely bit of speculative maths spelunking!

via Hans Havermann, whom James originally contacted with his discovery.