$T(n)=nT(n−1) + 1$
up vote
-1
down vote
favorite
I'm trying to figure out the order class of this recursion, I know it is of the order $O(n!)$ using substituting method.
$T(n)=n⋅T(n−1)+1$
$T(1)=1$
But I am wondering why I cant apply masters theorem for this function? Also can anyone share any pointers how to identify the recurrence relation that is not applicable using masters theorem.
permutations asymptotics
edited 2 days ago
Patricio
1165
asked Dec 1 at 2:48
Raj
61
New contributor
Raj 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 |
up vote
-1
down vote
favorite
I'm trying to figure out the order class of this recursion, I know it is of the order $O(n!)$ using substituting method.
$T(n)=n⋅T(n−1)+1$
$T(1)=1$
But I am wondering why I cant apply masters theorem for this function? Also can anyone share any pointers how to identify the recurrence relation that is not applicable using masters theorem.
permutations asymptotics
edited 2 days ago
Patricio
1165
asked Dec 1 at 2:48
Raj
61
New contributor
Raj is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
1
This seems to be a duplicate of MSE question 2714609.
– Somos
Dec 1 at 3:21
It does not answer why we cant use masters theorem!
– Raj
Dec 1 at 3:53
The Wikipedia article Master theorm states that the recursion has to be of a certain form which yours is not.
– Somos
Dec 1 at 4:05
More to the point, why do you believe that you can apply the master theorem to this problem?
– saulspatz
Dec 1 at 4:08
From Masters theorem T(n) = aT(n-b) + f(n), I thought I can consider a ~= n, but i am wrong based from your comments.
– Raj
Dec 1 at 4:29
add a comment |
up vote
-1
down vote
favorite
up vote
-1
down vote
favorite
I'm trying to figure out the order class of this recursion, I know it is of the order $O(n!)$ using substituting method.
$T(n)=n⋅T(n−1)+1$
$T(1)=1$
But I am wondering why I cant apply masters theorem for this function? Also can anyone share any pointers how to identify the recurrence relation that is not applicable using masters theorem.
permutations asymptotics
edited 2 days ago
Patricio
1165
asked Dec 1 at 2:48
Raj
61
New contributor
Raj is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
I'm trying to figure out the order class of this recursion, I know it is of the order $O(n!)$ using substituting method.
$T(n)=n⋅T(n−1)+1$
$T(1)=1$
But I am wondering why I cant apply masters theorem for this function? Also can anyone share any pointers how to identify the recurrence relation that is not applicable using masters theorem.
permutations asymptotics
permutations asymptotics
edited 2 days ago
Patricio
1165
asked Dec 1 at 2:48
Raj
61
New contributor
Raj is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited 2 days ago
Patricio
1165
asked Dec 1 at 2:48
Raj
61
New contributor
Raj is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited 2 days ago
Patricio
1165
edited 2 days ago
Patricio
1165
edited 2 days ago
Patricio
1165
1165
asked Dec 1 at 2:48
Raj
61
New contributor
Raj is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked Dec 1 at 2:48
Raj
61
asked Dec 1 at 2:48
Raj
61
61
New contributor
Raj is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Raj is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Raj is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
1
This seems to be a duplicate of MSE question 2714609.
– Somos
Dec 1 at 3:21
It does not answer why we cant use masters theorem!
– Raj
Dec 1 at 3:53
The Wikipedia article Master theorm states that the recursion has to be of a certain form which yours is not.
– Somos
Dec 1 at 4:05
More to the point, why do you believe that you can apply the master theorem to this problem?
– saulspatz
Dec 1 at 4:08
From Masters theorem T(n) = aT(n-b) + f(n), I thought I can consider a ~= n, but i am wrong based from your comments.
– Raj
Dec 1 at 4:29
add a comment |
1
This seems to be a duplicate of MSE question 2714609.
– Somos
Dec 1 at 3:21
It does not answer why we cant use masters theorem!
– Raj
Dec 1 at 3:53
The Wikipedia article Master theorm states that the recursion has to be of a certain form which yours is not.
– Somos
Dec 1 at 4:05
More to the point, why do you believe that you can apply the master theorem to this problem?
– saulspatz
Dec 1 at 4:08
From Masters theorem T(n) = aT(n-b) + f(n), I thought I can consider a ~= n, but i am wrong based from your comments.
– Raj
Dec 1 at 4:29
1
1
This seems to be a duplicate of MSE question 2714609.
– Somos
Dec 1 at 3:21
This seems to be a duplicate of MSE question 2714609.
– Somos
Dec 1 at 3:21
It does not answer why we cant use masters theorem!
– Raj
Dec 1 at 3:53
It does not answer why we cant use masters theorem!
– Raj
Dec 1 at 3:53
The Wikipedia article Master theorm states that the recursion has to be of a certain form which yours is not.
– Somos
Dec 1 at 4:05
The Wikipedia article Master theorm states that the recursion has to be of a certain form which yours is not.
– Somos
Dec 1 at 4:05
More to the point, why do you believe that you can apply the master theorem to this problem?
– saulspatz
Dec 1 at 4:08
More to the point, why do you believe that you can apply the master theorem to this problem?
– saulspatz
Dec 1 at 4:08
From Masters theorem T(n) = aT(n-b) + f(n), I thought I can consider a ~= n, but i am wrong based from your comments.
– Raj
Dec 1 at 4:29
From Masters theorem T(n) = aT(n-b) + f(n), I thought I can consider a ~= n, but i am wrong based from your comments.
– Raj
Dec 1 at 4:29
add a comment |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Raj is a new contributor. Be nice, and check out our Code of Conduct.
Raj is a new contributor. Be nice, and check out our Code of Conduct.
Raj is a new contributor. Be nice, and check out our Code of Conduct.
Raj is a new contributor. Be nice, and check out our Code of Conduct.
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%2f3020928%2ftn-ntn%25e2%2588%25921-1%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
This seems to be a duplicate of MSE question 2714609.
– Somos
Dec 1 at 3:21
It does not answer why we cant use masters theorem!
– Raj
Dec 1 at 3:53
The Wikipedia article Master theorm states that the recursion has to be of a certain form which yours is not.
– Somos
Dec 1 at 4:05
More to the point, why do you believe that you can apply the master theorem to this problem?
– saulspatz
Dec 1 at 4:08
From Masters theorem T(n) = aT(n-b) + f(n), I thought I can consider a ~= n, but i am wrong based from your comments.
– Raj
Dec 1 at 4:29