how to find the asymptotic growth of f
up vote
-1
down vote
favorite
The question is:
Let $$S_n=left{tinmathbb{N}mid ttext{ does not contain }ntext{ consectuive }4'text{s}right}$$ E.g. $2464in S_2$, but $2544$ is not.
Let $$f(n)=sum_{sin S_n}frac{1}{s}$$
Prove that $f(n)$ is finite and find the asymptotic growth of $f$.
I have tried to find out the number of $d$-digit numbers in $S_2$ for any integer $d$. Then approximate the value of the inverse of all these $d$-digit numbers in $S_2$. Then generalize the number of $d$-digit numbers in $S_n$ for any integer $d,n$.
I find it hard to find the number of $d$-digit numbers in $S_3$ for any integer $d$. Because $S_3$ allows the numbers to have two places having $2$ consecutive $4$'s, like $44544,544344$ and $4454$ is also in $S_3$.
Then I run out of ideas. How can I do this question?
summation permutations asymptotics infinity
add a comment |
up vote
-1
down vote
favorite
The question is:
Let $$S_n=left{tinmathbb{N}mid ttext{ does not contain }ntext{ consectuive }4'text{s}right}$$ E.g. $2464in S_2$, but $2544$ is not.
Let $$f(n)=sum_{sin S_n}frac{1}{s}$$
Prove that $f(n)$ is finite and find the asymptotic growth of $f$.
I have tried to find out the number of $d$-digit numbers in $S_2$ for any integer $d$. Then approximate the value of the inverse of all these $d$-digit numbers in $S_2$. Then generalize the number of $d$-digit numbers in $S_n$ for any integer $d,n$.
I find it hard to find the number of $d$-digit numbers in $S_3$ for any integer $d$. Because $S_3$ allows the numbers to have two places having $2$ consecutive $4$'s, like $44544,544344$ and $4454$ is also in $S_3$.
Then I run out of ideas. How can I do this question?
summation permutations asymptotics infinity
1
Welcome to MSE. For some basic information about writing mathematics at this site see, e.g., basic help on mathjax notation, mathjax tutorial and quick reference, main meta site math tutorial and equation editing how-to.
– José Carlos Santos
Nov 25 at 14:15
add a comment |
up vote
-1
down vote
favorite
up vote
-1
down vote
favorite
The question is:
Let $$S_n=left{tinmathbb{N}mid ttext{ does not contain }ntext{ consectuive }4'text{s}right}$$ E.g. $2464in S_2$, but $2544$ is not.
Let $$f(n)=sum_{sin S_n}frac{1}{s}$$
Prove that $f(n)$ is finite and find the asymptotic growth of $f$.
I have tried to find out the number of $d$-digit numbers in $S_2$ for any integer $d$. Then approximate the value of the inverse of all these $d$-digit numbers in $S_2$. Then generalize the number of $d$-digit numbers in $S_n$ for any integer $d,n$.
I find it hard to find the number of $d$-digit numbers in $S_3$ for any integer $d$. Because $S_3$ allows the numbers to have two places having $2$ consecutive $4$'s, like $44544,544344$ and $4454$ is also in $S_3$.
Then I run out of ideas. How can I do this question?
summation permutations asymptotics infinity
The question is:
Let $$S_n=left{tinmathbb{N}mid ttext{ does not contain }ntext{ consectuive }4'text{s}right}$$ E.g. $2464in S_2$, but $2544$ is not.
Let $$f(n)=sum_{sin S_n}frac{1}{s}$$
Prove that $f(n)$ is finite and find the asymptotic growth of $f$.
I have tried to find out the number of $d$-digit numbers in $S_2$ for any integer $d$. Then approximate the value of the inverse of all these $d$-digit numbers in $S_2$. Then generalize the number of $d$-digit numbers in $S_n$ for any integer $d,n$.
I find it hard to find the number of $d$-digit numbers in $S_3$ for any integer $d$. Because $S_3$ allows the numbers to have two places having $2$ consecutive $4$'s, like $44544,544344$ and $4454$ is also in $S_3$.
Then I run out of ideas. How can I do this question?
summation permutations asymptotics infinity
summation permutations asymptotics infinity
edited Nov 25 at 14:26
asked Nov 25 at 14:02
idunno
71
71
1
Welcome to MSE. For some basic information about writing mathematics at this site see, e.g., basic help on mathjax notation, mathjax tutorial and quick reference, main meta site math tutorial and equation editing how-to.
– José Carlos Santos
Nov 25 at 14:15
add a comment |
1
Welcome to MSE. For some basic information about writing mathematics at this site see, e.g., basic help on mathjax notation, mathjax tutorial and quick reference, main meta site math tutorial and equation editing how-to.
– José Carlos Santos
Nov 25 at 14:15
1
1
Welcome to MSE. For some basic information about writing mathematics at this site see, e.g., basic help on mathjax notation, mathjax tutorial and quick reference, main meta site math tutorial and equation editing how-to.
– José Carlos Santos
Nov 25 at 14:15
Welcome to MSE. For some basic information about writing mathematics at this site see, e.g., basic help on mathjax notation, mathjax tutorial and quick reference, main meta site math tutorial and equation editing how-to.
– José Carlos Santos
Nov 25 at 14:15
add a comment |
active
oldest
votes
active
oldest
votes
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.
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%2fmath.stackexchange.com%2fquestions%2f3012873%2fhow-to-find-the-asymptotic-growth-of-f%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
1
Welcome to MSE. For some basic information about writing mathematics at this site see, e.g., basic help on mathjax notation, mathjax tutorial and quick reference, main meta site math tutorial and equation editing how-to.
– José Carlos Santos
Nov 25 at 14:15