About This Document. MTH299 - Examples Weeks 1-6; updated on January 5, 2018

Size: px
Start display at page:

Download "About This Document. MTH299 - Examples Weeks 1-6; updated on January 5, 2018"

Transcription

1 About This Document This is the examples document for MTH 299. Basically it is a loosely organized universe of questions (examples) that we think are interesting, helpful, useful for practice, and serve as a preview of what may appear on homework and exams. Here is how we expect you to interact with this document: You will have a paper copy of this document with you during all class meetings. Each day, your instructor will choose a list of examples from this document that will be the focus of that day s practice activities. This list is dynamic and is designed to address the mixture of needs presented by: new topics, your understanding of old topics, your past homework performance, your upcoming homework assignment. You should always record each day s suggested list of examples. Those lists are suggestive that your instructor thinks those examples are particularly interesting. You will work examples in class, with your group-mates. You will go home and examine the solutions for these examples (and any other ones about which you are curious). The solutions are posted on your class D2L page. You will look for examples that are similar to homework questions in order to practice techniques that will help you do your homework. You can generally use the solutions to the examples as a guide for how you will write your solutions. I say generally because not all of the solutions in the document have been brought up to the our current presentation standards. When in doubt, ask your instructor. (Note, solutions contain many sentences and phrases intended as extra explanation to the students who are reading them and learning from them. You will obviously modify your homework solutions so that this extra explanation is not there.) MSU 1

2 Week 1 (things related to: sets, set operations, statements, conditional statements) Example 1.1. Let S = {1, {2, 3}, 4}. Indicate whether each statement is true or false. (a) S = 4 (b) {1} S (c) {2, 3} S (d) {1, 4} S (e) 2 S. (f) S = {1, 4, {2, 3}} (g) S Example 1.2. Write each of the following sets by listing its elements within braces. Find their cardinalities. (a) A = {n Z : 4 < n 4} (b) B = {n Z : n 2 < 5} (c) C = {n N : n 3 < 100} (d) D = {x R : x 2 x = 0} (e) E = {x R : x = 0} Example 1.3. Find the cardinalities of the following sets. (a) {, { }, {{ }}} (b) {n Z 2014 n 2014} (c) {n N n has exactly 3 digits} For example, 7 has one digit and 107 has three digits. Example 1.4. Compute the cardinality of the set, E, where E is defined as E = {x R : sin(x) = 1/2 and x 5} Example 1.5. List all the proper subsets for each of the following sets: (a) {0, 1, 2} (b) {0, {1, 2}} (c) {1, {2, {3}}} MSU 2

3 Example 1.6. Suppose A = {0, 2, 4, 6, 8}, B = {1, 3, 5, 7} and C = {2, 8, 4}. Find: (a) A B (b) A \ C (c) B \ A (d) B C (e) C \ B Example 1.7. Let U = {1, 2, 3,..., 14, 15} and E c = U \ E. Let A = {1, 5, 9, 13} and B = {3, 9, 13}. Determine the following: (a) A B (b) A B (c) A \ B (d) B \ A (e) A c (f) A B c. Example 1.8. Let U = {1, 2, 3, 4, 5} and E c = U \ E. Let A = {1, 2}, B = {2, 3} and C = {1, 3}. Determine the following: (a) (A B) \ (B C) (b) A c (c) (B C) c (d) A B. Example 1.9. Describe each set below in the form (a) D = {3, 5, 7, 9,... } { 1 (b) E = 2, 2 3, 3 } 4,... (c) F = {2, 4, 8, 16,... } {x X : x satisfies property P } Example Find the union of of {2k k N} and {2k + 1 k N}. Prove your answer. Recall if E = A B, you need to show E A B and A B E. Example Define E = {z Z z = 2k for some k N}. Show that E N. Example Prove that X = Y, where X = {x N : x 2 < 30} and Y = {1, 2, 3, 4, 5}. Example Prove that {x Z : x is divisible by 18} {x Z : x is divisible by 6}. MSU 3

4 Example Prove that {9 n : n Z} {3 n : n Z}, but {9 n : n Z} {3 n : n Z}. Example Prove that {9 n : n Q} = {3 n : n Q}. Example Define the sets and A = {n Z : n = 2k, for some k Z} B = {m Z : m = 2 i, for some i N}. Give a careful explanation of why each of the following two statements are true: (i) B A and (ii) A B. (Note that this means that B is a proper subset of A, see p. 7.) Example Find the intersection of A = {2k k N} and B = {3k k N}. Example Suppose A = {π, e, 0} and B = {0, 1}. Write out the indicated sets by listing their elements. (a) A B (b) B A (c) A A (d) B B (e) A (f) A B B Example For A = { 1, 0, 1} and B = {x, y}, determine A B. Example Give a brief justification for the theorem: Theorem: If A = n and B = m then A B = nm Example Let A = {(x, y) x 2 + y 2 1} and B = {(x, y) (x 1) 2 + y 2 1} inside of R 2 (a) Sketch the regions A and B. (Both are closed discs: circles together with the points they enclose.) (b) Sketch the region (A B) c (c) Sketch the region A c B c (d) Formulate a conjecture which explains your observations in the previous two steps. Example For A = {a R : a 1} and B = {b R : b = 1}, give a geometric description of the points in the xy-plane belonging to (A B) (B A). Example Which of the following sentences are statements? For those that are, indicate the truth value. (i) The integer 123 is prime. (ii) The integer 0 is even. (iii) Is 5 2 = 10?? MSU 4

5 (iv) x 2 4 = 0. (v) Multiply 5x + 2 by 3. (vi) 5x + 3 is an odd integer. Example Which of the following statements are true? Give an explanation for each false statement. (a) (b) { } (c) {1, 3} = {3, 1} (d) = { } (e) { } (f) 1 {1}. Example Imagine that there are exactly three coins on a table, as below. Which of these statements are true? (a) There are four coins on the table. (b) There are two coins on the table. (c) There are three coins on the table. (d) There is a coin on the table. Example Decide whether or not the following are statements. In the case of a statement, say if it is true or false. (i) Every real number is an even integer. (ii) If x and y are real numbers and 5x = 5y, then x = y. (iii) The integer x is a multiple of 7. (iv) The sets Z and N are infinite. (v) The derivative of any polynomial of degree 5 is a polynomial of degree 6. Example Consider the sets A, B, C and D below. Which of the following statements are true? Give an explanation for each false statement. A = {1, 4, 7, 10, 13, 16,... } C = {x Z : x is prime and x 2} B = {x Z : x is odd} D = {1, 2, 3, 5, 8, 13, 21, 34, 55,... } (a) 25 A (b) 33 D (c) 22 / A D (d) C B (e) B D (f) 53 / C. MSU 5

6 Example Decide if the following statements are true or false. Explain. (a) R 2 R 3 (b) {(x, y) R 2 : x 1 = 0} {(x, y) R 2 : x 2 x = 0} Example For a conditional statement P (A) : A {1, 2, 3} over the domain S = P({1, 2, 4}) determine: (a) all A S for which P (A) is true. (b) all A S for which P (A) is false. (c) all A S for which A {1, 2, 3} =. Example Write a conditional statement P (n) over the domain S = {3, 5, 7, 9} such that P (n) is true for half of the elements of S and false for the other half. Example Let the domain of a conditional statement be R and the conditional statement to be P (x) : x(x 1) = 6 (a) For what values of x is P (x) a true statement? (b) For what values of x is P (x) a false statement? Example Let the domain of a conditional statement be Z and the conditional statement to be P (x) : 3x 2 > 4. (a) For what values of x is P (x) a true statement? (b) For what values of x is P (x) a false statement? Example For A = {x R : x 1 2} and B = {y R : y 4 2}, give a geometric description of the points in the xy-plane belonging to A B. Example Define the sets and E := { 4, 3, 2, 1, N} F := N {0} {Z}. (i) Solve the equation 2x 3 + 4x 2 = 0 for x E. (ii) Solve the equation 2x 3 + 4x 2 = 0 for x F. (iii) Now, express F in a more elementary form, such as (just for example!) {A, {0, 1}, a, b, c,... }, and then go back and do (ii) over again. MSU 6

7 Example List the elements of the set S = {(x, y) Z Z : x + y = 3}. Plot the corresponding points in the Euclidean xy-plane. Example Sketch the set X = {(x, y) R 2 drawing, shade in the set X c. : 1 x 2 + y 2 4} on the plane R 2. On a separate Example List the elements of each set below and then sketch a Venn diagram to illustrate how they are related. For this problem, U = {1, 2, 3,..., 10}. A = {n U n is even }, B = {n U n is the square of an integer}, C = {n U n 2 3n + 2 = 0} Shade each of the following sets: (i) U \ (A B) (ii) (U \ A) (U \ B) (iii) U \ (A B) (iv) (U \ A) (U \ B). MSU 7

8 Week 2 (things related to: operations on statements, truth tables, quantifiers) Example 2.1. Express each statement as one of the forms P Q, P Q, or P. Be sure to also state exactly what statements P and Q stand for. (i) The number 8 is both even and a power of 2. (ii) The number x equals zero, but the number y does not. (iii) x A \ B. (iv) x y. (v) y x. (vi) A {X P(N) : X c < }. Example 2.2. Complete the following truth table P Q P Q T T T F F T F F Example 2.3. Let P : 15 is odd. and Q : 21 is prime. State each of the following in words, and determine whether they are true or false. (a) P Q (b) P Q (c) ( P ) Q (d) P ( Q) Example 2.4. Let S = {1, 2,..., 6} and let be conditional statements over the domain P(S). P (A) : A {2, 4, 6} =. and Q(A) : A. (a) Determine all A P(S) for which P (A) Q(A) is true. (b) Determine all A P(S) for which P (A) ( Q(A)) is true. (c) Determine all A P(S) for which ( P (A)) ( Q(A)) is true. Example 2.5. For the sets A = {1, 2,..., 10} and B = {2, 4, 6, 9, 12, 25}, consider the statements P : A B. Q : A \ B = 6. Determine which of the following statements are true. (a) P Q (b) P ( Q) (c) P Q (d) ( P ) Q (e) ( P ) ( Q). Example 2.6. Complete the following truth table MSU 8

9 Example 2.7. Write a truth table for the following: (i) (P P ) Q, (ii) ( P Q). P Q Q P ( Q) T T T F F T F F Example 2.8. Decide whether the following pairs of statements are logically equivalent. (i) P Q and ( P Q) (ii) P (Q R) and (P Q) R Example 2.9. Use truth tables to show that the following statements are logically equivalent. (i) P (Q R) (P Q) (P R) (ii) (P Q R) ( P ) ( Q) ( R) (iii) (P Q R) ( P ) ( Q) ( R) (iv) (P Q) ( P ) ( Q) Example Let the sets A and B be given as A = {3, 5, 8} and B = {3, 6, 10}. Show that the following quantified statement is indeed true: b B, a A, a b < 0. Example Write the following as English sentences. Say whether they are true or false. (a) x R, x 2 > 0 (b) x R, n N, x n 0 (c) a R, x R, ax = x Example Rewrite each statement using,, as appropriate and determine if the statement is true or false. (a) There exists a positive number x such that x 2 = 5. (b) For every positive number M, there is a positive number N such that N < 1/M. (c) No positive number x satisfies the equation f(x) = 5. Example Rewrite the following using and. For each statement, determine if it is true or false. MSU 9

10 (a) There exists a real number r such that r = cos(r). (b) For all n N, either n or n + 1 is even. (c) For all x R, x 2 is nonnegative. (d) There exists a natural number n satisfying 2n 2 = n 3. (e) If x is a real number with 1 < x < 0, then x < x 3. (f) If a and ɛ are real numbers with ɛ > 0, then there exists a natural number n such that a n < ɛ. (g) If f is continuous and f(0) < 0 < f(1), then there exists a real number c (0, 1) such that f(c) = 0. (Look up the intermediate value theorem to try to figure out this one!) Example Decide whether the following are true or false. Provide a proof to justify your answer. (a) x Z, y Z, x + y = 1. (b) y Z, x Z, x + y = 1. (c) x Z, y Z, xy = x. (d) y Z, x Z, xy = x. Example Determine the truth value of each of the following statements, and explain/justify your answer. (a) x R, x 2 x = 0. (b) x R, x 2 = x. Example Decide whether the following are true or false. Explain your answers. (a) p P 2, x R, p(x) < 0. (b) x R, p P 2, p(x) < 0. (c) x Z, y Z, (x 2 = y). (d) y Z, x Z, (x 2 = y). Example Decide whether the following are true or false. Explain your answers. (i) n N such that n 2 n. (j) n Z such that n 2 < n. MSU 10

11 Example Determine if the following statement is true or false, and justify your answer. q Q, x R, e qx Q. Example Determine if the following statement is true or false, and justify your answer. q Q, x R \ {0}, e qx Q. Example Determine if the following statement is true or false, and justify your answer. (a, b) { (x, y) R 2 : x < y }, q P 3, q(a) = q(b) = 0. Example Determine if the following statement is true or false, and justify your answer. (a, b) { (x, y) R 2 : x 2 + y 2 = 1 }, θ [0, π], (a, b) (cos θ, sin θ). Example Determine if the following statement is true or false, and justify your answer. p P 3, q P 5, q = p. Example Determine if the following statement is true or false, and justify your answer. [ 2 ] p P 3, ( x R, (p (x) 0)) and p(s) ds 0. (Note to reader: you could interpret this as: p P 3, 1 [ p constant and 2 1 ] p(s) ds 0.) Example Determine if the following statement is true or false, and justify your answer. ( 2 ) p P 3, deg(p) = 3 and p(s) ds = 0. Example Assume that you know for any real numbers, a, b, c R that if a 0 and b c, then it holds that ab ac. Carefully justify the statement: for any real number, x, it holds that x 2 0. Example Assume that you know that x < y. Carefully justify the statement that x < x + y 2 Example Show that there exists a positive even integer m such that for every positive integer n, 1 m 1 n < y. MSU 11

12 Week 3, (things related to: implications, negation, contradiction) Example 3.1. Consider the statements P : 17 is even. and Q : 19 is prime. Write each of the following statements in words and indicate whether it is true or false. (a) P (b) P Q (c) P Q (d) P Q Example 3.2. Without changing their meanings, convert each of the following sentences into a sentence having the form If P, then Q. (a) The quadratic equation ax 2 + bx + c = 0 has real roots provided that b 2 4ac 0. (b) A function is rational if it is a polynomial. (c) An integer is divisible by 8 only if it is divisible by 4. (d) Whenever a circle, C, has a circumference of 4π, it has an area of 4π. (e) The integer n 3 is even only if n is even. Example 3.3. Let P : 18 is odd, and Q : 25 is even. State P Q in words. Is P Q true or false? Example 3.4. Write a truth table for the logical statements: (i) P (Q R) (ii) (P P ) Q (iii) (P Q) Example 3.5. Use truth tables to show that the following statements are logically equivalent. (i) P Q ( P ) Q (ii) P Q (P Q) (Q Q) Example 3.6. Use truth tables to determine the following questions. (i) Is the statement ( P ) (P Q) logically equivalent to the statement (Q P )? (ii) Is the statement P Q logically equivalent to the statement ( P ) Q? Example 3.7. Let A = {x Z : 6 x}, B = {x Z : 2 x}, C = {x Z : 3 x}. Prove the following statement. x A ( y B and z C such that x = yz) Example 3.8. Prove that if x < 4 and y > 2, then the distance from (x, y) to (1, 2) is at least 6. Note that the distance between two points (x 1, y 1 ) and (x 2, y 2 ) is given by d = (x 1 x 2 ) 2 + (y 1 y 2 ) 2 MSU 12

13 Example 3.9. Prove that if an isosceles triangle has sides of length x, y, and z, where x = y and z = 2xy, then it is a right triangle using The Law of Cosines. Example Prove that if x 2 1, then x 2 7x > 10. Example Show that A B is logically equivalent to not(a and not B) This is the idea behind a proof by contradiction. (a) Using truth tables (b) Using other rules of logic we have developed in this course. Example Fill in the blank with necessary, sufficient or necessary and sufficient. (a) The number x > 1 is for x 2 > 1. (b) The number x N is for x 0. (c) The number x > 1 is for x 2 > 1. Example Consider the implication If m 2 > 0, then m > 0. Is it true or false? Write down its converse and determine its truth value. Example Prove the statement: If n Z is even, and m Z is odd, then n + m is odd. Example Prove that: (a) If A B then A B = B. (b) If A B = B then A B. Example Let P, Q, and R be statements. Prove that (P = Q) = R is equivalent to (P ( Q)) R. Example Prove that if A B, B C, and C A, then A = B and B = C. Example Prove that if x, y R, then 3 4 x y2 xy. Example If n is an integer, show that n 2 + n 3 is an even number. Example Consider the statements P : 2 is rational. and Q : 22/7 is rational. Write each of the following statements in words and indicate whether it is true or false. (a) P Q (b) Q P (c) ( P ) ( Q) (d) ( Q) ( P ). Example In each of the following, two conditional statements P (x) and Q(x) over a domain S are given. Determine the truth values of P (x) Q(x) for each x S. (a) P (x) : x = 4; Q(x) : x = 4; S = { 4, 3, 1, 4, 5}. MSU 13

14 (b) P (x) : x 2 = 16; Q(x) : x = 4; S = { 6, 4, 0, 3, 4, 8}. (c) P (x) : x > 3; Q(x) : 4x 1 > 12; S = {0, 2, 3, 4, 6}. Example Let S = {1, 2, 3, 4}. Consider the following conditional statements over the domain S: n(n 1) P (n) : is even. 2 Q(n) : 2 n 2 ( 2) n 2 is even. R(n) : 5 n n is prime. Determine the distinct elements a, b, c, d in S such that (i) P (a) = Q(a) is false; (ii) Q(b) = P (b) is true; (iii) P (c) R(c) is true; (iv) Q(d) R(d) is false; Example For statements P and Q, construct a truth table for (P Q) ( P ). Example Show that if n N, then 1 + ( 1) n (2n 1) is a multiple of 4. Next, show the converse, i.e. that if k Z is a multiple of 4, then k = 1 + ( 1) m (2m 1) for some m N. Example Define the Euclidean norm of x = (x 1, x 2,..., x n ) R n by x = x x 2 n. Prove that x = 0 if and only if (x 1, x 2,..., x n ) = (0, 0,..., 0). Example Decide whether the following pairs of statements are logically equivalent. (i) (P Q) and P Q (ii) (P Q) R and ((P Q) R) (iii) ( P ) (P Q) and (Q P ) (iv) P (Q Q) and ( P ) (Q Q) Example Suppose the statement ((P and Q) or R) = (R or S) is false. Find the truth values of P, Q, R and S. (This can be done without a truth table.) Example State the negation of each of the following statements. (a) 2 is a rational number. (b) 0 is not a negative number. (c) 111 is a prime number. Example State the negation of each of the following statements. (a) The real number r is at most 2. (b) The absolute value of the real number a is less than 3. (c) Two angles of the triangle are 45. MSU 14

15 (d) The area of the circle is at least 9π. (e) Two sides of the triangle have the same length. (f) The point P in the plane lies outside of the circle C. Example State the negations of the following quantified statements: (a) For every rational number r, the number 1/r is rational. (b) There exists a rational number r such that r 2 = 2. Example Negate the following implications: (a) If you are good I will buy you ice cream. (b) In order to earn a 4.0 in MTH 299, it is sufficient that one scores 95% on all exams and assignments. Example Negate the following statements and determine which is true, the original or the negation. Justify your answers. (a) y Z, x Z, x + y = 1. (b) x Z, y Z, xy = x. Example Negate the following. State whether each original statement is true or false. If the original is a true statement, prove it. If the original is false, prove that the negated statement is true (this is one of the great uses of negation... of the original statement and its negation, exactly one of them is always true). (a) n Z, m Z, m n = 1. (b) x Q, y Q, x y = y. Example Of the following two statements, one is true and one is false. Determine which one is which, prove why the true one is true, and why the false one is false. (Note, to prove a statement is false, it is equivalent to prove that its negation is true.) (i) x R, y R, such that y 2 3x + 5. (ii) y R, x R, such that y 2 3x + 5. Example Of the following two statements, one is true and one is false. Determine which one is which, prove why the true one is true, and why the false one is false. (Note, to prove a statement is false, it is equivalent to prove that its negation is true.) (i) c R, p {f P 2 : deg(f) 1}, cxp (x) = p(x) (ii) c R, p P 2, xp (x) + c = p(x) MSU 15

16 Example Use the method of proof by contradiction to prove the following statement: If A and B are sets, then A (B \ A) =. Example Let n be an integer. Show that n 2 is even if and only if n is even. Example Recall the definition: Definition(s): A real number x is rational if x = a for some a, b Z where a and b have no common b factors and b 0. Also, x is irrational if it is not rational. Use contradiction to prove that: The number 2 is irrational. Example Prove that 6 is an irrational number. Further, show that there are infinitely many positive integers n such that n is irrational. Example Prove the following: (a) (Instructor) There are infinitely many prime numbers. (b) There are no rational number solutions to the equation x 3 + x + 1 = 0. Example Prove that there is no largest even integer. Example Suppose a circle has center (2, 4). (a) Prove that ( 1, 5) and (5, 1) are not both on the circle. (b) Prove that if the radius is less than 5, the circle does not intersect the line y = x 6. (c) Prove that if (0, 3) is not inside the circle, then (3, 1) is not inside the circle. Example Let n be an integer. Show that n 2 is odd if and only if n is odd. Example 3.44 (Prove using Contradiction). Suppose a Z. Prove that if a 2 is even, then a is even. Example Suppose a, b, c Z. If a 2 + b 2 = c 2, then a or b is even. Example Prove that If a, b Z, then a 2 4b 2. Example Use the method of proof by contradiction to prove the following: (Hint: Consider (sin x cos x) 2.) x [π/2, π], sin x cos x 1. Example Prove: For every real number x [0, π/2], we have sin x + cos x 1. Example Suppose a, b R. If a is rational and ab is irrational, then b is irrational. Example Prove that if p is prime and p > 2, then p is odd. MSU 16

17 Week 4 (things related to contrapositive, induction, and divisibility) Example 4.1. Find the contrapositive of the following statements. (a) If Jane has grandchildren, then she has children. (b) If x = 1, then x is a solution to x 2 3x + 2 = 0. (c) If x is a solution to x 2 3x + 2 = 0, then x = 1 or x = 2. Example 4.2. Write down the contrapositive of the following: (a) If n is an integer, then 2n is an even integer. (b) You can work here only if you have a college degree. (c) The car will not run whenever you are out of gas. (d) Continuity is a necessary condition for differentiability. Example 4.3. Consider the conditional statements over the domain N. P (x) : x is prime Q(x) : x is odd (a) Determine the set S whose elements make the statement P Q false. Explain your answer. (b) Write down in words the contrapositive of P Q and determine the set T for which the contrapositive is a true statement. (c) Is there any relation between the sets S and T? Explain your answer. Example 4.4. Write down the contrapositive of the implication If 7m is an odd number, then m is an odd number. Then prove the original implication is true by showing that the contrapositive implication is true. Example 4.5. Assume that x Z. Prove that if x 2 6x + 5 is even, then x is odd. (Hint: Use the fact that an implication and its contrapositive are logically equivalent. You may want to write the desired implication as A = B so that you do the contrapositive correctly.) Example 4.6. Suppose x, y {z R : z 0}. Prove if xy > 100 then x > 10 or y > 10. Example 4.7. Let x be a positive real number. Prove that if x 2 x > 1, then x > 2 by (a) a direct proof, (b) a proof by contrapositive and MSU 17

18 (c) a proof by contradiction. Example 4.8. Give a proof for the claim: If x and y are odd integers, then xy is odd using: (a) A direct proof. (b) Proof by Contrapositive. (c) Proof by Contradiction. Example 4.9. Prove by induction that for all n N, Example Prove the following: If n N, then n i=1 i 2 = n (n + 1)(2n + 1) ! + 2 3! + 3 4! + + n (n + 1)! = 1 1 (n + 1)!. Example If n is a non-negative integer, use mathematical induction to show that 5 (n 5 n). Example Prove the following using mathematical induction: For every integer n N, n 3 = n2 (n + 1) 2. 4 Example Prove the following statement For all n N, n i i! = (n + 1)! 1. i=1 Example Prove that for each n N, 9 divides 4 3n 1. If you do not know what divides means, you can look it up in the text it is in the index. Example Assume that f : R R is defined via the assignment rule f(x) = e 2x. We will use the notation that f (n) (x) is the n-th derivative of f. Prove, using induction that for all n N, f (n) (x) = 2 n e 2x. You are allowed to assume the standard differentiation rules for g(x) = e x and h(x) = cx (for a constant, c), as well as the chain rule. Example Prove that 5 (3 3n n+1 ) for every positive integer n. Example Use mathematical induction to prove the following: For any integer n 0, it follows that 3 (n 3 + 5n + 6). MSU 18

19 Week 5 (things about functions, injective, surjective) Example 5.1. There are four different functions f : {a, b} {0, 1}. List them all. Example 5.2. For each of the following, determine the largest set A R, such that f : A R defines a function. Next, determine the range, f(a) := {y R : f(x) = y, for some x A}. (i) f(x) = 1 + x 2, (ii) f(x) = 1 1 x, (iii) f(x) = 3x 1, (iv) f(x) = x 3 8, (v) f(x) = x. x 3 Example 5.3. Suppose A = {a, b, c, d, e, f, g}, B = {1, 2, 3, 4, 5, 6} and the assignment rule for f is given by f(a) = 2, f(b) = 3, f(c) = 4, f(d) = 5. State the domain and a choice of co-domain of f so that the assignment rule, f, given, defines a function. As a followup, determine the range of f (range is defined in the supplementary document). (Note to student, there are infinitely many correct choices for the co-domain so that the resulting triple gives a function, but there is exactly one correct choice for the range of this function.) Example 5.4. Suppose A = { 101, 10, 5, 0, 1, 2, 3, 4, 5, 6, 10}, B = {1, 2, 3, 4, 5, 6} and the assignment rule for f is defined by the table: x f(x) First, evaluate f(2) and f( 5). Then, state the domain and a choice of co-domain of f so that the assignment rule, f, given, defines a function. As a followup, determine the range of f (range is defined in the supplementary document). (Note to student, there are infinitely many correct choices for the co-domain so that the resulting triple gives a function, but there is exactly one correct choice for the range of this function.) Example 5.5. Find the largest possible domain, X R, so that the formula, defines a function f : X R. Justify your answer. f(x) = 3x + 1 5x 2 MSU 19

20 Example 5.6. Does the formula, f(x) = 3x + 1 5x 2 define a function f : Z Q? Justify your answer. Example 5.7. Attempt to define an assignment for a real number, x R, as { x if x is even 2 f(x) = x+1 if x is odd. 2 Does this assignment make sense for x R? Justify your answer. Does this assignment define a function f : R R? Justify your answer. Example 5.8. Let f : R Z be defined via the assignment f(x) = x := max{z Z : z x}. (Note, we call f the integer floor function.) (i) evaluate f(0.1), f(4.7), f(π), f( e). (ii) does this assignment define a function? Justify your answer. Example 5.9. Let A = {x R x > 0}. The function f : A B (with B R) is defined by the assignment rule f(x) = x 2 4x + 5. What is the largest codomain i.e. choice of the set, B so that f is surjective? Carefully justify your answer. Example Define the function, f : P 3 R via the operation f(p) := 1 0 p(x)dx. Is f injective and or surjective from P 3 to R? Justify your answer. Example The following statements give certain properties of functions. You are to do two things: (a) rewrite the defining conditions using quantifiers and logical connectives, as appropriate (b) write the negation of part (a) using the same symbolism. Example: A function f is odd if for every x, f( x) = f(x). (a) defining condition: x, f( x) = f(x). (b) negation: x such that f( x) f(x). It is not necessary that you understand precisely what each term means. MSU 20

21 (i) A function f is strictly decreasing if for every x and y, if x < y, then f(x) > f(y). (ii) A function f : A B is injective if for every x and y in A, if f(x) = f(y), then x = y. (iii) A function f : A B is surjective if for every y in B there exists an x in A such that f(x) = y. Example The following statements give certain properties of functions. You are to do two things: (a) rewrite the defining conditions using quantifiers and logical connectives, as appropriate (b) write the negation of part (a) using the same symbolism. Example: A function f is odd if for every x, f( x) = f(x). (a) defining condition: x, f( x) = f(x). (b) negation: x such that f( x) f(x). It is not necessary that you understand precisely what each term means. (i) A function f is even if for every x, f( x) = f(x). (ii) A function f is periodic if there exists a k > 0 such that for every x, f(x + k) = f(x). (iii) A function f is increasing if for every x and y, if x y, then f(x) f(y). Example Which of the following best identifies f : R R as a constant function, where x and y are real numbers. (a) x, y, f(x) = y. (b) x, y, f(x) = y. (c) y, x, f(x) = y. (d) y, x, f(x) = y. Example Define the set G = {1, 2, 3} and the function f : {1, 2, 3} Z be given by f(n) = n 2. Define the following sets: A = {n Z : m G with f(m) < n} B = {n Z : m G with f(m) > n} C = {n Z : m G, f(m) < n} D = {n Z : m G, f(m) > n} Give a basic description of the sets A, B, C, and D, just using subsets of the integers combined with inequalities, e.g. for some fictitious set, E, we have E = {x Z : x 7029}. MSU 21

22 Example Carefully justify both of these two claims under the assumption that x and y are real numbers. (i) max{x, x} = x. (ii) max{x, y} = 1 ( x y + x + y) 2 Note, it may be useful to recall that x = { x if x 0 x if x < 0. Example Let A = {1, 2, 3, 4} and B = {a, b, c}. Give an example of a function f : A B that is neither injective nor surjective. Example Let A = {1, 2, 3, 4, 5} and B = {1, 2, 3, 4}. (a) Give an example of a function f : A B such that y B x A, f(x) = y. (b) Give an example of a function g : A B such that y B x A, g(x) = y. (c) Give an example of a function h : B A such that x, y B, h(x) = h(y) = x = y. Example Negate each statement in Question 5.17 and give an example of a function f, g, h satisfying the corresponding negation, if possible. If no example can be provided explain why. Example A function f : Z Z Z is defined as f((m, n)) = 2n 4m. Verify whether this function is injective and whether it is surjective. Example Show that the function f : R R given by f(x) = x is injective. Example Prove or disprove that the function f : R R defined by f(x) = x 3 x is injective. Hint: A graph can help, but a graph is not a proof. Example Let the function f : [ 1, 1] [0, 1] be defined by f(x) = x. Is this function injective? How about if its domain is [0, 1], instead of [ 1, 1]? Example Consider the cosine function cos : R R. Decide whether this function is injective and whether it is surjective. What if it had been defined as cos : R [ 1, 1]? Example Let A = {x R x 2} and the function f : A R be defined by f(x) = 4x x 2. Prove that the function f is injective. Example A function f : Z Z is defined as f(n) = 2n + 1. Verify whether this function is injective and whether it is surjective. Example Prove or disprove that the function f is surjective MSU 22

23 (i) f : R { R defined by x f(x) = if x 0 x + 10 if x < 0, (ii) f : Z N {0} defined by f(x) = x. (iii) f : R 2 R 2 defined by f(x, y) = (x + y, x y). (iv) Let A = {x R 0 x 5} and B = {x R 2 x 8}. Let f : A B be defined by f(x) = x + 2. Example Consider the following function: f : Z { 1, 1} { 1 n is odd. f(n) = 1 n is even. a) Show that f is surjective. (just give a brief justification) b) Show that f is not injective. (just give a brief justification) Example For k R, consider the function f : R R defined by { kx + 5 x < 0 f(x) = x x 0. For what values of k is f a bijection? Example Let f : Z Z be the assignment defined by the relationship { n if n is even 2 f(n) = n+1 if n is odd. 2 (a) Does this description of f define a function? Justify your answer. (b) Is f injective? Justify your answer. (c) Is f surjective? Justify your answer. Example Define the operation f(p) := d dx p. Does f define a function from P 4 to P 4? Justify your answer. Is f an injective function from P 4 to P 4? Justify your answer. Is f a surjective function from P 4 to P 4? Justify your answer. (P n is the collection of polynomials or order at most n, see the supplementary document.) MSU 23

24 Example Let Int be the set of intervals, and let Tri be a set that contains a class of triangles, Int = {[a, b] a, b R, a < b} Tri = {( ABC) ABC is the unique triangle with vertices A = (a, 0), B = (b, 0), C = (x, y) and with a < b, y > 0}. We can think of Int as the set of closed intervals in R and Tri as the triangles in R 2 that have one of their sides as an interval in Int (sitting on the x-axis) and the third vertex somewhere above the x-axis. Now, we define a function from Int to Tri as h : Int Tri using the assignment rule input = I = [a, b], output = h(i) = the unique equilateral triangle whose base is I with its 3rd vertex above the x-axis. (i) Evaluate h([1, 5]). (ii) Is h an injective function? (iii) Is h a surjective function? (Note, it may be useful for you to recognize that because of the equilateral shape of h(i), you can write an explicit formula for the three vertices of h(i), in terms of a and b when I = [a, b]). Example Let the alphabet set be A = { a, b, c,... z }, and for n N, define, A n as the set of words or more formally, strings consisting of at most n letters from the alphabet set A. Formally, this could be A n = {string = θ 1 θ m m n and θ i A for i = 1,..., m}. Notice that both eleven and xjastr are strings of length 6 in A 6, so here we don t care if our strings are valid words in the English dictionary. Consider the function s : A 6 A 6 that takes a string of length at most 6 to the string with all of the same letters sorted alphabetically. For example, s( number ) = bemnru, and s( eleven ) = eeelnv. Determine whether s is injective and whether it is surjective. If s is not surjective, how can we redefine the codomain of s to make it surjective? Example Define the set D P(N), as D = {A N : A contains a finite number of elements}, and the set Even = {x Z : x = 2k for some k Z}. MSU 24

25 Define a function, c : D N {0}, via the assignment c(a) = A Even. (Recall that the cardinality, E, is defined in the text, and the power set, P(N), is defined in the supplementary material.) Answer the questions about the function c. (a) Let E = {1, 3, 4, 6, 17, 20, 21}. Evaluate c(e). (b) Let B = {x N : 100 < x < 141 and x is divisible by 7}. Evaluate c(b). (c) Let H = {x N : x is divisible by 20}. Can you evaluate c(h)? (d) Prove that c is not an injective function. (e) Prove that c is a surjective function. Example Consider the function G : P 4 P 2 given by taking the second derivative, that is, for a polynomial f P 4, we have G(f) = d2 f dx 2 (a) Prove that G is not injective. (b) Prove that G is surjective. (c) Let X = {p P 4 : 1+a 2 x 2 +a 3 x 3 +a 4 x 4 }, and define H, similarly to G as H : X P 2, via H(f) = d2 f dx 2. Prove that H is injective. Example Let the function, R : P 2 P 4, be defined via the assignment rule [R(p)](x) := p(x) 2. (a) For q(x) = x 2 + 3x, evaluate the output, R(q). (b) Is R an injective function? Justify your answer. (c) Is R a surjective function? Justify your answer. Example Give an example of a function G : P 2 P 1 such that when the input is p(x) = x 2, the output is [G(p)](x) = 10x Example Given an example of a function g : R R that is injective but not surjective. Justify your answer. Example Give an example of p : R R such that p is a polynomial of degree 3 that is surjective but not injective. You don t need to justify your answer. MSU 25

26 Example Define the function T : P 2 P 3 via the assignment [T (f)](x) := x 0 f(s)ds, for all x R. That is to say, the input to T is a polynomial f P 2 and the output from T is the new polynomial made by antidifferenting f with a zero constant of integration. (a) Evaluate T (f) for each of the three instances of f as: f(s) = 1, f(s) = s, and f(s) = s 2. (note, since T (f) is a polynomial, you must show which polynomial it is by plugging in a real variable, x. So, really, you must show what is [T (f)](x) for x R.) (b) Prove that T is an injective function. (c) Prove that T is not a surjective function. NOTE! The fundamental theorem of calculus may be incredibly helpful to you here. Also note, you probably do not have to bother to write f(x) = a 0 + a 1 x + a 2 x 2, etc... you can just leave your functions as p, q, f, etc... Example Let the function, R : P 3 R, be defined via the assignment rule R(p) := (i) is R an injective function? Justify your answer. (ii) is R a surjective function? Justify your answer. p(4) p(0). 4 (iii) Describe the function, R, in terms of the graph of p; of the following list of phrases, include the correct and relevant ones in your description: derivative, secant line, antiderivative, integral, slope, area under the curve, gravitational singularity. MSU 26

27 Week 6 (things related to bijections and inverse functions) Example 6.1. Let f : N N be the function defined via the assignment f(n) = (i) Prove that f is not an injective function. (ii) Prove that f is a surjective function. { n n is even 2 3n + 1 n is odd (iii) Does there exist a function g : N N that satisfies g(f(x)) = x for all x N? (iv) Does there exist a function h : N N that satisfies f(h(y)) = y for all y N? Example 6.2. The function f : R R defined as f(x) = πx e is bijective. Find its inverse. Example 6.3. Prove that the function f : R \ {2} R \ {5} defined by f(x) = 5x+1 is bijective, and find x 2 the assignment rule for f 1 (you don t have to prove why the assignment rule is what it is). Example 6.4. Check that the function f : Z Z defined by f(n) = 6 n is bijective. Then find the assignment rule for f 1. Example 6.5. Let A = R \ {1} and define f : A A by f(x) = (i) Prove that f is bijective. (ii) Determine f 1. x x 1 for all x A. Example 6.6. Let F : (, ln(6) 4) ( 3, 3) be the function defined via F (x) = e x+4 3 (a) Show that F is a bijection. (b) Find the assignment rule for F 1 and state the domain and range of F 1. Example 6.7. Consider the function f : R N N R defined as f(x, n) = (n, 3xn). Check that this is bijective; find its inverse function. Carefully justify that your answer does indeed yield the inverse function. Example 6.8. The function f : R 2 R 2 is defined by (a) Show that f is a bijection. f(x, y) = (2x 3y, x + 1) (b) Find the assignment rule for the inverse, f 1, of f. Example 6.9. Suppose f : A B and g : X Y are bijective functions. h : A X B Y by h(a, x) = (f(a), g(x)). Prove that h is bijective. Define a new function MSU 27

28 Example (i) Prove the following: If f : N N and f is strictly increasing, then f is injective. (ii) Give an example of a function, f : Z Z such that f is strictly increasing, but f is not bijective. { x if x < 0 Example Consider the functionf : Z Z by the rule f(x) = 1 x 2 if x 0 Determine and justify if f is injective and/or surjective. If f is bijective find an inverse function. Example Consider the function f : R B given by the assignment rule { x + 13 if x < 0 f(x) = 14 + x 2 if x 0. Find the largest set B R such that f has an inverse. Find the assignment rule for the inverse function (you do not need to justify that it is the inverse). Example Suppose X is the set of all continuous functions from R to R. Define a function M : X X via the assignment M(f)(x) := 1 f(x 1), for all x R Show that: (a) M is a bijection. (b) Find M 1. Example Define the function T : P 2 R P 3 via the assignment [T (f, a)](x) := x 0 f(s)ds + a, for all x R. That is to say, the input to T is the pair (f, a) P 2 R, of a polynomial and a real number. The output from T is the new function made by anti-differentiating f with a zero constant of integration, and then adding the constant a to it. (a) Evaluate T (f, 6) when f is the polynomial given by f(x) = 2x 2 x. (b) Prove that T is an injective function. (c) Prove that T is a surjective function. (Note, if p P 3 is given, and you claim to have found some pair (q, a) such that T (q, a) = p please don t forget to check that indeed [T (q, a)](x) = p(x) for all x and that q in indeed an element of P 2!) (d) Find the assignment rule for the function, T 1. NOTE! The fundamental theorem of calculus may be incredibly helpful to you here. Also note, you probably do not have to bother to write f(x) = a 0 + a 1 x + a 2 x 2, etc... you can just leave your functions as p, q, f, etc... MSU 28

29 Example Let P n be the set of real polynomials of order at most n. For each of the following functions, determine if: (i) the function is surjective, (ii) the function is injective, and (iii) if the function is not injective, and if its domain is X and its codomain is Y, can you give an example of a set A X such that the function is injective from A Y? (a) Given a polynomial p P 3, such that p(x) = a 0 + a 1 x + a 2 x 2 + a 3 x 3 define the function D : P 3 P 3 with the assignment rule [D(p)](x) = p (x) + a 0 x 3 Note that D is a function that takes a real polynomial p as an input and returns another real polynomial, D(p). (b) Given a polynomial p P 3, define the function I : P 3 R with the assignment rule I(p) = 1 0 p(x) dx Note that I is a function that takes a real polynomial p as an input and returns a real number. (c) Given a polynomial p P 3, define the function S : P 3 P 6 with the assignment rule S(p) = p 2 Note that S is a function that takes a real polynomial p as an input and returns another real polynomial, S(p). When we plug in a real variable x into the polynomial S(p), we get that. (d) Given a polynomial p P 3, such that [S(p)](x) = [p(x)] 2 p(x) = a 0 + a 1 x + a 2 x 2 + a 3 x 3 define the function C : P 3 R 4 with the assignment rule [C(p)](x) = (a 0, a 1, a 2, a 3 ) Note that C is a function that takes a real polynomial p as an input and returns a real 4-vector. MSU 29

MTH 299 In Class and Recitation Problems SUMMER 2016

MTH 299 In Class and Recitation Problems SUMMER 2016 MTH 299 In Class and Recitation Problems SUMMER 2016 Last updated on: May 13, 2016 MTH299 - Examples CONTENTS Contents 1 Week 1 3 1.1 In Class Problems.......................................... 3 1.2 Recitation

More information

Name (print): Question 4. exercise 1.24 (compute the union, then the intersection of two sets)

Name (print): Question 4. exercise 1.24 (compute the union, then the intersection of two sets) MTH299 - Homework 1 Question 1. exercise 1.10 (compute the cardinality of a handful of finite sets) Solution. Write your answer here. Question 2. exercise 1.20 (compute the union of two sets) Question

More information

Supplementary Material for MTH 299 Online Edition

Supplementary Material for MTH 299 Online Edition Supplementary Material for MTH 299 Online Edition Abstract This document contains supplementary material, such as definitions, explanations, examples, etc., to complement that of the text, How to Think

More information

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements

More information

1 Take-home exam and final exam study guide

1 Take-home exam and final exam study guide Math 215 - Introduction to Advanced Mathematics Fall 2013 1 Take-home exam and final exam study guide 1.1 Problems The following are some problems, some of which will appear on the final exam. 1.1.1 Number

More information

LECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel

LECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel LECTURE NOTES on DISCRETE MATHEMATICS Eusebius Doedel 1 LOGIC Introduction. First we introduce some basic concepts needed in our discussion of logic. These will be covered in more detail later. A set is

More information

Math 10850, fall 2017, University of Notre Dame

Math 10850, fall 2017, University of Notre Dame Math 10850, fall 2017, University of Notre Dame Notes on first exam September 22, 2017 The key facts The first midterm will be on Thursday, September 28, 6.15pm-7.45pm in Hayes-Healy 127. What you need

More information

Lecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel

Lecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel Lecture Notes on DISCRETE MATHEMATICS Eusebius Doedel c Eusebius J. Doedel, 009 Contents Logic. Introduction............................................................................... Basic logical

More information

Lecture Notes 1 Basic Concepts of Mathematics MATH 352

Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,

More information

Final Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is

Final Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is 1. Describe the elements of the set (Z Q) R N. Is this set countable or uncountable? Solution: The set is equal to {(x, y) x Z, y N} = Z N. Since the Cartesian product of two denumerable sets is denumerable,

More information

Contribution of Problems

Contribution of Problems Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions

More information

Section A (not in the text) Which of the following are statements? Explain. 3. The President of the United States in 2089 will be a woman.

Section A (not in the text) Which of the following are statements? Explain. 3. The President of the United States in 2089 will be a woman. Math 299 Homework Assignment, Chapter 2 Section 2.1 2.A (not in the text) Which of the following are statements? Explain. 1. Let x be a positive integer. Then x is rational. 2. Mathematics is fun. 3. The

More information

Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.

Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3

More information

1 Homework. Recommended Reading:

1 Homework. Recommended Reading: Analysis MT43C Notes/Problems/Homework Recommended Reading: R. G. Bartle, D. R. Sherbert Introduction to real analysis, principal reference M. Spivak Calculus W. Rudin Principles of mathematical analysis

More information

LECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel

LECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel LECTURE NOTES on DISCRETE MATHEMATICS Eusebius Doedel 1 LOGIC Introduction. First we introduce some basic concepts needed in our discussion of logic. These will be covered in more detail later. A set is

More information

MATH 2200 Final LC Review

MATH 2200 Final LC Review MATH 2200 Final LC Review Thomas Goller April 25, 2013 1 Final LC Format The final learning celebration will consist of 12-15 claims to be proven or disproven. It will take place on Wednesday, May 1, from

More information

Theorem. For every positive integer n, the sum of the positive integers from 1 to n is n(n+1)

Theorem. For every positive integer n, the sum of the positive integers from 1 to n is n(n+1) Week 1: Logic Lecture 1, 8/1 (Sections 1.1 and 1.3) Examples of theorems and proofs Theorem (Pythagoras). Let ABC be a right triangle, with legs of lengths a and b, and hypotenuse of length c. Then a +

More information

1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : 5 points

1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : 5 points Introduction to Discrete Mathematics 3450:208 Test 1 1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : The inverse of E : The

More information

Math Fall 2014 Final Exam Solutions

Math Fall 2014 Final Exam Solutions Math 2001-003 Fall 2014 Final Exam Solutions Wednesday, December 17, 2014 Definition 1. The union of two sets X and Y is the set X Y consisting of all objects that are elements of X or of Y. The intersection

More information

Packet #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics

Packet #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics CSC 224/226 Notes Packet #2: Set Theory & Predicate Calculus Barnes Packet #2: Set Theory & Predicate Calculus Applied Discrete Mathematics Table of Contents Full Adder Information Page 1 Predicate Calculus

More information

1. Given the public RSA encryption key (e, n) = (5, 35), find the corresponding decryption key (d, n).

1. Given the public RSA encryption key (e, n) = (5, 35), find the corresponding decryption key (d, n). MATH 135: Randomized Exam Practice Problems These are the warm-up exercises and recommended problems taken from all the extra practice sets presented in random order. The challenge problems have not been

More information

MAT 417, Fall 2017, CRN: 1766 Real Analysis: A First Course

MAT 417, Fall 2017, CRN: 1766 Real Analysis: A First Course MAT 47, Fall 207, CRN: 766 Real Analysis: A First Course Prerequisites: MAT 263 & MAT 300 Instructor: Daniel Cunningham What is Real Analysis? Real Analysis is the important branch of mathematics that

More information

STRATEGIES OF PROBLEM SOLVING

STRATEGIES OF PROBLEM SOLVING STRATEGIES OF PROBLEM SOLVING Second Edition Maria Nogin Department of Mathematics College of Science and Mathematics California State University, Fresno 2014 2 Chapter 1 Introduction Solving mathematical

More information

Week Some Warm-up Questions

Week Some Warm-up Questions 1 Some Warm-up Questions Week 1-2 Abstraction: The process going from specific cases to general problem. Proof: A sequence of arguments to show certain conclusion to be true. If... then... : The part after

More information

(1) Which of the following are propositions? If it is a proposition, determine its truth value: A propositional function, but not a proposition.

(1) Which of the following are propositions? If it is a proposition, determine its truth value: A propositional function, but not a proposition. Math 231 Exam Practice Problem Solutions WARNING: This is not a sample test. Problems on the exams may or may not be similar to these problems. These problems are just intended to focus your study of the

More information

Selected problems from past exams

Selected problems from past exams Discrete Structures CS2800 Prelim 1 s Selected problems from past exams 1. True/false. For each of the following statements, indicate whether the statement is true or false. Give a one or two sentence

More information

MATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017

MATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017 MATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017 Definition: A set A is finite if there exists a nonnegative integer c such that there exists a bijection from A

More information

Midterm Preparation Problems

Midterm Preparation Problems Midterm Preparation Problems The following are practice problems for the Math 1200 Midterm Exam. Some of these may appear on the exam version for your section. To use them well, solve the problems, then

More information

MATH 135 Fall 2006 Proofs, Part IV

MATH 135 Fall 2006 Proofs, Part IV MATH 135 Fall 006 s, Part IV We ve spent a couple of days looking at one particular technique of proof: induction. Let s look at a few more. Direct Here we start with what we re given and proceed in a

More information

2 Lecture 2: Logical statements and proof by contradiction Lecture 10: More on Permutations, Group Homomorphisms 31

2 Lecture 2: Logical statements and proof by contradiction Lecture 10: More on Permutations, Group Homomorphisms 31 Contents 1 Lecture 1: Introduction 2 2 Lecture 2: Logical statements and proof by contradiction 7 3 Lecture 3: Induction and Well-Ordering Principle 11 4 Lecture 4: Definition of a Group and examples 15

More information

Math 13, Spring 2013, Lecture B: Midterm

Math 13, Spring 2013, Lecture B: Midterm Math 13, Spring 2013, Lecture B: Midterm Name Signature UCI ID # E-mail address Each numbered problem is worth 12 points, for a total of 84 points. Present your work, especially proofs, as clearly as possible.

More information

8. Given a rational number r, prove that there exist coprime integers p and q, with q 0, so that r = p q. . For all n N, f n = an b n 2

8. Given a rational number r, prove that there exist coprime integers p and q, with q 0, so that r = p q. . For all n N, f n = an b n 2 MATH 135: Randomized Exam Practice Problems These are the warm-up exercises and recommended problems taken from all the extra practice sets presented in random order. The challenge problems have not been

More information

Mathematics 1 Lecture Notes Chapter 1 Algebra Review

Mathematics 1 Lecture Notes Chapter 1 Algebra Review Mathematics 1 Lecture Notes Chapter 1 Algebra Review c Trinity College 1 A note to the students from the lecturer: This course will be moving rather quickly, and it will be in your own best interests to

More information

Solutions to 2015 Entrance Examination for BSc Programmes at CMI. Part A Solutions

Solutions to 2015 Entrance Examination for BSc Programmes at CMI. Part A Solutions Solutions to 2015 Entrance Examination for BSc Programmes at CMI Part A Solutions 1. Ten people sitting around a circular table decide to donate some money for charity. You are told that the amount donated

More information

A Guide to Proof-Writing

A Guide to Proof-Writing A Guide to Proof-Writing 437 A Guide to Proof-Writing by Ron Morash, University of Michigan Dearborn Toward the end of Section 1.5, the text states that there is no algorithm for proving theorems.... Such

More information

Solutions to Math 41 First Exam October 18, 2012

Solutions to Math 41 First Exam October 18, 2012 Solutions to Math 4 First Exam October 8, 202. (2 points) Find each of the following its, with justification. If the it does not exist, explain why. If there is an infinite it, then explain whether it

More information

Web Solutions for How to Read and Do Proofs

Web Solutions for How to Read and Do Proofs Web Solutions for How to Read and Do Proofs An Introduction to Mathematical Thought Processes Sixth Edition Daniel Solow Department of Operations Weatherhead School of Management Case Western Reserve University

More information

Some Basic Logic. Henry Liu, 25 October 2010

Some Basic Logic. Henry Liu, 25 October 2010 Some Basic Logic Henry Liu, 25 October 2010 In the solution to almost every olympiad style mathematical problem, a very important part is existence of accurate proofs. Therefore, the student should be

More information

Introduction to Proofs in Analysis. updated December 5, By Edoh Y. Amiran Following the outline of notes by Donald Chalice INTRODUCTION

Introduction to Proofs in Analysis. updated December 5, By Edoh Y. Amiran Following the outline of notes by Donald Chalice INTRODUCTION Introduction to Proofs in Analysis updated December 5, 2016 By Edoh Y. Amiran Following the outline of notes by Donald Chalice INTRODUCTION Purpose. These notes intend to introduce four main notions from

More information

Exam Practice Problems

Exam Practice Problems Math 231 Exam Practice Problems WARNING: This is not a sample test. Problems on the exams may or may not be similar to these problems. These problems are just intended to focus your study of the topics.

More information

MATH 13 FINAL EXAM SOLUTIONS

MATH 13 FINAL EXAM SOLUTIONS MATH 13 FINAL EXAM SOLUTIONS WINTER 2014 Problem 1 (15 points). For each statement below, circle T or F according to whether the statement is true or false. You do NOT need to justify your answers. T F

More information

Chapter 2: Functions, Limits and Continuity

Chapter 2: Functions, Limits and Continuity Chapter 2: Functions, Limits and Continuity Functions Limits Continuity Chapter 2: Functions, Limits and Continuity 1 Functions Functions are the major tools for describing the real world in mathematical

More information

Advanced Mathematics Unit 2 Limits and Continuity

Advanced Mathematics Unit 2 Limits and Continuity Advanced Mathematics 3208 Unit 2 Limits and Continuity NEED TO KNOW Expanding Expanding Expand the following: A) (a + b) 2 B) (a + b) 3 C) (a + b)4 Pascals Triangle: D) (x + 2) 4 E) (2x -3) 5 Random Factoring

More information

Advanced Mathematics Unit 2 Limits and Continuity

Advanced Mathematics Unit 2 Limits and Continuity Advanced Mathematics 3208 Unit 2 Limits and Continuity NEED TO KNOW Expanding Expanding Expand the following: A) (a + b) 2 B) (a + b) 3 C) (a + b)4 Pascals Triangle: D) (x + 2) 4 E) (2x -3) 5 Random Factoring

More information

1. From Lewis Carroll: extract a pair of premises and finish the conclusion.

1. From Lewis Carroll: extract a pair of premises and finish the conclusion. Math 2200 2. Treibergs σιι First Midterm Exam Name: Sample January 26, 2011 Sample First Midterm Questions. Sept. 17, 2008 and Sept. 16, 2009. Some questions from Math 3210 Midterms of 1. From Lewis Carroll:

More information

3 The language of proof

3 The language of proof 3 The language of proof After working through this section, you should be able to: (a) understand what is asserted by various types of mathematical statements, in particular implications and equivalences;

More information

Chapter 1 : The language of mathematics.

Chapter 1 : The language of mathematics. MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :

More information

MAT115A-21 COMPLETE LECTURE NOTES

MAT115A-21 COMPLETE LECTURE NOTES MAT115A-21 COMPLETE LECTURE NOTES NATHANIEL GALLUP 1. Introduction Number theory begins as the study of the natural numbers the integers N = {1, 2, 3,...}, Z = { 3, 2, 1, 0, 1, 2, 3,...}, and sometimes

More information

Chapter Summary. Sets (2.1) Set Operations (2.2) Functions (2.3) Sequences and Summations (2.4) Cardinality of Sets (2.5) Matrices (2.

Chapter Summary. Sets (2.1) Set Operations (2.2) Functions (2.3) Sequences and Summations (2.4) Cardinality of Sets (2.5) Matrices (2. Chapter 2 Chapter Summary Sets (2.1) Set Operations (2.2) Functions (2.3) Sequences and Summations (2.4) Cardinality of Sets (2.5) Matrices (2.6) Section 2.1 Section Summary Definition of sets Describing

More information

Mathematical Reasoning & Proofs

Mathematical Reasoning & Proofs Mathematical Reasoning & Proofs MAT 1362 Fall 2018 Alistair Savage Department of Mathematics and Statistics University of Ottawa This work is licensed under a Creative Commons Attribution-ShareAlike 4.0

More information

STUDY GUIDE FOR THE WRECKONING. 1. Combinatorics. (1) How many (positive integer) divisors does 2940 have? What about 3150?

STUDY GUIDE FOR THE WRECKONING. 1. Combinatorics. (1) How many (positive integer) divisors does 2940 have? What about 3150? STUDY GUIDE FOR THE WRECKONING. Combinatorics Go over combinatorics examples in the text. Review all the combinatorics problems from homework. Do at least a couple of extra problems given below. () How

More information

RED. Name: Instructor: Pace Nielsen Math 290 Section 1: Winter 2014 Final Exam

RED. Name: Instructor: Pace Nielsen Math 290 Section 1: Winter 2014 Final Exam RED Name: Instructor: Pace Nielsen Math 290 Section 1: Winter 2014 Final Exam Note that the first 10 questions are true-false. Mark A for true, B for false. Questions 11 through 20 are multiple choice

More information

In this initial chapter, you will be introduced to, or more than likely be reminded of, a

In this initial chapter, you will be introduced to, or more than likely be reminded of, a 1 Sets In this initial chapter, you will be introduced to, or more than likely be reminded of, a fundamental idea that occurs throughout mathematics: sets. Indeed, a set is an object from which every mathematical

More information

Math 230 Final Exam, Spring 2008

Math 230 Final Exam, Spring 2008 c IIT Dept. Applied Mathematics, May 15, 2008 1 PRINT Last name: Signature: First name: Student ID: Math 230 Final Exam, Spring 2008 Conditions. 2 hours. No book, notes, calculator, cell phones, etc. Part

More information

Math 300 Diana Davis Evanston, IL Spring 2016

Math 300 Diana Davis Evanston, IL Spring 2016 Diana Davis Evanston, IL Spring 2016 Before each class, your homework is to read the associated section(s) in Book of Proof by Richard Hammack, and do the homework problems on the associated page. Note

More information

0 Sets and Induction. Sets

0 Sets and Induction. Sets 0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set

More information

Math 4606, Summer 2004: Inductive sets, N, the Peano Axioms, Recursive Sequences Page 1 of 10

Math 4606, Summer 2004: Inductive sets, N, the Peano Axioms, Recursive Sequences Page 1 of 10 Math 4606, Summer 2004: Inductive sets, N, the Peano Axioms, Recursive Sequences Page 1 of 10 Inductive sets (used to define the natural numbers as a subset of R) (1) Definition: A set S R is an inductive

More information

Logical Reasoning. Chapter Statements and Logical Operators

Logical Reasoning. Chapter Statements and Logical Operators Chapter 2 Logical Reasoning 2.1 Statements and Logical Operators Preview Activity 1 (Compound Statements) Mathematicians often develop ways to construct new mathematical objects from existing mathematical

More information

MATH 1902: Mathematics for the Physical Sciences I

MATH 1902: Mathematics for the Physical Sciences I MATH 1902: Mathematics for the Physical Sciences I Dr Dana Mackey School of Mathematical Sciences Room A305 A Email: Dana.Mackey@dit.ie Dana Mackey (DIT) MATH 1902 1 / 46 Module content/assessment Functions

More information

4.1 Real-valued functions of a real variable

4.1 Real-valued functions of a real variable Chapter 4 Functions When introducing relations from a set A to a set B we drew an analogy with co-ordinates in the x-y plane. Instead of coming from R, the first component of an ordered pair comes from

More information

Quadratics and Other Polynomials

Quadratics and Other Polynomials Algebra 2, Quarter 2, Unit 2.1 Quadratics and Other Polynomials Overview Number of instructional days: 15 (1 day = 45 60 minutes) Content to be learned Know and apply the Fundamental Theorem of Algebra

More information

Sets and Functions. (As we will see, in describing a set the order in which elements are listed is irrelevant).

Sets and Functions. (As we will see, in describing a set the order in which elements are listed is irrelevant). Sets and Functions 1. The language of sets Informally, a set is any collection of objects. The objects may be mathematical objects such as numbers, functions and even sets, or letters or symbols of any

More information

Topics in Logic and Proofs

Topics in Logic and Proofs Chapter 2 Topics in Logic and Proofs Some mathematical statements carry a logical value of being true or false, while some do not. For example, the statement 4 + 5 = 9 is true, whereas the statement 2

More information

Mathematics 220 Midterm Practice problems from old exams Page 1 of 8

Mathematics 220 Midterm Practice problems from old exams Page 1 of 8 Mathematics 220 Midterm Practice problems from old exams Page 1 of 8 1. (a) Write the converse, contrapositive and negation of the following statement: For every integer n, if n is divisible by 3 then

More information

MATH 2200 Final Review

MATH 2200 Final Review MATH 00 Final Review Thomas Goller December 7, 01 1 Exam Format The final exam will consist of 8-10 proofs It will take place on Tuesday, December 11, from 10:30 AM - 1:30 PM, in the usual room Topics

More information

IVA S STUDY GUIDE FOR THE DISCRETE FINAL EXAM - SELECTED SOLUTIONS. 1. Combinatorics

IVA S STUDY GUIDE FOR THE DISCRETE FINAL EXAM - SELECTED SOLUTIONS. 1. Combinatorics IVA S STUDY GUIDE FOR THE DISCRETE FINAL EXAM - SELECTED SOLUTIONS Combinatorics Go over combinatorics examples in the text Review all the combinatorics problems from homewor Do at least a couple of extra

More information

Math 38: Graph Theory Spring 2004 Dartmouth College. On Writing Proofs. 1 Introduction. 2 Finding A Solution

Math 38: Graph Theory Spring 2004 Dartmouth College. On Writing Proofs. 1 Introduction. 2 Finding A Solution Math 38: Graph Theory Spring 2004 Dartmouth College 1 Introduction On Writing Proofs What constitutes a well-written proof? A simple but rather vague answer is that a well-written proof is both clear and

More information

MAS114: Solutions to Exercises

MAS114: Solutions to Exercises MAS114: s to Exercises Up to week 8 Note that the challenge problems are intended to be difficult! Doing any of them is an achievement. Please hand them in on a separate piece of paper if you attempt them.

More information

INTRODUCTION TO REAL ANALYSIS II MATH 4332 BLECHER NOTES

INTRODUCTION TO REAL ANALYSIS II MATH 4332 BLECHER NOTES INTRODUCTION TO REAL ANALYSIS II MATH 4332 BLECHER NOTES You will be expected to reread and digest these typed notes after class, line by line, trying to follow why the line is true, for example how it

More information

SUMMER MATH PACKET. Geometry A COURSE 227

SUMMER MATH PACKET. Geometry A COURSE 227 SUMMER MATH PACKET Geometry A COURSE 7 MATH SUMMER PACKET INSTRUCTIONS Attached you will find a packet of exciting math problems for your enjoyment over the summer. The purpose of the summer packet is

More information

For all For every For each For any There exists at least one There exists There is Some

For all For every For each For any There exists at least one There exists There is Some Section 1.3 Predicates and Quantifiers Assume universe of discourse is all the people who are participating in this course. Also let us assume that we know each person in the course. Consider the following

More information

Solutions to Tutorial for Week 4

Solutions to Tutorial for Week 4 The University of Sydney School of Mathematics and Statistics Solutions to Tutorial for Week 4 MATH191/1931: Calculus of One Variable (Advanced) Semester 1, 018 Web Page: sydneyeduau/science/maths/u/ug/jm/math191/

More information

College Algebra Notes

College Algebra Notes Metropolitan Community College Contents Introduction 2 Unit 1 3 Rational Expressions........................................... 3 Quadratic Equations........................................... 9 Polynomial,

More information

We have seen that the symbols,,, and can guide the logical

We have seen that the symbols,,, and can guide the logical CHAPTER 7 Quantified Statements We have seen that the symbols,,, and can guide the logical flow of algorithms. We have learned how to use them to deconstruct many English sentences into a symbolic form.

More information

Chapter 8B - Trigonometric Functions (the first part)

Chapter 8B - Trigonometric Functions (the first part) Fry Texas A&M University! Spring 2016! Math 150 Notes! Section 8B-I! Page 79 Chapter 8B - Trigonometric Functions (the first part) Recall from geometry that if 2 corresponding triangles have 2 angles of

More information

Taylor and Maclaurin Series. Approximating functions using Polynomials.

Taylor and Maclaurin Series. Approximating functions using Polynomials. Taylor and Maclaurin Series Approximating functions using Polynomials. Approximating f x = e x near x = 0 In order to approximate the function f x = e x near x = 0, we can use the tangent line (The Linear

More information

Writing proofs for MATH 61CM, 61DM Week 1: basic logic, proof by contradiction, proof by induction

Writing proofs for MATH 61CM, 61DM Week 1: basic logic, proof by contradiction, proof by induction Writing proofs for MATH 61CM, 61DM Week 1: basic logic, proof by contradiction, proof by induction written by Sarah Peluse, revised by Evangelie Zachos and Lisa Sauermann September 27, 2016 1 Introduction

More information

Proofs. Chapter 2 P P Q Q

Proofs. Chapter 2 P P Q Q Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,

More information

Contribution of Problems

Contribution of Problems Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions

More information

Logic. Facts (with proofs) CHAPTER 1. Definitions

Logic. Facts (with proofs) CHAPTER 1. Definitions CHAPTER 1 Logic Definitions D1. Statements (propositions), compound statements. D2. Truth values for compound statements p q, p q, p q, p q. Truth tables. D3. Converse and contrapositive. D4. Tautologies

More information

Functions. Definition 1 Let A and B be sets. A relation between A and B is any subset of A B.

Functions. Definition 1 Let A and B be sets. A relation between A and B is any subset of A B. Chapter 4 Functions Definition 1 Let A and B be sets. A relation between A and B is any subset of A B. Definition 2 Let A and B be sets. A function from A to B is a relation f between A and B such that

More information

Final exam (practice) UCLA: Math 31B, Spring 2017

Final exam (practice) UCLA: Math 31B, Spring 2017 Instructor: Noah White Date: Final exam (practice) UCLA: Math 3B, Spring 207 This exam has 8 questions, for a total of 80 points. Please print your working and answers neatly. Write your solutions in the

More information

3 FUNCTIONS. 3.1 Definition and Basic Properties. c Dr Oksana Shatalov, Fall

3 FUNCTIONS. 3.1 Definition and Basic Properties. c Dr Oksana Shatalov, Fall c Dr Oksana Shatalov, Fall 2016 1 3 FUNCTIONS 3.1 Definition and Basic Properties DEFINITION 1. Let A and B be nonempty sets. A function f from the set A to the set B is a correspondence that assigns to

More information

Since x + we get x² + 2x = 4, or simplifying it, x² = 4. Therefore, x² + = 4 2 = 2. Ans. (C)

Since x + we get x² + 2x = 4, or simplifying it, x² = 4. Therefore, x² + = 4 2 = 2. Ans. (C) SAT II - Math Level 2 Test #01 Solution 1. x + = 2, then x² + = Since x + = 2, by squaring both side of the equation, (A) - (B) 0 (C) 2 (D) 4 (E) -2 we get x² + 2x 1 + 1 = 4, or simplifying it, x² + 2

More information

MATH 196, SECTION 57 (VIPUL NAIK)

MATH 196, SECTION 57 (VIPUL NAIK) TAKE-HOME CLASS QUIZ: DUE MONDAY NOVEMBER 25: SUBSPACE, BASIS, DIMENSION, AND ABSTRACT SPACES: APPLICATIONS TO CALCULUS MATH 196, SECTION 57 (VIPUL NAIK) Your name (print clearly in capital letters): PLEASE

More information

We are going to discuss what it means for a sequence to converge in three stages: First, we define what it means for a sequence to converge to zero

We are going to discuss what it means for a sequence to converge in three stages: First, we define what it means for a sequence to converge to zero Chapter Limits of Sequences Calculus Student: lim s n = 0 means the s n are getting closer and closer to zero but never gets there. Instructor: ARGHHHHH! Exercise. Think of a better response for the instructor.

More information

Propositional Logic, Predicates, and Equivalence

Propositional Logic, Predicates, and Equivalence Chapter 1 Propositional Logic, Predicates, and Equivalence A statement or a proposition is a sentence that is true (T) or false (F) but not both. The symbol denotes not, denotes and, and denotes or. If

More information

Automata Theory and Formal Grammars: Lecture 1

Automata Theory and Formal Grammars: Lecture 1 Automata Theory and Formal Grammars: Lecture 1 Sets, Languages, Logic Automata Theory and Formal Grammars: Lecture 1 p.1/72 Sets, Languages, Logic Today Course Overview Administrivia Sets Theory (Review?)

More information

Solutions to Practice Final

Solutions to Practice Final s to Practice Final 1. (a) What is φ(0 100 ) where φ is Euler s φ-function? (b) Find an integer x such that 140x 1 (mod 01). Hint: gcd(140, 01) = 7. (a) φ(0 100 ) = φ(4 100 5 100 ) = φ( 00 5 100 ) = (

More information

MATH FINAL EXAM REVIEW HINTS

MATH FINAL EXAM REVIEW HINTS MATH 109 - FINAL EXAM REVIEW HINTS Answer: Answer: 1. Cardinality (1) Let a < b be two real numbers and define f : (0, 1) (a, b) by f(t) = (1 t)a + tb. (a) Prove that f is a bijection. (b) Prove that any

More information

Sequences. Chapter 3. n + 1 3n + 2 sin n n. 3. lim (ln(n + 1) ln n) 1. lim. 2. lim. 4. lim (1 + n)1/n. Answers: 1. 1/3; 2. 0; 3. 0; 4. 1.

Sequences. Chapter 3. n + 1 3n + 2 sin n n. 3. lim (ln(n + 1) ln n) 1. lim. 2. lim. 4. lim (1 + n)1/n. Answers: 1. 1/3; 2. 0; 3. 0; 4. 1. Chapter 3 Sequences Both the main elements of calculus (differentiation and integration) require the notion of a limit. Sequences will play a central role when we work with limits. Definition 3.. A Sequence

More information

1 Direct Proofs Technique Outlines Example Implication Proofs Technique Outlines Examples...

1 Direct Proofs Technique Outlines Example Implication Proofs Technique Outlines Examples... CSE 311: Foundations of Computing I Proof Techniques What Is This? Each of the following is as close as we can get to giving you a template (and a completely worked out example) for every proof technique

More information

1.1 Language and Logic

1.1 Language and Logic c Oksana Shatalov, Fall 2017 1 1.1 Language and Logic Mathematical Statements DEFINITION 1. A proposition is any declarative sentence (i.e. it has both a subject and a verb) that is either true or false,

More information

Chapter 1A -- Real Numbers. iff. Math Symbols: Sets of Numbers. Example: Let A = {4, 8, 12, 16, 20,...} and let B = {6, 12, 18, 24, 30,...

Chapter 1A -- Real Numbers. iff. Math Symbols: Sets of Numbers. Example: Let A = {4, 8, 12, 16, 20,...} and let B = {6, 12, 18, 24, 30,... Fry Texas A&M University!! Math 150! Spring 2015 Unit 1! Page 1 Chapter 1A -- Real Numbers Math Symbols: iff or Example: Let A = {4, 8, 12, 16, 20,...} and let B = {6, 12, 18, 24, 30,...} Then A B= and

More information

Proofs. Chapter 2 P P Q Q

Proofs. Chapter 2 P P Q Q Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,

More information

Test Codes : MIA (Objective Type) and MIB (Short Answer Type) 2007

Test Codes : MIA (Objective Type) and MIB (Short Answer Type) 2007 Test Codes : MIA (Objective Type) and MIB (Short Answer Type) 007 Questions will be set on the following and related topics. Algebra: Sets, operations on sets. Prime numbers, factorisation of integers

More information

Chapter 0 Preliminaries

Chapter 0 Preliminaries Chapter 0 Preliminaries MA1101 Mathematics 1A Semester I Year 2017/2018 FTMD & FTI International Class Odd NIM (K-46) Lecturer: Dr. Rinovia Simanjuntak 0.1 Real Numbers and Logic Real Numbers Repeating

More information

1.4 Techniques of Integration

1.4 Techniques of Integration .4 Techniques of Integration Recall the following strategy for evaluating definite integrals, which arose from the Fundamental Theorem of Calculus (see Section.3). To calculate b a f(x) dx. Find a function

More information

Functions as Relations

Functions as Relations Functions as Relations Definition Recall that if A and B are sets, then a relation from A to B is a subset of A B. A function from A to B is a relation f from A to B with the following properties (i) The

More information

2k n. k=0. 3x 2 7 (mod 11) 5 4x 1 (mod 9) 2 r r +1 = r (2 r )

2k n. k=0. 3x 2 7 (mod 11) 5 4x 1 (mod 9) 2 r r +1 = r (2 r ) MATH 135: Randomized Exam Practice Problems These are the warm-up exercises and recommended problems take from the extra practice sets presented in random order. The challenge problems have not been included.

More information