Twenty different positive integers are written in a 4×5 table. Any two neighbours (numbers in cells with a common side) have a common divisor greater than 1. If N is the biggest number in the table, find the least possible value of N.
This problem is from Math Kangaroo in USA.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
No explanations have been posted yet. Check back later!