Theorem: For every positive integer $n$, there is a sequence of $n$ consecutive positive integers containing no primes. (Another MSE post about this Theorem)
Proof: Since we desire "a sequence of $\color{#1560BD}{n}$ consecutive
positive integers containing no primes,"
thus denominate these $\color{#1560BD}{n}$ numbers as: $x + \color{#1560BD}{0}, x + \color{#1560BD}{1}, ..., x+(\color{#1560BD}{n - 2}), x+(\color{#1560BD}{n - 1})$.
Thus the objective is to prove: None of these are prime. $\equiv$ All of these are composite.
Define $x := (n + 1)! \color{ #FF4F00}{+ 2}.$ Then for all $\color{green}{0 \leq i \leq n - 1}$:
$$\begin{align}x \quad \color{green}{+ i} & = 1\cdot2\cdot3\cdot...\cdot(i + 1)(i+2)(i+3)...n(n+1)\color{ #FF4F00}{+ 2} \quad \color{green}{+ i} \\
& = (\color{green}{i} \color{ #FF4F00}{+ 2})\left[1\cdot2\cdot3\cdot...\cdot(i + 1)\quad(i+3)...n(n+1) \qquad + 1\right] \qquad \qquad\blacksquare \end{align} $$
How would you divine/previse to define $x := (n + 1)! \color{ #FF4F00}{+ 2}$ ?
Supplementary dated Jan 25 2014: $1.$ Yury's answer uncloaks the easier choice of $x := (n + 1)!$. Thus, why did Velleman add/be concerned with $\color{ #FF4F00}{+ 2}$ in his $x$ ?
$2$. Which variable in my question is $i > 1$ in Yury's answer? It differs from my $\color{green}{0 \le i \le n - 1}$?
$3$. Would someone please elucidate Yury's answer starting from "The problem now is ..."?