3.4 Problems

Prove the following statements using mathematical induction.

  1. 1.

    For every integer n0n\geqslant 0, 4n14^{n}-1 is divisible by 33.

  2. 2.

    For every nn\in\mathbb{N}, k=1nk3=14n2(n+1)2\sum_{k=1}^{n}k^{3}=\frac{1}{4}n^{2}(n+1)^{2}.

  3. 3.

    Every positive power of 13 can be written as a sum of two squares.

  4. 4.

    H02: Let AA be a set with |A|=n|A|=n. Then |𝒫(A)|=2n|\mathcal{P}(A)|=2^{n} for every integer n0n\geqslant 0.

    NOTE: You must prove this by mathematical induction to pass H02.

  5. 5.

    H02 Resit: Let SS be an infinite set of sets such that if A,BSA,B\in S, then ABSA\cap B\in S. If A1,,AnSA_{1},\cdots,A_{n}\in S, then i=1nAiS\bigcap_{i=1}^{n}A_{i}\in S for all nn\in\mathbb{N}.

    NOTE: You must prove this by mathematical induction to pass the H02 Resit.

  6. 6.

    Let nn\in\mathbb{N}. Take nn lines in the plane such that no two lines are parallel and no three lines meet at a single point. Then these lines divide the plane into n(n+1)2+1\frac{n(n+1)}{2}+1 regions.

  7. 7.

    Every set SS with |S|12|S|\geqslant 12 can be partitioned into two sets AA and BB such that 4||A|4\Big{|}|A| and 5||B|5\Big{|}|B|.