How many strings of n bits are there which differ by exactly m bits?
0
$begingroup$
For example:
If n = 8 and m = 0: ans = 1
If n = 8 and m = 1: ans = 8
If n = 8 and m = 2: ans = ?
If n =256 and m = 3: ans = ?
linear-algebra combinatorics bit-strings
asked Jan 7 at 19:28
d eid ei
31
New contributor
d ei is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
0
$begingroup$
For example:
If n = 8 and m = 0: ans = 1
If n = 8 and m = 1: ans = 8
If n = 8 and m = 2: ans = ?
If n =256 and m = 3: ans = ?
linear-algebra combinatorics bit-strings
asked Jan 7 at 19:28
d eid ei
31
New contributor
d ei is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
$begingroup$
Isn't this just $nchoose m$? Perhaps I am misinterpreting the question..
$endgroup$
– John Doe
Jan 7 at 19:30
add a comment |
0
0
0
$begingroup$
For example:
If n = 8 and m = 0: ans = 1
If n = 8 and m = 1: ans = 8
If n = 8 and m = 2: ans = ?
If n =256 and m = 3: ans = ?
linear-algebra combinatorics bit-strings
asked Jan 7 at 19:28
d eid ei
31
New contributor
d ei is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
For example:
If n = 8 and m = 0: ans = 1
If n = 8 and m = 1: ans = 8
If n = 8 and m = 2: ans = ?
If n =256 and m = 3: ans = ?
linear-algebra combinatorics bit-strings
linear-algebra combinatorics bit-strings
asked Jan 7 at 19:28
d eid ei
31
New contributor
d ei is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked Jan 7 at 19:28
d eid ei
31
New contributor
d ei is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked Jan 7 at 19:28
d eid ei
31
New contributor
d ei is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked Jan 7 at 19:28
d eid ei
31
asked Jan 7 at 19:28
d eid ei
31
31
New contributor
d ei is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
d ei is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
d ei is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$begingroup$
Isn't this just $nchoose m$? Perhaps I am misinterpreting the question..
$endgroup$
– John Doe
Jan 7 at 19:30
add a comment |
$begingroup$
Isn't this just $nchoose m$? Perhaps I am misinterpreting the question..
$endgroup$
– John Doe
Jan 7 at 19:30
$begingroup$
Isn't this just $nchoose m$? Perhaps I am misinterpreting the question..
$endgroup$
– John Doe
Jan 7 at 19:30
$begingroup$
Isn't this just $nchoose m$? Perhaps I am misinterpreting the question..
$endgroup$
– John Doe
Jan 7 at 19:30
add a comment |
1 Answer
1
active
oldest
votes
1
$begingroup$
Just choose the $m$ bits out of $n$ to be different, so $n choose m$
edited Jan 7 at 19:31
John Doe
11.1k11238
answered Jan 7 at 19:30
Ross MillikanRoss Millikan
293k23197372
$endgroup$
$begingroup$
You're right of course. Thanks!
$endgroup$
– d ei
Jan 9 at 20:50
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
});
}
});
d ei is a new contributor. Be nice, and check out our Code of Conduct.
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%2f3065393%2fhow-many-strings-of-n-bits-are-there-which-differ-by-exactly-m-bits%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
1
$begingroup$
Just choose the $m$ bits out of $n$ to be different, so $n choose m$
edited Jan 7 at 19:31
John Doe
11.1k11238
answered Jan 7 at 19:30
Ross MillikanRoss Millikan
293k23197372
$endgroup$
$begingroup$
You're right of course. Thanks!
$endgroup$
– d ei
Jan 9 at 20:50
add a comment |
1
$begingroup$
Just choose the $m$ bits out of $n$ to be different, so $n choose m$
edited Jan 7 at 19:31
John Doe
11.1k11238
answered Jan 7 at 19:30
Ross MillikanRoss Millikan
293k23197372
$endgroup$
$begingroup$
You're right of course. Thanks!
$endgroup$
– d ei
Jan 9 at 20:50
add a comment |
1
1
1
$begingroup$
Just choose the $m$ bits out of $n$ to be different, so $n choose m$
edited Jan 7 at 19:31
John Doe
11.1k11238
answered Jan 7 at 19:30
Ross MillikanRoss Millikan
293k23197372
$endgroup$
Just choose the $m$ bits out of $n$ to be different, so $n choose m$
edited Jan 7 at 19:31
John Doe
11.1k11238
answered Jan 7 at 19:30
Ross MillikanRoss Millikan
293k23197372
edited Jan 7 at 19:31
John Doe
11.1k11238
edited Jan 7 at 19:31
John Doe
11.1k11238
edited Jan 7 at 19:31
John Doe
11.1k11238
11.1k11238
answered Jan 7 at 19:30
Ross MillikanRoss Millikan
293k23197372
answered Jan 7 at 19:30
Ross MillikanRoss Millikan
293k23197372
answered Jan 7 at 19:30
Ross MillikanRoss Millikan
293k23197372
293k23197372
$begingroup$
You're right of course. Thanks!
$endgroup$
– d ei
Jan 9 at 20:50
add a comment |
$begingroup$
You're right of course. Thanks!
$endgroup$
– d ei
Jan 9 at 20:50
$begingroup$
You're right of course. Thanks!
$endgroup$
– d ei
Jan 9 at 20:50
$begingroup$
You're right of course. Thanks!
$endgroup$
– d ei
Jan 9 at 20:50
add a comment |
d ei is a new contributor. Be nice, and check out our Code of Conduct.
draft saved
draft discarded
d ei is a new contributor. Be nice, and check out our Code of Conduct.
d ei is a new contributor. Be nice, and check out our Code of Conduct.
d ei is a new contributor. Be nice, and check out our Code of Conduct.
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.
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%2f3065393%2fhow-many-strings-of-n-bits-are-there-which-differ-by-exactly-m-bits%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$
Isn't this just $nchoose m$? Perhaps I am misinterpreting the question..
$endgroup$
– John Doe
Jan 7 at 19:30