A square with side n, where n is an integer, is divided in unitary squares. If the total number of squares that we can get from those unitary squares is 1240 (including the unitary ones), calculate
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.
We can get squares from side equal to 1 to side equal to n. It is possible to learn that for squares with side n + 1 - k, where 1 ≤ k ≤ n , we can build k 2 squares. Let's N to be the total number of squares we can build, then N = ∑ i = 1 n i 2 = 6 n × ( n + 1 ) × ( 2 n + 1 ) = 1 2 4 0 . The solution for this equation is n = 15. Therefore n + n 2 = 1 5 + 1 5 2 = 2 4 0