The squares of an chessboard are filled with positive integers in such a way that each integer is the average of the integers on the neighbouring squares (sharing common edge and vertex). Let be the number of all such distinct configurations. What is the value of ?
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.
Take the MINIMUM number among all such positive integer entries. Since its the average of its neighbours which are greater than or equal to it ⟹ the neighbouring numbers has to be the same as this MINIMUM number. So eventually all numbers will become same. Therefore k=n since the numbers are positive integers. ∴ lim n → + ∞ n k = 1