What is the largest number of distinct positive integers you can have such that most of their pairwise differences are prime?
For example, among (2, 4, 6, 11, 13, 15) there are 15 pairwise differences, of which 10 are prime.
Determine all possible integer pairs (p,q) such that p+q²+s³=pqs, where s=gcd(p,q) and gcd denotes the
greatest common divisor.