Prove using induction that $n^6 18$
up vote
-2
down vote
favorite
Prove using induction (or using any other elementary precalculus techniques) that $$n^6 < 3^n, forall n geq 19.$$
I have no idea how to do this. Writing the induction step, I get that I need to prove that $$3n^6 > (n+1)^6,$$ and I don't know how to do so.
I want a proof that doesn't use calculus techniques.
inequality induction natural-numbers
add a comment |
up vote
-2
down vote
favorite
Prove using induction (or using any other elementary precalculus techniques) that $$n^6 < 3^n, forall n geq 19.$$
I have no idea how to do this. Writing the induction step, I get that I need to prove that $$3n^6 > (n+1)^6,$$ and I don't know how to do so.
I want a proof that doesn't use calculus techniques.
inequality induction natural-numbers
1
what do you mean by 'calculus techniques'? is induction allowed?
– Viktor Glombik
yesterday
add a comment |
up vote
-2
down vote
favorite
up vote
-2
down vote
favorite
Prove using induction (or using any other elementary precalculus techniques) that $$n^6 < 3^n, forall n geq 19.$$
I have no idea how to do this. Writing the induction step, I get that I need to prove that $$3n^6 > (n+1)^6,$$ and I don't know how to do so.
I want a proof that doesn't use calculus techniques.
inequality induction natural-numbers
Prove using induction (or using any other elementary precalculus techniques) that $$n^6 < 3^n, forall n geq 19.$$
I have no idea how to do this. Writing the induction step, I get that I need to prove that $$3n^6 > (n+1)^6,$$ and I don't know how to do so.
I want a proof that doesn't use calculus techniques.
inequality induction natural-numbers
inequality induction natural-numbers
asked yesterday
S.T.
154
154
1
what do you mean by 'calculus techniques'? is induction allowed?
– Viktor Glombik
yesterday
add a comment |
1
what do you mean by 'calculus techniques'? is induction allowed?
– Viktor Glombik
yesterday
1
1
what do you mean by 'calculus techniques'? is induction allowed?
– Viktor Glombik
yesterday
what do you mean by 'calculus techniques'? is induction allowed?
– Viktor Glombik
yesterday
add a comment |
2 Answers
2
active
oldest
votes
up vote
4
down vote
Use that
$$3^{n+1}=3cdot 3^nstackrel{Ind. Hyp.}>3cdot n^6 stackrel{?}>(n+1)^6$$
and
$$3cdot n^6 >(n+1)^6 iff frac{n+1}{n}<sqrt[6] 3 iff n>frac1{sqrt[6] 3-1}approx 4.98$$
add a comment |
up vote
1
down vote
If $nge 19$,
$$(n+1)^6=n^6left(1+frac1nright)^6le3^ncdot left(1+frac1{19}right)^6<3^ncdot1.1^6$$
add a comment |
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
4
down vote
Use that
$$3^{n+1}=3cdot 3^nstackrel{Ind. Hyp.}>3cdot n^6 stackrel{?}>(n+1)^6$$
and
$$3cdot n^6 >(n+1)^6 iff frac{n+1}{n}<sqrt[6] 3 iff n>frac1{sqrt[6] 3-1}approx 4.98$$
add a comment |
up vote
4
down vote
Use that
$$3^{n+1}=3cdot 3^nstackrel{Ind. Hyp.}>3cdot n^6 stackrel{?}>(n+1)^6$$
and
$$3cdot n^6 >(n+1)^6 iff frac{n+1}{n}<sqrt[6] 3 iff n>frac1{sqrt[6] 3-1}approx 4.98$$
add a comment |
up vote
4
down vote
up vote
4
down vote
Use that
$$3^{n+1}=3cdot 3^nstackrel{Ind. Hyp.}>3cdot n^6 stackrel{?}>(n+1)^6$$
and
$$3cdot n^6 >(n+1)^6 iff frac{n+1}{n}<sqrt[6] 3 iff n>frac1{sqrt[6] 3-1}approx 4.98$$
Use that
$$3^{n+1}=3cdot 3^nstackrel{Ind. Hyp.}>3cdot n^6 stackrel{?}>(n+1)^6$$
and
$$3cdot n^6 >(n+1)^6 iff frac{n+1}{n}<sqrt[6] 3 iff n>frac1{sqrt[6] 3-1}approx 4.98$$
edited yesterday
answered yesterday
gimusi
85.6k74294
85.6k74294
add a comment |
add a comment |
up vote
1
down vote
If $nge 19$,
$$(n+1)^6=n^6left(1+frac1nright)^6le3^ncdot left(1+frac1{19}right)^6<3^ncdot1.1^6$$
add a comment |
up vote
1
down vote
If $nge 19$,
$$(n+1)^6=n^6left(1+frac1nright)^6le3^ncdot left(1+frac1{19}right)^6<3^ncdot1.1^6$$
add a comment |
up vote
1
down vote
up vote
1
down vote
If $nge 19$,
$$(n+1)^6=n^6left(1+frac1nright)^6le3^ncdot left(1+frac1{19}right)^6<3^ncdot1.1^6$$
If $nge 19$,
$$(n+1)^6=n^6left(1+frac1nright)^6le3^ncdot left(1+frac1{19}right)^6<3^ncdot1.1^6$$
answered yesterday
ajotatxe
52.1k23688
52.1k23688
add a comment |
add a comment |
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%2f3004975%2fprove-using-induction-that-n6-3n-for-all-n-18%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
what do you mean by 'calculus techniques'? is induction allowed?
– Viktor Glombik
yesterday