Determine the smallest natural number
![n](/media/m/a/e/5/ae594d7d1e46f4b979494cf8a815232b.png)
having the following property: For every integer
![p, p \geq n](/media/m/7/b/9/7b9d7d2b791d7219b2972e204a7d03d7.png)
, it is possible to subdivide (partition) a given square into
![p](/media/m/1/c/8/1c85c88d10b11745150467bf9935f7de.png)
squares (not necessarily equal).
%V0
Determine the smallest natural number $n$ having the following property: For every integer $p, p \geq n$, it is possible to subdivide (partition) a given square into $p$ squares (not necessarily equal).