Proving by induction of n. Is this correct until this point?prove inequality by induction — Discrete mathProve $25^n>6^n$ using inductionTrying to simplify an expression for an induction proof.Induction on summation inequality stuck on Induction stepProve by Induction: Summation of Factorial (n! * n)Prove that $n! > n^3$ for every integer $n ge 6$ using inductionProving by induction on $n$ that $sum limits_k=1^n (k+1)2^k = n2^n+1 $5. Prove by induction on $n$ that $sumlimits_k=1^n frac kk+1 leq n - frac1n+1$Prove by induction on n that $sumlimits_k=1^n frac k+2k(k+1)2^k+1 = frac12 - frac1(n+1)2^n+1$Prove by induction on n that $sumlimits_k=1^n frac 2^kk leq 2^n$
Are taller landing gear bad for aircraft, particulary large airliners?
Adding empty element to declared container without declaring type of element
Stereotypical names
What does the "3am" section means in manpages?
Hostile work environment after whistle-blowing on coworker and our boss. What do I do?
What is the opposite of 'gravitas'?
How to prevent YouTube from showing already watched videos?
Greatest common substring
How will losing mobility of one hand affect my career as a programmer?
Can the harmonic series explain the origin of the major scale?
Did US corporations pay demonstrators in the German demonstrations against article 13?
The most efficient algorithm to find all possible integer pairs which sum to a given integer
Books on the History of math research at European universities
Java - What do constructor type arguments mean when placed *before* the type?
How do I repair my stair bannister?
Why isn't KTEX's runway designation 10/28 instead of 9/27?
Bob has never been a M before
Organic chemistry Iodoform Reaction
Was the picture area of a CRT a parallelogram (instead of a true rectangle)?
Visiting the UK as unmarried couple
How to deal with or prevent idle in the test team?
Word describing multiple paths to the same abstract outcome
Pronouncing Homer as in modern Greek
Why is delta-v is the most useful quantity for planning space travel?
Proving by induction of n. Is this correct until this point?
prove inequality by induction — Discrete mathProve $25^n>6^n$ using inductionTrying to simplify an expression for an induction proof.Induction on summation inequality stuck on Induction stepProve by Induction: Summation of Factorial (n! * n)Prove that $n! > n^3$ for every integer $n ge 6$ using inductionProving by induction on $n$ that $sum limits_k=1^n (k+1)2^k = n2^n+1 $5. Prove by induction on $n$ that $sumlimits_k=1^n frac kk+1 leq n - frac1n+1$Prove by induction on n that $sumlimits_k=1^n frac k+2k(k+1)2^k+1 = frac12 - frac1(n+1)2^n+1$Prove by induction on n that $sumlimits_k=1^n frac 2^kk leq 2^n$
$begingroup$
$$
sum_k=1^n frac k+2k(k+1)2^k+1 = frac12 - frac1(n+1)2^n+1
$$
Base Case:
I did $n = 1$, so..
LHS-
$$sum_k=1^n frac k+2k(k+1)2^k+1 = frac38$$
RHS-
$$frac12 - frac1(n+1)2^n+1 = frac38$$
so LHS = RHS
Inductive case-
LHS for $n+1$
$$sum_k=1^n+1 frac k+2k(k+1)2^k+1 +frac n+3(n+1)(n+2)2^n+2$$
and then I think that you can use inductive hypothesis to change it to the form of
$$
frac12 - frac1(n+1)2^n+1 +frac n+3(n+1)(n+2)2^n+2
$$
and then I broke up $frac n+3(n+1)(n+2)2^n+2$ into
$$frac2(n+2)-(n+1)(n+1)(n+2)2^n+2$$
$$=$$
$$frac2(n+1)2^n+2 - frac1(n+2)2^n+2$$
$$=$$
$$frac1(n+1)2^n+1 - frac1(n+2)2^n+2$$
then put it back in with the rest of the equation, bringing me to
$$frac12 -frac 1(n+1)2^n+1 +frac1(n+1)2^n+1 - frac1(n+2)2^n+2$$
then
$$frac12 -frac2(n+1)2^n+1 - frac1(n+2)2^n+2$$
and
$$frac12 -frac1(n+1)2^n - frac1(n+2)2^n+2$$
$$frac12 -frac(n+2)2^n+2 - (n+1)2^n(n+1)(n+2)2^2n+2 $$
which I think simplifies down to this after factoring out a $2^n$ from the numerator?
$$frac12 -frac2^n((n+2)2^2 - (n+1))(n+1)(n+2)2^2n+2 $$
canceling out $2^n$
$$frac12 -frac(3n-7)(n+1)(n+2)2^n+2 $$
and I'm stuck, please help!
discrete-mathematics induction
asked 5 hours ago
BrownieBrownie
1927
$endgroup$
add a comment |
$begingroup$
$$
sum_k=1^n frac k+2k(k+1)2^k+1 = frac12 - frac1(n+1)2^n+1
$$
Base Case:
I did $n = 1$, so..
LHS-
$$sum_k=1^n frac k+2k(k+1)2^k+1 = frac38$$
RHS-
$$frac12 - frac1(n+1)2^n+1 = frac38$$
so LHS = RHS
Inductive case-
LHS for $n+1$
$$sum_k=1^n+1 frac k+2k(k+1)2^k+1 +frac n+3(n+1)(n+2)2^n+2$$
and then I think that you can use inductive hypothesis to change it to the form of
$$
frac12 - frac1(n+1)2^n+1 +frac n+3(n+1)(n+2)2^n+2
$$
and then I broke up $frac n+3(n+1)(n+2)2^n+2$ into
$$frac2(n+2)-(n+1)(n+1)(n+2)2^n+2$$
$$=$$
$$frac2(n+1)2^n+2 - frac1(n+2)2^n+2$$
$$=$$
$$frac1(n+1)2^n+1 - frac1(n+2)2^n+2$$
then put it back in with the rest of the equation, bringing me to
$$frac12 -frac 1(n+1)2^n+1 +frac1(n+1)2^n+1 - frac1(n+2)2^n+2$$
then
$$frac12 -frac2(n+1)2^n+1 - frac1(n+2)2^n+2$$
and
$$frac12 -frac1(n+1)2^n - frac1(n+2)2^n+2$$
$$frac12 -frac(n+2)2^n+2 - (n+1)2^n(n+1)(n+2)2^2n+2 $$
which I think simplifies down to this after factoring out a $2^n$ from the numerator?
$$frac12 -frac2^n((n+2)2^2 - (n+1))(n+1)(n+2)2^2n+2 $$
canceling out $2^n$
$$frac12 -frac(3n-7)(n+1)(n+2)2^n+2 $$
and I'm stuck, please help!
discrete-mathematics induction
asked 5 hours ago
BrownieBrownie
1927
$endgroup$
add a comment |
$begingroup$
$$
sum_k=1^n frac k+2k(k+1)2^k+1 = frac12 - frac1(n+1)2^n+1
$$
Base Case:
I did $n = 1$, so..
LHS-
$$sum_k=1^n frac k+2k(k+1)2^k+1 = frac38$$
RHS-
$$frac12 - frac1(n+1)2^n+1 = frac38$$
so LHS = RHS
Inductive case-
LHS for $n+1$
$$sum_k=1^n+1 frac k+2k(k+1)2^k+1 +frac n+3(n+1)(n+2)2^n+2$$
and then I think that you can use inductive hypothesis to change it to the form of
$$
frac12 - frac1(n+1)2^n+1 +frac n+3(n+1)(n+2)2^n+2
$$
and then I broke up $frac n+3(n+1)(n+2)2^n+2$ into
$$frac2(n+2)-(n+1)(n+1)(n+2)2^n+2$$
$$=$$
$$frac2(n+1)2^n+2 - frac1(n+2)2^n+2$$
$$=$$
$$frac1(n+1)2^n+1 - frac1(n+2)2^n+2$$
then put it back in with the rest of the equation, bringing me to
$$frac12 -frac 1(n+1)2^n+1 +frac1(n+1)2^n+1 - frac1(n+2)2^n+2$$
then
$$frac12 -frac2(n+1)2^n+1 - frac1(n+2)2^n+2$$
and
$$frac12 -frac1(n+1)2^n - frac1(n+2)2^n+2$$
$$frac12 -frac(n+2)2^n+2 - (n+1)2^n(n+1)(n+2)2^2n+2 $$
which I think simplifies down to this after factoring out a $2^n$ from the numerator?
$$frac12 -frac2^n((n+2)2^2 - (n+1))(n+1)(n+2)2^2n+2 $$
canceling out $2^n$
$$frac12 -frac(3n-7)(n+1)(n+2)2^n+2 $$
and I'm stuck, please help!
discrete-mathematics induction
asked 5 hours ago
BrownieBrownie
1927
$endgroup$
$$
sum_k=1^n frac k+2k(k+1)2^k+1 = frac12 - frac1(n+1)2^n+1
$$
Base Case:
I did $n = 1$, so..
LHS-
$$sum_k=1^n frac k+2k(k+1)2^k+1 = frac38$$
RHS-
$$frac12 - frac1(n+1)2^n+1 = frac38$$
so LHS = RHS
Inductive case-
LHS for $n+1$
$$sum_k=1^n+1 frac k+2k(k+1)2^k+1 +frac n+3(n+1)(n+2)2^n+2$$
and then I think that you can use inductive hypothesis to change it to the form of
$$
frac12 - frac1(n+1)2^n+1 +frac n+3(n+1)(n+2)2^n+2
$$
and then I broke up $frac n+3(n+1)(n+2)2^n+2$ into
$$frac2(n+2)-(n+1)(n+1)(n+2)2^n+2$$
$$=$$
$$frac2(n+1)2^n+2 - frac1(n+2)2^n+2$$
$$=$$
$$frac1(n+1)2^n+1 - frac1(n+2)2^n+2$$
then put it back in with the rest of the equation, bringing me to
$$frac12 -frac 1(n+1)2^n+1 +frac1(n+1)2^n+1 - frac1(n+2)2^n+2$$
then
$$frac12 -frac2(n+1)2^n+1 - frac1(n+2)2^n+2$$
and
$$frac12 -frac1(n+1)2^n - frac1(n+2)2^n+2$$
$$frac12 -frac(n+2)2^n+2 - (n+1)2^n(n+1)(n+2)2^2n+2 $$
which I think simplifies down to this after factoring out a $2^n$ from the numerator?
$$frac12 -frac2^n((n+2)2^2 - (n+1))(n+1)(n+2)2^2n+2 $$
canceling out $2^n$
$$frac12 -frac(3n-7)(n+1)(n+2)2^n+2 $$
and I'm stuck, please help!
discrete-mathematics induction
discrete-mathematics induction
asked 5 hours ago
BrownieBrownie
1927
asked 5 hours ago
BrownieBrownie
1927
asked 5 hours ago
BrownieBrownie
1927
asked 5 hours ago
BrownieBrownie
1927
asked 5 hours ago
BrownieBrownie
1927
1927
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Your error is just after the sixth step from the bottom:
$$frac12 -frac 1(n+1)2^n+1 +frac1(n+1)2^n+1 - frac1(n+2)2^n+2=frac12 -frac1(n+2)2^n+2$$
Then you are done.
You accidentally added the two middle terms instead of subtracting.
answered 4 hours ago
John Wayland BalesJohn Wayland Bales
15.1k21238
$endgroup$
add a comment |
$begingroup$
Using a telescoping sum, we get
$$
beginalign
sum_k=1^nfrack+2k(k+1)2^k+1
&=sum_k=1^nleft(frac1k2^k-frac1(k+1)2^k+1right)\
&=sum_k=1^nfrac1k2^k-sum_k=2^n+1frac1k2^k\
&=frac12-frac1(n+1)2^n+1
endalign
$$
answered 3 hours ago
robjohn♦robjohn
270k27312639
$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');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
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%2f3162553%2fproving-by-induction-of-n-is-this-correct-until-this-point%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Your error is just after the sixth step from the bottom:
$$frac12 -frac 1(n+1)2^n+1 +frac1(n+1)2^n+1 - frac1(n+2)2^n+2=frac12 -frac1(n+2)2^n+2$$
Then you are done.
You accidentally added the two middle terms instead of subtracting.
answered 4 hours ago
John Wayland BalesJohn Wayland Bales
15.1k21238
$endgroup$
add a comment |
$begingroup$
Your error is just after the sixth step from the bottom:
$$frac12 -frac 1(n+1)2^n+1 +frac1(n+1)2^n+1 - frac1(n+2)2^n+2=frac12 -frac1(n+2)2^n+2$$
Then you are done.
You accidentally added the two middle terms instead of subtracting.
answered 4 hours ago
John Wayland BalesJohn Wayland Bales
15.1k21238
$endgroup$
add a comment |
$begingroup$
Your error is just after the sixth step from the bottom:
$$frac12 -frac 1(n+1)2^n+1 +frac1(n+1)2^n+1 - frac1(n+2)2^n+2=frac12 -frac1(n+2)2^n+2$$
Then you are done.
You accidentally added the two middle terms instead of subtracting.
answered 4 hours ago
John Wayland BalesJohn Wayland Bales
15.1k21238
$endgroup$
Your error is just after the sixth step from the bottom:
$$frac12 -frac 1(n+1)2^n+1 +frac1(n+1)2^n+1 - frac1(n+2)2^n+2=frac12 -frac1(n+2)2^n+2$$
Then you are done.
You accidentally added the two middle terms instead of subtracting.
answered 4 hours ago
John Wayland BalesJohn Wayland Bales
15.1k21238
answered 4 hours ago
John Wayland BalesJohn Wayland Bales
15.1k21238
answered 4 hours ago
John Wayland BalesJohn Wayland Bales
15.1k21238
answered 4 hours ago
John Wayland BalesJohn Wayland Bales
15.1k21238
15.1k21238
add a comment |
add a comment |
$begingroup$
Using a telescoping sum, we get
$$
beginalign
sum_k=1^nfrack+2k(k+1)2^k+1
&=sum_k=1^nleft(frac1k2^k-frac1(k+1)2^k+1right)\
&=sum_k=1^nfrac1k2^k-sum_k=2^n+1frac1k2^k\
&=frac12-frac1(n+1)2^n+1
endalign
$$
answered 3 hours ago
robjohn♦robjohn
270k27312639
$endgroup$
add a comment |
$begingroup$
Using a telescoping sum, we get
$$
beginalign
sum_k=1^nfrack+2k(k+1)2^k+1
&=sum_k=1^nleft(frac1k2^k-frac1(k+1)2^k+1right)\
&=sum_k=1^nfrac1k2^k-sum_k=2^n+1frac1k2^k\
&=frac12-frac1(n+1)2^n+1
endalign
$$
answered 3 hours ago
robjohn♦robjohn
270k27312639
$endgroup$
add a comment |
$begingroup$
Using a telescoping sum, we get
$$
beginalign
sum_k=1^nfrack+2k(k+1)2^k+1
&=sum_k=1^nleft(frac1k2^k-frac1(k+1)2^k+1right)\
&=sum_k=1^nfrac1k2^k-sum_k=2^n+1frac1k2^k\
&=frac12-frac1(n+1)2^n+1
endalign
$$
answered 3 hours ago
robjohn♦robjohn
270k27312639
$endgroup$
Using a telescoping sum, we get
$$
beginalign
sum_k=1^nfrack+2k(k+1)2^k+1
&=sum_k=1^nleft(frac1k2^k-frac1(k+1)2^k+1right)\
&=sum_k=1^nfrac1k2^k-sum_k=2^n+1frac1k2^k\
&=frac12-frac1(n+1)2^n+1
endalign
$$
answered 3 hours ago
robjohn♦robjohn
270k27312639
answered 3 hours ago
robjohn♦robjohn
270k27312639
answered 3 hours ago
robjohn♦robjohn
270k27312639
answered 3 hours ago
robjohn♦robjohn
270k27312639
270k27312639
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');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
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%2f3162553%2fproving-by-induction-of-n-is-this-correct-until-this-point%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');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
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');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
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');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
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
