27 Jan
2005
27 Jan
'05
9:23 a.m.
Hello (answer to several postings), Yes, that last one makes sense, probably the simplest argument, thank you. I was not sure if it was trivial, but well I think it is. ========== that is : S+ = {Q_k(p) : p prime, k = 1,2,3,... } contains for each prime p all multiples of p greater than p^2, ========== This was my conclusion too : by using n^2 + k for suitable k's or more trivially k in N would suffice. I was restricting the array to be in N only for simplicity. Simon Plouffe