We have spent some time now figuring the mathematical properties of the game of arithmetical pursuit in which the goal is to arithmetically manipulate six randomly chosen integers to land as close as possible to a randomly chosen target, using only addition, subtraction, multiplication and division and admitting no fractions.

We have thus far shown that any target can be hit with the right deal of the cards and that there are something along the lines of210,000,000,000,000 admissible formulae that might arise during the game.

The next question that my fellow students and I should like answered is just how frequently any given number might be the result of those formulae.

We have thus far shown that any target can be hit with the right deal of the cards and that there are something along the lines of

The next question that my fellow students and I should like answered is just how frequently any given number might be the result of those formulae.

Full text...