Need help with Pattern problem
$begingroup$
Letters $A$ to $J$ is a random number.
If only $A$ is used. There is just $A$. Which is $1$ scenario
If $A$ and $B$ are used. There are $2$ scenarios. $(A=B) (A<>B)$
If$ A, B$ and $C$ are used. There are $5$ scenarios.
$(A=B,A<>C)(A=C,A<>B)(B=C,B<>A)(A<>B<>C)(A=B=C)$
If all $10$ letters are used. How many possible scenarios are there?
pattern-recognition
$endgroup$
add a comment |
$begingroup$
Letters $A$ to $J$ is a random number.
If only $A$ is used. There is just $A$. Which is $1$ scenario
If $A$ and $B$ are used. There are $2$ scenarios. $(A=B) (A<>B)$
If$ A, B$ and $C$ are used. There are $5$ scenarios.
$(A=B,A<>C)(A=C,A<>B)(B=C,B<>A)(A<>B<>C)(A=B=C)$
If all $10$ letters are used. How many possible scenarios are there?
pattern-recognition
$endgroup$
add a comment |
$begingroup$
Letters $A$ to $J$ is a random number.
If only $A$ is used. There is just $A$. Which is $1$ scenario
If $A$ and $B$ are used. There are $2$ scenarios. $(A=B) (A<>B)$
If$ A, B$ and $C$ are used. There are $5$ scenarios.
$(A=B,A<>C)(A=C,A<>B)(B=C,B<>A)(A<>B<>C)(A=B=C)$
If all $10$ letters are used. How many possible scenarios are there?
pattern-recognition
$endgroup$
Letters $A$ to $J$ is a random number.
If only $A$ is used. There is just $A$. Which is $1$ scenario
If $A$ and $B$ are used. There are $2$ scenarios. $(A=B) (A<>B)$
If$ A, B$ and $C$ are used. There are $5$ scenarios.
$(A=B,A<>C)(A=C,A<>B)(B=C,B<>A)(A<>B<>C)(A=B=C)$
If all $10$ letters are used. How many possible scenarios are there?
pattern-recognition
pattern-recognition
edited Jan 16 at 3:28
Andrews
1,2812422
1,2812422
asked Jan 16 at 1:29
Elton LimElton Lim
1
1
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
It appears that you are looking for Bell numbers, the number of equivalence relations on a finite set. $B_{10}=115975$
$endgroup$
add a comment |
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%2f3075203%2fneed-help-with-pattern-problem%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$
It appears that you are looking for Bell numbers, the number of equivalence relations on a finite set. $B_{10}=115975$
$endgroup$
add a comment |
$begingroup$
It appears that you are looking for Bell numbers, the number of equivalence relations on a finite set. $B_{10}=115975$
$endgroup$
add a comment |
$begingroup$
It appears that you are looking for Bell numbers, the number of equivalence relations on a finite set. $B_{10}=115975$
$endgroup$
It appears that you are looking for Bell numbers, the number of equivalence relations on a finite set. $B_{10}=115975$
answered Jan 16 at 1:43
saulspatzsaulspatz
17.1k31435
17.1k31435
add a comment |
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%2f3075203%2fneed-help-with-pattern-problem%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