Scribd
Upload
18 views2 pages

Quiz 1

Uploaded by

onepiecenorthblue
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
18 views2 pages

Quiz 1

Uploaded by

onepiecenorthblue
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
You are on page 1/ 2

Name: Roll No:

(COL 202) Discrete Mathematics 18 August, 2023

Quiz 1
Duration: 45 minutes (12 marks)

• Be clear in your writing.


• If you use a statement proved in class or in the problem set, then write down the entire statement
before using it.
• You will not get a new sheet, so make sure you are certain when you write something.
Make a judicious decision of which tool(s) to use to get a clean and short answer that fits in the space.

1. (2 × 2 = 4 points) Translate the following sentences into a predicate formula. The domain of discourse
should be the set of students in the class; in addition, the only predicates that you may use are (1)
Equality, (2) E(x, y) meaning that “x has sent e-mail to y.”
Note: I have used the predicate Student(x) for clarity, but its not really necessary.

(a) There is a student who has e-mailed at most n other people in the class, besides possibly himself.
Let S denote the set of students, the we can say
k k
∃s ∈ S, ∀k > n, ( ⋀ (xi ∈ S)) Ô⇒ ¬ ( ⋀ E(s, xi ))
i=1 i=1

(b) There is a student who has emailed at least n other people in the class, besides possibly himself.
Let S denote the set of students, the we can say
k k k
∃s ∈ S, ∃k ≥ n, ( ⋀ (xi ∈ S) ∧ ⋀ ¬(xp = xq )) ∧ ( ⋀ E(s, xi ))
i=1 p≠q=1 i=1

However many of you have used an extra cardinality predicate to express this, and we have given
marks for these as well.

2. (4 points) Use the Well Ordering Principle to prove that any integer greater than or equal to 8 can
be represented as the sum of nonnegative integer multiples of 3 and 5.

Proof. For the sake of contradiction assume that the set of counterexamples C is nonempty, i.e.,

C ∶= {n ≥ 8 ∣ n cannot be represented as a linear combination of 3 and 5}

By WOP C contains a least element m. Now note that if m can’t be represented as a sum of non-
negative integer multiples of 3 and 5, then neither can m − 3. Therefore m − 3 cannot be greater than
10, as if m ≥ 11 then m − 3 ≥ 8, and thus m − 3 would be in C, which is a contradiction since m is the
least element of C. The only remaining cases are n = 8, 9, 10, which are clearly not in C.

3. (4 points) Prove by induction that √ √


√ √
1 2 3... n < 2
√ √
Proof. Note that if you try induction√naively, it doesn’t work: Base case n = 1 ∶ 1 ≤ 2 is fine,
√ √ √
but if your induction hypothesis is 1 2 3 . . . n − 1 ≤ 2, it is not clear how to upper bound
√ √
√ √
1 2 3 . . . n by 2. We need a stronger induction hypothesis, namely:
√ √ √ √
∀n ∈ N, ∀m ∈ N ∪ {0}, (m + 1) (m + 2) (m + 3) . . . (m + n) < (m + 2)

.
Note that from the stronger hypothesis, when m = 0, we recover our simpler hypothesis! Let us proceed
to prove the stronger hypothesis by induction:
√ √
• Base case: ∀m ∈ N ∪ {0}, m + 1 < m + 2 is clearly true.
• Inductive case: Assume as your induction hypothesis,
√ √ √ √
∀n ∈ N, ∀m ∈ N ∪ {0}, (m + 1) (m + 2) (m + 3) . . . (m + n − 1) < (m + 2)

. Now note that √ √ √ √


(m + 2) (m + 2) (m + 3) . . . (m + n) < (m + 3)
. Therefore we have
√ √ √ √ √
(m + 1) (m + 2) (m + 3) . . . (m + n) < (m + 1)(m + 3)
< (m + 2)

as required. Note that the last inequality follows by squaring the equation on both sides (this is
ok since they are both positive quantities).

You might also like