This question is inspired by Fortune's conjecture .
Can you provide proofs or counterexamples for the following two claims :
First claim
If $q$ is the smallest prime greater than $\displaystyle\prod_{i=1}^n C_i+1$ , where $\displaystyle\prod_{i=1}^n C_i$ is the product of the first $n$ composite numbers , then $q-\displaystyle\prod_{i=1}^n C_i$ is prime .
The first few such differences are :
3,5,5,5,11,7,23,11,29,17,31...
Second claim
If $q$ is the greatest prime less than $\displaystyle\prod_{i=1}^n C_i-1$ , where $\displaystyle\prod_{i=1}^n C_i$ is the product of the first $n$ composite numbers , then $\displaystyle\prod_{i=1}^n C_i-q$ is prime .
The first few such differences are :
2,5,11,5,23,17,13,11,13,23,53...
I have tested both claims up to $n=660$ and there were no counterexamples .