Using distributive property to prove that the product of two odd numbers is odd











up vote
0
down vote

favorite












I've been reading Algebra The Easy Way, and there's a problem at the end of the chapter to prove that the product of two odd numbers is an odd number.



In this problem, an even number is defined as two multiplied by a natural number, so (2 * m). An odd number is defined as an even number plus one, so (2 * n + 1).



Therefore, two odd numbers multiplied by each other is



(2 * m + 1) * ( 2 * n + 1).


The answer says to use the distributive property to convert this to



(2 * m + 1) * 2 * n + (2 * m + 1)


My question is how does the distributive property allow (2 * m + 1) * ( 2 * n + 1) to be converted to (2 * m + 1) * 2 * n + (2 * m + 1)? Is this a typo in the book, or is it actually possible to do this conversion using the distributive property?










share|cite|improve this question


















  • 1




    Because $2m + 1 = 1 cdot (2m + 1)$.
    – T. Bongers
    Nov 13 at 22:20












  • Yes. (2*n+1)=(2*n)+(1), so (2*m+1) can distribute.
    – herb steinberg
    Nov 13 at 22:45















up vote
0
down vote

favorite












I've been reading Algebra The Easy Way, and there's a problem at the end of the chapter to prove that the product of two odd numbers is an odd number.



In this problem, an even number is defined as two multiplied by a natural number, so (2 * m). An odd number is defined as an even number plus one, so (2 * n + 1).



Therefore, two odd numbers multiplied by each other is



(2 * m + 1) * ( 2 * n + 1).


The answer says to use the distributive property to convert this to



(2 * m + 1) * 2 * n + (2 * m + 1)


My question is how does the distributive property allow (2 * m + 1) * ( 2 * n + 1) to be converted to (2 * m + 1) * 2 * n + (2 * m + 1)? Is this a typo in the book, or is it actually possible to do this conversion using the distributive property?










share|cite|improve this question


















  • 1




    Because $2m + 1 = 1 cdot (2m + 1)$.
    – T. Bongers
    Nov 13 at 22:20












  • Yes. (2*n+1)=(2*n)+(1), so (2*m+1) can distribute.
    – herb steinberg
    Nov 13 at 22:45













up vote
0
down vote

favorite









up vote
0
down vote

favorite











I've been reading Algebra The Easy Way, and there's a problem at the end of the chapter to prove that the product of two odd numbers is an odd number.



In this problem, an even number is defined as two multiplied by a natural number, so (2 * m). An odd number is defined as an even number plus one, so (2 * n + 1).



Therefore, two odd numbers multiplied by each other is



(2 * m + 1) * ( 2 * n + 1).


The answer says to use the distributive property to convert this to



(2 * m + 1) * 2 * n + (2 * m + 1)


My question is how does the distributive property allow (2 * m + 1) * ( 2 * n + 1) to be converted to (2 * m + 1) * 2 * n + (2 * m + 1)? Is this a typo in the book, or is it actually possible to do this conversion using the distributive property?










share|cite|improve this question













I've been reading Algebra The Easy Way, and there's a problem at the end of the chapter to prove that the product of two odd numbers is an odd number.



In this problem, an even number is defined as two multiplied by a natural number, so (2 * m). An odd number is defined as an even number plus one, so (2 * n + 1).



Therefore, two odd numbers multiplied by each other is



(2 * m + 1) * ( 2 * n + 1).


The answer says to use the distributive property to convert this to



(2 * m + 1) * 2 * n + (2 * m + 1)


My question is how does the distributive property allow (2 * m + 1) * ( 2 * n + 1) to be converted to (2 * m + 1) * 2 * n + (2 * m + 1)? Is this a typo in the book, or is it actually possible to do this conversion using the distributive property?







algebra-precalculus






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Nov 13 at 22:16









Toby Artisan

1032




1032








  • 1




    Because $2m + 1 = 1 cdot (2m + 1)$.
    – T. Bongers
    Nov 13 at 22:20












  • Yes. (2*n+1)=(2*n)+(1), so (2*m+1) can distribute.
    – herb steinberg
    Nov 13 at 22:45














  • 1




    Because $2m + 1 = 1 cdot (2m + 1)$.
    – T. Bongers
    Nov 13 at 22:20












  • Yes. (2*n+1)=(2*n)+(1), so (2*m+1) can distribute.
    – herb steinberg
    Nov 13 at 22:45








1




1




Because $2m + 1 = 1 cdot (2m + 1)$.
– T. Bongers
Nov 13 at 22:20






Because $2m + 1 = 1 cdot (2m + 1)$.
– T. Bongers
Nov 13 at 22:20














Yes. (2*n+1)=(2*n)+(1), so (2*m+1) can distribute.
– herb steinberg
Nov 13 at 22:45




Yes. (2*n+1)=(2*n)+(1), so (2*m+1) can distribute.
– herb steinberg
Nov 13 at 22:45










1 Answer
1






active

oldest

votes

















up vote
1
down vote



accepted










To answer your specific question, let $nu = (2m+1)$. Then, with substitution, $$(2m+1)(2n+1) = \
nu(2n+1) = \ nu2n + nu
$$
Does that last line make sense? If not, please have a look over distributive multiplication. Going on, replace $nu$ above with $(2m+1)$ and you get the answer in the book.



The overall proof may actually be easier to use FOIL, to obtain $4mn + 2m + 2n + 1$ then factor out a 2 to get $$2(2mn + m + n) + 1 = \2(mathrm{some integer})+1$$Since you've established that an odd number has the form, $2i+1$ for some integer $i$, and the above expansion has that form, then the above expansion is odd. Since the above expansion was created as a product of two odd numbers, then the product is an odd number.






share|cite|improve this answer





















  • Using "v" as a substitution makes it perfectly clear. I also like your suggestion of using FOIL. Thank you.
    – Toby Artisan
    Nov 14 at 14:59











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',
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%2f2997422%2fusing-distributive-property-to-prove-that-the-product-of-two-odd-numbers-is-odd%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes








up vote
1
down vote



accepted










To answer your specific question, let $nu = (2m+1)$. Then, with substitution, $$(2m+1)(2n+1) = \
nu(2n+1) = \ nu2n + nu
$$
Does that last line make sense? If not, please have a look over distributive multiplication. Going on, replace $nu$ above with $(2m+1)$ and you get the answer in the book.



The overall proof may actually be easier to use FOIL, to obtain $4mn + 2m + 2n + 1$ then factor out a 2 to get $$2(2mn + m + n) + 1 = \2(mathrm{some integer})+1$$Since you've established that an odd number has the form, $2i+1$ for some integer $i$, and the above expansion has that form, then the above expansion is odd. Since the above expansion was created as a product of two odd numbers, then the product is an odd number.






share|cite|improve this answer





















  • Using "v" as a substitution makes it perfectly clear. I also like your suggestion of using FOIL. Thank you.
    – Toby Artisan
    Nov 14 at 14:59















up vote
1
down vote



accepted










To answer your specific question, let $nu = (2m+1)$. Then, with substitution, $$(2m+1)(2n+1) = \
nu(2n+1) = \ nu2n + nu
$$
Does that last line make sense? If not, please have a look over distributive multiplication. Going on, replace $nu$ above with $(2m+1)$ and you get the answer in the book.



The overall proof may actually be easier to use FOIL, to obtain $4mn + 2m + 2n + 1$ then factor out a 2 to get $$2(2mn + m + n) + 1 = \2(mathrm{some integer})+1$$Since you've established that an odd number has the form, $2i+1$ for some integer $i$, and the above expansion has that form, then the above expansion is odd. Since the above expansion was created as a product of two odd numbers, then the product is an odd number.






share|cite|improve this answer





















  • Using "v" as a substitution makes it perfectly clear. I also like your suggestion of using FOIL. Thank you.
    – Toby Artisan
    Nov 14 at 14:59













up vote
1
down vote



accepted







up vote
1
down vote



accepted






To answer your specific question, let $nu = (2m+1)$. Then, with substitution, $$(2m+1)(2n+1) = \
nu(2n+1) = \ nu2n + nu
$$
Does that last line make sense? If not, please have a look over distributive multiplication. Going on, replace $nu$ above with $(2m+1)$ and you get the answer in the book.



The overall proof may actually be easier to use FOIL, to obtain $4mn + 2m + 2n + 1$ then factor out a 2 to get $$2(2mn + m + n) + 1 = \2(mathrm{some integer})+1$$Since you've established that an odd number has the form, $2i+1$ for some integer $i$, and the above expansion has that form, then the above expansion is odd. Since the above expansion was created as a product of two odd numbers, then the product is an odd number.






share|cite|improve this answer












To answer your specific question, let $nu = (2m+1)$. Then, with substitution, $$(2m+1)(2n+1) = \
nu(2n+1) = \ nu2n + nu
$$
Does that last line make sense? If not, please have a look over distributive multiplication. Going on, replace $nu$ above with $(2m+1)$ and you get the answer in the book.



The overall proof may actually be easier to use FOIL, to obtain $4mn + 2m + 2n + 1$ then factor out a 2 to get $$2(2mn + m + n) + 1 = \2(mathrm{some integer})+1$$Since you've established that an odd number has the form, $2i+1$ for some integer $i$, and the above expansion has that form, then the above expansion is odd. Since the above expansion was created as a product of two odd numbers, then the product is an odd number.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Nov 14 at 0:35









Russ

37919




37919












  • Using "v" as a substitution makes it perfectly clear. I also like your suggestion of using FOIL. Thank you.
    – Toby Artisan
    Nov 14 at 14:59


















  • Using "v" as a substitution makes it perfectly clear. I also like your suggestion of using FOIL. Thank you.
    – Toby Artisan
    Nov 14 at 14:59
















Using "v" as a substitution makes it perfectly clear. I also like your suggestion of using FOIL. Thank you.
– Toby Artisan
Nov 14 at 14:59




Using "v" as a substitution makes it perfectly clear. I also like your suggestion of using FOIL. Thank you.
– Toby Artisan
Nov 14 at 14:59


















 

draft saved


draft discarded



















































 


draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2997422%2fusing-distributive-property-to-prove-that-the-product-of-two-odd-numbers-is-odd%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

Probability when a professor distributes a quiz and homework assignment to a class of n students.

Aardman Animations

Are they similar matrix