coloring 4x4 square by 2 colors
up vote
-1
down vote
favorite
we have 4x4 square. We can paint 16 small squares white or black color. neighbouring squares can not be black colored (sharig an edge). how many patterns we can get? (if we reach a coloring from rotating another one, then those two are same. if we reach a coloring from reflecting another one, then those two are different)
combinatorics
asked Nov 20 at 9:19
Rasim Abi
11
add a comment |
up vote
-1
down vote
favorite
we have 4x4 square. We can paint 16 small squares white or black color. neighbouring squares can not be black colored (sharig an edge). how many patterns we can get? (if we reach a coloring from rotating another one, then those two are same. if we reach a coloring from reflecting another one, then those two are different)
combinatorics
asked Nov 20 at 9:19
Rasim Abi
11
1
Come on, downvoter. At least let the OP know what you think is wrong with the question (perhaps you didn't see he's a "New contributer"?). Anyway, since that person won't, let me say this: this website is meant to help you solve problems you get stuck on. As your question is posed now, we have no way to tell whether you even tried the problem. Share your work with us so we can see where exactly you got stuck. Besides that, showing your work simply shows you put effort into it and we like that here :)
– vrugtehagel
Nov 20 at 9:23
yes i prepared the question but till now could not solve it. i checked similar questions but this is different. first time im using this side.
– Rasim Abi
Nov 20 at 9:28
Then please edit your question to include your work, show us what you've tried.
– vrugtehagel
Nov 20 at 9:29
$4times 4$ is a very small grid. If one ignore the issue of overcounting due to rotational symmetry, you can count the number of configuration without nearby black squares with a few line of code. You will find there are $1234$ possible configurations. To handle overcounting due to symmetry, first figure out the number of configurations with $2$-fold symmetry $(34)$ and $4$-fold symmetry $(4)$ and then apply Burnside's lemma.
– achille hui
Nov 20 at 23:43
add a comment |
up vote
-1
down vote
favorite
up vote
-1
down vote
favorite
we have 4x4 square. We can paint 16 small squares white or black color. neighbouring squares can not be black colored (sharig an edge). how many patterns we can get? (if we reach a coloring from rotating another one, then those two are same. if we reach a coloring from reflecting another one, then those two are different)
combinatorics
asked Nov 20 at 9:19
Rasim Abi
11
we have 4x4 square. We can paint 16 small squares white or black color. neighbouring squares can not be black colored (sharig an edge). how many patterns we can get? (if we reach a coloring from rotating another one, then those two are same. if we reach a coloring from reflecting another one, then those two are different)
combinatorics
combinatorics
asked Nov 20 at 9:19
Rasim Abi
11
asked Nov 20 at 9:19
Rasim Abi
11
asked Nov 20 at 9:19
Rasim Abi
11
asked Nov 20 at 9:19
Rasim Abi
11
asked Nov 20 at 9:19
Rasim Abi
11
11
1
Come on, downvoter. At least let the OP know what you think is wrong with the question (perhaps you didn't see he's a "New contributer"?). Anyway, since that person won't, let me say this: this website is meant to help you solve problems you get stuck on. As your question is posed now, we have no way to tell whether you even tried the problem. Share your work with us so we can see where exactly you got stuck. Besides that, showing your work simply shows you put effort into it and we like that here :)
– vrugtehagel
Nov 20 at 9:23
yes i prepared the question but till now could not solve it. i checked similar questions but this is different. first time im using this side.
– Rasim Abi
Nov 20 at 9:28
Then please edit your question to include your work, show us what you've tried.
– vrugtehagel
Nov 20 at 9:29
$4times 4$ is a very small grid. If one ignore the issue of overcounting due to rotational symmetry, you can count the number of configuration without nearby black squares with a few line of code. You will find there are $1234$ possible configurations. To handle overcounting due to symmetry, first figure out the number of configurations with $2$-fold symmetry $(34)$ and $4$-fold symmetry $(4)$ and then apply Burnside's lemma.
– achille hui
Nov 20 at 23:43
add a comment |
1
Come on, downvoter. At least let the OP know what you think is wrong with the question (perhaps you didn't see he's a "New contributer"?). Anyway, since that person won't, let me say this: this website is meant to help you solve problems you get stuck on. As your question is posed now, we have no way to tell whether you even tried the problem. Share your work with us so we can see where exactly you got stuck. Besides that, showing your work simply shows you put effort into it and we like that here :)
– vrugtehagel
Nov 20 at 9:23
yes i prepared the question but till now could not solve it. i checked similar questions but this is different. first time im using this side.
– Rasim Abi
Nov 20 at 9:28
Then please edit your question to include your work, show us what you've tried.
– vrugtehagel
Nov 20 at 9:29
$4times 4$ is a very small grid. If one ignore the issue of overcounting due to rotational symmetry, you can count the number of configuration without nearby black squares with a few line of code. You will find there are $1234$ possible configurations. To handle overcounting due to symmetry, first figure out the number of configurations with $2$-fold symmetry $(34)$ and $4$-fold symmetry $(4)$ and then apply Burnside's lemma.
– achille hui
Nov 20 at 23:43
1
1
Come on, downvoter. At least let the OP know what you think is wrong with the question (perhaps you didn't see he's a "New contributer"?). Anyway, since that person won't, let me say this: this website is meant to help you solve problems you get stuck on. As your question is posed now, we have no way to tell whether you even tried the problem. Share your work with us so we can see where exactly you got stuck. Besides that, showing your work simply shows you put effort into it and we like that here :)
– vrugtehagel
Nov 20 at 9:23
Come on, downvoter. At least let the OP know what you think is wrong with the question (perhaps you didn't see he's a "New contributer"?). Anyway, since that person won't, let me say this: this website is meant to help you solve problems you get stuck on. As your question is posed now, we have no way to tell whether you even tried the problem. Share your work with us so we can see where exactly you got stuck. Besides that, showing your work simply shows you put effort into it and we like that here :)
– vrugtehagel
Nov 20 at 9:23
yes i prepared the question but till now could not solve it. i checked similar questions but this is different. first time im using this side.
– Rasim Abi
Nov 20 at 9:28
yes i prepared the question but till now could not solve it. i checked similar questions but this is different. first time im using this side.
– Rasim Abi
Nov 20 at 9:28
Then please edit your question to include your work, show us what you've tried.
– vrugtehagel
Nov 20 at 9:29
Then please edit your question to include your work, show us what you've tried.
– vrugtehagel
Nov 20 at 9:29
$4times 4$ is a very small grid. If one ignore the issue of overcounting due to rotational symmetry, you can count the number of configuration without nearby black squares with a few line of code. You will find there are $1234$ possible configurations. To handle overcounting due to symmetry, first figure out the number of configurations with $2$-fold symmetry $(34)$ and $4$-fold symmetry $(4)$ and then apply Burnside's lemma.
– achille hui
Nov 20 at 23:43
$4times 4$ is a very small grid. If one ignore the issue of overcounting due to rotational symmetry, you can count the number of configuration without nearby black squares with a few line of code. You will find there are $1234$ possible configurations. To handle overcounting due to symmetry, first figure out the number of configurations with $2$-fold symmetry $(34)$ and $4$-fold symmetry $(4)$ and then apply Burnside's lemma.
– achille hui
Nov 20 at 23:43
add a comment |
active
oldest
votes
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',
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
});
}
});
draft saved
draft discarded
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%2f3006105%2fcoloring-4x4-square-by-2-colors%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
draft saved
draft discarded
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.
draft saved
draft discarded
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%2f3006105%2fcoloring-4x4-square-by-2-colors%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
1
Come on, downvoter. At least let the OP know what you think is wrong with the question (perhaps you didn't see he's a "New contributer"?). Anyway, since that person won't, let me say this: this website is meant to help you solve problems you get stuck on. As your question is posed now, we have no way to tell whether you even tried the problem. Share your work with us so we can see where exactly you got stuck. Besides that, showing your work simply shows you put effort into it and we like that here :)
– vrugtehagel
Nov 20 at 9:23
yes i prepared the question but till now could not solve it. i checked similar questions but this is different. first time im using this side.
– Rasim Abi
Nov 20 at 9:28
Then please edit your question to include your work, show us what you've tried.
– vrugtehagel
Nov 20 at 9:29
$4times 4$ is a very small grid. If one ignore the issue of overcounting due to rotational symmetry, you can count the number of configuration without nearby black squares with a few line of code. You will find there are $1234$ possible configurations. To handle overcounting due to symmetry, first figure out the number of configurations with $2$-fold symmetry $(34)$ and $4$-fold symmetry $(4)$ and then apply Burnside's lemma.
– achille hui
Nov 20 at 23:43