Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
∧≜ ;I≜ Label an unknown integer I (tries 0, then 1, then -1, then 2, etc.)
ṅ Negate
-;?+SubtractAddItofrom the input
ṗ The result must be prime
We label a free integer which will attempt values in the order 0, 1, -1, 2, -2, 3, etc. We then negate this number so that -1 is tried before 1, -2 before 2 etc., to respect the tiebreaker that the smaller of the 2 primes must be outputted.
∧≜ Label an unknown integer (tries 0, then 1, then -1, then 2, etc.)
ṅ Negate
;?+Addto the input
ṗ The result must be prime
We label a free integer which will attempt values in the order 0, 1, -1, 2, -2, 3, etc. We then negate this number so that -1 is tried before 1, -2 before 2 etc., to respect the tiebreaker that the smaller of the 2 primes must be outputted.
∧≜ Label an unknown integer (tries 0, then 1, then -1, then 2, etc.)
ṅ Negate
;?+ Add to the input
ṗ The result must be prime
We label a free integer which will attempt values in the order 0, 1, -1, 2, -2, 3, etc. We then negate this number so that -1 is tried before 1, -2 before 2 etc., to respect the tiebreaker that the smaller of the 2 primes must be outputted.
