Mathematical Proof/Appendix/Answer Key/Mathematical Proof/Methods of Proof/Constructive Proof

From testwiki
Revision as of 02:10, 25 November 2017 by imported>Pi zero ({{BookCat}})
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Problem 1

First, we wish to show that A(BC)(AB)(AC). Let xA(BC). Then xA or xBC.

Case 1: xA

xAAB so that xAB
xAAC so that xAC
xAB and xAC so that x(AB)(AC)

Case 2: xBC

xB and xC
xBABso that xAB
xCAC so that xAC
xAB and xAC so that x(AB)(AC)

Since in both cases, x(AB)(AC), we know that A(BC)(AB)(AC)

Now we wish to show that (AB)(AC)A(BC). Let x(AB)(AC). Then xAB and xAC.

Case 1a: xA

xAA(BC), so xA(BC)

Case 1b: xB

We can't actually conclude anything we want with just this, so we have to also to consider the case xAC.


Case 2a: xA : [see Case 1a]

Case 2b: xC

We now have xB and xC so that xBC
Of course, since xBCA(BC), it follows that xA(BC).
Since both cases 2a and 2b yield xA(BC), we know that it follows from 1b.

Since in both cases 1a and 1b, xA(BC), we know that (AB)(AC)A(BC).

Since both A(BC)(AB)(AC) and (AB)(AC)A(BC), it follows (finally) that A(BC)=(AB)(AC).


--will continue later, feel free to refine it if you feel it can be--

Problem 3

  1. Because the question asks about the square of a number, you can substitute the definition of an odd number Template:Math into the number to be squared. So, say x is that number, then

    x2=(2n+1)2=(2n+1)(2n+1)

  2. Multiply both factors together

    (2n+1)(2n+1)=4n2+4n+1

  3. Factor out a two for the first two terms

    4n2+4n+1=2(2n2+2n)+1

  4. The factor 2n2+2n will always be a natural number. As such, it fits the definition of an odd number, Template:Math
Problem solved!

Template:BookCat