MATH 170 Team Three Group Project Part 1

Daniel Ayala Jacob Button Jacob Young

Introduction

We are solving 4 problems from chapter 3 in this part of the project.

o o

Section 3.1: #28, 29, 30 Section 3.3: #20

MATH 170 Team 3 Group Project Problem Set 1

Directions for the 1st set of Problems

Give background information about our problem sets In 2830, rewrite each statement without using quantifiers or variables. Indicate which are true and which are false, and justify your answers as best as you can.

Symbols and their Definitions

= For all It means that for all possible values in the domain the statement is true. = There exists...This means that at least one element of the domain matching the condition can be found. = An element of This means that the preceeding elements belong to the set listed after it.

Symbols (continued)
= Implication. It means that the term before it implies the term after it. Example: If P(x) then Q(x) is the same as P(x) Q(x) = Biconditional, or If and only If = AND (both values MUST be true) = OR (At least one value must be true) ~ = NOT, or the opposite truth value

First Problem
28. Let the domain of x be the set D of objects discussed in mathematics courses, and let Real(x) be x is a real number, Pos(x) be x is a positive real number, Neg(x) be x is a negative real number, and Int(x) be x is an integer. a. Pos(0) b. x, Real(x) Neg(x) Pos(x). c. x, Int(x) Real(x).

a. Pos(0)
- Translated into words: 0 is a positive real number - This statement is false because 0 is neither negative or positive.

b. x, Real(x) Neg(x) Pos(x).

- Translated into words: If x is a real number and is negative, then (-x) is positive. - This statement is true because the negative of a negative number is positive

c. x, Int(x) Real(x).
- Translated into words: If x is an integer, then x is a real number - This statement is true because all integers are real numbers.

d. x such that Real(x) ~Int(x).

- Translated into words: There exists an x such that it is a real number and x is not an integer - This statement is true because fractions are real numbers, but they are not integers.

Second Problem
29. Let the domain of x be the set of geometric figures in the plane, and let Square(x) be x is a square and Rect(x) be x is a rectangle.

a. x, such that Rect(x) Square(x). b. x, such that Rect(x) ~Square(x). c. x, Square(x) Rect(x).

a. x, such that Rect(x) Square(x).

- Translated into words: There is exists an x such that x is a rectangle and a square - This is true because a square is always a rectangle

b. x, such that Rect(x) ~Square(x).

- Translated into words: There is an x such that x is a rectangle and is not a square. - This statement is true because not all rectangles are squares

c. x, Square(x) Rect(x).
-Translated into words: There exists an x, if x is a square, then x is a rectangle. - This is true because all squares are rectangles

Third Problem
30. Let the domain of x be the set Z of integers, and let Odd(x) be x is odd, Prime(x) be x is prime, and Square(x) be x is a perfect square. (An integer n is said to be a perfect square if, and only if, it equals the square of some integer. For example, 25 is a perfect square because 25 = 5^2.)

a. x such that Prime(x) Odd(x). b. x, Prime(x) Square(x). c. x such that Odd(x) Square(x)

a. x such that Prime(x) Odd(x).

- Translated into words:: There exists an x such that x is prime and x is not an odd number. - This is true because there is an even number that is prime, the number 2.

b. x, Prime(x) ~Square(x).
- Translated into words: There exists an x such that if x is a prime number then x is not a perfect square. - This is false because all prime numbers are not perfect squares.

c. x such that Odd(x) Square(x)

- Translated into words: There exists an x such that x is odd and x is a perfect square - This is true because 49 is an odd number and 49 = 7^2 is a perfect square.

MATH 170 Team 3 Group Project Problem Set 2

Problem Set 2
Recall that reversing the order of the quantifiers in a statement with two different quantifiers may change the truth value of the statementbut it does not necessarily do so. All the statements in the pairs on the next page refer to the Tarski world of Figure 3.3.1. In each pair, the order of the quantifiers is reversed but everything else is the same. For each pair, determine whether the statements have the same or opposite truth values. Justify your answers.
Pg. 118 - 119 Discrete Mathematics With Applications

Problem Set 2 Problems:

Problem a: (1) For all squares y there is a triangle x such that x and y have different color. (2) There is a triangle x such that for all squares y, x and y have different colors. Problem b: (1) For all circles y there is a square x such that x and y have the same color. (2) There is a square x such that for all circles y, x and y have the same color.

Tarski World

Problem 1
a. (1) For all squares y there is a triangle x such that x and y have different color. Statement: y different colors.
Given Square y =

D, x such that Square(y) and Triangle(x) have

Choose Triangle x = For every square, is there at least one triangle that has a different color than that of the square?
Yes Yes

h or g (Light Grey) e (Dark Grey)

d f or i

j (Blue)

f, i, or d

Yes

Truth Value: True This statement has a truth value of true because for every Square(y) there is at least one triangle(x) that has a different color.

Problem 1 - Reversed Quantifiers

a. (2) There is a triangle x such that for all squares y, x and y have different colors. Statement: x different colors.

D, y

such that Square(y) and Triangle(x) have

Is there at least one Triangle that has a different color than that of every square?
No No

Choose Triangle x =

Then, given Square y =

d f

e, g, h, and j e, g, h, and j

e, g, h, and j

No

Truth Value: False This problem has a truth value of false due to the fact that there is no triangle(x) that has a different color from all squares (y).

Problem 1 - Solution Explanation

As you can see with the examples in problem 1 (part 1 and part 2), by switching the universal and existential quantifiers in a given statement, the truth value does not always remain the same. By switching the quantifiers, the statement has essentially been changed.

The statement in part one is declaring that for every square there is at least one triangle of a different color.
The statement in part two is declaring that there is at least one triangle that is a different color from every square.

Problem 2
b. (1) For all circles y there is a square x such that x and y have the same color.

Statement: same color.

y D, x such that Circles(y) and Squares(x) have the

Choose Square x = For every circle, is there at least one square that has the same color?
Yes Yes Yes

Given Circles y =

a b c

j g or h j

Truth Value: True This statement has a truth value of true because for every Circle(y) there is at least one Square(x) that has the same color. Pg. 118 - 119 Discrete Mathematics With Applications

Problem 2 - Reversed Quantifiers

b. (2) There is a square x such that for all circles y, x and y have the same color. Statement: same color.

x D, y

such that circles(y) and square(x) have the

Is there at least one Square that has the same color as every circle?
No No No

Choose Square x =

Then, given Circle y =

e g h

a, b, and c a, b, and c a, b, and c

Truth Value: False This problem has a truth value of false due to the fact that there is no square(x) that has the same color as all squares (y).

Problem 2 - Solution Explanation

As you can see with the examples in problem 2 (part 1 and part 2), that once again the truth value of the statement has been changed by switching the quantifiers. The statement in part one is declaring that for every circle there is at least one square of the same color. The statement in part two is declaring that there is at least one triangle that has the same color as every square.