[seqfan] Re: Prime Sums In A Grid

[franktaw at netscape.net]

Almost certainly.  Start with

1 2
4

And continue to fill in anti-diagonals.  Each alternating anti-diagonal 
will be either all even or all odd.  To fill in each square, you need 
only find a sufficiently large pair of primes with the required (even) 
difference.  This is a slight generalization of the twin prime 
conjecture, which everyone in the field believes is correct.  (Indeed, 
considerably stronger conjectures about prime clusters are generally 
believed to be true.)

Franklin T. Adams-Watters

-----Original Message-----
From: David Wilson <davidwwilson at comcast.net>

So, can you fill an infinite grid with distinct integers so that any 
two
adjacent integers sum to a prime?