Vous êtes sur la page 1sur 3

Question 1

Use the information below to answer the questions


U= {Whole numbers less than 16}
P = {Prime numbers less <=17}
Q = {Factors of 24}
a. List of the members of [2 marks]
i. P⋂Q
ii. P ⋃ Q
b. Draw the Venn diagram to represent this information [6 marks]
c. Hence, write
i. n (P ⋂ Q) [2 marks]
ii. n (P ⋃ Q) [2 marks]
U = {1, 2, 3, 4, 7, 6, 7, 8, 9, 10, 11,12,13,14,15,16}
P = {3, 5, 7, 11, 13, 17}
Q = {}

Use information below to answer the question below


U= {Letters in the word athletics}
R= {letters in the word letters}
S= {Letters in the word health}
T= {letters in the word hat}
a. List the members of [14 marks]

i. R⋂S
ii. R ⋂ T
iii. S ⋂ T
iv. R⋃S
v. R ⋃ T
vi. S⋃T
vii. (R ⋂ S)’
viii. (R ⋂ T)’
b. Draw the Venn diagram to represent this information [6 marks]
Question 2
Convert the following binary numbers to hexadecimal
i. 1110000101101 =E2D
ii. 11101111100011110 =1DF1E
1 1 1 0 1 1 1 1 1 0 0 0 1 1 1 1 0
1 8 4 0 1 8 4 2 1 0 0 0 1 8 4 2 0
1 D 15 F 1 E

Question 3
Construct a truth table for each of these compound propositions
a. p ⟶ (∼q ∨ r)
b. ∼p ⟶ (q ⟶ r)
c. (p ⟶ q) ∨ (∼p ⟶ r)
d. (p ⟶ q) ∧ (∼p ⟶ r)
e. (p ⟷ q) ∨ (∼q ⟷ r)
f. (∼p ⟷ ∼q) ⟷ (q ⟷ r)

Let p, q, and r be the proposition


P: You have the flu
Q: You miss the final examination
R: You pass the course
Express each of these propositions as an English sentence
a. P⟶q
b. ∼Q ⟷ r
c. Q ⟶ ∼r
d. P∨q∨r
e. (p ⟶ ∼r) ∨ (q ⟶ ∼r)
f.
Use mathematical inductions to prove the questions below
a. 1 + 5 + 9 + 13 + ……. + (4n-3) = 2n2- n
N=1 (4(1) - 3) =1 = 2 (1)2 - 1
N=K
1 + 5 + 9 + 13 + … + (4K - 3) = 2K2 – K

2K2 – K + (4K+1 -3) =2(K + 1)2 – K+ 1


b. 12 + 32 + 52 +…… + (2n-1)2 = n(2n-1) (2n + 1)/3
N=1 (2(1) - 1)2 = 1(2(1) - 1) (2(1) + 1)/3
1 =3/3
N=K
12 + 32 + 52 +… +(2K-1)2 =K(2K-1) + K(2K + 1)//3
= k(2k-1) (2k + 1)/3 + (2k+1-1)2 =k + k(2K+1-1 ) -(2K+1+1 )

c. 1 + 3 + 6 + 10 + ……. + n (n + 1)/2 = n (n +1) (n + 2)/6


N= 1
1(1 + 1)/2 =1(1 + 1) (1 + 2)/6
2/2 =2*3/6 =1
N=K
1 + 3 + 6 + 10 + ………+ K(K + 1)/2 =K(k + 1)(k + 2)/6

Vous aimerez peut-être aussi