Counting problem k-tuples
$begingroup$
Let two k-tuples are said to be "2-different" if it is differ from at least two positions otherwise called 2-same . Which means (1,2,3,4) is 2-same with (1,2,3,5) and (6,2,3,4).
Now let we have 3 numbers for each coordinate of k-tuple than there are at most 3^k different k- tuples can be formed.
My question is if we have 3 numbers for each coordinate of k- tuple than at most how many 2-different k- tuples can be possible?
combinatorics
$endgroup$
add a comment |
$begingroup$
Let two k-tuples are said to be "2-different" if it is differ from at least two positions otherwise called 2-same . Which means (1,2,3,4) is 2-same with (1,2,3,5) and (6,2,3,4).
Now let we have 3 numbers for each coordinate of k-tuple than there are at most 3^k different k- tuples can be formed.
My question is if we have 3 numbers for each coordinate of k- tuple than at most how many 2-different k- tuples can be possible?
combinatorics
$endgroup$
1
$begingroup$
Please edit your question to show what you have attempted and explain where you are stuck so that you receive responses that address the specific difficulties you are encountering. For instance, have you worked out the results for $k = 1, 2, 3, 4, 5$? This tutorial explains how to typeset mathematics on this site.
$endgroup$
– N. F. Taussig
Jan 25 at 10:50
add a comment |
$begingroup$
Let two k-tuples are said to be "2-different" if it is differ from at least two positions otherwise called 2-same . Which means (1,2,3,4) is 2-same with (1,2,3,5) and (6,2,3,4).
Now let we have 3 numbers for each coordinate of k-tuple than there are at most 3^k different k- tuples can be formed.
My question is if we have 3 numbers for each coordinate of k- tuple than at most how many 2-different k- tuples can be possible?
combinatorics
$endgroup$
Let two k-tuples are said to be "2-different" if it is differ from at least two positions otherwise called 2-same . Which means (1,2,3,4) is 2-same with (1,2,3,5) and (6,2,3,4).
Now let we have 3 numbers for each coordinate of k-tuple than there are at most 3^k different k- tuples can be formed.
My question is if we have 3 numbers for each coordinate of k- tuple than at most how many 2-different k- tuples can be possible?
combinatorics
combinatorics
asked Jan 25 at 9:27


SOHAIL ZAFARSOHAIL ZAFAR
1
1
1
$begingroup$
Please edit your question to show what you have attempted and explain where you are stuck so that you receive responses that address the specific difficulties you are encountering. For instance, have you worked out the results for $k = 1, 2, 3, 4, 5$? This tutorial explains how to typeset mathematics on this site.
$endgroup$
– N. F. Taussig
Jan 25 at 10:50
add a comment |
1
$begingroup$
Please edit your question to show what you have attempted and explain where you are stuck so that you receive responses that address the specific difficulties you are encountering. For instance, have you worked out the results for $k = 1, 2, 3, 4, 5$? This tutorial explains how to typeset mathematics on this site.
$endgroup$
– N. F. Taussig
Jan 25 at 10:50
1
1
$begingroup$
Please edit your question to show what you have attempted and explain where you are stuck so that you receive responses that address the specific difficulties you are encountering. For instance, have you worked out the results for $k = 1, 2, 3, 4, 5$? This tutorial explains how to typeset mathematics on this site.
$endgroup$
– N. F. Taussig
Jan 25 at 10:50
$begingroup$
Please edit your question to show what you have attempted and explain where you are stuck so that you receive responses that address the specific difficulties you are encountering. For instance, have you worked out the results for $k = 1, 2, 3, 4, 5$? This tutorial explains how to typeset mathematics on this site.
$endgroup$
– N. F. Taussig
Jan 25 at 10:50
add a comment |
0
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',
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%2f3086911%2fcounting-problem-k-tuples%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
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%2f3086911%2fcounting-problem-k-tuples%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
$begingroup$
Please edit your question to show what you have attempted and explain where you are stuck so that you receive responses that address the specific difficulties you are encountering. For instance, have you worked out the results for $k = 1, 2, 3, 4, 5$? This tutorial explains how to typeset mathematics on this site.
$endgroup$
– N. F. Taussig
Jan 25 at 10:50