Suppose that k(0) >= 3.5 x 10(6) and H = {h(1),...,h(k0)} is admissible. Then, for any m >= 1, the set {m(h(j) - h(i)) : h(i) < h(j)} contains at least one Polignac number.