Exam 2 Flashcards

1
Q

A sentence that contains a finite number of variables and becomes a statement when specific values are substituted for the variables

A

Predicate

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

The set of all values that may be substituted in place of the variable

A

Domain

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Ex:

{x £ D | P(x)}

A

Truth set

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Symbol inside down A denotes “for all” and is called:

A

Universal quantifier

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

A statement of the form “upsidedown Ax £ D, Q(x)”. Defined true if, and only if, Q(x) is true for every x in D.

A

Universal statement

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

A value for x for which Q(x) is false is called a _____________ to the universal statement

A

Counterexample

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

The technique used to show the truth of the universal statement:

1^2 >= 1, 2^2 >= 2, 3^2 >= 3, 4^2 >= 4

Hence “upside down x £ D, x^2 >= x” is true.

This is called:

A

method of exhaustion

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Consists of showing the truth of the predicate separately for each individual element of the domain.

A

Method of exhaustion

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

The symbol E denotes “there exists” and is called the:

A

Existential quantifier

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Is a statement of the form “Ex £ D such that Q(x).” It is defined as true if, and only if, Q(x) is true for at least one x in D.

A

Existential statement

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

A reasonable argument can be made that the most important form of statement in mathematics is:

A

Universal conditional statement

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

The negation of a universal statement (“all are”) is logically equivalent to an:

A

Existential statement

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Note that’s when we speak of __________________, we mean that the statements always have identical truth values no matter what predicates are substituted for the predicate symbols and no matter what sets are used for the domains of the predicate variables.

A

Logical equivalence for quantified statements

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

~(upside down Ax, if P(x) then Q(x)) is logically equivalent Ex such that P(x) and ~Q(x)

A

Negation of a universal conditional statement

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

The ____________ of a real number a is a real number b such that ab=1.

A

Reciprocal

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

~(upsidedown A x in D, exists y in E such that P(x,y)) is equivalent to (their exists x in D such that inside down Ay in E, ~P(x,y)

A

Negations of multiply-quantified statements

17
Q

An integer n is ______ if, and only if, n equals twice some integer.

Symbolically:
Their exists and integer k such that n = 2k

A

Even

18
Q

An integer n is ______ if, and only if, n equals twice some integer plus 1.

Symbolically:
Their exists and integer k such that n = 2k + 1

A

Odd

19
Q

An integer n is ______ if, and only if, n > 1 and for all positive integers r and s, if n = rs, then either r or a equals n.

Symbolically:
For all positive integers r and a, is n = rs then either r = 1 and s = n or r= n and s= 1

A

Prime

20
Q

An integer n is ______ if, and only if, n > 1 and for some integers r and s, with 1

A

Composite

21
Q

To show that every element of a set satisfies a certain property, suppose x is a particular but arbitrarily chosen element of the set, and show that x satisfies the property

A

Method of generalizing from generic particular

22
Q

If the existence of a certain kind of object is assumed or has been deduced then it can be given a name,as long as that name is not currently being used to denote something else

A

Existential instantiation

23
Q

Star the steps to write a proof:

A
  1. Copy statement of the theorem to be proved on your paper
  2. Clearly mark the beginning with “proof”
  3. Make you’re proof self-contained
  4. write you’re proof in complete, grammatically correct sentences
  5. Keep reader informed about status of each statement
  6. Give reason for each assertion in proof
  7. Display equations and inequalities
  8. Include “little words and phrases” that make logic of your arguments clear
24
Q

Common proof mistakes:

A
  1. Arguing from examples
  2. using the same letter to mean two different things
  3. Jumping to conclusions
  4. Circular reasoning
  5. Confusion between what is known and what is still to be shown
  6. Use of “any” rather than “some”
  7. Misuse of the word if
25
Q

A real number r is __________ if and only if, it can be expressed as a quotient of two integers with a nonzero denominator.

A

Rational

26
Q

The word rational contains the word ratio, which is another word for ____________. A rational number can be written as a ratio of integers

A

Quotient

27
Q

If neither of the two real numbers is zero, then their product is also not zero

A

Zero product property

28
Q

It follows that ________ is a quotient if two integers with a nonzero denominator and hence is a rational number

A

(m+n)/mn

29
Q

The notion of do is ability is the central concept of one of the most beautiful subjects in advanced mathematics: ____________, the study of properties of integers

A

Number theory

30
Q

If n and d are integers and d != 0 then

A

n is divisible by d if, and only if n equals d times some integer

31
Q

Instead of “n is divisible by d” we can say that:

A

n is a multiple of d
d is a factor of n
d is a divisor of n
d divided n

32
Q

One of the most useful properties of divisibility is that it is __________. If one number divides a second and the second divides a third, then the first number divides the third.

A

Transitive

33
Q

Given any real number x, the _________ of x, denoted [x], is defined as follows:

[x] = that unique integer n such that n <=x

A

Floor

34
Q

Given any real number x, the _________ of x, denoted [x], is defined as follows:

[x] = that unique integer n such that n -1 < x <=n

A

Ceiling

35
Q
  1. Suppose the statement to be proved is false. That is, suppose that the negation of the statement is true.
  2. Show that this supposition leads logically to a contradiction
  3. Conclude that the statement to be proved is true
A

Method of proof by contradiction

36
Q

[PBAC] meaning

A

Particular but arbitrary chosen

37
Q

What is the definition along rational numbers?

A

x = a/b and y = c/d and b != 0 and d != 0