Is it always possible to fit these pieces in a square?
Consider all possible pairs of squares that can fit in a row of length $n$ where every square has a width of 1. If I have a large square of width $n$, can all such pairs of squares fit in the large square simultaneously?
It's hard to explain without an example so here is the case when $n=4$:
To the left are all the pairs of squares and to the right is a way for them to fit in the $n$ by $n$ square. Note that the pairs are not allowed to be moved horizontally but can be moved vertically.
It becomes a little harder but still possible when $n=5$:
What I'm interested in is the general case. Is it possible to fit all pairs in the square for any $n$?
recreational-mathematics
|
show 3 more comments
Consider all possible pairs of squares that can fit in a row of length $n$ where every square has a width of 1. If I have a large square of width $n$, can all such pairs of squares fit in the large square simultaneously?
It's hard to explain without an example so here is the case when $n=4$:
To the left are all the pairs of squares and to the right is a way for them to fit in the $n$ by $n$ square. Note that the pairs are not allowed to be moved horizontally but can be moved vertically.
It becomes a little harder but still possible when $n=5$:
What I'm interested in is the general case. Is it possible to fit all pairs in the square for any $n$?
recreational-mathematics
What does "all possible pieces (disconnected or connected) of width 2 and height of 1 that could fit in the square" mean? Can you show us how to generate the pieces for a given square?
– John Douma
Nov 18 '18 at 21:39
@JohnDouma Well a piece here simply consists of choosing two squares in a single row of length n. So the total number of pieces will be (n choose 2).
– Pazzaz
Nov 18 '18 at 21:46
1
I think you have to specify the problem more accurately. A triangle can have width $2$ and height $1$, for example, and that seems to be different from what you mean (and that is without thinking about figures which are not convex). I think you mean figures constructed of two $1times 1$ squares in a particular kind of configuration (as in your comment). And these sub-figures need not be connected. I do think your intended question is interesting, and worth asking, but the way you have asked it is misleading.
– Mark Bennet
Nov 18 '18 at 21:56
@MarkBennet I agree, I did leave out some important parts. I've edited the question some, it should be more clear now.
– Pazzaz
Nov 18 '18 at 22:14
Well, if possible, there will always be $n^2-2binom n2=n$ leftover spaces.
– YiFan
Nov 18 '18 at 23:44
|
show 3 more comments
Consider all possible pairs of squares that can fit in a row of length $n$ where every square has a width of 1. If I have a large square of width $n$, can all such pairs of squares fit in the large square simultaneously?
It's hard to explain without an example so here is the case when $n=4$:
To the left are all the pairs of squares and to the right is a way for them to fit in the $n$ by $n$ square. Note that the pairs are not allowed to be moved horizontally but can be moved vertically.
It becomes a little harder but still possible when $n=5$:
What I'm interested in is the general case. Is it possible to fit all pairs in the square for any $n$?
recreational-mathematics
Consider all possible pairs of squares that can fit in a row of length $n$ where every square has a width of 1. If I have a large square of width $n$, can all such pairs of squares fit in the large square simultaneously?
It's hard to explain without an example so here is the case when $n=4$:
To the left are all the pairs of squares and to the right is a way for them to fit in the $n$ by $n$ square. Note that the pairs are not allowed to be moved horizontally but can be moved vertically.
It becomes a little harder but still possible when $n=5$:
What I'm interested in is the general case. Is it possible to fit all pairs in the square for any $n$?
recreational-mathematics
recreational-mathematics
edited Nov 18 '18 at 22:51
Jens
3,7382928
3,7382928
asked Nov 18 '18 at 21:21
Pazzaz
485
485
What does "all possible pieces (disconnected or connected) of width 2 and height of 1 that could fit in the square" mean? Can you show us how to generate the pieces for a given square?
– John Douma
Nov 18 '18 at 21:39
@JohnDouma Well a piece here simply consists of choosing two squares in a single row of length n. So the total number of pieces will be (n choose 2).
– Pazzaz
Nov 18 '18 at 21:46
1
I think you have to specify the problem more accurately. A triangle can have width $2$ and height $1$, for example, and that seems to be different from what you mean (and that is without thinking about figures which are not convex). I think you mean figures constructed of two $1times 1$ squares in a particular kind of configuration (as in your comment). And these sub-figures need not be connected. I do think your intended question is interesting, and worth asking, but the way you have asked it is misleading.
– Mark Bennet
Nov 18 '18 at 21:56
@MarkBennet I agree, I did leave out some important parts. I've edited the question some, it should be more clear now.
– Pazzaz
Nov 18 '18 at 22:14
Well, if possible, there will always be $n^2-2binom n2=n$ leftover spaces.
– YiFan
Nov 18 '18 at 23:44
|
show 3 more comments
What does "all possible pieces (disconnected or connected) of width 2 and height of 1 that could fit in the square" mean? Can you show us how to generate the pieces for a given square?
– John Douma
Nov 18 '18 at 21:39
@JohnDouma Well a piece here simply consists of choosing two squares in a single row of length n. So the total number of pieces will be (n choose 2).
– Pazzaz
Nov 18 '18 at 21:46
1
I think you have to specify the problem more accurately. A triangle can have width $2$ and height $1$, for example, and that seems to be different from what you mean (and that is without thinking about figures which are not convex). I think you mean figures constructed of two $1times 1$ squares in a particular kind of configuration (as in your comment). And these sub-figures need not be connected. I do think your intended question is interesting, and worth asking, but the way you have asked it is misleading.
– Mark Bennet
Nov 18 '18 at 21:56
@MarkBennet I agree, I did leave out some important parts. I've edited the question some, it should be more clear now.
– Pazzaz
Nov 18 '18 at 22:14
Well, if possible, there will always be $n^2-2binom n2=n$ leftover spaces.
– YiFan
Nov 18 '18 at 23:44
What does "all possible pieces (disconnected or connected) of width 2 and height of 1 that could fit in the square" mean? Can you show us how to generate the pieces for a given square?
– John Douma
Nov 18 '18 at 21:39
What does "all possible pieces (disconnected or connected) of width 2 and height of 1 that could fit in the square" mean? Can you show us how to generate the pieces for a given square?
– John Douma
Nov 18 '18 at 21:39
@JohnDouma Well a piece here simply consists of choosing two squares in a single row of length n. So the total number of pieces will be (n choose 2).
– Pazzaz
Nov 18 '18 at 21:46
@JohnDouma Well a piece here simply consists of choosing two squares in a single row of length n. So the total number of pieces will be (n choose 2).
– Pazzaz
Nov 18 '18 at 21:46
1
1
I think you have to specify the problem more accurately. A triangle can have width $2$ and height $1$, for example, and that seems to be different from what you mean (and that is without thinking about figures which are not convex). I think you mean figures constructed of two $1times 1$ squares in a particular kind of configuration (as in your comment). And these sub-figures need not be connected. I do think your intended question is interesting, and worth asking, but the way you have asked it is misleading.
– Mark Bennet
Nov 18 '18 at 21:56
I think you have to specify the problem more accurately. A triangle can have width $2$ and height $1$, for example, and that seems to be different from what you mean (and that is without thinking about figures which are not convex). I think you mean figures constructed of two $1times 1$ squares in a particular kind of configuration (as in your comment). And these sub-figures need not be connected. I do think your intended question is interesting, and worth asking, but the way you have asked it is misleading.
– Mark Bennet
Nov 18 '18 at 21:56
@MarkBennet I agree, I did leave out some important parts. I've edited the question some, it should be more clear now.
– Pazzaz
Nov 18 '18 at 22:14
@MarkBennet I agree, I did leave out some important parts. I've edited the question some, it should be more clear now.
– Pazzaz
Nov 18 '18 at 22:14
Well, if possible, there will always be $n^2-2binom n2=n$ leftover spaces.
– YiFan
Nov 18 '18 at 23:44
Well, if possible, there will always be $n^2-2binom n2=n$ leftover spaces.
– YiFan
Nov 18 '18 at 23:44
|
show 3 more comments
2 Answers
2
active
oldest
votes
It is always possible, we can place the $binom{n}{2}$ pairs in a $n times n$ square when $n$ is odd and in a $(n-1) times n$ rectangle when $n$ is even.
This problem is equivalent to the edge coloring problem for complete graph $K_n$. Look at wiki for the geometric intuition underlying following construction.
Let $[n]$ be a short hand for ${ 0, ldots, n-1 }$.
Index the set of possible pairs by $(i,j) in [n]^2$ with $i < j$.
Label rows and columns of the large square using numbers from $[n]$.
When $n$ is odd, place the pair $(i,j)$ at row $k$ of the large square where $i + j equiv k pmod n$.
If two pairs $(i_1,j_1)$, $(i_2,j_2)$ on same row intersect, then
one of the following happens
$$i_1 = i_2 lor i_1 = j_2lor j_1 = i_2 lor j_1 = j_2$$
Since $i_1 + j_1 equiv i_2 + j_2 pmod n$, we find
$$(i_1,j_1) = (i_2,j_2) pmod n lor (i_1,j_1) = (j_2,i_2) pmod n$$
Since $i_1,i_2,j_1,j_2 in [n]$ and $i_1 < j_1$, $i_2 < j_2$, we can rule out the second case. From this, we can deduce distinct pairs on some row are disjoint. This generate
a desired packing of the $binom{n}{2}$ pairs into a $n times n$ square.
When $n$ is even, $n - 1$ is odd.
Place those pair $(i,j) in [n-1]^2$ into row $k$ where $i + j equiv k pmod {n-1}$.
Notice
- For each row $i in [n-1]$, the slot at column $2i pmod {n - 1}$ and $n-1$ is unused.
- For any column $j in [n-1]$, one and only slot at row $i in [n-1]$ is unused.
For those pair $(i,j) in [n]^2 setminus [n-1]^2$ with $i < j$, we have $j = n$.
We can place the pair on row $k$ where $2k = i pmod {n-1}$. This will fill all the unused slots in the first $n-1$ rows and generate a desired packing of the $binom{n}{2}$ pairs into a $(n-1) times n$ rectangle.
add a comment |
For 7×7, we have the following. X is an empty space, A through U are the 21 pairs of squares. For example, D D in the second row indicates that the {1,3} pair is used in that row, while the X in the seventh position means that spot is left empty.
A A B B C X C
D E D E F F X
G H X I H I G
J K K J X L L
X M N O O M N
P X Q R Q P R
S T U X S U T
.
1
It looks like for odd n, the empty spots are all in different columns. In other words, by rearranging the rows you can create a blank diagonal.
– Pazzaz
Nov 19 '18 at 10:03
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3004135%2fis-it-always-possible-to-fit-these-pieces-in-a-square%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
It is always possible, we can place the $binom{n}{2}$ pairs in a $n times n$ square when $n$ is odd and in a $(n-1) times n$ rectangle when $n$ is even.
This problem is equivalent to the edge coloring problem for complete graph $K_n$. Look at wiki for the geometric intuition underlying following construction.
Let $[n]$ be a short hand for ${ 0, ldots, n-1 }$.
Index the set of possible pairs by $(i,j) in [n]^2$ with $i < j$.
Label rows and columns of the large square using numbers from $[n]$.
When $n$ is odd, place the pair $(i,j)$ at row $k$ of the large square where $i + j equiv k pmod n$.
If two pairs $(i_1,j_1)$, $(i_2,j_2)$ on same row intersect, then
one of the following happens
$$i_1 = i_2 lor i_1 = j_2lor j_1 = i_2 lor j_1 = j_2$$
Since $i_1 + j_1 equiv i_2 + j_2 pmod n$, we find
$$(i_1,j_1) = (i_2,j_2) pmod n lor (i_1,j_1) = (j_2,i_2) pmod n$$
Since $i_1,i_2,j_1,j_2 in [n]$ and $i_1 < j_1$, $i_2 < j_2$, we can rule out the second case. From this, we can deduce distinct pairs on some row are disjoint. This generate
a desired packing of the $binom{n}{2}$ pairs into a $n times n$ square.
When $n$ is even, $n - 1$ is odd.
Place those pair $(i,j) in [n-1]^2$ into row $k$ where $i + j equiv k pmod {n-1}$.
Notice
- For each row $i in [n-1]$, the slot at column $2i pmod {n - 1}$ and $n-1$ is unused.
- For any column $j in [n-1]$, one and only slot at row $i in [n-1]$ is unused.
For those pair $(i,j) in [n]^2 setminus [n-1]^2$ with $i < j$, we have $j = n$.
We can place the pair on row $k$ where $2k = i pmod {n-1}$. This will fill all the unused slots in the first $n-1$ rows and generate a desired packing of the $binom{n}{2}$ pairs into a $(n-1) times n$ rectangle.
add a comment |
It is always possible, we can place the $binom{n}{2}$ pairs in a $n times n$ square when $n$ is odd and in a $(n-1) times n$ rectangle when $n$ is even.
This problem is equivalent to the edge coloring problem for complete graph $K_n$. Look at wiki for the geometric intuition underlying following construction.
Let $[n]$ be a short hand for ${ 0, ldots, n-1 }$.
Index the set of possible pairs by $(i,j) in [n]^2$ with $i < j$.
Label rows and columns of the large square using numbers from $[n]$.
When $n$ is odd, place the pair $(i,j)$ at row $k$ of the large square where $i + j equiv k pmod n$.
If two pairs $(i_1,j_1)$, $(i_2,j_2)$ on same row intersect, then
one of the following happens
$$i_1 = i_2 lor i_1 = j_2lor j_1 = i_2 lor j_1 = j_2$$
Since $i_1 + j_1 equiv i_2 + j_2 pmod n$, we find
$$(i_1,j_1) = (i_2,j_2) pmod n lor (i_1,j_1) = (j_2,i_2) pmod n$$
Since $i_1,i_2,j_1,j_2 in [n]$ and $i_1 < j_1$, $i_2 < j_2$, we can rule out the second case. From this, we can deduce distinct pairs on some row are disjoint. This generate
a desired packing of the $binom{n}{2}$ pairs into a $n times n$ square.
When $n$ is even, $n - 1$ is odd.
Place those pair $(i,j) in [n-1]^2$ into row $k$ where $i + j equiv k pmod {n-1}$.
Notice
- For each row $i in [n-1]$, the slot at column $2i pmod {n - 1}$ and $n-1$ is unused.
- For any column $j in [n-1]$, one and only slot at row $i in [n-1]$ is unused.
For those pair $(i,j) in [n]^2 setminus [n-1]^2$ with $i < j$, we have $j = n$.
We can place the pair on row $k$ where $2k = i pmod {n-1}$. This will fill all the unused slots in the first $n-1$ rows and generate a desired packing of the $binom{n}{2}$ pairs into a $(n-1) times n$ rectangle.
add a comment |
It is always possible, we can place the $binom{n}{2}$ pairs in a $n times n$ square when $n$ is odd and in a $(n-1) times n$ rectangle when $n$ is even.
This problem is equivalent to the edge coloring problem for complete graph $K_n$. Look at wiki for the geometric intuition underlying following construction.
Let $[n]$ be a short hand for ${ 0, ldots, n-1 }$.
Index the set of possible pairs by $(i,j) in [n]^2$ with $i < j$.
Label rows and columns of the large square using numbers from $[n]$.
When $n$ is odd, place the pair $(i,j)$ at row $k$ of the large square where $i + j equiv k pmod n$.
If two pairs $(i_1,j_1)$, $(i_2,j_2)$ on same row intersect, then
one of the following happens
$$i_1 = i_2 lor i_1 = j_2lor j_1 = i_2 lor j_1 = j_2$$
Since $i_1 + j_1 equiv i_2 + j_2 pmod n$, we find
$$(i_1,j_1) = (i_2,j_2) pmod n lor (i_1,j_1) = (j_2,i_2) pmod n$$
Since $i_1,i_2,j_1,j_2 in [n]$ and $i_1 < j_1$, $i_2 < j_2$, we can rule out the second case. From this, we can deduce distinct pairs on some row are disjoint. This generate
a desired packing of the $binom{n}{2}$ pairs into a $n times n$ square.
When $n$ is even, $n - 1$ is odd.
Place those pair $(i,j) in [n-1]^2$ into row $k$ where $i + j equiv k pmod {n-1}$.
Notice
- For each row $i in [n-1]$, the slot at column $2i pmod {n - 1}$ and $n-1$ is unused.
- For any column $j in [n-1]$, one and only slot at row $i in [n-1]$ is unused.
For those pair $(i,j) in [n]^2 setminus [n-1]^2$ with $i < j$, we have $j = n$.
We can place the pair on row $k$ where $2k = i pmod {n-1}$. This will fill all the unused slots in the first $n-1$ rows and generate a desired packing of the $binom{n}{2}$ pairs into a $(n-1) times n$ rectangle.
It is always possible, we can place the $binom{n}{2}$ pairs in a $n times n$ square when $n$ is odd and in a $(n-1) times n$ rectangle when $n$ is even.
This problem is equivalent to the edge coloring problem for complete graph $K_n$. Look at wiki for the geometric intuition underlying following construction.
Let $[n]$ be a short hand for ${ 0, ldots, n-1 }$.
Index the set of possible pairs by $(i,j) in [n]^2$ with $i < j$.
Label rows and columns of the large square using numbers from $[n]$.
When $n$ is odd, place the pair $(i,j)$ at row $k$ of the large square where $i + j equiv k pmod n$.
If two pairs $(i_1,j_1)$, $(i_2,j_2)$ on same row intersect, then
one of the following happens
$$i_1 = i_2 lor i_1 = j_2lor j_1 = i_2 lor j_1 = j_2$$
Since $i_1 + j_1 equiv i_2 + j_2 pmod n$, we find
$$(i_1,j_1) = (i_2,j_2) pmod n lor (i_1,j_1) = (j_2,i_2) pmod n$$
Since $i_1,i_2,j_1,j_2 in [n]$ and $i_1 < j_1$, $i_2 < j_2$, we can rule out the second case. From this, we can deduce distinct pairs on some row are disjoint. This generate
a desired packing of the $binom{n}{2}$ pairs into a $n times n$ square.
When $n$ is even, $n - 1$ is odd.
Place those pair $(i,j) in [n-1]^2$ into row $k$ where $i + j equiv k pmod {n-1}$.
Notice
- For each row $i in [n-1]$, the slot at column $2i pmod {n - 1}$ and $n-1$ is unused.
- For any column $j in [n-1]$, one and only slot at row $i in [n-1]$ is unused.
For those pair $(i,j) in [n]^2 setminus [n-1]^2$ with $i < j$, we have $j = n$.
We can place the pair on row $k$ where $2k = i pmod {n-1}$. This will fill all the unused slots in the first $n-1$ rows and generate a desired packing of the $binom{n}{2}$ pairs into a $(n-1) times n$ rectangle.
edited Nov 19 '18 at 16:38
answered Nov 19 '18 at 16:23
achille hui
95.4k5130256
95.4k5130256
add a comment |
add a comment |
For 7×7, we have the following. X is an empty space, A through U are the 21 pairs of squares. For example, D D in the second row indicates that the {1,3} pair is used in that row, while the X in the seventh position means that spot is left empty.
A A B B C X C
D E D E F F X
G H X I H I G
J K K J X L L
X M N O O M N
P X Q R Q P R
S T U X S U T
.
1
It looks like for odd n, the empty spots are all in different columns. In other words, by rearranging the rows you can create a blank diagonal.
– Pazzaz
Nov 19 '18 at 10:03
add a comment |
For 7×7, we have the following. X is an empty space, A through U are the 21 pairs of squares. For example, D D in the second row indicates that the {1,3} pair is used in that row, while the X in the seventh position means that spot is left empty.
A A B B C X C
D E D E F F X
G H X I H I G
J K K J X L L
X M N O O M N
P X Q R Q P R
S T U X S U T
.
1
It looks like for odd n, the empty spots are all in different columns. In other words, by rearranging the rows you can create a blank diagonal.
– Pazzaz
Nov 19 '18 at 10:03
add a comment |
For 7×7, we have the following. X is an empty space, A through U are the 21 pairs of squares. For example, D D in the second row indicates that the {1,3} pair is used in that row, while the X in the seventh position means that spot is left empty.
A A B B C X C
D E D E F F X
G H X I H I G
J K K J X L L
X M N O O M N
P X Q R Q P R
S T U X S U T
.
For 7×7, we have the following. X is an empty space, A through U are the 21 pairs of squares. For example, D D in the second row indicates that the {1,3} pair is used in that row, while the X in the seventh position means that spot is left empty.
A A B B C X C
D E D E F F X
G H X I H I G
J K K J X L L
X M N O O M N
P X Q R Q P R
S T U X S U T
.
edited Nov 19 '18 at 1:15
answered Nov 19 '18 at 1:02
Oscar Lanzi
12.1k12036
12.1k12036
1
It looks like for odd n, the empty spots are all in different columns. In other words, by rearranging the rows you can create a blank diagonal.
– Pazzaz
Nov 19 '18 at 10:03
add a comment |
1
It looks like for odd n, the empty spots are all in different columns. In other words, by rearranging the rows you can create a blank diagonal.
– Pazzaz
Nov 19 '18 at 10:03
1
1
It looks like for odd n, the empty spots are all in different columns. In other words, by rearranging the rows you can create a blank diagonal.
– Pazzaz
Nov 19 '18 at 10:03
It looks like for odd n, the empty spots are all in different columns. In other words, by rearranging the rows you can create a blank diagonal.
– Pazzaz
Nov 19 '18 at 10:03
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3004135%2fis-it-always-possible-to-fit-these-pieces-in-a-square%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
What does "all possible pieces (disconnected or connected) of width 2 and height of 1 that could fit in the square" mean? Can you show us how to generate the pieces for a given square?
– John Douma
Nov 18 '18 at 21:39
@JohnDouma Well a piece here simply consists of choosing two squares in a single row of length n. So the total number of pieces will be (n choose 2).
– Pazzaz
Nov 18 '18 at 21:46
1
I think you have to specify the problem more accurately. A triangle can have width $2$ and height $1$, for example, and that seems to be different from what you mean (and that is without thinking about figures which are not convex). I think you mean figures constructed of two $1times 1$ squares in a particular kind of configuration (as in your comment). And these sub-figures need not be connected. I do think your intended question is interesting, and worth asking, but the way you have asked it is misleading.
– Mark Bennet
Nov 18 '18 at 21:56
@MarkBennet I agree, I did leave out some important parts. I've edited the question some, it should be more clear now.
– Pazzaz
Nov 18 '18 at 22:14
Well, if possible, there will always be $n^2-2binom n2=n$ leftover spaces.
– YiFan
Nov 18 '18 at 23:44