Ask your own question, for FREE!
Mathematics 18 Online
OpenStudy (lgbasallote):

Prove that every odd integer is the difference of two squares

OpenStudy (lgbasallote):

i suppose best proof to use would be contradiction...

OpenStudy (lgbasallote):

so i assume x^2 - y^2 = 2k

OpenStudy (lgbasallote):

then... for x^2 - y^2 to be even... both must be even or odd

OpenStudy (lgbasallote):

so if x^2 and y^2 are both even... x and y are also even

OpenStudy (anonymous):

no we're trying to prove converse i think, which doesnt justify the actual statement

OpenStudy (lgbasallote):

so i can rewrite this... (2m)^2 - (2n)^2 = 2k

OpenStudy (lgbasallote):

4m^2 - 4n^2 = 2k

OpenStudy (lgbasallote):

so.... 2m ^ 2 - 2n^2 = k

OpenStudy (lgbasallote):

then... m^2 - n^2 = k/2

OpenStudy (lgbasallote):

can i assume this is contradiction because 1/2 is not an integer?

OpenStudy (anonymous):

could u plz clarify, you want to prove difference of two squares is alwasy an odd number, or you want to prove every odd number is a difference of two squares ?

OpenStudy (lgbasallote):

no idea

OpenStudy (lgbasallote):

how do you understand the question?

OpenStudy (anonymous):

the question is, every odd integer can be written as difference of squares

OpenStudy (anonymous):

but i see you're trying to prove its converse, which is not correct

OpenStudy (lgbasallote):

so how would you do the assumption?

OpenStudy (lgbasallote):

using contradiction

OpenStudy (lgbasallote):

personally, i see no difference in solution

OpenStudy (anonymous):

consider below two statements : 1) all odd numbers are diff of squares 2) all diff of squares are odd numbers

OpenStudy (anonymous):

both are converses of each other

OpenStudy (anonymous):

proving by contradiction is different

OpenStudy (lgbasallote):

so tell me...can you think of a different solution then?

OpenStudy (lgbasallote):

what would you equate 2k + 1 to in proof by contradiction then?

OpenStudy (lgbasallote):

if you think about it...every difference of two squares is also odd...

OpenStudy (anonymous):

first, did u get that a converse is not same as the actual statement proving a converse doesnot justify the actual statement

OpenStudy (lgbasallote):

i know...but i cannot see any other way to prove by contradiction....so if you have an idea...i'll gladly hear it

OpenStudy (raden):

i think , it means : (2n-1) = n^2 - (n-1)^2 just to expand right side, it can be a prove

OpenStudy (lgbasallote):

@RadEn contradiction

OpenStudy (anonymous):

then dont try to prove the converse, lets think of how to prove by contradiction, by assuming the opposite of what we need to prove :)

OpenStudy (lgbasallote):

what is the opposite of difference of two squares? sum??

OpenStudy (anonymous):

we can factor difference of squares

OpenStudy (lgbasallote):

then you're using direct proof

OpenStudy (anonymous):

doesnt look obvious to me the contradiction proof

OpenStudy (anonymous):

looks involved

OpenStudy (lgbasallote):

involved?

OpenStudy (anonymous):

yes atleast to meh il give a try

OpenStudy (lgbasallote):

i think you'll arrive with the same proof i was doing earlier...

OpenStudy (anonymous):

thats not a proof

OpenStudy (lgbasallote):

it is actually...probably not contradiction...but it is

OpenStudy (lgbasallote):

it is a proof*

OpenStudy (anonymous):

thats not a proof for this question, it is a proof for the converse of this question

OpenStudy (lgbasallote):

you're welcome to give it a try

OpenStudy (anonymous):

|dw:1350120500516:dw|

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!