Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

Discrete Math 1 > Unit 2 > Flashcards

Unit 2 Flashcards

1
Q

A blank is a collection of objects

A

set

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

The objects in a set are called blank

A

elements

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

The blank definition of a set is a list of the elements enclosed in curly braces with the individual elements separated by commas. The following definition of the set A uses roster notation:

A = { 2, 4, 6, 10 }

A

roster notation

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

The symbol blank is used to indicate that an element is in a set, as in 2 ∈ A.

A

∈

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

The symbol blank indicates that an element is not in a set, as in 5 ∉ A.

A

∉

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

The set with no elements is called the blank and is denoted by the symbol ∅

A

empty set

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

The empty set is sometimes referred to as the blank and can also be denoted by {}. Because the empty set has no elements, for any element a, a ∉ ∅ is true.

A

null set

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

A blank has a finite number of elements.

A

finite set

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

An blank has an infinite number of elements.

A

infinite set

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

The blank of a finite set A, denoted by |A|, is the number of elements in A.

A

cardinality

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

Two sets are blank if they have exactly the same elements

A

equal

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

The set of natural numbers: All integers greater than or equal to 0.

A

N

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

The set of all integers.

A

Z

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

The set of rational numbers: All real numbers that can be expressed as a/b, where a and b are integers and b ≠ 0.

A

Q

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

The set of real numbers

A

R

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

The superscript blank is used to indicate the positive elements of a particular set. For example, the set R+ is the set of all positive real numbers, and Z+ is the set of all positive integers.

A

+

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

The superscript blank is used to indicate the negative elements of a particular set. For example, the set R- is the set of all negative real numbers, and Z- is the set of all negative integers.

A

-

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

In blank, a set is defined by specifying that the set includes all elements in a larger set that also satisfy certain conditions. The notation would look like:

A = { x ∈ S : P(x) }

S is the larger set from which the elements in A are taken. P(x) is some condition for membership in A. The colon symbol “:” is read “such that”. The description for A above would read: “all x in S such that P(x)”.

A

set builder notation

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

The blank, usually denoted by the variable U, is a set that contains all elements mentioned in a particular context.

A

universal set

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

Sets are often represented pictorially with blank. A rectangle is used to denote the universal set U, and oval shapes are used to denote sets within U.

A

Venn diagrams

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

If every element in A is also an element of B, then A is a blank of B, denoted as A ⊆ B If there is an element of A that is not an element of B, then A is not a subset of B, denoted as A ⊈ B. If the universal set is U, then for every set A:

∅ ⊆ A ⊆ U

A

subset

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

Two sets are blank if and only if each is a subset of the other:

A = B if and only if A ⊆ B and B ⊆ A

A

equal

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

If A ⊆ B and there is an element of B that is not an element of A (i.e., A ≠ B), then A is a blank of B, denoted as A ⊂ B.

A

proper subset

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

The blank is a subset of every set.

A

empty set

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

Every set is a blank of itself.

A

subset

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

Set A is a subset of B, denoted blank if every element in A is also in B.

A

A⊆B

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

Set A is a proper subset of set B if it is a subset of B and is not equal to B. It is denoted blank

A

A⊂B

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

Sets can contain sets as blank.

A

elements

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

The cardinality of a set within a set is blank. That is, each set counts as a single element.

A

1

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

If S = the set of all sets that are not members of itself, then is S a member of itself?

A

If S is in S then it cannot be a member of S by definition of being in S.

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

The blank of a set A, denoted P(A), is the set of all subsets of A. For example, if A = { 1, 2, 3 }, then:

P(A) = { ∅, { 1 }, { 2 }, { 3 }, { 1, 2 }, { 1, 3 }, { 2, 3 }, { 1, 2, 3 } }

A

power set

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

Since |A| = 3, the cardinality of the power set of blank

A

8

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

Let A be a finite set of cardinality n. Then the cardinality of the power set of blank

A

A is 2^n, or |P(A)|=2^n.

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

The power set of a set A is denoted blank

A

P(A)

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

The power set of any set A is the set of all blank, including the empty set and A itself.

A

subsets of A

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

The blank is an element of every power set.

A

empty set

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

The blank of the power set of a set of size n is 2^n

A

cardinality

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

Let A and B be sets. The intersection of A and B, denoted blank and read “A intersect B”, is the set of all elements that are elements of both A and B.

A

A ∩ B

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

A = { x ∈ Z: x is an integer multiple of 2 }

B = { x ∈ Z: x is an integer multiple of 3 }

A ∩ B = blank

A

{ x ∈ Z: x is an integer multiple of 6 }

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

The union of two sets, A and B, denoted blank and read “A union B”, is the set of all elements that are elements of A or B.

A

A ∪ B

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

A = { x: student x received an A on midterm 1 }

B = { x: student x received an A on midterm 2 }

Then

A ∪ B = blank

= { x: student x is eligible to skip the final exam }

A

{ x: student x received an A on midterm 1 or midterm 2 }

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

The blank of two sets: A∪B

A

union

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

The blank of two sets: A∩B

A

intersection

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

The union and intersection operations are blank. That is, A∪B=B∪A and A∩B=B∩A

A

commutative

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

Set operations can be blank to define even more sets.

A

combined

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

The expression A ∩ B ∩ C ∩ D is blank because the order in which intersection operations are applied does not matter.

A

well-defined

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

Similarly, the expression A ∪ B ∪ C ∪ D is also blank and defines the set consisting of those elements that are elements of at least one of the four sets: A, B, C, and D.

A

well-defined

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

The intersection and union operators can be combined in sequence: A∩(B∪C) or A∪(B∩C). Make sure to complete operations blank first.

A

inside parentheses

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

The blank between two sets A and B, denoted A - B, is the set of elements that are in A but not in B.

A

difference

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

The difference operation is not blank since it is not necessarily the case that A - B = B - A

A

commutative

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

The symmetric difference between two sets, A and B, denoted blank, is the set of elements that are a member of exactly one of A and B, but not both. An alternative definition of the symmetric difference operation is:

A ⊕ B = ( A - B ) ∪ ( B - A )

A

A ⊕ B

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

The symmetric difference is blank. A - B = B - A

A

commutative

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

The blank of a set A, denoted Ä, is the set of all elements in U that are not elements of A. An alternative definition of Ä is U - A. For example, let U = Z, and define:

A = { x ∈ Z: x is odd }

A

complement

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

x ∈ A ∩ B ↔ blank

A

(x ∈ A) ∧ (x ∈ B)

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

x ∈ A ∪ B ↔ blank

A

(x ∈ A) ∨ (x ∈ B)

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

x ∈ Å ↔ blank

A

¬(x ∈ A)

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

x ∈ ∅ ↔ blank

A

F

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

x ∈ U ↔ blank

A

T

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

A blank is an equation involving sets that is true regardless of the contents of the sets in the expression. The idea is similar to an equivalence in logic which holds regardless of the truth values of the individual variable in the expressions.

A

set identity

60
Q

A ∪ A = A

A

Idempotent laws

61
Q

A ∩ A = A

A

Idempotent laws

62
Q

To say A union A or to say A intersect A is redundant. In both cases, we just have A.

A

Idempotent laws

63
Q

A ∪ (A ∩ B) = A

A

Absorption laws

64
Q

A ∩ (A ∪ B) = A

A

Absorption laws

65
Q

A union any subset of A is just A.

A

Absorption laws

66
Q

(A ∪ B) ∪ C = A ∪ (B ∪ C)

A

Associative laws

67
Q

(A ∩ B) ∩ C = A ∩ (B ∩ C)

A

Associative laws

68
Q

Only applies when the operators are all ∪ or ∩. Rearranging the parentheses in an expression will not change its value.

A

Associative laws

69
Q

A ∪ B = B ∪ A

A

Commutative laws

70
Q

Rearranging the operator within a single union or intersection will not change its truth value.

A

Commutative laws

71
Q

A ∩ B = B ∩ A

A

Commutative laws

72
Q

A ∩ Å = ∅
~U= ∅

A

Complement laws

73
Q

A ∪ Å = U
∅ = U

A

Complement laws

74
Q

It cannot be true that an element is in both A and the complement of A. Similarly, all elements in U are either in A or its complement.

A

Complement laws

75
Q

A ∪ B = A ∩ B (all superscript–)

A

De Morgan’s laws

76
Q

A ∩ B = A ∪ B (all superscript)

A

De Morgan’s laws

77
Q

If the complement operation is distributed in a parenthesized expression with either the union or intersection operation, change the union operation to intersection operation, and vice versa.

A

De Morgan’s laws

78
Q

A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C)

A

Distributive laws

79
Q

A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C)

A

Distributive laws

80
Q

This law is similar to the distributive law of multiplication over addition of the real numbers. For example, 5(x+y) = 5x + 5y

A

Distributive laws

81
Q

A ∩ ∅ = ∅

A

Domination laws

82
Q

A ∪ U = U

A

Domination laws

83
Q

The intersection of a set with the empty set is always empty set. The union of a set A with the universal set is always the universal set.

A

Domination laws

84
Q

The complement of the complement of a set is the set itself.

A

Double Complement law

85
Q

A ∪ ∅ = A

A

Identity laws

86
Q

A ∩ U = A

A

Identity laws

87
Q

The union of A with itself can be reduced to just A. The intersection of A with itself can be reduced to just A

A

Identity laws

88
Q

To blank a set identity, work with one side of the equation and manipulate it by using the identity laws until it matches the other side of the equation.

A

prove

89
Q

An blank of items is written (x, y)

A

ordered pair

90
Q

The first blank of the ordered pair (x, y) is x and the second entry is y.

A

entry

91
Q

For two sets, A and B, the blank of A and B, denoted A x B, is the set of all ordered pairs in which the first entry is in A and the second entry is in B. That is:

A x B = { (a, b) : a ∈ A and b ∈ B }

Since the order of the elements in a pair is significant, A x B will not be the same as B x A, unless A = B. If A and B are finite sets, then |A x B| = |A|⋅|B|.

A

Cartesian product

92
Q

A = { 1, 2, 3 }
B = { x, y }

(1, y) ∈ A x B

True or False

A

True

93
Q

An ordered list of three items is called an blank and is denoted (x, y, z).

A

ordered triple

94
Q

For n ≥ 4, an ordered list of n items is called an blank. For example, (w, x, y, z) is an ordered 4-tuple and (u, w, x, y, z) is an ordered 5-tuple.

A

ordered n-tuple

95
Q

The blank of three sets contains ordered triples, and for n ≥ 4, the blank of n sets contains n-tuples. The blank of n sets, A1, A2, …, An is

A1 x A2 x … x An = { (a1, a2, … , an) : ai ∈ Ai for all i such that 1 ≤ i ≤ n }

For example, define A = {a, b}, B = {1, 2}, C = {x, y}, and D = {α, β}. Then the 4-tuples (a, 1, y, β) and (b, 1, x, α) are both examples of elements in the set A × B × C × D.

A

Cartesian product

96
Q

The Cartesian product of a set A with itself can be denoted as A × A or blank More generally:
For example, if A = {0, 1}, then An is the set of all ordered n-tuples whose entries are bits (0 or 1). For n = 3:

{0, 1}^3 = { (0, 0, 0), (0, 0, 1), (0, 1, 0), (0, 1, 1), (1, 0, 0), (1, 0, 1), (1, 1, 0), (1, 1, 1) }

A

A^2.

97
Q

The product A1×A2… ×An = {a1∈A1, a2∈A2, …, an∈An}. The elements in this set are called blank.

A

n-tuples

98
Q

The number of blank in A×B is the number of elements in A multiplied by the number of elements in B. That is, |A×B| = |A|×|B|

A

elements

99
Q

The product A×B×C= {(a,b,c)|a∈A b∈B, c∈C}. The elements in this set are called blank.

A

ordered triples

100
Q

If s and t are two strings, then the blank of s and t (denoted st) is a longer string obtained by putting s and t together. If s = 010 and t = 11, then st = 01011. It is also possible to concatenate a string and a single symbol: t0 = 110. Concatenating any string x with the empty string gives back x: xλ = x.

A

concatenation

101
Q

Two sets, A and B, are said to be blank if their intersection is empty (A ∩ B = ∅)

A

disjoint

102
Q

A sequence of sets, A1, A2, …, An, is blank if every pair of distinct sets in the sequence is disjoint (i.e., Ai ∩ Aj = ∅ for any i and j in the range from 1 through n where i ≠ j).

A

pairwise disjoint

103
Q

A blank of a non-empty set A is a collection of non-empty subsets of A such that each element of A is in exactly one of the subsets. A1, A2, …,An is a partition for a non-empty set A if all of the following conditions hold:

For all i, Ai ⊆ A.
For all i, Ai ≠ ∅
A1, A2, …,An are pairwise disjoint.
A = A1 ∪ A2 ∪ … ∪ An

A

partition

104
Q

A blank of a non-empty set A is a collection of nonempty sets whose union is all of A and each pair in the collection is pairwise disjoint. Hint: Think of a partition as chopping the set up into disjoint pieces.

A

partition

105
Q

A blank f that maps elements of a set X to elements of a set Y, is a subset of X × Y such that for every x ∈ X, there is exactly one y ∈ Y for which (x, y) ∈ f.

A

function

106
Q

f: X → Y is the notation to express the fact that f is a function from X to Y. The set X is called the blank of f, and the set Y is the blank of f. The fact that f maps x to y (or (x, y) ∈ f) can also be denoted as f(x) = y.

A

domain
target

107
Q

In an blank for a function f, the elements of the domain X are listed on the left and the elements of the target Y are listed on the right. There is an arrow from x ∈ X to y ∈ Y if and only if (x, y) ∈ f.

A

arrow diagram

108
Q

For function f: X → Y, an element y is in the blank of f if and only if there is an x ∈ X such that (x, y) ∈ f. Expressed in set notation:

Range of f = { y: (x, y) ∈ f, for some x ∈ X }

The range of f is a subset of the target but the range is not necessarily equal to the target.

A

range

109
Q

blank are functions whose pairing relationship is defined by an algebraic set of operations. For example, f : R → R where f(x) = x2 -2x + 3.

A

Algebraic functions

110
Q

In an arrow diagram, domain elements are on the left, target elements on the right. An arrow for each domain element points to a target element.

In an arrow diagram for f, each element in the domain has exactly blank leaving it. If not, then it is not a function

A

one arrow

111
Q

Two functions, f and g, are blank if f and g have the same domain and target, and f(x) = g(x) for every element x in the domain. The notation f = g is used to denote the fact that functions f and g are equal.

A

equal

112
Q

The blank maps a real number to the nearest integer in the downward direction.

A

floor function

113
Q

The blank rounds a real number to the nearest integer in the upward direction.

A

ceiling function

114
Q

A function f: X → A is blank or one-to-one if x1 ≠ x2 implies that f(x1) ≠ f(x2). That is, f maps different elements in X to different elements in A.

A

injective

115
Q

A function f: X → A is blank or onto if the range of f is equal to the target A. That is, for every a ∈ A, there is an x ∈ X such that f(x) = a.

A

surjective

116
Q

A function is blank if it is both injective and surjective. A bijective function is called a bijection. A bijection is also called a one-to-one correspondence.

A

bijective

117
Q

A function f: X → Y is blank if there exists a function g with domain Y and range X with the property
f(x) = y ⇔ g(y) = x.

A

invertible

118
Q

If a function f: X → Y is a bijection, then the blank of f is obtained by exchanging the first and second entries in each pair in f. The inverse of f is denoted by f-1:

f-1 = { (y, x) : (x, y) ∈ f }.

A

inverse

119
Q

Some functions do not have an inverse. A function f: X → Y has an inverse if and only if reversing each pair in f results in a blank from Y to X. f-1 is a well-defined function if every element in Y is mapped to exactly one element in X.

A

well-defined function

120
Q

A function f has an inverse if and only if f is a blank.

A

bijection

121
Q

The inverse of a bijection f can also be expressed in function notation. If f is a bijection from X to Y, then for every x ∈ X and y ∈ Y,

f(x) = y if and only if blank

Therefore, the value of f^-1(y) is the unique element x ∈ X such that f(x) = y. If f-1 is the inverse of function f, then for every element x ∈ X, f-1(f(x)) = x.

A

f^-1(y) = x.

122
Q

If a function with an inverse has a finite domain, you can find the inverse by swapping the order in all the blank.

A

ordered pairs

123
Q

Inverses for functions on infinite domains can be solved blank.

A

algebraically

124
Q

To algebraically solve for an inverse, use the following algorithm:

.

A

1) Replace f(x)
with y
2)Interchange x
and y
3. Solve for y
4.Replace y
with f^-1(x)

125
Q

The process of applying a function to the result of another function is called blank.

A

composition

126
Q

f and g are two functions, where f: X → Y and g: Y → Z. The blank, denoted g ο f, is the function (g ο f): X → Z, such that for all x ∈ X, (g ο f)(x) = g(f(x)).

A

composition of g with f

127
Q

The blank always maps a set onto itself and maps every element onto itself.

The blank on A, denoted IA: A → A, is defined as IA(a) = a, for all a ∈ A.

A

identity function

128
Q

If a function f from A to B has an blank, then f composed with its inverse is the identity function. If f(a) = b, then f-1(b) = a, and (f-1 ο f)(a) = f-1(f(a)) = f-1(b) = a.

Let f: A → B be a bijection. Then f-1 ο f = IA and f ο f-1 = IB.

A

inverse

129
Q

The exponential function expb:R → R+ is defined as: blank
where b is a positive real number and b ≠ 1.

A

expb(x) = b^x

130
Q

The parameter b is called the blank in the expression bx.

A

base of the exponent

131
Q

The input x to the function bx is called the blank.

A

exponent

132
Q

blank exponents are combined by multiplying the exponents.

A

Nested

133
Q

When you multiply powers with the same base, add the exponents

A

Product of powers rule

134
Q

When the power is raised to a power, multiply exponents.

A

Power rule I

135
Q

When you divide powers with the same base, subtract the exponents

A

Quotient rule

136
Q

When you raise a product to a power, raise each factor with a power

A

Power of a product rule

137
Q

The exponential function is one-to-one and onto, and therefore has an blank.

A

inverse

138
Q

The logarithm function is the inverse of the exponential function. For real number b > 0 and b ≠ 1, logb:R+ → R is defined as: blank
The parameter b is called the base of the logarithm in the expression logb y.

A

b^x = y == logby = x

139
Q

A function f is said to be blank if whenever x1 < x2, then f(x1) < f(x2

A

strictly increasing

140
Q

A function f is said to be blank if whenever x1 < x2, then f(x1) > f(x2).

A

strictly decreasing

141
Q

The inverse function to the exponential is the blank.

A

logarithmic function

142
Q

The log of a product is equal to the sum of the log of the first base and the log of the second base

A

Log product rule

143
Q

The log of a quotient is equal to the difference of the logs of the numerator and denominator

A

Log quotient rule

144
Q

The log of a power is equal to the power times the log of the base

A

Log power rule

145
Q

The log of a new base is the log of the new base divided by the log of the old base in the new base

A

Change of base formula

146
Q

The exponential and the logarithmic function are both blank functions.

A

strictly increasing

Discrete Math 1 (7 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions