Integers $1,2,…,n$ are placed in a way that each value is either bigger or smaller than all preceding...
$begingroup$
Firstly I should mention an example of this patter which is also given in the book that is for $n=5$ $3,2,4,1,5$ is valid whereas $3,2,5,1,4$ is not.
I have calculated that for $n=3$, the number of ways is $1+2+1=4$, for $n=4$, the number of ways is $1+3+3+1=8$, for $n=5$, the number of ways is $1+4+6+4+1=16$.
But even I can't get the general implication. Can anybody suggest me a proper way out to solve it?
Thanks for answer in advance.
number-theory permutations combinations
asked Jan 1 at 17:53
Biswarup SahaBiswarup Saha
602110
$endgroup$
add a comment |
$begingroup$
Firstly I should mention an example of this patter which is also given in the book that is for $n=5$ $3,2,4,1,5$ is valid whereas $3,2,5,1,4$ is not.
I have calculated that for $n=3$, the number of ways is $1+2+1=4$, for $n=4$, the number of ways is $1+3+3+1=8$, for $n=5$, the number of ways is $1+4+6+4+1=16$.
But even I can't get the general implication. Can anybody suggest me a proper way out to solve it?
Thanks for answer in advance.
number-theory permutations combinations
asked Jan 1 at 17:53
Biswarup SahaBiswarup Saha
602110
$endgroup$
$begingroup$
Hint: for the $n$ odd case, what if the integers were $-frac{n-1}{2},ldots,0,ldots,frac{n-1}{2}$? Similarly, if $n$ is even, what if they were $-frac{n-2}{2},ldots,0,ldots,frac{n}{2}$? Now notice that this translation doesn't change anything.
$endgroup$
– user3482749
Jan 1 at 17:55
$begingroup$
Note: swapping $i$ and $n+1-i$ throughout changes a "good" sequence into another. It follows that the answer must always be even....calling that $25$ into question.
$endgroup$
– lulu
Jan 1 at 18:02
add a comment |
$begingroup$
Firstly I should mention an example of this patter which is also given in the book that is for $n=5$ $3,2,4,1,5$ is valid whereas $3,2,5,1,4$ is not.
I have calculated that for $n=3$, the number of ways is $1+2+1=4$, for $n=4$, the number of ways is $1+3+3+1=8$, for $n=5$, the number of ways is $1+4+6+4+1=16$.
But even I can't get the general implication. Can anybody suggest me a proper way out to solve it?
Thanks for answer in advance.
number-theory permutations combinations
asked Jan 1 at 17:53
Biswarup SahaBiswarup Saha
602110
$endgroup$
Firstly I should mention an example of this patter which is also given in the book that is for $n=5$ $3,2,4,1,5$ is valid whereas $3,2,5,1,4$ is not.
I have calculated that for $n=3$, the number of ways is $1+2+1=4$, for $n=4$, the number of ways is $1+3+3+1=8$, for $n=5$, the number of ways is $1+4+6+4+1=16$.
But even I can't get the general implication. Can anybody suggest me a proper way out to solve it?
Thanks for answer in advance.
number-theory permutations combinations
number-theory permutations combinations
asked Jan 1 at 17:53
Biswarup SahaBiswarup Saha
602110
asked Jan 1 at 17:53
Biswarup SahaBiswarup Saha
602110
edited Jan 1 at 18:22
Biswarup Saha
asked Jan 1 at 17:53
Biswarup SahaBiswarup Saha
602110
asked Jan 1 at 17:53
Biswarup SahaBiswarup Saha
602110
asked Jan 1 at 17:53
Biswarup SahaBiswarup Saha
602110
602110
$begingroup$
Hint: for the $n$ odd case, what if the integers were $-frac{n-1}{2},ldots,0,ldots,frac{n-1}{2}$? Similarly, if $n$ is even, what if they were $-frac{n-2}{2},ldots,0,ldots,frac{n}{2}$? Now notice that this translation doesn't change anything.
$endgroup$
– user3482749
Jan 1 at 17:55
$begingroup$
Note: swapping $i$ and $n+1-i$ throughout changes a "good" sequence into another. It follows that the answer must always be even....calling that $25$ into question.
$endgroup$
– lulu
Jan 1 at 18:02
add a comment |
$begingroup$
Hint: for the $n$ odd case, what if the integers were $-frac{n-1}{2},ldots,0,ldots,frac{n-1}{2}$? Similarly, if $n$ is even, what if they were $-frac{n-2}{2},ldots,0,ldots,frac{n}{2}$? Now notice that this translation doesn't change anything.
$endgroup$
– user3482749
Jan 1 at 17:55
$begingroup$
Note: swapping $i$ and $n+1-i$ throughout changes a "good" sequence into another. It follows that the answer must always be even....calling that $25$ into question.
$endgroup$
– lulu
Jan 1 at 18:02
$begingroup$
Hint: for the $n$ odd case, what if the integers were $-frac{n-1}{2},ldots,0,ldots,frac{n-1}{2}$? Similarly, if $n$ is even, what if they were $-frac{n-2}{2},ldots,0,ldots,frac{n}{2}$? Now notice that this translation doesn't change anything.
$endgroup$
– user3482749
Jan 1 at 17:55
$begingroup$
Hint: for the $n$ odd case, what if the integers were $-frac{n-1}{2},ldots,0,ldots,frac{n-1}{2}$? Similarly, if $n$ is even, what if they were $-frac{n-2}{2},ldots,0,ldots,frac{n}{2}$? Now notice that this translation doesn't change anything.
$endgroup$
– user3482749
Jan 1 at 17:55
$begingroup$
Note: swapping $i$ and $n+1-i$ throughout changes a "good" sequence into another. It follows that the answer must always be even....calling that $25$ into question.
$endgroup$
– lulu
Jan 1 at 18:02
$begingroup$
Note: swapping $i$ and $n+1-i$ throughout changes a "good" sequence into another. It follows that the answer must always be even....calling that $25$ into question.
$endgroup$
– lulu
Jan 1 at 18:02
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
You can use induction. Let $A_n$ be the number of such choices for $1,ldots, n$. The number that must go in the last place (the $n$-th place) is either $n$ or 1. Then after the number that goes in the $n$-th place is decided, the number of ways to arrange the remaining $n-1$ numbers in the first $n-1$ places $1,2,ldots, n-1$ is $A_{n-1}$. Thus $A_n = 2A_{n-1}$.
Finish by noting $A_2 = 2$ to get $A_n=2^{n-1}$.
answered Jan 1 at 17:59
MikeMike
4,276412
$endgroup$
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
});
}
});
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%2f3058696%2fintegers-1-2-n-are-placed-in-a-way-that-each-value-is-either-bigger-or-sma%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$
You can use induction. Let $A_n$ be the number of such choices for $1,ldots, n$. The number that must go in the last place (the $n$-th place) is either $n$ or 1. Then after the number that goes in the $n$-th place is decided, the number of ways to arrange the remaining $n-1$ numbers in the first $n-1$ places $1,2,ldots, n-1$ is $A_{n-1}$. Thus $A_n = 2A_{n-1}$.
Finish by noting $A_2 = 2$ to get $A_n=2^{n-1}$.
answered Jan 1 at 17:59
MikeMike
4,276412
$endgroup$
add a comment |
$begingroup$
You can use induction. Let $A_n$ be the number of such choices for $1,ldots, n$. The number that must go in the last place (the $n$-th place) is either $n$ or 1. Then after the number that goes in the $n$-th place is decided, the number of ways to arrange the remaining $n-1$ numbers in the first $n-1$ places $1,2,ldots, n-1$ is $A_{n-1}$. Thus $A_n = 2A_{n-1}$.
Finish by noting $A_2 = 2$ to get $A_n=2^{n-1}$.
answered Jan 1 at 17:59
MikeMike
4,276412
$endgroup$
add a comment |
$begingroup$
You can use induction. Let $A_n$ be the number of such choices for $1,ldots, n$. The number that must go in the last place (the $n$-th place) is either $n$ or 1. Then after the number that goes in the $n$-th place is decided, the number of ways to arrange the remaining $n-1$ numbers in the first $n-1$ places $1,2,ldots, n-1$ is $A_{n-1}$. Thus $A_n = 2A_{n-1}$.
Finish by noting $A_2 = 2$ to get $A_n=2^{n-1}$.
answered Jan 1 at 17:59
MikeMike
4,276412
$endgroup$
You can use induction. Let $A_n$ be the number of such choices for $1,ldots, n$. The number that must go in the last place (the $n$-th place) is either $n$ or 1. Then after the number that goes in the $n$-th place is decided, the number of ways to arrange the remaining $n-1$ numbers in the first $n-1$ places $1,2,ldots, n-1$ is $A_{n-1}$. Thus $A_n = 2A_{n-1}$.
Finish by noting $A_2 = 2$ to get $A_n=2^{n-1}$.
answered Jan 1 at 17:59
MikeMike
4,276412
answered Jan 1 at 17:59
MikeMike
4,276412
answered Jan 1 at 17:59
MikeMike
4,276412
answered Jan 1 at 17:59
MikeMike
4,276412
4,276412
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%2f3058696%2fintegers-1-2-n-are-placed-in-a-way-that-each-value-is-either-bigger-or-sma%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$
Hint: for the $n$ odd case, what if the integers were $-frac{n-1}{2},ldots,0,ldots,frac{n-1}{2}$? Similarly, if $n$ is even, what if they were $-frac{n-2}{2},ldots,0,ldots,frac{n}{2}$? Now notice that this translation doesn't change anything.
$endgroup$
– user3482749
Jan 1 at 17:55
$begingroup$
Note: swapping $i$ and $n+1-i$ throughout changes a "good" sequence into another. It follows that the answer must always be even....calling that $25$ into question.
$endgroup$
– lulu
Jan 1 at 18:02