mhf-3202-homework

MHF-3202 Homework



  • Homework 18. Due Friday 12 April. Section 12.6, problem 10. (8 April)
  • Homework 17. Due Friday 12 April. Section 12.5, problem 8. (8 April)
    • You might first wish to show, given a universal set \( U \) and \( A\subseteq U, \),that \( \overline{(\overline{A})}=A.\)
    • The problem asks the reader to find \(\theta^{-1}.\) I did not grade this part of the problem. Had I: It is not sufficient to simply state that \( \theta^{-1}(X)=\overline{X} = \theta(X)\) or even solve for the inverse. Rather, once a candidate for the inverse is identified, verify that it satisfies the definition of inverse function (a simple task in this example).
  • Homework 16. Due Wednesday 3 April. (29 March)
    • Show, if \( n\in\mathbb N \) is not prime, then there exists \( [a], \, [b] \in \mathbb Z_n\) such that \( [a]\ne [0] \ne [b] \), but \( [a]\cdot [b] = [0]. \)
    • Show, if \( p\in\mathbb N \) is prime, \( [a], \, [b] \in \mathbb Z_p\) and \( [a]\ne [0] \ne [b] \), then \( [a]\cdot [b] \ne [0]. \)
  • Homework 15. Due Monday 1 April. Section 11.3 problem 10. (25 March)
  • Homework 14. Due Wednesday 27 March (22 March).
      Let \( a_1=1, \, a_2=8,\) and \( a_n= a_{n-1}+2a_{n-2}\) for \( \ge 3. \) Prove \( a_n = (3)(2^{n-1})+2(-1)^n\) for all \( n\in \mathbb N.\)
  • Homework 13. Due Monday 25 March (18 March). Chapter 10, problem 8.
  • Homework 12. Due Monday 11 March. (27 Feb) Suppose \( U,V \) are sets and \( A,C\subset U\) and \(B,D\subset V\). Show \( (A\times B)\setminus (C\times D) = [A\times (B\setminus D)]\cup [(A\setminus C)\times B.\)
  • Homework 11. Due Wednesday 27 February. Chapter 7, problem 30. (22 Feb) Here is an outline you may wish to follows, in which case there are many details to be filled in.
    • 1. Show it suffices to prove: If \( p\mid ab\) and \( p\not\mid a\), then \( p\mid b.\)
    • In what follows, suppose \( p \) is prime, \( p\mid ab\) and \( p\not\mid a\).
    • 2. Show \( \gcd(a,p)=1. \)
    • 3. From (2) and the proposition on page 152, there exists \( k,\ell\in\mathbb Z\) such that \( ak+p\ell =1.\)
    • 4. Invoke the assumption \( p\mid ab\) and use a bit of algebra to show \( p\mid b,\) completing the proof.
  • Homework 10. Due Monday 25 February. Chapter 7, problem 8. (20 Feb)
  • Homework 9. Due Friday 22 February. Chapter 6, Problems 21 and 22. (In problem 21 interpret Explain as Prove. That is, prove \( x^2+y^2-3^k=0\) has no rational solutions when \( k \) is an odd integer. (18 Feb)
  • Homework 8. Due Wednesday 20 February. Chapter 5, Problems 10 and 28. (15 Feb)
  • Homework 7. Due Friday 15 February. Chapter 4, Problems 24 and 26. (11 Feb)
  • Homework 6. Due Wednesday 13 February. Chapter 4, Problems 8 and 10. (8 Feb)
  • Homework 5. Due Friday 1 February (28 Jan). Section 2.5 Problem 8.
      Which pairs of the following four statements are logically equivalent? \( (a) \sim (P\Rightarrow Q), \ \ (b)\, (Q\Rightarrow P), \ \ (c)\, P \wedge (\sim Q), \ \ (d)\, P \vee (\sim Q). \) Explain.
  • Homework 4. Due Monday 28 January (23 Jan). Section 2.3 problems 2,6,8; Section 2.4 problem 2,4.
  • Homework 3. Due Friday 25 January (21 Jan). Section 1.8 problem 14; Section 2.1 problems 4 and 8; Section 2.2 problem 8.
  • Homework 2. Due Friday 18 January (11 Jan). Section 1.2 problem 14; Section 1.4 problem 20;
      Suppose \( X,Y \) are sets, \( A,C \subseteq X \) and \( B,D\subseteq Y. \) Compare \( (A\times B)\setminus (C\times D)\) with \(\left((A\setminus C)\times B\right ) \bigcup \left( A\times (B\setminus D) \right ).\)
  • Homework 1. Due Friday 11 January (7 Jan). Section 1.1 problems 8,20,28,46,50.



    Homework grading abbreviations

  • QU. Quantifier unclear.
  • QE. Quantifier error.
  • QI. The symbol needs an introduction with a quantifier.
  • IT. If needs a then, or vice-versa.
  • IDF. I don’t follow.
  • Circular. Assumes what is to be proved.
  • ETR. Easy to read. Thanks!
  • MC. Missing conjunction(s).
  • SF. Sentence fragment or not a sentence.
  • DNP. Parse error (doesn’t parse).
  • DNF. Does not follow.
  • NN. Narration needed.
  • NRD. Not relevant, delete.
  • ꟼ start new paragraph.