Simon's Favorite Factoring Trick

From AoPSWiki

Simon's Favorite Factoring Trick (abbreviated SFFT) is a special factorization first popularized by AoPS user Simon Rubinstein-Salzedo. This appears to be the thread where Simon's favorite factoring trick was first introduced. The general statement of SFFT is: ${xy}+{xk}+{yj}+{jk}=(x+j)(y+k)$ . Two special common cases are: $xy + x + y + 1 = (x+1)(y+1)$ and $xy - x - y +1 = (x-1)(y-1)$ .

The act of adding ${jk}$ to ${xy}+{xk}+{yj}$ in order to be able to factor it could be called "completing the rectangle" in analogy to the more familiar "completing the square."

Applications

This factorization frequently shows up on contest problems, especially those heavy on algebraic manipulation. Usually $x$ and $y$ are variables and $j,k$ are known constants. Also, it is typically necessary to add the $jk$ term to both sides to perform the factorization.

Problems

Introductory

Two different prime numbers between $4$ and $18$ are chosen. When their sum is subtracted from their product, which of the following numbers could be obtained?