Monthly Archives: June 2013

Competitions

There are several items of news worth mentioning. Firstly, I have been informed that the current status of the ‘bounded gaps between primes’ effort has now reached H = 6966, which is impressively low for these sieve methods. According to … Continue reading

Posted in Uncategorized | 4 Comments

Partition numbers

The partition numbers (sequence A000041) count the number of distinct ways to partition n identical objects. For example, p(5) = 7, as there are seven distinct ways to partition 5 objects: This visualisation, where partitions are graphs whose connected components are … Continue reading

Posted in Uncategorized | 4 Comments

Cipher 33: Puzzling II

I’ve based this particular cipher on a sliding block puzzle, the initial and final positions of which are displayed below: Here is the ciphertext: 145, 8, 21, 85, 24, 80, 130, 97, 136, 79, 91, 61, 199, 93, 19, 30, … Continue reading

Posted in Ciphers | Leave a comment

Assorted news

Firstly, the bounded gaps between primes project has made a considerable amount of progress since the value of H = 285278. The latest result has the following parameters: Tables of admissible k-tuples had already been precomputed, so Terence Tao was … Continue reading

Posted in Uncategorized | Leave a comment

Iterated Aut revisited

In an earlier post, I briefly mentioned the idea of repeatedly iterating the Aut operator (a function which takes an abstract group as its input and outputs the automorphism group) and observing the behaviour. There have been papers on the transfinite version … Continue reading

Posted in Uncategorized | 8 Comments

Cipher 32: Untitled

This was not the cipher I originally intended to make, but rather a compromise due to time constraints. Also, my complete lack of imagination is manifested in the fact that this cipher lacks a title. The only elegant property is that the … Continue reading

Posted in Ciphers | Leave a comment

How to score 1729 in the IA Tripos

Part IA of the Mathematical Tripos is marked in a rather interesting way. A naïve computation of the maximum score is 1120, although it is (in principle) possible to achieve absolutely any score (it need not even be a real … Continue reading

Posted in Uncategorized | 5 Comments