Math 300 Homework 8 Graded Problems

4.1 Q8 Problem. Is it true that for any sets A, B and C , A (B \ C ) = (A B ) \ (A C )? Give either a proof or a counterexample to justify your answer. Solution Claim: it is true. Proof [] Suppose a A (B \ C ). By denition, we have a = (x, y ), where x A and y B \ C . Hence, y B and y / C , so a = (x, y ) A B and a = (x, y ) / A C . Thus, a (A B ) \ (A C ). Since a is arbitrary, we have A (B \ C ) (A B ) \ (A C ). [] Suppose a (A B ) \ (A C ). Then a A B and a / A C . Since a A B , we have a = (x, y ), where x A, y B . Now, a = (x, y ) / A C and x A, so we have y / C . Thus, y B \ C , so a = (x, y ) A (B \ C ). Since a is arbitrary, we have (A B ) \ (A C ) A (B \ C ). Therefore, A (B \ C ) = (A B ) \ (A C ).

Comment. Some groups wrote that it suces to show [A (B \ C ) (A B ) \ (A C )] [A (B \ C ) (A B ) \ (A C )]. This is incorrect. We need and instead of to show two sets are equal. 4.3 Q13 Problem. Suppose R1 , R2 are relations on A. For each part, give either a proof or a counterexample to justify your answer.

a. If R1 and R2 are reexive, must R1 R2 be reexive? b. If R1 and R2 are symmetric, must R1 R2 be symmetric? c. If R1 and R2 are transitive, must R1 R2 be transitive? Solution a. Yes. Suppose a A. Since R1 is reexive, we have (a, a) R1 R1 R2 , so R1 R2 is reexive.

b. Yes. Suppose a, b A s.t. (a, b) R1 R2 . Then (a, b) R1 or (a, b) R2 . If (a, b) R1 , then since R1 is symmetric we have (b, a) R1 R1 R2 . Similarly, if (a, b) R2 we have (b, a) R1 R2 . Therefore, R1 R2 is symmetric.

c. No. Let A = {0, 1}, R1 = {(0, 1)} and R2 = {(1, 0)}. Then (0, 1), (1, 0) R1 R2 , but (0, 0) / R1 R2 .

Comment. For (a) you just have to show that (a, a) is in R1 to show that it is in R1 R2 . You dont even have to mention that (a, a) R2 , though the proof will still be correct. 1

Worksheet Q6 Problem.

Find integers a1 , a2 , a3 , a4 , a5 s.t. every integer satises at least one of the congruences

x a1 (mod 2) x a2 (mod 3) x a3 (mod 4) x a4 (mod 2) x a5 (mod 12) Solution For any integer x, there are 12 possibilities of x mod 12, that is 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11. By Problem 2c, if x a (mod 12) and d | 12 with d > 0, then x a (mod d). Let x be an integer and we have the following possibilities: If x 0 (mod 12), then x 0 (mod 2), x 0 (mod 3), x 0 (mod 4), x 0 (mod 6). If x 1 (mod 12), then x 1 (mod 2), x 1 (mod 3), x 1 (mod 4), x 1 (mod 6). If x 2 (mod 12), then x 0 (mod 2), x 2 (mod 3), x 2 (mod 4), x 2 (mod 6). If x 3 (mod 12), then x 1 (mod 2), x 0 (mod 3), x 3 (mod 4), x 3 (mod 6). If x 4 (mod 12), then x 0 (mod 2), x 1 (mod 3), x 0 (mod 4), x 4 (mod 6). If x 5 (mod 12), then x 1 (mod 2), x 2 (mod 3), x 1 (mod 4), x 5 (mod 6). If x 6 (mod 12), then x 0 (mod 2), x 0 (mod 3), x 2 (mod 4), x 0 (mod 6). If x 7 (mod 12), then x 1 (mod 2), x 1 (mod 3), x 3 (mod 4), x 1 (mod 6). If x 8 (mod 12), then x 0 (mod 2), x 2 (mod 3), x 0 (mod 4), x 2 (mod 6). If x 9 (mod 12), then x 1 (mod 2), x 0 (mod 3), x 1 (mod 4), x 3 (mod 6). If x 10 (mod 12), then x 0 (mod 2), x 1 (mod 3), x 2 (mod 4), x 4 (mod 6). If x 11 (mod 12), then x 1 (mod 2), x 2 (mod 3), x 3 (mod 4), x 5 (mod 6). Hence, since the above cases exhaust all the possibilities we must have any integer x satifsying one of the following: x 0 (mod 2), x 0 (mod 3), x 1 (mod 4), x 1 (mod 6), x 11 (mod 12). Therefore we can let a1 = 0, a2 = 0, a3 = 1, a4 = 1, a5 = 11. (Other answers are accepted, and please refer to the above list to check your answer.)

Comment. Always remember that you have to provide reasons and proves for what you claim. You cannot simply state an answer here. You must give a proof. Besides, some answers are wrong. Be sure that they are correct, by trying suciently many cases. By suciently many, I mean cases that cover all the possibilities here. Worksheet Q7 Problem. Solution Find a way to determine if an integer n is divisible by 11, and prove it. We claim the following:

Theorem. For an integer x, suppose O = sum of odd (unit, hundred, ten-thousand, etc) digits and E = sum of even (tenth, thousand, hundred-thousand, etc) digits. x is divisible by 11 i O E is divisible by 11. Proof We write the decimal representation of x. Suppose x has n + 1 digits. Let a0 , a1 , , an be positive integers between 0 and 9 (inclusive) s.t. x = a0 + 10a1 + 102 a2 + + 10n an . Since 10 1 (mod 11), we have 1 (mod 11) if k is even 10k 1 (mod 11) if k is odd Then we have x = a0 + 10a1 + 102 a2 + + 10n an a0 a1 + a2 + (1)n an a2i2 a2j 1 (mod 11) (mod 11) (mod 11) 2

OE

Therefore, x is divisible by 11 (i.e. x 0 (mod 11)) i O E 0 (mod 11), that is, O E is divisible by 11.

Comment.

Good performance.