3X3 grid – gcd from 1 to 12

 
 
To place distinct integers in a n × n grid such that all gcds from 1 to 2*n(n-1) are generated.
 

If   n = 3,   then find 9 integers such that all gcds from   1 to   2*3(3-1) = 12 are generated

 
grid-gcd-1

 
Determine the 9 integers so that the sum N is minimal
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Advertisements

About benvitalis

math grad - Interest: Number theory
This entry was posted in Number Puzzles and tagged , . Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s