Helping students gain understanding and self-confidence in algebra.
Proof: Let a=b be an integer. Then we have the following.
Things start to look strange around step 4/5. However, I'm not sure what is wrong.
Zerrigan wrote:3. Use a contradiction argument to show that for all positive real numbers X,Y, and Z, if X>Z and Y^2=XZ, then X>Y>Z. Hint: X>Y>Z is equivalent to saying X>Y and Y>Z.
Contradiction arguments use the general form of p and not q implies r and not r, correct? So for this problem it would be if X>Z and Y^2=XZ and X less than or equal to Y less than or equal to Z. Is this correct?
Zerrigan wrote:4. Prove that if D is an odd integer that divides both A+B and A-B, then D divides both A and B.
The definition of divides is that there A|B if there is some integer K we can multiply A by to get B, correct? So for this problem it would be if K_1D=A+B and K_2D=A-B then K_3D=A and K_4D=B correct? (The underscores represent subscripts).
Zerrigan wrote:5.Prove that N is odd if and only if N^2 is odd.
The definition of odd is that a number N can be represented by 2K_1+1 yes? So for an if and only if argument we prove if N is odd then N^2 is odd, then we prove the converse of if N^2 is odd, N is odd?
Zerrigan wrote:6. Prove that the sum of two odd numbers is even.
So I simply add (2K_1 +1)+(2K_2+1) and simply from there?
Zerrigan wrote:7. Prove by way on contradiction that for integers A,B, and C, if A^2+B^2=C^2, then at least one of A and B is even. Hint, use problem 5 and 6.
Zerrigan wrote:8. Prove that for all real numbers X and Y, if Y^3+YX^2 less than or equal to X^3+XY^2, then Y less than or equal to X. Hint, use a proof by contrapositive.
Contrapositive proofs reverse and negate the implication right? So for this it would be if Y>X, then Y^3+YX^2>X^3+XY^2?
Zerrigan wrote:9. Prove that the square root of 3 is irrational.
A rational number can be expressed as A/B where A and B are both integers. I'm not sure how to start this as I don't know how to express an irrational number.
Zerrigan wrote:10. 7^n -2^n is divisible by 5 for all natural numbers n. Hint, add a clever form of zero when doing the inductive step.
I can set the base case up for this fairly easily but I have no idea what the clever form of zero is during the inductive step.
Zerrigan wrote:11. (1+1/2)^n greater than or equal to 1+n/2.
This is another induction problem but I don't know how to deal with the inequality. Are there any particular tips I should use for these that don't apply to equalities?
Zerrigan wrote:13. Let P and Q be positive integers with Q>P. Prove that Q-P divides Q-1 if and only if Q-P divides P-1.
I don't even know what process to use on this one. I know the if and only if means I will be using the converse. But where do I even start?