0

Starting at $1$ and with inclusivity of only $3$, we can answer our question. Using all positive real numbers, numbers coming out of the algorithm will show truly as Prime numbers
$$\sum (P_{n_0} + 3), (P_{n_1} + 3)$$
If the integer is not $MOD5$, and not $MOD2$ excluding the integers, $2$ and $5...