6 Solved Questions on Constructing Proofs for Quiz 2 | CS 1050, Quizzes of Computer Science

Material Type: Quiz; Class: Constructing Proofs; Subject: Computer Science; University: Georgia Institute of Technology-Main Campus; Term: Fall 2002;

Typology: Quizzes

Pre 2010

Uploaded on 08/04/2009

koofers-user-35k-1
koofers-user-35k-1 🇺🇸

10 documents

1 / 3

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Quiz 2 CS 1050 Fall 2001
1. Let A = {10, 12, 14, 16, 18} B = {10,11,12,13,14,15,16} and C =
{14,15,16,17,18,19}. (10pts.)
Find: (2 pts. each)
(AB)C = {14,16}
(AB)C = {10,12,14,15,16, 17, 18, 19}
AB = {11,13, 15, 18}
C A = {15, 17, 19}
(A-B) C = {14,15,16,17,19}
2. Let A and B be sets. Prove that (A-B) A B (20pts.)
Note: make sure that each statement is justified and follows a logical sequence that
constitutes a correct proof. Divide the points up more or less equally for each
statement in the proof.
Proof: We must show that (A-B) A B’ .
Let e (A-B).
Then e A but e B.
Since e B, then e B’.
Since e is an element of both A and B’, then e AB’
3. Suppose that g is a function from A to B and f is a function from B to C. Prove
that if both f and g are one-to-one functions, then f ° g is also one-to-one. (20pts.)
Note: make sure that each statement is justified and follows a logical sequence that
constitutes a correct proof. Divide the points up more or less equally for each
statement in the proof.
Proof: We must show that, x,yA, xy (fg)(x) (fg)(y).
Let x,y be distinct elements of A.
Then, since g is one-to-one, g(x) g(y).
Now, since g(x) g(y) and f is one-to-one, then f(g(x)) = (fg)(x) f(g(y)) = (fg)(y).
Therefore xy (fg)(x) (fg)(y), so the composite function is one-to-one.
pf3

Partial preview of the text

Download 6 Solved Questions on Constructing Proofs for Quiz 2 | CS 1050 and more Quizzes Computer Science in PDF only on Docsity!

Quiz 2 CS 1050 Fall 2001

1. Let A = {10, 12, 14, 16, 18} B = {10,11,12,13,14,15,16} and C = {14,15,16,17,18,19}. (10pts.)

Find: (2 pts. each)

(A∩B)∩C = {14,16}

(A∩B)∪C = {10,12,14,15,16, 17, 18, 19}

A⊕B = {11,13, 15, 18}

C – A = {15, 17, 19}

(A-B) ⊕ C = {14,15,16,17,19}

2. Let A and B be sets. Prove that (A-B) ⊆ A ∩ B (20pts.)

Note: make sure that each statement is justified and follows a logical sequence that constitutes a correct proof. Divide the points up more or less equally for each statement in the proof.

Proof: We must show that (A-B) ⊆ A ∩ B’. Let e ∈ (A-B). Then e∈ A but e ∉ B. Since e ∉ B, then e∈ B’. Since e is an element of both A and B’, then e ∈ A∩B’

3. Suppose that g is a function from A to B and f is a function from B to C. Prove that if both f and g are one-to-one functions, then f ° g is also one -to-one. (20pts.)

Note: make sure that each statement is justified and follows a logical sequence that constitutes a correct proof. Divide the points up more or less equally for each statement in the proof.

Proof: We must show that, ∀ x,y∈A, x≠y → (f•g)(x) ≠ (f•g)(y).

Let x,y be distinct elements of A. Then, since g is one-to-one, g(x) ≠ g(y). Now, since g(x) ≠ g(y) and f is one-to-one, then f(g(x)) = (f•g)(x) ≠ f(g(y)) = (f•g)(y). Therefore x≠y → (f•g)(x) ≠ (f•g)(y), so the composite function is one-to-one.

4. Find the value of (10pts.)

This problem uses the closed form solutions on the first page. Take off 3 if they do eveything correctly but sum to the wrong index (such 99 instead of 98).

5. Use mathematical induction to prove that: (20pts.)

5 points for the basis case. Basis Case For n= 1

Inductive step. Five points for explaining what is assume and what we must prove. Then 10 for details.

Assume

We must show that

=

n

k

k n n 1

=

200

99

3 k

k

( 200 )^2 ( 201 )^222

98

1

3 200

1

3 200

99

3

∑ =^ ∑ −∑

k = k = k =

k k k

1

1 − = − =

= n n

j k

=

n

k

j n n 1

[ ]

1

1 = + +

= n n

k n n

n

k

2

1

1

1

=

=

n n

n n

n n n

k n

k

n

k

n

k