Is my proof by induction of even number arithmetic progression correct?












1












$begingroup$


Prove that for all integers $ngeq1$, $P(n) = 2+4+6+...+2n=n^2+n$



For $P(1)$, we have that: $2cdot1=1^2+1$



Let $k$ be an integer with $kgeq1$. Suppose $P(k)$ is true. Then: $2+4+6+...+2k=k^2+k$



I must show that $P(k+1)$ is also true:



$2+4+6+...+2(k+1)=(k+1)^2+(k+1)$ $(1)$



If $k$ is an integer then $l=k+1$ is also an integer. For $l=k+1$ $(1)$ becomes: $l^2+l$ which is of the form $k^2+k$ that is true.



$Q.E.D$



A small change at the inductive step:



I must show that $P(k+1)$ is also true:



$(2+4+6+...+2k)+2(k+1)=k^2+k+2k+2=(k^2+2k+1)+(k+1)=(k+1)^2+(k+1)$



$Q.E.D$



I know that the second inductive step is definitely correct, but I'm confused as to whether the first one is correct.










share|cite|improve this question









$endgroup$












  • $begingroup$
    I think it's right.
    $endgroup$
    – Michael Rozenberg
    Jan 5 at 13:07






  • 3




    $begingroup$
    First one is wrong.
    $endgroup$
    – Thomas Shelby
    Jan 5 at 13:07






  • 3




    $begingroup$
    I don't understand the first argument at all. It looks like you just assumed what you were trying to prove. The second one looks solid.
    $endgroup$
    – lulu
    Jan 5 at 13:09






  • 1




    $begingroup$
    You can't make arguments using equation $(1) $,as you haven't proved it.
    $endgroup$
    – Thomas Shelby
    Jan 5 at 13:10










  • $begingroup$
    The first attempt isn't valid.
    $endgroup$
    – Peter
    Jan 5 at 13:14
















1












$begingroup$


Prove that for all integers $ngeq1$, $P(n) = 2+4+6+...+2n=n^2+n$



For $P(1)$, we have that: $2cdot1=1^2+1$



Let $k$ be an integer with $kgeq1$. Suppose $P(k)$ is true. Then: $2+4+6+...+2k=k^2+k$



I must show that $P(k+1)$ is also true:



$2+4+6+...+2(k+1)=(k+1)^2+(k+1)$ $(1)$



If $k$ is an integer then $l=k+1$ is also an integer. For $l=k+1$ $(1)$ becomes: $l^2+l$ which is of the form $k^2+k$ that is true.



$Q.E.D$



A small change at the inductive step:



I must show that $P(k+1)$ is also true:



$(2+4+6+...+2k)+2(k+1)=k^2+k+2k+2=(k^2+2k+1)+(k+1)=(k+1)^2+(k+1)$



$Q.E.D$



I know that the second inductive step is definitely correct, but I'm confused as to whether the first one is correct.










share|cite|improve this question









$endgroup$












  • $begingroup$
    I think it's right.
    $endgroup$
    – Michael Rozenberg
    Jan 5 at 13:07






  • 3




    $begingroup$
    First one is wrong.
    $endgroup$
    – Thomas Shelby
    Jan 5 at 13:07






  • 3




    $begingroup$
    I don't understand the first argument at all. It looks like you just assumed what you were trying to prove. The second one looks solid.
    $endgroup$
    – lulu
    Jan 5 at 13:09






  • 1




    $begingroup$
    You can't make arguments using equation $(1) $,as you haven't proved it.
    $endgroup$
    – Thomas Shelby
    Jan 5 at 13:10










  • $begingroup$
    The first attempt isn't valid.
    $endgroup$
    – Peter
    Jan 5 at 13:14














1












1








1





$begingroup$


Prove that for all integers $ngeq1$, $P(n) = 2+4+6+...+2n=n^2+n$



For $P(1)$, we have that: $2cdot1=1^2+1$



Let $k$ be an integer with $kgeq1$. Suppose $P(k)$ is true. Then: $2+4+6+...+2k=k^2+k$



I must show that $P(k+1)$ is also true:



$2+4+6+...+2(k+1)=(k+1)^2+(k+1)$ $(1)$



If $k$ is an integer then $l=k+1$ is also an integer. For $l=k+1$ $(1)$ becomes: $l^2+l$ which is of the form $k^2+k$ that is true.



$Q.E.D$



A small change at the inductive step:



I must show that $P(k+1)$ is also true:



$(2+4+6+...+2k)+2(k+1)=k^2+k+2k+2=(k^2+2k+1)+(k+1)=(k+1)^2+(k+1)$



$Q.E.D$



I know that the second inductive step is definitely correct, but I'm confused as to whether the first one is correct.










share|cite|improve this question









$endgroup$




Prove that for all integers $ngeq1$, $P(n) = 2+4+6+...+2n=n^2+n$



For $P(1)$, we have that: $2cdot1=1^2+1$



Let $k$ be an integer with $kgeq1$. Suppose $P(k)$ is true. Then: $2+4+6+...+2k=k^2+k$



I must show that $P(k+1)$ is also true:



$2+4+6+...+2(k+1)=(k+1)^2+(k+1)$ $(1)$



If $k$ is an integer then $l=k+1$ is also an integer. For $l=k+1$ $(1)$ becomes: $l^2+l$ which is of the form $k^2+k$ that is true.



$Q.E.D$



A small change at the inductive step:



I must show that $P(k+1)$ is also true:



$(2+4+6+...+2k)+2(k+1)=k^2+k+2k+2=(k^2+2k+1)+(k+1)=(k+1)^2+(k+1)$



$Q.E.D$



I know that the second inductive step is definitely correct, but I'm confused as to whether the first one is correct.







discrete-mathematics induction






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Jan 5 at 13:04









NickNick

183




183












  • $begingroup$
    I think it's right.
    $endgroup$
    – Michael Rozenberg
    Jan 5 at 13:07






  • 3




    $begingroup$
    First one is wrong.
    $endgroup$
    – Thomas Shelby
    Jan 5 at 13:07






  • 3




    $begingroup$
    I don't understand the first argument at all. It looks like you just assumed what you were trying to prove. The second one looks solid.
    $endgroup$
    – lulu
    Jan 5 at 13:09






  • 1




    $begingroup$
    You can't make arguments using equation $(1) $,as you haven't proved it.
    $endgroup$
    – Thomas Shelby
    Jan 5 at 13:10










  • $begingroup$
    The first attempt isn't valid.
    $endgroup$
    – Peter
    Jan 5 at 13:14


















  • $begingroup$
    I think it's right.
    $endgroup$
    – Michael Rozenberg
    Jan 5 at 13:07






  • 3




    $begingroup$
    First one is wrong.
    $endgroup$
    – Thomas Shelby
    Jan 5 at 13:07






  • 3




    $begingroup$
    I don't understand the first argument at all. It looks like you just assumed what you were trying to prove. The second one looks solid.
    $endgroup$
    – lulu
    Jan 5 at 13:09






  • 1




    $begingroup$
    You can't make arguments using equation $(1) $,as you haven't proved it.
    $endgroup$
    – Thomas Shelby
    Jan 5 at 13:10










  • $begingroup$
    The first attempt isn't valid.
    $endgroup$
    – Peter
    Jan 5 at 13:14
















$begingroup$
I think it's right.
$endgroup$
– Michael Rozenberg
Jan 5 at 13:07




$begingroup$
I think it's right.
$endgroup$
– Michael Rozenberg
Jan 5 at 13:07




3




3




$begingroup$
First one is wrong.
$endgroup$
– Thomas Shelby
Jan 5 at 13:07




$begingroup$
First one is wrong.
$endgroup$
– Thomas Shelby
Jan 5 at 13:07




3




3




$begingroup$
I don't understand the first argument at all. It looks like you just assumed what you were trying to prove. The second one looks solid.
$endgroup$
– lulu
Jan 5 at 13:09




$begingroup$
I don't understand the first argument at all. It looks like you just assumed what you were trying to prove. The second one looks solid.
$endgroup$
– lulu
Jan 5 at 13:09




1




1




$begingroup$
You can't make arguments using equation $(1) $,as you haven't proved it.
$endgroup$
– Thomas Shelby
Jan 5 at 13:10




$begingroup$
You can't make arguments using equation $(1) $,as you haven't proved it.
$endgroup$
– Thomas Shelby
Jan 5 at 13:10












$begingroup$
The first attempt isn't valid.
$endgroup$
– Peter
Jan 5 at 13:14




$begingroup$
The first attempt isn't valid.
$endgroup$
– Peter
Jan 5 at 13:14










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
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3062695%2fis-my-proof-by-induction-of-even-number-arithmetic-progression-correct%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
















draft saved

draft discarded




















































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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3062695%2fis-my-proof-by-induction-of-even-number-arithmetic-progression-correct%23new-answer', 'question_page');
}
);

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







Popular posts from this blog

Ellipse (mathématiques)

Quarter-circle Tiles

Mont Emei