If $|frac{a_{n+1}}{a_n}|leq q,forall ngeq n_0$ Is...
$begingroup$
Is there a trick how to deal with those counting Problems? These kind of problem also occur quite often in combinatorics too. What is the rule of thumb?
algebra-precalculus
$endgroup$
add a comment |
$begingroup$
Is there a trick how to deal with those counting Problems? These kind of problem also occur quite often in combinatorics too. What is the rule of thumb?
algebra-precalculus
$endgroup$
$begingroup$
There are simply $p$ terms on the left (look at the indices of the numerators) and each term contributes a $q$ on the right. Why does this question have anything to do with number theory?
$endgroup$
– user587192
Jan 31 at 18:08
$begingroup$
The first index is p and the last is 1. If p is for example 1 I have got 1. That means p Terms establishing the induction base. If the first index is $p+1$ then the second must be p using the inductionhypothesis gives p numbers + 1 for the p+1. Okay I thought since it was a counting Problem I should put it under the numbertheory tag.
$endgroup$
– RM777
Jan 31 at 19:22
add a comment |
$begingroup$
Is there a trick how to deal with those counting Problems? These kind of problem also occur quite often in combinatorics too. What is the rule of thumb?
algebra-precalculus
$endgroup$
Is there a trick how to deal with those counting Problems? These kind of problem also occur quite often in combinatorics too. What is the rule of thumb?
algebra-precalculus
algebra-precalculus
edited Jan 31 at 21:16


Jyrki Lahtonen
110k13171385
110k13171385
asked Jan 23 at 17:17
RM777RM777
38312
38312
$begingroup$
There are simply $p$ terms on the left (look at the indices of the numerators) and each term contributes a $q$ on the right. Why does this question have anything to do with number theory?
$endgroup$
– user587192
Jan 31 at 18:08
$begingroup$
The first index is p and the last is 1. If p is for example 1 I have got 1. That means p Terms establishing the induction base. If the first index is $p+1$ then the second must be p using the inductionhypothesis gives p numbers + 1 for the p+1. Okay I thought since it was a counting Problem I should put it under the numbertheory tag.
$endgroup$
– RM777
Jan 31 at 19:22
add a comment |
$begingroup$
There are simply $p$ terms on the left (look at the indices of the numerators) and each term contributes a $q$ on the right. Why does this question have anything to do with number theory?
$endgroup$
– user587192
Jan 31 at 18:08
$begingroup$
The first index is p and the last is 1. If p is for example 1 I have got 1. That means p Terms establishing the induction base. If the first index is $p+1$ then the second must be p using the inductionhypothesis gives p numbers + 1 for the p+1. Okay I thought since it was a counting Problem I should put it under the numbertheory tag.
$endgroup$
– RM777
Jan 31 at 19:22
$begingroup$
There are simply $p$ terms on the left (look at the indices of the numerators) and each term contributes a $q$ on the right. Why does this question have anything to do with number theory?
$endgroup$
– user587192
Jan 31 at 18:08
$begingroup$
There are simply $p$ terms on the left (look at the indices of the numerators) and each term contributes a $q$ on the right. Why does this question have anything to do with number theory?
$endgroup$
– user587192
Jan 31 at 18:08
$begingroup$
The first index is p and the last is 1. If p is for example 1 I have got 1. That means p Terms establishing the induction base. If the first index is $p+1$ then the second must be p using the inductionhypothesis gives p numbers + 1 for the p+1. Okay I thought since it was a counting Problem I should put it under the numbertheory tag.
$endgroup$
– RM777
Jan 31 at 19:22
$begingroup$
The first index is p and the last is 1. If p is for example 1 I have got 1. That means p Terms establishing the induction base. If the first index is $p+1$ then the second must be p using the inductionhypothesis gives p numbers + 1 for the p+1. Okay I thought since it was a counting Problem I should put it under the numbertheory tag.
$endgroup$
– RM777
Jan 31 at 19:22
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%2f3084778%2fif-fraca-n1a-n-leq-q-forall-n-geq-n-0-is-fraca-n-0pa-n%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%2f3084778%2fif-fraca-n1a-n-leq-q-forall-n-geq-n-0-is-fraca-n-0pa-n%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$
There are simply $p$ terms on the left (look at the indices of the numerators) and each term contributes a $q$ on the right. Why does this question have anything to do with number theory?
$endgroup$
– user587192
Jan 31 at 18:08
$begingroup$
The first index is p and the last is 1. If p is for example 1 I have got 1. That means p Terms establishing the induction base. If the first index is $p+1$ then the second must be p using the inductionhypothesis gives p numbers + 1 for the p+1. Okay I thought since it was a counting Problem I should put it under the numbertheory tag.
$endgroup$
– RM777
Jan 31 at 19:22