Scribd
Upload
4 views2 pages

Tutorial2 (2012) (25-26 First)

This document outlines a tutorial for MATH2012 at the University of Hong Kong, covering topics such as open statements, logical equivalences, negations, and quantifiers. It includes exercises on determining integer values, proving logical statements, and expressing statements in a specific form. Additionally, it addresses common errors with quantifiers and provides examples to illustrate logical relationships.

Uploaded by

panghohimbosco
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views2 pages

Tutorial2 (2012) (25-26 First)

This document outlines a tutorial for MATH2012 at the University of Hong Kong, covering topics such as open statements, logical equivalences, negations, and quantifiers. It includes exercises on determining integer values, proving logical statements, and expressing statements in a specific form. Additionally, it addresses common errors with quantifiers and provides examples to illustrate logical relationships.

Uploaded by

panghohimbosco
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

T2/MATH2012/2025-26/1st

THE UNIVERSITY OF HONG KONG


DEPARTMENT OF MATHEMATICS

MATH2012 Fundamental Concepts of Mathematics

Tutorial 2 (Sep 22 – 26)

Chapter 2 (Section 2.4)

1. Let
P (x) : x ≥ 3 Q(x) : x < 0 R(x) : x is an even integer

be three open statements. Determine all integer values of x such that


impossible

R(x) =⇒ (P (x) ∧ Q(x)).

Explain briefly your answer.

2. (a) Let P , Q and R be statements. Show that

((P ∧ Q) −→ R) ⇐⇒ (P ∧ (∼ R) −→ (∼ Q)).

(b) Use (a) to restate the following conditional

If n is a prime and n > 2, then n is odd.

Chapter 2 (Section 2.5)

3. Write down the negation of each of the following statements.

(a) There exists x ∈ R such that for any y ∈ R, x + y < 10.


for negation of if the statement , no if and
(b) For any x, y, z ∈ R, if x + y = x + z, then y = z.
then (disappare)
(c) For any x, y ∈ R, if xy = 0, then x = 0 or y = 0.
(d) There exists x ∈ (−2, 2) such that for any y ∈ R, if y ≤ x, then y ∈ (0, 5).
(e) If there exists x ∈ R such that x2 = −1, then a = b for any a, b ∈ R.
(f) There exists x ∈ R such that for any a, b, c ∈ R \ {0}, the equation ax2 + bx + c = 0
holds.

4. Let a, b ∈ Z. We say that a and b are relatively prime if there exist r, s ∈ Z such that
ra + sb = 1. Write down the meaning of “a and b are not relatively prime”.

1
5. (Common errors with quantifiers)

Let P (x) and Q(x) be open statements concerning elements x in some set S. A student
decides to put in the symbol “⇐⇒” in each of the following blanks:

(a) (∃x ∈ S, P (x)) ∨ (∃x ∈ S, Q(x)) (∃x ∈ S, P (x) ∨ Q(x))

(b) (∃x ∈ S, P (x)) ∧ (∃x ∈ S, Q(x)) (∃x ∈ S, P (x) ∧ Q(x))

(c) (∀x ∈ S, P (x)) ∨ (∀x ∈ S, Q(x)) (∀x ∈ S, P (x) ∨ Q(x))

(d) (∀x ∈ S, P (x)) ∧ (∀x ∈ S, Q(x)) (∀x ∈ S, P (x) ∧ Q(x))

Comment on the student’s work.

6. Consider the following form of a statement:

“∀x ∈ S, (P (x) −→ Q(x))”

This means for any element x in the set S, if P (x), then Q(x). Many statements can be
expressed in this form, for example,

“The square of any odd integer is odd”

can be rephrased as “∀x ∈ Z, if x is odd, then x2 is odd”.

Express each of the following statements (not necessarily true) in such a form:

(a) Every prime number is odd.


(b) The square root of any positive real number is positive.
(c) The absolute value of any real number less than −3 is bigger than 7.
(d) The product of 10 and any integer in the interval [2, 6] is even.

7. Write down the negation of the statement of the form

“∀x ∈ S, (P (x) −→ Q(x))”

Hence write down the negation of each of the statements in Q.6.

8. Consider the statement “∀x ∈ S, (P (x) −→ Q(x))” again. Give an example in which
 
“ ∀x ∈ S, P (x) −→ ∀x ∈ S, Q(x) ” is true but “∀x ∈ S, (P (x) −→ Q(x))” is false.
Remark: As a consequence,
 
“ ∀x ∈ S, P (x) −→ ∀x ∈ S, Q(x) ” is NOT logically equivalent to “∀x ∈ S, (P (x) −→ Q(x))”.

You might also like