Excuse my English please.
I am looking for the name in Mathematics (/English) for finding the biggest two numbers that form an array that can contain at minimum x number of items whereby array's both sides are as close as possible (to form a square or square-ish rectangle).
Ex:
For 10, it is 3*4 (not 2*5 as it is not square-ish)
90 is 9*10
91..99 is 10*10
66 is 6*7
or 1324 is 36*37
Given a number, I would like to create an x*y "array", as square looking as possible.
Thanks!
for $k^2 + 1, \ldots, k^2 + k,$ you use $k$ by $k+1$
for $k^2 + k + 1, \ldots, k^2 + 2 k + 1,$ you use $k+1$ by $k+1$
The array dimensions for your integer $x$ are thus $$ \left\lfloor \frac{1}{2} + \sqrt x \right\rfloor $$ by $$ \left\lceil \sqrt x \right\rceil $$
==