Pattern recognition using a, b, c, d, and e
I need to find the solution of this pattern:
{a,b,c}, {c,d,e}, ?, ?, ?, {b,c,e}, {a,c,d}, {b,c,d}, {a,c,e}, ?
The solution should be something like this:
{a,b,c}, {c,d,e} {x,x,x} {x,x,x} {x,x,x},{b,c,e},{a,c,d}, {b,c,d}, {a,c,e}, {x,x,x}
where instead of the x you should replace letters.
Source: http://zagaza.ru/za548.htm
logical-deduction pattern combinatorics
edited 5 mins ago
Peter Mortensen
1253
asked 9 hours ago
alnesi
457
New contributor
alnesi is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
I need to find the solution of this pattern:
{a,b,c}, {c,d,e}, ?, ?, ?, {b,c,e}, {a,c,d}, {b,c,d}, {a,c,e}, ?
The solution should be something like this:
{a,b,c}, {c,d,e} {x,x,x} {x,x,x} {x,x,x},{b,c,e},{a,c,d}, {b,c,d}, {a,c,e}, {x,x,x}
where instead of the x you should replace letters.
Source: http://zagaza.ru/za548.htm
logical-deduction pattern combinatorics
edited 5 mins ago
Peter Mortensen
1253
asked 9 hours ago
alnesi
457
New contributor
alnesi is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
I need to find the solution of this pattern:
{a,b,c}, {c,d,e}, ?, ?, ?, {b,c,e}, {a,c,d}, {b,c,d}, {a,c,e}, ?
The solution should be something like this:
{a,b,c}, {c,d,e} {x,x,x} {x,x,x} {x,x,x},{b,c,e},{a,c,d}, {b,c,d}, {a,c,e}, {x,x,x}
where instead of the x you should replace letters.
Source: http://zagaza.ru/za548.htm
logical-deduction pattern combinatorics
edited 5 mins ago
Peter Mortensen
1253
asked 9 hours ago
alnesi
457
New contributor
alnesi is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
I need to find the solution of this pattern:
{a,b,c}, {c,d,e}, ?, ?, ?, {b,c,e}, {a,c,d}, {b,c,d}, {a,c,e}, ?
The solution should be something like this:
{a,b,c}, {c,d,e} {x,x,x} {x,x,x} {x,x,x},{b,c,e},{a,c,d}, {b,c,d}, {a,c,e}, {x,x,x}
where instead of the x you should replace letters.
Source: http://zagaza.ru/za548.htm
logical-deduction pattern combinatorics
logical-deduction pattern combinatorics
edited 5 mins ago
Peter Mortensen
1253
asked 9 hours ago
alnesi
457
New contributor
alnesi is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited 5 mins ago
Peter Mortensen
1253
asked 9 hours ago
alnesi
457
New contributor
alnesi is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited 5 mins ago
Peter Mortensen
1253
edited 5 mins ago
Peter Mortensen
1253
edited 5 mins ago
Peter Mortensen
1253
1253
asked 9 hours ago
alnesi
457
New contributor
alnesi is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 9 hours ago
alnesi
457
asked 9 hours ago
alnesi
457
457
New contributor
alnesi is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
alnesi is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
alnesi is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
How about:
{a,b,c}, {c,d,e}, {a,b,d}, {b,d,e}, {a,b,e}, {b,c,e}, {a,c,d}, {b,c,d}, {a,c,e}, {a,d,e}.
Because:
We know there are $binom53=10$ variants, and there are $10$ slots, so a one-to-one correspondence seems likely.
The lexical order is {a,b,c}, {a,b,d}, {a,b,e}, {a,c,d}, {a,c,e}, {a,d,e}, {b,c,d}, {b,c,e}, {b,d,e}, {c,d,e}.
Alternate indices cover 1,2,3,4,5 and 10,9,8,7,6, i.e. 1,10,2,9,3,8,4,7,5,6.
answered 7 hours ago
JonMark Perry
17.6k63585
This is logical. I was going for Permutations instead.
– ABcDexter
7 hours ago
thanks for answering,could you please explain me how you understood the order of those variants,i mean inside the x.x.x at the beginning there could even be C as first letter,please explain that to an heretical guy xD
– alnesi
6 hours ago
do u have any other contact,like discord,steam even a twitter account that you use to communicate thanks in advace
– alnesi
6 hours ago
@alnesi I think the explanation is already very good and clear. maybe you don't see how the lexical order is determined? Just take three letters, and order them as if they were words: "abc", "abd",... Once that is established, the index alternation should pretty easy.
– Silly Freak
6 hours ago
oh thank you,i just wanted to know that :D .Really thank you
– alnesi
6 hours ago
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: "559"
};
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: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
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
});
}
});
alnesi is a new contributor. Be nice, and check out our Code of Conduct.
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%2fpuzzling.stackexchange.com%2fquestions%2f78174%2fpattern-recognition-using-a-b-c-d-and-e%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
How about:
{a,b,c}, {c,d,e}, {a,b,d}, {b,d,e}, {a,b,e}, {b,c,e}, {a,c,d}, {b,c,d}, {a,c,e}, {a,d,e}.
Because:
We know there are $binom53=10$ variants, and there are $10$ slots, so a one-to-one correspondence seems likely.
The lexical order is {a,b,c}, {a,b,d}, {a,b,e}, {a,c,d}, {a,c,e}, {a,d,e}, {b,c,d}, {b,c,e}, {b,d,e}, {c,d,e}.
Alternate indices cover 1,2,3,4,5 and 10,9,8,7,6, i.e. 1,10,2,9,3,8,4,7,5,6.
answered 7 hours ago
JonMark Perry
17.6k63585
This is logical. I was going for Permutations instead.
– ABcDexter
7 hours ago
thanks for answering,could you please explain me how you understood the order of those variants,i mean inside the x.x.x at the beginning there could even be C as first letter,please explain that to an heretical guy xD
– alnesi
6 hours ago
do u have any other contact,like discord,steam even a twitter account that you use to communicate thanks in advace
– alnesi
6 hours ago
@alnesi I think the explanation is already very good and clear. maybe you don't see how the lexical order is determined? Just take three letters, and order them as if they were words: "abc", "abd",... Once that is established, the index alternation should pretty easy.
– Silly Freak
6 hours ago
oh thank you,i just wanted to know that :D .Really thank you
– alnesi
6 hours ago
add a comment |
How about:
{a,b,c}, {c,d,e}, {a,b,d}, {b,d,e}, {a,b,e}, {b,c,e}, {a,c,d}, {b,c,d}, {a,c,e}, {a,d,e}.
Because:
We know there are $binom53=10$ variants, and there are $10$ slots, so a one-to-one correspondence seems likely.
The lexical order is {a,b,c}, {a,b,d}, {a,b,e}, {a,c,d}, {a,c,e}, {a,d,e}, {b,c,d}, {b,c,e}, {b,d,e}, {c,d,e}.
Alternate indices cover 1,2,3,4,5 and 10,9,8,7,6, i.e. 1,10,2,9,3,8,4,7,5,6.
answered 7 hours ago
JonMark Perry
17.6k63585
This is logical. I was going for Permutations instead.
– ABcDexter
7 hours ago
thanks for answering,could you please explain me how you understood the order of those variants,i mean inside the x.x.x at the beginning there could even be C as first letter,please explain that to an heretical guy xD
– alnesi
6 hours ago
do u have any other contact,like discord,steam even a twitter account that you use to communicate thanks in advace
– alnesi
6 hours ago
@alnesi I think the explanation is already very good and clear. maybe you don't see how the lexical order is determined? Just take three letters, and order them as if they were words: "abc", "abd",... Once that is established, the index alternation should pretty easy.
– Silly Freak
6 hours ago
oh thank you,i just wanted to know that :D .Really thank you
– alnesi
6 hours ago
add a comment |
How about:
{a,b,c}, {c,d,e}, {a,b,d}, {b,d,e}, {a,b,e}, {b,c,e}, {a,c,d}, {b,c,d}, {a,c,e}, {a,d,e}.
Because:
We know there are $binom53=10$ variants, and there are $10$ slots, so a one-to-one correspondence seems likely.
The lexical order is {a,b,c}, {a,b,d}, {a,b,e}, {a,c,d}, {a,c,e}, {a,d,e}, {b,c,d}, {b,c,e}, {b,d,e}, {c,d,e}.
Alternate indices cover 1,2,3,4,5 and 10,9,8,7,6, i.e. 1,10,2,9,3,8,4,7,5,6.
answered 7 hours ago
JonMark Perry
17.6k63585
How about:
{a,b,c}, {c,d,e}, {a,b,d}, {b,d,e}, {a,b,e}, {b,c,e}, {a,c,d}, {b,c,d}, {a,c,e}, {a,d,e}.
Because:
We know there are $binom53=10$ variants, and there are $10$ slots, so a one-to-one correspondence seems likely.
The lexical order is {a,b,c}, {a,b,d}, {a,b,e}, {a,c,d}, {a,c,e}, {a,d,e}, {b,c,d}, {b,c,e}, {b,d,e}, {c,d,e}.
Alternate indices cover 1,2,3,4,5 and 10,9,8,7,6, i.e. 1,10,2,9,3,8,4,7,5,6.
answered 7 hours ago
JonMark Perry
17.6k63585
answered 7 hours ago
JonMark Perry
17.6k63585
answered 7 hours ago
JonMark Perry
17.6k63585
answered 7 hours ago
JonMark Perry
17.6k63585
17.6k63585
This is logical. I was going for Permutations instead.
– ABcDexter
7 hours ago
thanks for answering,could you please explain me how you understood the order of those variants,i mean inside the x.x.x at the beginning there could even be C as first letter,please explain that to an heretical guy xD
– alnesi
6 hours ago
do u have any other contact,like discord,steam even a twitter account that you use to communicate thanks in advace
– alnesi
6 hours ago
@alnesi I think the explanation is already very good and clear. maybe you don't see how the lexical order is determined? Just take three letters, and order them as if they were words: "abc", "abd",... Once that is established, the index alternation should pretty easy.
– Silly Freak
6 hours ago
oh thank you,i just wanted to know that :D .Really thank you
– alnesi
6 hours ago
add a comment |
This is logical. I was going for Permutations instead.
– ABcDexter
7 hours ago
thanks for answering,could you please explain me how you understood the order of those variants,i mean inside the x.x.x at the beginning there could even be C as first letter,please explain that to an heretical guy xD
– alnesi
6 hours ago
do u have any other contact,like discord,steam even a twitter account that you use to communicate thanks in advace
– alnesi
6 hours ago
@alnesi I think the explanation is already very good and clear. maybe you don't see how the lexical order is determined? Just take three letters, and order them as if they were words: "abc", "abd",... Once that is established, the index alternation should pretty easy.
– Silly Freak
6 hours ago
oh thank you,i just wanted to know that :D .Really thank you
– alnesi
6 hours ago
This is logical. I was going for Permutations instead.
– ABcDexter
7 hours ago
This is logical. I was going for Permutations instead.
– ABcDexter
7 hours ago
thanks for answering,could you please explain me how you understood the order of those variants,i mean inside the x.x.x at the beginning there could even be C as first letter,please explain that to an heretical guy xD
– alnesi
6 hours ago
thanks for answering,could you please explain me how you understood the order of those variants,i mean inside the x.x.x at the beginning there could even be C as first letter,please explain that to an heretical guy xD
– alnesi
6 hours ago
do u have any other contact,like discord,steam even a twitter account that you use to communicate thanks in advace
– alnesi
6 hours ago
do u have any other contact,like discord,steam even a twitter account that you use to communicate thanks in advace
– alnesi
6 hours ago
@alnesi I think the explanation is already very good and clear. maybe you don't see how the lexical order is determined? Just take three letters, and order them as if they were words: "abc", "abd",... Once that is established, the index alternation should pretty easy.
– Silly Freak
6 hours ago
@alnesi I think the explanation is already very good and clear. maybe you don't see how the lexical order is determined? Just take three letters, and order them as if they were words: "abc", "abd",... Once that is established, the index alternation should pretty easy.
– Silly Freak
6 hours ago
oh thank you,i just wanted to know that :D .Really thank you
– alnesi
6 hours ago
oh thank you,i just wanted to know that :D .Really thank you
– alnesi
6 hours ago
add a comment |
alnesi is a new contributor. Be nice, and check out our Code of Conduct.
alnesi is a new contributor. Be nice, and check out our Code of Conduct.
alnesi is a new contributor. Be nice, and check out our Code of Conduct.
alnesi is a new contributor. Be nice, and check out our Code of Conduct.
Thanks for contributing an answer to Puzzling 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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2fpuzzling.stackexchange.com%2fquestions%2f78174%2fpattern-recognition-using-a-b-c-d-and-e%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
