From J. Wolfowitz (father of Paul Wolfowitz), in Coding Theorems of Information Theory:

The use of combinatorial arguments is frequent in probability theory. We shall reverse this usual procedure and use formally probabilistic arguments to obtain combinatorial results. However, the probabilistic arguments to be employed are very simple and of no depth, and could easily be replaced by suitable combinatorial arguments. Their chief role is therefore one of convenience, to enable us to proceed with speed and dispatch.

And now to vanquish this paper I’m writing with “speed and dispatch.”