[FOM] Talk on Formal Verification
urquhart at cs.toronto.edu
Wed Feb 3 17:01:26 EST 2016
> Here’s a different example, due to Tim Gowers: does there exist a series
> of 100 consecutive composite numbers? (Of course there does, by the
> prime number theorem. But what about a constructive proof?) I don’t
> think that a computer has a hope with this type of problem.
If n is any number, then n!+2, n!+3, ..., n!+n is a series of n-1
consecutive composite numbers.
More information about the FOM