Combinatorics problem (coloring squares)
$begingroup$
I'm having some trouble with a combinatorics problem and I was thinking maybe somebody could give me a little help. I've been thinking about it the entire day and I can't get my head around it. It goes like this.
You have 12 pencils of different colors.
How many ways are there to color 2*n (n>2) squares (as in 2 rows, n columns) such that no 2 adjacent squares are painted the same color.
Sorry if my wording is a little bit confusing I translated the problem from spanish. I'll attach an image for better understanding.
Here's the image
I can't do it in any way. I've done this before with n=2 (a square made of 4 smaller squares) and it's a matter of separating into 2 cases, but here I have infinite? cases. It's really confusing.
If someone could give me a clue it'd of great help. Thanks!
combinatorics coloring
asked Dec 20 '18 at 4:22
DirewolfoxDirewolfox
406
$endgroup$
add a comment |
$begingroup$
I'm having some trouble with a combinatorics problem and I was thinking maybe somebody could give me a little help. I've been thinking about it the entire day and I can't get my head around it. It goes like this.
You have 12 pencils of different colors.
How many ways are there to color 2*n (n>2) squares (as in 2 rows, n columns) such that no 2 adjacent squares are painted the same color.
Sorry if my wording is a little bit confusing I translated the problem from spanish. I'll attach an image for better understanding.
Here's the image
I can't do it in any way. I've done this before with n=2 (a square made of 4 smaller squares) and it's a matter of separating into 2 cases, but here I have infinite? cases. It's really confusing.
If someone could give me a clue it'd of great help. Thanks!
combinatorics coloring
asked Dec 20 '18 at 4:22
DirewolfoxDirewolfox
406
$endgroup$
$begingroup$
You might be able to infer a pattern by solving easier versions of the same question. For example, for $n=2$, was there some pattern for the number of colorings as a function of $p$?
$endgroup$
– David Diaz
Dec 20 '18 at 4:30
$begingroup$
@DavidDiaz Hm well I couldn't find a general formula because the number of options you have to color a certain square depends on how you've previously colores its adjacent. So I had to separate in 2 cases, whether the "non-adjacent" squares were the same color or not. Hope it makes sense?
$endgroup$
– Direwolfox
Dec 20 '18 at 4:38
add a comment |
$begingroup$
I'm having some trouble with a combinatorics problem and I was thinking maybe somebody could give me a little help. I've been thinking about it the entire day and I can't get my head around it. It goes like this.
You have 12 pencils of different colors.
How many ways are there to color 2*n (n>2) squares (as in 2 rows, n columns) such that no 2 adjacent squares are painted the same color.
Sorry if my wording is a little bit confusing I translated the problem from spanish. I'll attach an image for better understanding.
Here's the image
I can't do it in any way. I've done this before with n=2 (a square made of 4 smaller squares) and it's a matter of separating into 2 cases, but here I have infinite? cases. It's really confusing.
If someone could give me a clue it'd of great help. Thanks!
combinatorics coloring
asked Dec 20 '18 at 4:22
DirewolfoxDirewolfox
406
$endgroup$
I'm having some trouble with a combinatorics problem and I was thinking maybe somebody could give me a little help. I've been thinking about it the entire day and I can't get my head around it. It goes like this.
You have 12 pencils of different colors.
How many ways are there to color 2*n (n>2) squares (as in 2 rows, n columns) such that no 2 adjacent squares are painted the same color.
Sorry if my wording is a little bit confusing I translated the problem from spanish. I'll attach an image for better understanding.
Here's the image
I can't do it in any way. I've done this before with n=2 (a square made of 4 smaller squares) and it's a matter of separating into 2 cases, but here I have infinite? cases. It's really confusing.
If someone could give me a clue it'd of great help. Thanks!
combinatorics coloring
combinatorics coloring
asked Dec 20 '18 at 4:22
DirewolfoxDirewolfox
406
asked Dec 20 '18 at 4:22
DirewolfoxDirewolfox
406
asked Dec 20 '18 at 4:22
DirewolfoxDirewolfox
406
asked Dec 20 '18 at 4:22
DirewolfoxDirewolfox
406
asked Dec 20 '18 at 4:22
DirewolfoxDirewolfox
406
406
$begingroup$
You might be able to infer a pattern by solving easier versions of the same question. For example, for $n=2$, was there some pattern for the number of colorings as a function of $p$?
$endgroup$
– David Diaz
Dec 20 '18 at 4:30
$begingroup$
@DavidDiaz Hm well I couldn't find a general formula because the number of options you have to color a certain square depends on how you've previously colores its adjacent. So I had to separate in 2 cases, whether the "non-adjacent" squares were the same color or not. Hope it makes sense?
$endgroup$
– Direwolfox
Dec 20 '18 at 4:38
add a comment |
$begingroup$
You might be able to infer a pattern by solving easier versions of the same question. For example, for $n=2$, was there some pattern for the number of colorings as a function of $p$?
$endgroup$
– David Diaz
Dec 20 '18 at 4:30
$begingroup$
@DavidDiaz Hm well I couldn't find a general formula because the number of options you have to color a certain square depends on how you've previously colores its adjacent. So I had to separate in 2 cases, whether the "non-adjacent" squares were the same color or not. Hope it makes sense?
$endgroup$
– Direwolfox
Dec 20 '18 at 4:38
$begingroup$
You might be able to infer a pattern by solving easier versions of the same question. For example, for $n=2$, was there some pattern for the number of colorings as a function of $p$?
$endgroup$
– David Diaz
Dec 20 '18 at 4:30
$begingroup$
You might be able to infer a pattern by solving easier versions of the same question. For example, for $n=2$, was there some pattern for the number of colorings as a function of $p$?
$endgroup$
– David Diaz
Dec 20 '18 at 4:30
$begingroup$
@DavidDiaz Hm well I couldn't find a general formula because the number of options you have to color a certain square depends on how you've previously colores its adjacent. So I had to separate in 2 cases, whether the "non-adjacent" squares were the same color or not. Hope it makes sense?
$endgroup$
– Direwolfox
Dec 20 '18 at 4:38
$begingroup$
@DavidDiaz Hm well I couldn't find a general formula because the number of options you have to color a certain square depends on how you've previously colores its adjacent. So I had to separate in 2 cases, whether the "non-adjacent" squares were the same color or not. Hope it makes sense?
$endgroup$
– Direwolfox
Dec 20 '18 at 4:38
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Think of coloring each column. How many ways to color the first column? Now for the second column, you have $10$ ways to color the top square different from the bottom square of the first column and $1$ way to color the top square the same as the bottom square of the first column. How many ways to color the whole second column? Now argue there are the same number of ways to color each column after the first.
answered Dec 20 '18 at 4:32
Ross MillikanRoss Millikan
298k23198371
$endgroup$
$begingroup$
I think I kind of got it. Would it be something like 132*(111)^(n-1)? For instance, if I had 3 columns would it be 132*111*111? Thanks
$endgroup$
– Direwolfox
Dec 20 '18 at 4:51
$begingroup$
Yes, that is correct
$endgroup$
– Ross Millikan
Dec 20 '18 at 4:52
$begingroup$
Thank you so so much. Have a great day.
$endgroup$
– Direwolfox
Dec 20 '18 at 4:53
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%2f3047150%2fcombinatorics-problem-coloring-squares%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Think of coloring each column. How many ways to color the first column? Now for the second column, you have $10$ ways to color the top square different from the bottom square of the first column and $1$ way to color the top square the same as the bottom square of the first column. How many ways to color the whole second column? Now argue there are the same number of ways to color each column after the first.
answered Dec 20 '18 at 4:32
Ross MillikanRoss Millikan
298k23198371
$endgroup$
$begingroup$
I think I kind of got it. Would it be something like 132*(111)^(n-1)? For instance, if I had 3 columns would it be 132*111*111? Thanks
$endgroup$
– Direwolfox
Dec 20 '18 at 4:51
$begingroup$
Yes, that is correct
$endgroup$
– Ross Millikan
Dec 20 '18 at 4:52
$begingroup$
Thank you so so much. Have a great day.
$endgroup$
– Direwolfox
Dec 20 '18 at 4:53
add a comment |
$begingroup$
Think of coloring each column. How many ways to color the first column? Now for the second column, you have $10$ ways to color the top square different from the bottom square of the first column and $1$ way to color the top square the same as the bottom square of the first column. How many ways to color the whole second column? Now argue there are the same number of ways to color each column after the first.
answered Dec 20 '18 at 4:32
Ross MillikanRoss Millikan
298k23198371
$endgroup$
$begingroup$
I think I kind of got it. Would it be something like 132*(111)^(n-1)? For instance, if I had 3 columns would it be 132*111*111? Thanks
$endgroup$
– Direwolfox
Dec 20 '18 at 4:51
$begingroup$
Yes, that is correct
$endgroup$
– Ross Millikan
Dec 20 '18 at 4:52
$begingroup$
Thank you so so much. Have a great day.
$endgroup$
– Direwolfox
Dec 20 '18 at 4:53
add a comment |
$begingroup$
Think of coloring each column. How many ways to color the first column? Now for the second column, you have $10$ ways to color the top square different from the bottom square of the first column and $1$ way to color the top square the same as the bottom square of the first column. How many ways to color the whole second column? Now argue there are the same number of ways to color each column after the first.
answered Dec 20 '18 at 4:32
Ross MillikanRoss Millikan
298k23198371
$endgroup$
Think of coloring each column. How many ways to color the first column? Now for the second column, you have $10$ ways to color the top square different from the bottom square of the first column and $1$ way to color the top square the same as the bottom square of the first column. How many ways to color the whole second column? Now argue there are the same number of ways to color each column after the first.
answered Dec 20 '18 at 4:32
Ross MillikanRoss Millikan
298k23198371
answered Dec 20 '18 at 4:32
Ross MillikanRoss Millikan
298k23198371
answered Dec 20 '18 at 4:32
Ross MillikanRoss Millikan
298k23198371
answered Dec 20 '18 at 4:32
Ross MillikanRoss Millikan
298k23198371
298k23198371
$begingroup$
I think I kind of got it. Would it be something like 132*(111)^(n-1)? For instance, if I had 3 columns would it be 132*111*111? Thanks
$endgroup$
– Direwolfox
Dec 20 '18 at 4:51
$begingroup$
Yes, that is correct
$endgroup$
– Ross Millikan
Dec 20 '18 at 4:52
$begingroup$
Thank you so so much. Have a great day.
$endgroup$
– Direwolfox
Dec 20 '18 at 4:53
add a comment |
$begingroup$
I think I kind of got it. Would it be something like 132*(111)^(n-1)? For instance, if I had 3 columns would it be 132*111*111? Thanks
$endgroup$
– Direwolfox
Dec 20 '18 at 4:51
$begingroup$
Yes, that is correct
$endgroup$
– Ross Millikan
Dec 20 '18 at 4:52
$begingroup$
Thank you so so much. Have a great day.
$endgroup$
– Direwolfox
Dec 20 '18 at 4:53
$begingroup$
I think I kind of got it. Would it be something like 132*(111)^(n-1)? For instance, if I had 3 columns would it be 132*111*111? Thanks
$endgroup$
– Direwolfox
Dec 20 '18 at 4:51
$begingroup$
I think I kind of got it. Would it be something like 132*(111)^(n-1)? For instance, if I had 3 columns would it be 132*111*111? Thanks
$endgroup$
– Direwolfox
Dec 20 '18 at 4:51
$begingroup$
Yes, that is correct
$endgroup$
– Ross Millikan
Dec 20 '18 at 4:52
$begingroup$
Yes, that is correct
$endgroup$
– Ross Millikan
Dec 20 '18 at 4:52
$begingroup$
Thank you so so much. Have a great day.
$endgroup$
– Direwolfox
Dec 20 '18 at 4:53
$begingroup$
Thank you so so much. Have a great day.
$endgroup$
– Direwolfox
Dec 20 '18 at 4:53
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.
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%2f3047150%2fcombinatorics-problem-coloring-squares%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
$begingroup$
You might be able to infer a pattern by solving easier versions of the same question. For example, for $n=2$, was there some pattern for the number of colorings as a function of $p$?
$endgroup$
– David Diaz
Dec 20 '18 at 4:30
$begingroup$
@DavidDiaz Hm well I couldn't find a general formula because the number of options you have to color a certain square depends on how you've previously colores its adjacent. So I had to separate in 2 cases, whether the "non-adjacent" squares were the same color or not. Hope it makes sense?
$endgroup$
– Direwolfox
Dec 20 '18 at 4:38