If the original claim is true, it means that the maximum numerical separation between primes is 600, meaning primes may sometimes be separated by a smaller gap, but no two primes will be separated by a larger gap, a numerical distance greater than 600. What this means is, if there are no gaps between primes a and b greater than 600 (i.e. |a-b| > 600), if all prime pairs have a smaller gap, then given the size of the set under consideration, it follows that there are an infinite number of pairings {a,b} in which their separation is 600 or less (|a-b| <= 600).

Also, in mathematics, finding an example of a property isn't very difficult. The difficulty lies in proving a theorem that makes a universal statement about that property -- that's the real challenge.

If that answer wasn't clear, don't hesitate to ask a clearer question.