I can’t answer those two questions without the full problem data — please upload or paste the original problem (how many pattern pieces he has, the size/shape of each pattern, any restrictions).
Explanation and how to solve this type of problem (so you can check or give the missing data):
- Common interpretation A (he has m identical pattern units and each unit is a 1×1 tile):
- (i) The smallest perfect-square number of units that can form a square is the smallest $k^2$ with $k\in\mathbb{Z}^+$ such that $k^2\ge m$. So
- $k=\lceil\sqrt{m}\rceil$ and the number of patterns needed is $k^2$.
- (ii) The largest square he can actually form using at most $m$ units has side
- $s=\lfloor\sqrt{m}\rfloor$, so the largest square dimension is $s\times s$ (uses $s^2$ units).
- Example: if $m=12$, (i) smallest square needs $k=\lceil\sqrt{12}\rceil=4$, so $4^2=16$ patterns; (ii) largest square he can make from 12 pieces is $3\times3$ (uses $9$ pieces).
- Common interpretation B (he has pieces of several different sizes or a repeating pattern strip):
- You typically need to compute either the least common multiple (LCM) of tile-lengths or work with areas/lengths so the assembled side lengths match. Give the piece sizes and I’ll compute the exact smallest and largest square.
Tell me which interpretation fits or paste the original numbers/diagram and I’ll solve (i) and (ii) step-by-step.