Skip to main content
nonuser's user avatar
nonuser's user avatar
nonuser's user avatar
nonuser
  • Member for 7 years, 5 months
  • Last seen more than a week ago
  • nowhere
awarded
Loading…
comment
How to recognise that the polynomial method might work
Hi, can you help me here with polynomial method (I'm not sure if it actually works). math.stackexchange.com/questions/4164782/…
Loading…
awarded
comment
Loading…
Loading…
Loading…
Loading…
revised
Domination problem with sets
deleted 36 characters in body
Loading…
revised
Domination problem with sets
added 139 characters in body
Loading…
awarded
awarded
revised
Domination problem with sets
added 27 characters in body
Loading…
revised
Loading…
awarded
comment
The drawn diagonals divide the $N\times N$ board into $K$ regions. For each $N$, determine the smallest and the largest possible values of $K$
Each of the $4N$ exterior edges is a side of exactly one face and every other of at most two. So the sum of the sizes of faces is equal to at most $2N^2+4N$. Now, each face has to be at least quadrilateral except corner faces which can be triangles but there are at most $4$ of them taking at most $12$ from $2N^2+4N$. So altogether there can be at most: $$\frac{2N^2+4N-12}{4}$$ non-triangular faces and therefore at most: $$\frac{2N^2+4N-12}{4}+4=\frac{(N+1)^2+1}{2}$$ faces in total. Equality is achieved if for each diagonal we alternate directions. @GerryMyerson