Discrete Mathematics
3. [8 marks] Induction.
(a) [3 marks) Prove that 3 | 22n+1 + 1 for all natural numbers n.
Copyright By PowCoder代写 加微信 powcoder
(b) (5 marks) Prove that for all positive integers n,
HINT: You will find it difficult (likely impossible) to prove this directly. Consider proving a slightly
stronger statement by making a small change to the expression inside the square root. Then, re-
member to use what you prove to conclude the inequality in this question.
4. 14 marks Working with functions. In this question, we will explore various properties of functions.
You may want to review the basic definitions and terminology introduced on pages 15-16 of the course
notes. Then, read the following definitions carefully.
Definition: A function f: A › B is one-to-one iff no two elements of A have the same image. Symbol-
Val, a2 € A, f(a1) = f(a2) = 01 = 02.
Definition: A function f: A
– B is onto iff every element of B is the image of at least one element
from A. Symbolically,
Vb E B,Ja € A, f(a) = b.
Definition: For all functions f: A › B and q : B – C, their composition is the function go f : A > C
defined by:
Va E A, (go f) (a) = g(f(a)).
(a) [4 marks]
i. Prove that g1 : 2 – 2: g(z) =2
– 4 is both one-to-one and onto.
i. Prove that g2 : R > R; g2(2) = a + 2 is neither one-to-one nor onto.
(b) [4 marks] Give explicit, concrete definitions for two functions f1, f2 : 7 › It such that:
i. fo is onto but not one-to-one,
il. f is one-to-one but not onto,
and prove that each of your functions has the desired properties.
(c) 6 marks Let f: A
+ B and q : B
+ C be arbitrary functions. Prove or disprove each of the
following. In each case, first write down in symbolic notation the exact statement you are attempting
to prove (either the original statement or its negation).
i. If go f is one-to-one, then f is also one-to-one.
i. If go f is onto, then g is also onto.
in. If go f is both one-to-one and onto, then f and q are also both one-to-one and onto.
程序代写 CS代考 加微信: powcoder QQ: 1823890830 Email: powcoder@163.com