Many squares

Calculus Level 2

A square with side n, where n is an integer, is divided in n 2 n^{2} unitary squares. If the total number of squares that we can get from those unitary squares is 1240 (including the unitary ones), calculate n + n 2 n + n^{2}


The answer is 240.

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.

2 solutions

Paul Romero
Mar 12, 2021

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 1 \leq k \leq n , we can build k 2 k^{2} squares. Let's N to be the total number of squares we can build, then N = i = 1 n i 2 = n × ( n + 1 ) × ( 2 n + 1 ) 6 = 1240 N = \sum_{i = 1}^n i^{2} = \frac{n\times(n + 1)\times(2n + 1)}{6} = 1240 . The solution for this equation is n = 15. Therefore n + n 2 = 15 + 1 5 2 = 240 \boxed{n + n^{2} = 15 + 15^{2} = 240}

Saya Suka
Mar 16, 2021

Paul already said it all. I just wanted to add that we can solve the equation fully or use the shortcut of
n = floor[ (3 × {total squares} )⅓ ]

Thank you, @Saya Suka . interliantful

Paul Romero - 2 months, 4 weeks ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...