{"id":2843,"date":"2023-10-03T14:00:56","date_gmt":"2023-10-03T14:00:56","guid":{"rendered":"http:\/\/localhost\/ecole9ja\/?p=2843"},"modified":"2023-10-03T14:03:22","modified_gmt":"2023-10-03T14:03:22","slug":"week-6-and-7-ss2-first-term-further-mathematics-notes","status":"publish","type":"post","link":"https:\/\/ecolebooks.com\/nigeria\/posts\/week-6-and-7-ss2-first-term-further-mathematics-notes\/","title":{"rendered":"Week 6 and 7 – SS2 First Term Further Mathematics Notes"},"content":{"rendered":"

WEEK 6
\n<\/strong>Review
\nWEEK 1 FINDING QUADRATIC EQUATIONS WITH GIVEN SUM AND PRODUCT OF ROOTS
\nWEEK 2 TANGENT AND NORMAL TO CURVES
\nWEEK 3 POLYNOMIAL
\nWEEK 4 POLYNOMIAL ( CONTINUED)
\nWEEK 5 CUBIC EQUATIONS<\/p>\n

\u00a0
\n\u00a0WEEK 7
\n<\/strong>TOPIC: Logical reasoning
\n<\/strong>Statements
\n<\/strong>A statement in a logical context is a declaration, verbal or written that is either true or false but not both.
\nA true statement is said to have a truth value T,<\/strong> while a false statement is said to have a truth value F.
\n<\/strong>
\n\u00a0Example 1
\n<\/strong>The following are statements:
\n(a) Nigeria is an African country.
\n(b) The earth is conical in shape.
\n(c) If I run I shall not late.
\n(d) Japanese are hard working people.<\/p>\n

\u00a0Example 2
\n<\/strong>The following are not statements in the logical context.
\n(a) Who is he?
\n(b) What a lovely man!
\n(c) Take the pencil away.
\n(d) If I think of my family.
\nIn general, questions, exclamations, commands and expressions of feelings which cannot be assigned a truth value T or F are not statements in the logical context.
\nBy convention, we shall use letter P<\/em>.q.r,\u2026<\/em> to denote statements.<\/p>\n

\u00a0Negation
\n<\/strong>Given a statement P, the negation ofP, written \u0334P is the statement; “it is false that P” or “nor P”.If P is true, \u0334P is false and if P is false \u0334P is true. In other words, if P has the truth value T then \u0334P has the truth value F and if P has the truth value F then \u0334P has the truth value T.
\nThe relationship between P and \u0334P can be summarizer in the following table.
\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Table 1
\n<\/strong><\/p>\n

\n\n\n\n\n\n
P<\/td>\n \u0334P<\/td>\n<\/tr>\n
T<\/td>\nF<\/td>\n<\/tr>\n
F<\/td>\nT<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n

Table 1 is called a truth table.<\/p>\n

\u00a0If P is a statement: “Nigeria is a rich country” then \u0334P is the statement: “it is false that Nigeria is a rich country” or in a more reasonable English “Nigeria is not a rich country”.<\/p>\n

\u00a0Let q<\/em> be the statement “some lawyers are honest people” then \u0334q<\/em> is the statement” it is false that some lawyers are honest people”. In a more reasonable English, we can also write \u0334q<\/em> as some lawyers are not honest people.<\/p>\n

\u00a0Let P be the statement 3 + 4 = 8 then \u0334P is the statement 3 + 4 \u2260 8.<\/p>\n

\u00a0\"\"\/Let q be the statement X + 1 \u2265 4 then \u0334q<\/em> is the statement X + 1 \u2265 4.<\/p>\n

\u00a0Let P be the statement “The set of numbers 2, 4, 6, 8, \u2026 is a set of even numbers” then \u0334P is the statement “The set of numbers 2, 4, 6, 8, \u2026 is a set of odd numbers.
\n1. State which of the following are statements in the logical context:
\n(a) Caesar was a great leader.
\n(b) Stop talking to the boys.
\n(c) Decide whether you are going to the club’s meeting now.
\n(d) Oh Mansa Musa, you are wonderful!
\n(e) The Broking House in Ibadan, is a magnificent building.<\/p>\n

\u00a02. State which of the following are statements in the logical context:
\n(a) As old as Methuselah.
\n(b) The set of numbers 3, 5 and 4 is not a Pythagorean triplet.
\n(c) Is he a serious teacher at all?
\n(d) If 6 is an odd number, then 3 + 5 = 10.<\/p>\n

\u00a03. Write the negation of each of the following statements:
\n(a) He is a handsome man.
\n(b) It is very cold in Siberia.
\n(c) It is very hot in tropics.
\n(d) The sky is blue.<\/p>\n

\u00a04. Write the negation of each of the following statements:
\n(a) The party leader will win the election.
\n(b) The football captain scored the first goal.
\n(c) Short cuts are dangerous.
\n(d) Honest men are very rare to come by.<\/p>\n

\u00a05. Statement with reasons whether the statement q <\/em> is a negation of the statement P<\/em> in each of the following:
\n(a) \u00a0\u00a0\u00a0\u00a0p<\/em>. The line AB is parallel to the line CD,
\n\u00a0\u00a0\u00a0\u00a0q. <\/em>The line AB is perpendicular to the line CD.
\n(b)\u00a0\u00a0\u00a0\u00a0p<\/em>. He is a good leader.
\n\u00a0\u00a0\u00a0\u00a0q. <\/em>He is a bad leader.
\n(c)\u00a0\u00a0\u00a0\u00a0p<\/em>. She is a good leader.
\n\u00a0\u00a0\u00a0\u00a0q. <\/em>She is a good follower.<\/p>\n

\u00a0(6) Write the negation of each of the following avoiding the word ‘not’ as much as possible.
\n(a) The car is moving fast.
\n(b) He was present in school yesterday.
\n(c)The Equator is a Great circle.
\n(d) His friend is younger than my brother.
\n(7) Write the negation of each of the following avoiding the word ‘not’ as much as possible.
\n(a) He obtained the least mark in the examination.
\n(b) She is the shortest girl in the class.
\n(c) He is an ugly man.
\n(d) The hospital is in a bad state.<\/p>\n

\u00a0Conditional Statement
\n<\/strong>Let p <\/em>stand for the statement ‘Lagos is a state in Nigeria’ and q<\/em> stand for the statement ‘Lagos is a state in Africa’. One way the two statements can be combined is ‘If Lagos is a city in Nigeria then Lagos is a city in Africa or ‘if p<\/em> and q<\/em>‘.<\/p>\n

\u00a0The statement ”if p<\/em> and q<\/em>‘ is a combination of two simple statements p<\/em> and q<\/em> it is therefore called a compound statement.
\n<\/strong>\"\"\/Symbolically, we can write the compound statement if p<\/em> then q<\/em>as p\u00a0\u00a0\u00a0\u00a0q<\/em>.
\n\"\"\/The statementp<\/em>\u00a0\u00a0\u00a0\u00a0q<\/em> is read as:
\n\u00a0\u00a0\u00a0\u00a0p<\/em> implies q or
\nIf p then q or
\nq<\/em> is necessary for p<\/em> or
\np<\/em> is sufficient for q<\/em> or
\np<\/em> only if q<\/em> or
\np<\/em> follows from p<\/em> or
\nq<\/em>ifp.
\n<\/em>\"\"\/\"\"\/The symbol \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0is an operation. In the compound statementp<\/em> is called the antecedent<\/strong> while the sub statementq<\/em> is called the consequent <\/strong>of p\u00a0\u00a0\u00a0\u00a0q.
\n<\/em>\"\"\/The truth or falsity of the implication p\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0q<\/em> is illustrated in Table 2.
\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0Table 2
\n<\/strong><\/p>\n

\n\n\n\n\n
p<\/em><\/td>\nQ<\/em><\/td>\n\"\"\/P q<\/em><\/td>\n<\/tr>\n
T
\nT
\nF
\nF<\/td>\n		T
\nF
\nT
\nF<\/td>\n		T
\nF
\nT
\nT<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n

\"\"\/\"\"\/The statement p<\/em>\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0q<\/em> is false if the antecedent is true and the consequent is false. The statement p<\/em>\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0q<\/em> is sometimes called a Conditional Statement.
\n<\/strong>Consider the following statements;
\n(a) If Cairo is in Africa then 8 is an even number.
\n(b) If Cairo is in Africa then 8 is an odd number.
\n(c)If Cairo is in Asia then 8 is an even number.
\n(d) If Cairo is in Asia then 8 is an odd number.
\nThe statements (a) (c) and (d) are all true but the statement (b) is not true for the simple reason that the antecedent is true while the consequent is false. Note that although in statement (d) both the antecedent and consequent are false, yet the whole statement is true.<\/p>\n

\u00a0Converse Statement
\n<\/strong>\"\"\/\"\"\/Letp<\/em> be the statement ‘a triangle is equilateral’ and q<\/em> the statement ‘a triangle is equiangular’. The statement p<\/em> implies q.<\/em>i.ep\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0q<\/em>. The statement also implies p, i.eq\u00a0\u00a0\u00a0\u00a0p<\/em>. In other words, if a triangle is equiangular then it is equilateral. The statement q\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0p<\/em> is called the converse of the statement<\/strong>
\n\t\t\"\"\/P\u00a0\u00a0\u00a0\u00a0q.<\/em><\/p>\n

\u00a0Inverse Statement
\n<\/strong>\"\"\/If p<\/em> is the statement ‘a triangle is equilateral’ and q<\/em> is the statement ‘a triangle is equiangular’ the statement \u0334p\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/em> \u0334q<\/em> is the statement ‘if a triangle is not equilateral than it is not equiangular.
\n\"\"\/\"\"\/The statement \u0334p\u00a0\u00a0\u00a0\u00a0<\/em> \u0334q<\/em>is called the inverse of the statement <\/strong>p\u00a0\u00a0\u00a0\u00a0q.<\/em><\/p>\n

\u00a0Contrapositive Statement
\n<\/strong>\"\"\/If P<\/em> is the statement ‘a triangle is equilateral’ and q<\/em> is the statement ‘a triangle is equiangular’ the statement \u0334q\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/em> \u0334p<\/em> is ‘if a triangle is not equiangular then it is not equilateral’. The statement
\n\"\"\/\"\"\/q\u00a0\u00a0\u00a0\u00a0p<\/em> is called the contrapositive statement <\/strong>of p\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0q.<\/em><\/p>\n

\u00a0Biconditional Statement
\n<\/strong>Let p<\/em> be the statement ‘the interior angles of a polygon are equal’ and q<\/em> be the statement ‘a polygon is regular’.
\n\"\"\/p\u00a0\u00a0\u00a0\u00a0q<\/em> is the statement’If the interior angles of a polygon are equal then the polygon is regular’
\n\t\t\t<\/em>\"\"\/\"\"\/\"\"\/q\u00a0\u00a0\u00a0\u00a0p<\/em> is the statement ‘If a polygon is regular then the interior angles of the polygon are equal’. We see here thatp\u00a0\u00a0\u00a0\u00a0q <\/em>and q\u00a0\u00a0\u00a0\u00a0p.<\/em>
\n\t\t\"\"\/\"\"\/The two conditional statements are valid. We say that p <\/em>and q<\/em> imply ‘each other or p is equivalent to q<\/em> and we write p\u00a0\u00a0\u00a0\u00a0q<\/em>. The statement p\u00a0\u00a0\u00a0\u00a0q<\/em> is called a Biconditional Statement<\/strong> of p and q<\/em> and the
\nstatementsp<\/em> and q<\/em> are said to be equivalent to each other.
\n\"\"\/Other terminologies for p\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0q<\/em> are:
\nq<\/em> is equivalent to p
\n<\/em>p<\/em> is necessary and sufficient for q
\n<\/em>q<\/em>if and only if p
\n<\/em>p<\/em> if and only if q
\n<\/em>If p<\/em>thenq and if q<\/em> thenp.<\/em>
\n\t\t\"\"\/The truth of falsity of pq<\/em> is completely illustrated by Table 3.
\nTable 3
\n<\/strong><\/p>\n

\n\n\n\n\n
p<\/em><\/td>\nq<\/em><\/td>\n\"\"\/P q<\/em><\/td>\n<\/tr>\n
T
\nT
\nF
\nF<\/td>\n		T
\nF
\nT
\nF<\/td>\n		T
\nF
\nF
\nT<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n

So a biconditional statement is true when the two substatements have the same truth value.
\nConsider the following four statements:
\n(a) Nyerere is an African name if and only if a, e, i, o, u are vowels;
\n(b) Nyerere is an African name if and only if a, e, i, o, u are consonants;
\n(c) Nyerere is a European name if and only if a, e, i, o, u are vowels;
\n(d) Nyerere is a European name if and only if a, e, i, o, u are are consonants.
\nThe statements (a) and (d) are both true since the substatements of each have the same truth value. The statements (b) and (c) are false since the substatement of each have different truth values.<\/p>\n

\u00a0The Chain Rule
\n<\/strong>\"\"\/\"\"\/\"\"\/If p. q <\/em>andr<\/em> are three statements such that p\u00a0\u00a0\u00a0\u00a0q<\/em> and q\u00a0\u00a0\u00a0\u00a0r,<\/em> then p\u00a0\u00a0\u00a0\u00a0r.<\/em> This is called the chain rule<\/strong>and it may have several links.
\nConsider the argument:
\nT1<\/sub>:\u00a0\u00a0\u00a0\u00a0If a student works very hard, he passes his examination.
\nT2<\/sub>:\u00a0\u00a0\u00a0\u00a0If a student passes his examination, he is awarded a certificate.
\nT1<\/sub>:\u00a0\u00a0\u00a0\u00a0If a student works very hard, he is awarded a certificate.
\nLet P<\/em> be the statement ‘a student works very hard.
\nLet q<\/em> be the statement ‘a student passes his examination.
\nLet r<\/em> be the statement ‘a student is awarded a certificate.
\nThe argument has the following structural form:
\n\"\"\/\"\"\/\"\"\/p\u00a0\u00a0\u00a0\u00a0p.\u00a0\u00a0\u00a0\u00a0q\u00a0\u00a0\u00a0\u00a0r\u00a0\u00a0\u00a0\u00a0:\u00a0\u00a0\u00a0\u00a0p\u00a0\u00a0\u00a0\u00a0r
\n<\/em>This argument follows the chain rule link hence it is said to be valid.
\nThe statement T1<\/sub> and T2<\/sub> are called the Premises<\/strong>while the statement T3<\/sub> is called the Conclusion<\/strong> of the argument.
\nThe argument is valid not on the basis of the truth or falsity of its premises but on the basis of the structural from which follows the chain rule link.<\/p>\n

\u00a0Compound Statement
\n<\/strong>A statement may consist of two or more simple statements or substatements. Such a statement is called
\naCompound <\/strong>or Composite Statement.<\/strong> For example, the compound statement: ‘John is an intelligent and courageous boy’, consists of the substatements: ‘John is an intelligent boy’ and ‘John is a courageous boy’.
\nBy convention, we shall use letters p, q, r,\u2026<\/em> to denote statements.
\nWe proceed now to introduce logical symbols called Connectives.
\n<\/strong>
\n\u00a0Disjunction
\n<\/strong>Two statements can be combined by the use of the connective ‘or’.
\nThe statement: ‘He is a philosopher’ can be combined with the statement ‘He is a teacher as follow: ‘He is a philosopher or he is a teacher’. In a more refined English, the combined statement is ‘Either he is a philosopher, or he is a teacher’.
\nIf the statement ‘He is a philosopher’ is denoted p<\/em> and the statement ‘He is a teacher is denoted q,<\/em> the combined statement is either p<\/em> or q<\/em>or simply q or q.<\/em> In symbolic logic, q <\/em>or q <\/em>is designated p<\/em> v q,<\/em> where the connective p <\/em>v q.<\/em>Where the connective v means ‘or’.
\nThe word ‘or; in English Language is used in two different sense.
\nIn the statement, ‘the professor will deliver the lecture at Bayero University or remain at the hotel’. The ‘or’ is used in an exclusive sense, in that it is not possible for the professor to deliver lecture at Bayero University, and at the same time remain at the hotel. The ‘or’ is said to be used in the exclusive sense.
\nIn the statement, ‘He is a good politician or a good statement’, the or is used in the inclusive sense, in that it is possible for the good politician to be a good statesman as well. We shall clear this apparent ambiguity, it we settle for one meaning.<\/p>\n

\u00a0In this teat, we use ‘or’ in the inclusive sense.<\/strong> The statement p v q <\/em>can be read; either p or q <\/em>or both or simply p v q<\/em> or both. The truth table for p v q<\/em> is illustrated in Table 4
\nTable 4
\n<\/strong><\/p>\n

\n\n\n\n\n
p<\/em><\/td>\nq<\/em><\/td>\nP v q<\/em><\/td>\n<\/tr>\n
T
\nT
\nF
\nF<\/td>\n		T
\nF
\nT
\nF<\/td>\n		T
\nT
\nT
\nF<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n

The statement p v q<\/em> is false when both p <\/em>and q<\/em> are false, otherwise p v q<\/em> is true.
\nConsider the following statements:
\n(a) Cairo is in Africa or 8 is an even number.
\n(b) Cairo is in Africa or 8 is an odd number.
\n(c) Cairo is in Asia or 8 is an even number.
\n(d) Cairo is in Asia or 8 is an odd number.
\nThe statements (a) (b) and (c) are all true since at least one of the substatements is true. The statement (d) is false since the two substatements are false.<\/p>\n

\u00a0Conjunction
\n<\/strong>Another way by which two statements can be combined with the statement ‘she is proud’ using the connective ‘and’ as ‘she is pretty and she is proud’. In a more refined English, the combined statement is: ‘she is pretty and proud’.
\nIf the statement ‘she is pretty’ is denoted p<\/em> and the statement ‘she is proud’ is denoted q,<\/em> the statement ‘she is pretty and proud’ can be written as p <\/em>and q.<\/em> In symbolic logic, p<\/em> and q<\/em> is designated p \u1d27q,<\/em> where
\nthe connective \u1d27<\/em> means ‘and’.
\nThe truth table for p \u1d27 q<\/em> is illustrated in Table 5<\/p>\n

\u00a0Table 5
\n<\/strong><\/p>\n

\n\n\n\n\n
p<\/em><\/td>\nq<\/em><\/td>\nP \u1d27 q<\/em><\/td>\n<\/tr>\n
T
\nT
\nF
\nF<\/td>\n		T
\nF
\nT
\nF<\/td>\n		T
\nF
\nF
\nF\u00a0\u00a0\u00a0\u00a0<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n

The statementp \u1d27 q <\/em>is true when the sub statements p <\/em>and q <\/em>are both true, otherwise p \u1d27 q <\/em>is false.
\n<\/strong>Consider the following statements:
\n(a) Cairo is in Africa and 8 is an even number.
\n(b) Cairo is in Africa and 8 is an odd number.
\n(c) Cairo is in Asia and 8 is an even number.
\n(d) Cairo is in Asia and 8 is an odd number.
\nThe statements (a) (b) and (c) are all true since at least one of the substatements is true. The statement (d) is false since the two substatements are false
\nOf the four given statements, only (a) is true. The statements (b), (c) and (d) are since at least one if their substatement is false.<\/p>\n

\u00a0Equivalent Statements
\n<\/strong>Two compound statements are said to be logically equivalent if they have the same truth value.
\n<\/strong>Use the truth table to establish that:
\n\u0334(p v q)<\/em> = \u0334p<\/em> \u1d27 \u0334q<\/em><\/p>\n

\u00a0Solution
\n<\/strong>\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0Table 6
\n<\/strong><\/p>\n

\n\n\n\n\n
p<\/em><\/td>\nQ<\/em><\/td>\np \u1d27 q<\/em><\/td>\n \u0334(p v q)<\/td>\n<\/tr>\n
T
\nT
\nF
\nF<\/td>\n		T
\nF
\nT
\nF<\/td>\n		F
\nF
\nF
\nT\u00a0\u00a0\u00a0\u00a0<\/td>\n		F
\nF
\nF
\nT<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n

\u00a0<\/p>\n

\n\n\n\n\n
P<\/em><\/td>\nq<\/em><\/td>\n \u0334p<\/em><\/td>\n \u0334q<\/em><\/td>\n \u0334p\u1d27 \u0334q<\/td>\n<\/tr>\n
T
\nT
\nF
\nF<\/td>\n		T
\nF
\nT
\nF<\/td>\n		F
\nF
\nT
\nT\u00a0\u00a0\u00a0\u00a0<\/td>\n		F
\nF
\nF
\nT<\/td>\n		F
\nF
\nF
\nT<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0(a)\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0(b)
\nWe observe that the last columns of Table 6(a) and Table 6(b) have the same truth values.
\nHence \u0334(p v q)<\/em> = \u0334p \u1d27<\/em> \u0334q
\n<\/em>
\n\u00a0Use the truth table to prove that:
\n\u0334(p \u1d27 q)<\/em> = \u0334p v<\/em> \u0334q
\n<\/em>
\n\u00a0Solution
\n<\/strong>\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0Table 7
\n<\/strong><\/p>\n

\n\n\n\n\n
p<\/em><\/td>\nq<\/em><\/td>\np \u1d27 q<\/em><\/td>\n \u0334(p v q)<\/td>\n<\/tr>\n
T
\nT
\nF
\nF<\/td>\n		T
\nF
\nT
\nF<\/td>\n		T
\nF
\nF
\nF\u00a0\u00a0\u00a0\u00a0<\/td>\n		F
\nT
\nT
\nT<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n

\u00a0<\/p>\n

\n\n\n\n\n
P<\/em><\/td>\nQ<\/em><\/td>\n \u0334p<\/em><\/td>\n \u0334q<\/em><\/td>\n \u0334p\u1d27 \u0334q<\/td>\n<\/tr>\n
T
\nT
\nF
\nF<\/td>\n		T
\nF
\nT
\nF<\/td>\n		F
\nF
\nT
\nT\u00a0\u00a0\u00a0\u00a0<\/td>\n		F
\nT
\nF
\nT<\/td>\n		F
\nT
\nT
\nT<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0(a)\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0(b)
\nThe last columns of the two tables have the same truth values, hence \u0334(p \u1d27 q)<\/em> = \u0334p v <\/em> \u0334q
\n<\/em>
\n\u00a0Use the truth table to show that:
\n(a) the connective \u1d27 distributes over the connective v;
\n(b) the connective v distributes over the connective \u1d27.<\/p>\n

\u00a0Solution
\n<\/strong>Given the statements p, q <\/em>and r<\/em> and the connectives \u1d27 and v, we wish specifically to show that:
\n(a) p \u1d27 (q v r) = (p \u1d27 q) v (p \u1d27 r)
\n(b)p v (q \u1d27 r) = (p v q) \u1d27 (p v r)<\/p>\n

\u00a0
\n\u00a0
\n\u00a0
\n\u00a0(a)
\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0Table 8
\n<\/strong><\/p>\n

\n\n\n\n\n
p<\/em><\/td>\nQ<\/em><\/td>\nR<\/em><\/td>\nq v r<\/td>\np\u1d27 (q v r)<\/td>\n<\/tr>\n
T
\nT
\nT
\nT
\nF
\nF
\nF
\nF<\/td>\n		T
\nT
\nF
\nF
\nF
\nF
\nT
\nT<\/td>\n		T
\nF
\nT
\nF
\nF
\nT
\nT
\nF\u00a0\u00a0\u00a0\u00a0<\/td>\n		T
\nT
\nT
\nF
\nF
\nT
\nT
\nT<\/td>\n		T
\nT
\nT
\nF
\nF
\nF
\nF
\nF<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n

\u00a0
\n\u00a0
\n\u00a0
\n\u00a0Table 9
\n<\/strong><\/p>\n

\n\n\n\n\n
p<\/em><\/td>\nq<\/em><\/td>\nr<\/em><\/td>\np \u1d27 q<\/td>\n p \u1d27 r<\/td>\n(p \u1d27 q) v (p \u1d27 r)<\/td>\n<\/tr>\n
T
\nT
\nT
\nT
\nF
\nF
\nF
\nF<\/td>\n		T
\nT
\nF
\nF
\nF
\nF
\nT
\nT<\/td>\n		T
\nF
\nT
\nF
\nF
\nT
\nF
\nT\u00a0\u00a0\u00a0\u00a0<\/td>\n		T
\nT
\nT
\nF
\nF
\nT
\nT
\nT<\/td>\n		T
\nF
\nT
\nF
\nF
\nF
\nF
\nF<\/td>\n		T
\nT
\nT
\nF
\nF
\nF
\nF
\nF<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n

\u00a0
\n\u00a0
\n\u00a0
\n\u00a0
\n\u00a0
\n\u00a0
\n\u00a0
\n\u00a0
\n\u00a0
\n\u00a0We notices that the last two columns of the two tables above the same truth values,
\nHence p \u1d27 (q v r) = (p \u1d27 q) v (p \u1d27 r)
\n(b)
\nTable 10
\n<\/strong><\/p>\n

\n\n\n\n\n
p<\/em><\/td>\nq<\/em><\/td>\nR<\/em><\/td>\nq \u1d27 r<\/td>\n p v (q \u1d27 r)<\/td>\n<\/tr>\n
T
\nT
\nT
\nT
\nF
\nF
\nF
\nF<\/td>\n		T
\nT
\nF
\nF
\nF
\nF
\nT
\nT<\/td>\n		T
\nF
\nT
\nF
\nF
\nT
\nF
\nT\u00a0\u00a0\u00a0\u00a0<\/td>\n		T
\nF
\nF
\nF
\nF
\nF
\nF
\nT<\/td>\n		T
\nT
\nT
\nT
\nF
\nF
\nF
\nT<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n

\u00a0
\n\u00a0
\n\u00a0
\n\u00a0
\n\u00a0
\n\u00a0
\n\u00a0
\n\u00a0
\n\u00a0
\n\u00a0
\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0Table 11
\n<\/strong><\/p>\n

\n\n\n\n\n
p<\/em><\/td>\nq<\/em><\/td>\nr<\/em><\/td>\np v q<\/td>\n p v r<\/td>\n(p v q) \u1d27 (p v r)<\/td>\n<\/tr>\n
T
\nT
\nT
\nT
\nF
\nF
\nF
\nF<\/td>\n		T
\nT
\nF
\nF
\nF
\nF
\nT
\nT<\/td>\n		T
\nF
\nT
\nF
\nF
\nT
\nF
\nT\u00a0\u00a0\u00a0\u00a0<\/td>\n		T
\nT
\nT
\nT
\nF
\nF
\nT
\nT<\/td>\n		T
\nT
\nT
\nT
\nF
\nT
\nF
\nT<\/td>\n		T
\nT
\nT
\nT
\nF
\nF
\nF
\nT<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n

\u00a0
\n\u00a0
\n\u00a0
\n\u00a0
\n\u00a0
\n\u00a0
\n\u00a0
\n\u00a0
\n\u00a0
\n\u00a0We see here also that the last two columns of Table 10 and Table 11 have the same truth value, hence
\np v (q \u1d27 r) = (p v q) \u1d27 (p v r)
\nGiven the statements p, q and r show that:
\n(a) p \u1d27 (q \u1d27 r) = (p \u1d27 q) \u1d27 r
\n(b) p v (q v r) = (p v q) v r
\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0Table 12
\n<\/strong>(a<\/p>\n

\n\n\n\n\n
p<\/em><\/td>\nq<\/em><\/td>\nR<\/em><\/td>\nq \u1d27 r<\/td>\n p v (q \u1d27 r)<\/td>\n<\/tr>\n
T
\nT
\nT
\nT
\nF
\nF
\nF
\nF<\/td>\n		T
\nT
\nF
\nF
\nF
\nF
\nT
\nT<\/td>\n		T
\nF
\nT
\nF
\nF
\nT
\nF
\nT\u00a0\u00a0\u00a0\u00a0<\/td>\n		T
\nF
\nF
\nF
\nF
\nF
\nF
\nT<\/td>\n		T
\nF
\nF
\nF
\nF
\nF
\nF
\nF<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n

\u00a0\u00a0\u00a0\u00a0<\/p>\n

\n\n\n\n\n
P<\/em><\/td>\nQ<\/em><\/td>\nr<\/em><\/td>\np \u1d27 q<\/td>\n(p \u1d27 q) \u1d27 r<\/td>\n<\/tr>\n
T
\nT
\nT
\nT
\nF
\nF
\nF
\nF<\/td>\n		T
\nT
\nF
\nF
\nF
\nF
\nT
\nT<\/td>\n		T
\nF
\nT
\nF
\nF
\nT
\nF
\nT\u00a0\u00a0\u00a0\u00a0<\/td>\n		T
\nT
\nF
\nF
\nF
\nF
\nF
\nF<\/td>\n		T
\nF
\nF
\nF
\nF
\nF
\nF
\nF<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n

\u00a0
\n\u00a0
\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/p>\n

\u00a0
\n\u00a0
\n\u00a0
\n\u00a0
\n\u00a0(a)\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (b)<\/p>\n

\u00a0The last two columns of Table 12(a) and Table 12(b) are identical, hence;
\np \u1d27 (q \u1d27 r) = (p \u1d27 q) \u1d27 r
\nWe see here that the conjunctive connective as an operator, is associative.
\n(b)\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0Table 13
\n<\/strong><\/p>\n

\n\n\n\n\n\n\n
P<\/em><\/td>\nQ<\/em><\/td>\nr<\/em><\/td>\np \u1d27 q<\/td>\n(p v q) v r<\/td>\n<\/tr>\n
T
\nT
\nT
\nT
\nF
\nF
\nF
\nF<\/td>\n		T
\nT
\nF
\nF
\nF
\nF
\nT
\nT<\/td>\n		T
\nF
\nT
\nF
\nF
\nT
\nF
\nT\u00a0\u00a0\u00a0\u00a0<\/td>\n		T
\nF
\nF
\nF
\nF
\nF
\nF
\nT<\/td>\n		T
\nT
\nT
\nT
\nF
\nT
\nT
\nT<\/td>\n<\/tr>\n
p<\/em><\/td>\nq<\/em><\/td>\nr<\/em><\/td>\nq v r<\/td>\n p v (q v r)<\/td>\n<\/tr>\n
T
\nT
\nT
\nT
\nF
\nF
\nF
\nF<\/td>\n		T
\nT
\nF
\nF
\nF
\nF
\nT
\nT<\/td>\n		T
\nF
\nT
\nF
\nF
\nT
\nF
\nT\u00a0\u00a0\u00a0\u00a0<\/td>\n		T
\nT
\nT
\nF
\nF
\nT
\nT
\nT<\/td>\n		T
\nT
\nT
\nT
\nF
\nT
\nT
\nT<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n

\u00a0
\n\u00a0
\n\u00a0
\n\u00a0
\n\u00a0
\n\u00a0
\n\u00a0
\n\u00a0
\n\u00a0
\n\u00a0Table last two columns of Table 13a and Table 13b are identical, hence p v (q v r) = (p v q) v r
\nThe disjunctive connective as an operator is seen as being associative.
\n<\/strong>Tautology and Contradiction
\n<\/strong>A compound statement which is always true irrespective of the truth values of the substatements, is called a Tautology<\/strong>. A tautology is represented as T.
\n<\/strong>A compound statement which is always false, irrespective of the truth values of the substatements is called a Contradiction.<\/strong> A contradiction is usually represented as F.
\n<\/strong>Ues the truth table to show that the statement p v \u0334p is a tautology.<\/p>\n

\u00a0Solution
\n<\/strong>\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0Table 14
\n<\/strong><\/p>\n

\n\n\n\n\n
p<\/td>\n \u0334p<\/td>\np v \u0334p<\/td>\n<\/tr>\n
T
\nT
\nF
\nF<\/td>\n		F
\nF
\nT
\nT<\/td>\n		T
\nT
\nT
\nT<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n

\u00a0We observe that the last column of the table has the truth value T irrespective of the truth values of the substatements. Hence the statement p v \u0334p is a tautology.
\nUse the truth table to show the statement p \u1d27 \u0334p is a contradiction.<\/p>\n

\u00a0
\n\u00a0
\n\u00a0
\n\u00a0
\n\u00a0
\n\u00a0
\n\u00a0
\n\u00a0Solution
\n<\/strong>\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0Table 15
\n<\/strong><\/p>\n

\n\n\n\n\n
p<\/td>\n \u0334p<\/td>\np \u1d27 \u0334p<\/td>\n<\/tr>\n
T
\nT
\nF
\nF<\/td>\n		F
\nF
\nT
\nT<\/td>\n		F
\nF
\nF
\nF<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n

The last column of Table 15 has the truth value F irrespective of the truth values of the substatements hence, p \u1d27 \u0334p = F.
\nShow that the statement
\np \u1d27 (( \u0334p \u1d27 q) v ( \u0334p \u1d27q)) is a contradiction.<\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0Table 16
\n<\/strong><\/p>\n

\n\n\n\n\n
p<\/td>\nQ<\/td>\n \u0334p<\/td>\n \u0334q<\/td>\n \u0334p \u1d27 q<\/td>\n \u0334p \u1d27 \u0334q<\/td>\n( \u0334p \u1d27 q) v
\n( \u0334p \u1d27 \u0334q)<\/td>\n		p \u1d27 (( \u0334p \u1d27 q) v
\n( \u0334p \u1d27 \u0334q))<\/td>\n<\/tr>\n
T
\nT
\nF
\nF<\/td>\n		T
\nF
\nT
\nF<\/td>\n		F
\nF
\nT
\nT<\/td>\n		F
\nT
\nF
\nT<\/td>\n		F
\nF
\nT
\nF<\/td>\n		F
\nF
\nF
\nT<\/td>\n		F
\nF
\nT
\nT<\/td>\n		F
\nF
\nF
\nF<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n

We see that the truth value of expression in the last column of Table 16 is F irrespective of the truth values of the substatements, hence p \u1d27 (( \u0334p \u1d27 q) v( \u0334p \u1d27 \u0334q)) = F
\nLaws of the Algebra of Logical Statements
\n<\/strong>There is a close relationship between the algebra of sets and algebra of logical statements. The logical connectives as operations obey the laws of algebra.<\/p>\n

\u00a0Commutative Laws
\n<\/strong>i. \u00a0\u00a0\u00a0\u00a0(a) p \u1d27 q = q \u1d27 p
\nI\u00a0\u00a0\u00a0\u00a0(b) p v q = q v p<\/p>\n

\u00a0Associative Laws
\n<\/strong>Ii\u00a0\u00a0\u00a0\u00a0(a) p \u1d27 (q \u1d27 r) = (p \u1d27 q) \u1d27 r
\nIi\u00a0\u00a0\u00a0\u00a0(b) p v (q v r) = (p v q ) v r<\/p>\n

\u00a0Distributive Laws
\n<\/strong>iii.\u00a0\u00a0\u00a0\u00a0(a) p \u1d27 (q \u1d27 r) = (p \u1d27 q) \u1d27 (p \u1d27 r)
\niii.\u00a0\u00a0\u00a0\u00a0(b) p v (q v r) = (p v q ) v (p v r)<\/p>\n

\u00a0Laws of Absorption
\n<\/strong>iv.\u00a0\u00a0\u00a0\u00a0(a) p \u1d27 (p v q) = p
\niv.\u00a0\u00a0\u00a0\u00a0(b) p v (p \u1d27 q) = p<\/p>\n

\u00a0Idempotent Laws
\n<\/strong>v.\u00a0\u00a0\u00a0\u00a0(a) p \u1d27 p = p
\nv.\u00a0\u00a0\u00a0\u00a0(b) p v p = p<\/p>\n

\u00a0De Morgan’s Laws
\n<\/strong>vi.\u00a0\u00a0\u00a0\u00a0(a) \u0334(p \u1d27 q) = \u0334p c \u0334q
\nvi.\u00a0\u00a0\u00a0\u00a0(b) \u0334(p v q) = \u0334p \u1d27 \u0334q <\/p>\n

\u00a0Laws of Complementation
\n<\/strong>vii.\u00a0\u00a0\u00a0\u00a0(a) p \u1d27 \u0334p = F\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0(b) p v \u0334p = T
\nvii.\u00a0\u00a0\u00a0\u00a0(a) \u0334F = T\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0(b) \u0334T = F
\nix.\u00a0\u00a0\u00a0\u00a0\u0334( \u0334p) = P<\/p>\n

\u00a0Laws of Contrapositivity
\n<\/strong>\"\"\/\"\"\/x. p \u00a0\u00a0\u00a0\u00a0q\u00a0\u00a0\u00a0\u00a0= \u0334q\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u0334p<\/p>\n

\u00a0Laws of Identity
\n<\/strong>xi.\u00a0\u00a0\u00a0\u00a0P \u1d27 T = P
\nxii.\u00a0\u00a0\u00a0\u00a0P \u1d27 F = F
\nxiii.\u00a0\u00a0\u00a0\u00a0P v T = T
\nxiv.\u00a0\u00a0\u00a0\u00a0P v F = P
\nAll these laws can be verified using the truth table technique.
\nUsing the truth table technique, show that if p, q and r are arbitrary statements, then:
\n\"\"\/\"\"\/\"\"\/(p\u00a0\u00a0\u00a0\u00a0q) \u1d27 (q\u00a0\u00a0\u00a0\u00a0r)\u00a0\u00a0\u00a0\u00a0(p\u00a0\u00a0\u00a0\u00a0r) = T<\/p>\n

\u00a0Solution
\n<\/strong>\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0Table 17
\n<\/strong><\/p>\n

\n\n\n\n\n
p<\/td>\nq<\/td>\nr<\/td>\n\"\"\/p q<\/td>\n\"\"\/q r\n<\/td>\n\"\"\/\"\"\/(p q)r (q r)<\/td>\n\"\"\/p r<\/td>\n\"\"\/(p q) \u1d27
\n\"\"\/(q r)
\n\"\"\/(p r)<\/td>\n<\/tr>\n
T
\nT
\nT
\nT
\nF
\nF
\nF
\nF<\/td>\n		T
\nT
\nF
\nF
\nF
\nF
\nT
\nT<\/td>\n		T
\nF
\nT
\nF
\nF
\nT
\nF
\nT<\/td>\n		T
\nT
\nF
\nF
\nT
\nT
\nT
\nT<\/td>\n		T
\nF
\nF
\nF
\nT
\nT
\nF
\nT<\/td>\n		T
\nF
\nF
\nF
\nT
\nT
\nF
\nT<\/td>\n		T
\nF
\nT
\nF
\nT
\nT
\nT
\nT<\/td>\n		T
\nT
\nT
\nT
\nT
\nT
\nT
\nT<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n

\u00a0The truth value of the expression in the last column is T, hence
\n\"\"\/\"\"\/\"\"\/\"\"\/(p\u00a0\u00a0\u00a0\u00a0q) \u1d27 (q\u00a0\u00a0\u00a0\u00a0 r) \u00a0\u00a0\u00a0\u00a0(p\u00a0\u00a0\u00a0\u00a0r) = T
\nUse the truth table technique to show that
\n\"\"\/\"\"\/\"\"\/p\u00a0\u00a0\u00a0\u00a0q = (p\u00a0\u00a0\u00a0\u00a0q) \u1d27 (q\u00a0\u00a0\u00a0\u00a0 p)<\/p>\n

\u00a0Solution
\n<\/strong>\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0Table 18
\n<\/strong>(a)<\/p>\n

\n\n\n\n\n
p<\/td>\nQ<\/td>\n\"\"\/p q<\/td>\n<\/tr>\n
T
\nT
\nF
\nF<\/td>\n		T
\nF
\nT
\nF<\/td>\n		T
\nF
\nF
\nT<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n

\u00a0(b)<\/p>\n

\n\n\n\n\n
p<\/td>\nQ<\/td>\n\"\"\/p q<\/td>\n\"\"\/q p<\/td>\n\"\"\/\"\"\/(p q) \u1d27 (q p)<\/td>\n<\/tr>\n
T
\nT
\nF
\nF<\/td>\n		T
\nF
\nT
\nF<\/td>\n		T
\nF
\nT
\nT<\/td>\n		T
\nT
\nF
\nT<\/td>\n		T
\nF
\nF
\nT<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n

\u00a0The truth values of the expression in the last columns of each of the table are identical, hence
\n\"\"\/\"\"\/\"\"\/p\u00a0\u00a0\u00a0\u00a0q = (p q) \u1d27 (q p)
\nUse the truth table technique to show that
\n\"\"\/\"\"\/\u0334p \u00a0\u00a0\u00a0\u00a0\u0334q = q\u00a0\u00a0\u00a0\u00a0 p<\/p>\n

\u00a0Solution
\n<\/strong>\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0Table 19
\n<\/strong>\"\"\/\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0p\u00a0\u00a0\u00a0\u00a0q\u00a0\u00a0\u00a0\u00a0\u0334p\u00a0\u00a0\u00a0\u00a0\u0334q\u00a0\u00a0\u00a0\u00a0\u0334p \u00a0\u00a0\u00a0\u00a0\u0334q\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/p>\n

\n\n\n\n\n
T<\/td>\nT<\/td>\nF<\/td>\nF<\/td>\nT<\/td>\n<\/tr>\n
T
\nF
\nF\n<\/td>\n		T
\nF
\nT<\/td>\n		F
\nT
\nT<\/td>\n		T
\nF
\nT<\/td>\n		T
\nF
\nT<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n

\"\"\/p q q p<\/p>\n

\n\n\n\n\n
T<\/td>\nT<\/td>\nT<\/td>\n<\/tr>\n
T
\nF
\nF<\/td>\n		F
\nT
\nF<\/td>\n		T
\nF
\nT<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0(a)\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0(b)
\nThe last column of the two tables are identical, hence
\n\"\"\/\"\"\/\u00a0\u00a0\u00a0\u00a0\u0334p\u00a0\u00a0\u00a0\u00a0\u0334q \u00a0\u00a0\u00a0\u00a0= q\u00a0\u00a0\u00a0\u00a0 p<\/p>\n

\u00a01. Let P<\/em> be the statement ‘He is funny’ and q<\/em> be the statement ‘He is serious’. Write each of the following in a simple English:
\n(a) p v q\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0(b) p \u1d27 q
\n(c) p \u1d27 \u0334q\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0(d) \u0334p v \u0334q
\n2. Let p<\/em> be the statement ‘she is beautiful’ and q<\/em> be the statement ‘she is soft – spoken’. Write each of the following in symbolic form:
\n(a) She is beautiful and soft \u2013 spoken.
\n(b) Either she is beautiful or she is soft \u2013 spoken.
\n(c) She is beautifulbut not soft \u2013 spoken.
\n(d) She is ugly but soft \u2013 spoken.<\/p>\n

\u00a0Evaluation<\/strong>
\n\t\t1. Fin the truth value of these statements (a) If 11 > 8 then -1 < -8(b) If 3 + 4 \u2260 10 then 2 + 3 \u2260 5.<\/p>\n

\u00a0General Evaluation
\n<\/strong>(1) Let P be the statement: “He is funny” and q be the statement: “He is serious”. Write each of the following in simple English\u00a0\u00a0\u00a0\u00a0(i) p v q\u00a0\u00a0\u00a0\u00a0(b) p \u1d27 \u0334q\u00a0\u00a0\u00a0\u00a0(c) \u0334p v \u0334q
\n(2) If p and q represent two statements ‘he is good in physics” and “he is good in mathematics” respectively. Write the following in symbolic form; “he is good in physics if and only if he is good in mathematrics”. <\/p>\n

\u00a0Reading Assignment
\n<\/strong>F\/Maths Project 1 pages 126 \u2013 130 Exercise 9b Q 2, 3 and 4<\/p>\n

\u00a0
\n\u00a0Weekend Assignment
\n<\/strong>Objective
\n<\/strong>P is the statement “Ayo has determination and q is the statement”Ayo will succeed”. Use this information to answer the questions. Which of these symbols represent these statements?
\n\"\"\/\"\"\/(1) Ayo has no determination\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0(a) p q (b) \u0334p q (c) \u0334p
\n\"\"\/\"\"\/\"\"\/(2) If Ayo has no determination then he won’t succeed (a) \u0334p \u0334q (b) p \u0334q (c) p q
\n\"\"\/(d) p \u0334q
\n\"\"\/\"\"\/\"\"\/(3) If Ayo won’t succeed then he has no determination (a) \u0334q p (b) \u0334q \u0334q (c) \u0334q p
\n\"\"\/(d) q p
\n\"\"\/\"\"\/\"\"\/(4) If Ayo has determination then he will succeed (a) \u0334p q (b) \u0334p \u0334q (c) \u0334q \u0334p
\n\"\"\/(d) p q
\n\"\"\/\"\"\/(5) If Ayo has no determination then he will succeed (a) \u0334p q (b) \u0334q \u0334p (c) \u0334p
\n\"\"\/(d) \u0334p \u0334q<\/p>\n

\u00a0Theory
\n<\/strong>(1) Write down the inverse, converse and contrapositive of each of these statements.
\n(i) If the bank workers work hard they will be adequately compensated.
\n(ii) If he is humble and prayerful, he will meet with God’sfavour.
\n(iii) If he set a good example, he will get a good followership.
\n(2) Consider the following statements P: some dogs are tame\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0Q: all tame animals are small.
\nWhich of the following is a valid conclusion from the above statements?
\n(i) All dogs are tame\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0(ii) No dog is small\u00a0\u00a0\u00a0\u00a0 (iii) All small animals are tame (iv) Some dogs are small (v) All tame animals are dogs.<\/p>\n

\t\t\u00a0<\/p>\n","protected":false},"excerpt":{"rendered":"

WEEK 6 Review WEEK 1 FINDING QUADRATIC EQUATIONS WITH GIVEN SUM AND PRODUCT OF ROOTS…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1,230],"tags":[],"class_list":["post-2843","post","type-post","status-publish","format-standard","hentry","category-posts","category-first-term-ss2-further-mathematics"],"aioseo_notices":[],"_links":{"self":[{"href":"https:\/\/ecolebooks.com\/nigeria\/wp-json\/wp\/v2\/posts\/2843","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/ecolebooks.com\/nigeria\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/ecolebooks.com\/nigeria\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/ecolebooks.com\/nigeria\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/ecolebooks.com\/nigeria\/wp-json\/wp\/v2\/comments?post=2843"}],"version-history":[{"count":1,"href":"https:\/\/ecolebooks.com\/nigeria\/wp-json\/wp\/v2\/posts\/2843\/revisions"}],"predecessor-version":[{"id":2844,"href":"https:\/\/ecolebooks.com\/nigeria\/wp-json\/wp\/v2\/posts\/2843\/revisions\/2844"}],"wp:attachment":[{"href":"https:\/\/ecolebooks.com\/nigeria\/wp-json\/wp\/v2\/media?parent=2843"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/ecolebooks.com\/nigeria\/wp-json\/wp\/v2\/categories?post=2843"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/ecolebooks.com\/nigeria\/wp-json\/wp\/v2\/tags?post=2843"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}