Derrangments function for coloring a chess table
$begingroup$
How many ways are there to color a chess table of size n*n with n different colors. We color in such a way that in each horizontal row there are all colors and at the same time in no vertical row there are two fields of the same color next to each other. I think we can use derangements for this but I'm not sure how.
combinatorics discrete-mathematics
asked Dec 10 '18 at 15:43
ponikoliponikoli
416
$endgroup$
add a comment |
$begingroup$
How many ways are there to color a chess table of size n*n with n different colors. We color in such a way that in each horizontal row there are all colors and at the same time in no vertical row there are two fields of the same color next to each other. I think we can use derangements for this but I'm not sure how.
combinatorics discrete-mathematics
asked Dec 10 '18 at 15:43
ponikoliponikoli
416
$endgroup$
$begingroup$
Where did this question come from?
$endgroup$
– coffeemath
Dec 10 '18 at 15:46
add a comment |
$begingroup$
How many ways are there to color a chess table of size n*n with n different colors. We color in such a way that in each horizontal row there are all colors and at the same time in no vertical row there are two fields of the same color next to each other. I think we can use derangements for this but I'm not sure how.
combinatorics discrete-mathematics
asked Dec 10 '18 at 15:43
ponikoliponikoli
416
$endgroup$
How many ways are there to color a chess table of size n*n with n different colors. We color in such a way that in each horizontal row there are all colors and at the same time in no vertical row there are two fields of the same color next to each other. I think we can use derangements for this but I'm not sure how.
combinatorics discrete-mathematics
combinatorics discrete-mathematics
asked Dec 10 '18 at 15:43
ponikoliponikoli
416
asked Dec 10 '18 at 15:43
ponikoliponikoli
416
asked Dec 10 '18 at 15:43
ponikoliponikoli
416
asked Dec 10 '18 at 15:43
ponikoliponikoli
416
asked Dec 10 '18 at 15:43
ponikoliponikoli
416
416
$begingroup$
Where did this question come from?
$endgroup$
– coffeemath
Dec 10 '18 at 15:46
add a comment |
$begingroup$
Where did this question come from?
$endgroup$
– coffeemath
Dec 10 '18 at 15:46
$begingroup$
Where did this question come from?
$endgroup$
– coffeemath
Dec 10 '18 at 15:46
$begingroup$
Where did this question come from?
$endgroup$
– coffeemath
Dec 10 '18 at 15:46
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Fill in the first row any way you like. How many options? Now, you are correct, the second row has to be a derangement of the first. How many options there? Each row in turn is a derangement of the one above.
answered Dec 10 '18 at 15:48
Ross MillikanRoss Millikan
300k24200375
$endgroup$
$begingroup$
So for the first row I think there are n^n ways we can color the first row. So for the second row there are D(n^n) ways to color it? But how do I continue this?
$endgroup$
– ponikoli
Dec 10 '18 at 19:20
$begingroup$
No, you need one of each color in the first row, so there are fewer. How many?
$endgroup$
– Ross Millikan
Dec 10 '18 at 19:35
$begingroup$
There is n^n * n^(n-1) * n^(n-2) * n^(n-3) ... n^1.
$endgroup$
– ponikoli
Dec 10 '18 at 19:44
$begingroup$
The first row has $n$ objects that you can put in any order, so there are $n!$ ways to do it.
$endgroup$
– Ross Millikan
Dec 10 '18 at 20:52
$begingroup$
Then the second row has D(n!) ways to do it. The third D(D(n!)) etc..?
$endgroup$
– ponikoli
Dec 11 '18 at 9:00
|
show 6 more comments
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%2f3034075%2fderrangments-function-for-coloring-a-chess-table%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$
Fill in the first row any way you like. How many options? Now, you are correct, the second row has to be a derangement of the first. How many options there? Each row in turn is a derangement of the one above.
answered Dec 10 '18 at 15:48
Ross MillikanRoss Millikan
300k24200375
$endgroup$
$begingroup$
So for the first row I think there are n^n ways we can color the first row. So for the second row there are D(n^n) ways to color it? But how do I continue this?
$endgroup$
– ponikoli
Dec 10 '18 at 19:20
$begingroup$
No, you need one of each color in the first row, so there are fewer. How many?
$endgroup$
– Ross Millikan
Dec 10 '18 at 19:35
$begingroup$
There is n^n * n^(n-1) * n^(n-2) * n^(n-3) ... n^1.
$endgroup$
– ponikoli
Dec 10 '18 at 19:44
$begingroup$
The first row has $n$ objects that you can put in any order, so there are $n!$ ways to do it.
$endgroup$
– Ross Millikan
Dec 10 '18 at 20:52
$begingroup$
Then the second row has D(n!) ways to do it. The third D(D(n!)) etc..?
$endgroup$
– ponikoli
Dec 11 '18 at 9:00
|
show 6 more comments
$begingroup$
Fill in the first row any way you like. How many options? Now, you are correct, the second row has to be a derangement of the first. How many options there? Each row in turn is a derangement of the one above.
answered Dec 10 '18 at 15:48
Ross MillikanRoss Millikan
300k24200375
$endgroup$
$begingroup$
So for the first row I think there are n^n ways we can color the first row. So for the second row there are D(n^n) ways to color it? But how do I continue this?
$endgroup$
– ponikoli
Dec 10 '18 at 19:20
$begingroup$
No, you need one of each color in the first row, so there are fewer. How many?
$endgroup$
– Ross Millikan
Dec 10 '18 at 19:35
$begingroup$
There is n^n * n^(n-1) * n^(n-2) * n^(n-3) ... n^1.
$endgroup$
– ponikoli
Dec 10 '18 at 19:44
$begingroup$
The first row has $n$ objects that you can put in any order, so there are $n!$ ways to do it.
$endgroup$
– Ross Millikan
Dec 10 '18 at 20:52
$begingroup$
Then the second row has D(n!) ways to do it. The third D(D(n!)) etc..?
$endgroup$
– ponikoli
Dec 11 '18 at 9:00
|
show 6 more comments
$begingroup$
Fill in the first row any way you like. How many options? Now, you are correct, the second row has to be a derangement of the first. How many options there? Each row in turn is a derangement of the one above.
answered Dec 10 '18 at 15:48
Ross MillikanRoss Millikan
300k24200375
$endgroup$
Fill in the first row any way you like. How many options? Now, you are correct, the second row has to be a derangement of the first. How many options there? Each row in turn is a derangement of the one above.
answered Dec 10 '18 at 15:48
Ross MillikanRoss Millikan
300k24200375
answered Dec 10 '18 at 15:48
Ross MillikanRoss Millikan
300k24200375
answered Dec 10 '18 at 15:48
Ross MillikanRoss Millikan
300k24200375
answered Dec 10 '18 at 15:48
Ross MillikanRoss Millikan
300k24200375
300k24200375
$begingroup$
So for the first row I think there are n^n ways we can color the first row. So for the second row there are D(n^n) ways to color it? But how do I continue this?
$endgroup$
– ponikoli
Dec 10 '18 at 19:20
$begingroup$
No, you need one of each color in the first row, so there are fewer. How many?
$endgroup$
– Ross Millikan
Dec 10 '18 at 19:35
$begingroup$
There is n^n * n^(n-1) * n^(n-2) * n^(n-3) ... n^1.
$endgroup$
– ponikoli
Dec 10 '18 at 19:44
$begingroup$
The first row has $n$ objects that you can put in any order, so there are $n!$ ways to do it.
$endgroup$
– Ross Millikan
Dec 10 '18 at 20:52
$begingroup$
Then the second row has D(n!) ways to do it. The third D(D(n!)) etc..?
$endgroup$
– ponikoli
Dec 11 '18 at 9:00
|
show 6 more comments
$begingroup$
So for the first row I think there are n^n ways we can color the first row. So for the second row there are D(n^n) ways to color it? But how do I continue this?
$endgroup$
– ponikoli
Dec 10 '18 at 19:20
$begingroup$
No, you need one of each color in the first row, so there are fewer. How many?
$endgroup$
– Ross Millikan
Dec 10 '18 at 19:35
$begingroup$
There is n^n * n^(n-1) * n^(n-2) * n^(n-3) ... n^1.
$endgroup$
– ponikoli
Dec 10 '18 at 19:44
$begingroup$
The first row has $n$ objects that you can put in any order, so there are $n!$ ways to do it.
$endgroup$
– Ross Millikan
Dec 10 '18 at 20:52
$begingroup$
Then the second row has D(n!) ways to do it. The third D(D(n!)) etc..?
$endgroup$
– ponikoli
Dec 11 '18 at 9:00
$begingroup$
So for the first row I think there are n^n ways we can color the first row. So for the second row there are D(n^n) ways to color it? But how do I continue this?
$endgroup$
– ponikoli
Dec 10 '18 at 19:20
$begingroup$
So for the first row I think there are n^n ways we can color the first row. So for the second row there are D(n^n) ways to color it? But how do I continue this?
$endgroup$
– ponikoli
Dec 10 '18 at 19:20
$begingroup$
No, you need one of each color in the first row, so there are fewer. How many?
$endgroup$
– Ross Millikan
Dec 10 '18 at 19:35
$begingroup$
No, you need one of each color in the first row, so there are fewer. How many?
$endgroup$
– Ross Millikan
Dec 10 '18 at 19:35
$begingroup$
There is n^n * n^(n-1) * n^(n-2) * n^(n-3) ... n^1.
$endgroup$
– ponikoli
Dec 10 '18 at 19:44
$begingroup$
There is n^n * n^(n-1) * n^(n-2) * n^(n-3) ... n^1.
$endgroup$
– ponikoli
Dec 10 '18 at 19:44
$begingroup$
The first row has $n$ objects that you can put in any order, so there are $n!$ ways to do it.
$endgroup$
– Ross Millikan
Dec 10 '18 at 20:52
$begingroup$
The first row has $n$ objects that you can put in any order, so there are $n!$ ways to do it.
$endgroup$
– Ross Millikan
Dec 10 '18 at 20:52
$begingroup$
Then the second row has D(n!) ways to do it. The third D(D(n!)) etc..?
$endgroup$
– ponikoli
Dec 11 '18 at 9:00
$begingroup$
Then the second row has D(n!) ways to do it. The third D(D(n!)) etc..?
$endgroup$
– ponikoli
Dec 11 '18 at 9:00
|
show 6 more comments
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%2f3034075%2fderrangments-function-for-coloring-a-chess-table%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$
Where did this question come from?
$endgroup$
– coffeemath
Dec 10 '18 at 15:46