Maths 2F Flashcards

(38 cards)

1
Q

The power set of X denoted P(X) or 2<strong>x</strong> is the set whose?

A

Members are the subsets of X.

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

The union of A and B, denoted A ∪ B, is the set of?

A

All objects belonging to at least one of the sets.

A ∪ B = { x : x ∈ A or x ∈ B }

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

The intersection of A and B, denoted A ∩ B, is the set of objects belonging to?

A

Both of the sets

A ∩ B = { x : x ∈ A and x ∈ B }

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

The complement or relative complement of B in A, denoted A\B or A−B, is the?

A

Set of members of A which do not belong to B

A \ B = { x ∈ A : x ∈/ B }

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

Let X, Y and Z be sets, and let f: X → Y and g: Y → Z be functions. Then the composite

g ◦ f = gf : X → Z

A

Is the function given by

g ◦ f(x) = g f(x)

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

For any set X there is an identity function…

A

Id = IdX : X → X given by IdX (x) = x

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

A function f : X → Y is injective or an injection or one-to- one if?

A

f(x1) = f(x2) ⇒ x1 = x2

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

A function f : X → Y is surjective or a surjection or onto if for every…

A

y ∈ Y there exists x ∈ X such that f(x) = y

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

A function f : X → Y is bijective or a bijection or a one-to-one correspondence if?

A

It is both injective and surjective

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

Let f : X → Y be a function. If A is a subset of X then the image of A is the?

A

Subset f(A) of Y given by

f(A) = {f(a) : a ∈ A}

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

If B is a subset of Y then the inverse image or preimage of B is?

A

The subset f−1(B) of X given by

f−1(B) = { x ∈ X : f(x) ∈ B }

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

Let X be a set. If there is a bijection n → X for some nonnegative integer n then?

A

X is finite

Otherwise X is infinite

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

A set E is countably infinite if?

A

There is a bijection from ℕ to E

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

A set E is uncountable if there is?

A

No injective function from E to ℕ.

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

If f : X → Y is injective and Y is countable then X is?

A

Countable

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

If f : X → Y is surjective and X is countable then?

A

Y is countable

17
Q

Let X be any set. Is P(X) to X countable or uncountable?

A

Then there is no injective function from P(X) to X.

In particular P(ℕ) is uncountable.

18
Q

Is the set of real numbers countable or uncountable?

19
Q

Let ∼ be a relation on a set X

x ∼ x for all x ∈ X is?

A

One says then that ∼ is relexive

20
Q

Let ∼ be a relation on a set X

If x ∼ y then y ∼ x is?

A

One says then that ∼ is symmmetric

21
Q

Let ∼ be a relation on a set X

If x ∼ y and y ∼ z then x ∼ z is?

A

One says then that ∼ is transitive

22
Q

Let ∼ be an equivalence relation on a set X, and let x be a member of X. Then the equivalence class of x is the set?

A

[x] = { y ∈ X : x ∼ y }

23
Q

Let d, a, b, m, n be integers such that d | a and d | b. Then?

A

d | (ma + nb)

24
Q

Let a and b be integers not both zero. Then there are integers m and n such that?

A

gcd(a, b) = ma + nb

25
Two integers are ***coprime*** or ***relatively prime*** if?
Their greatest common divisor is 1 Integers m,n such that ma + nb = 1
26
A ***prime number*** is an integer p \> 1 with?
No positive integer divisors other than 1 and p
27
The ***least common multiple*** of two integers a and b is the?
Smallest natural number m such that m divides a and m divides b
28
One says that a and b are ***congruent modulo*** m a ≡ b mod m if?
if a − b is divisible by m
29
If a ̸≡ b mod m then?
a − b is not divisible by m
30
a ≡ b mod m ⇒?
a = b + km for some integer k
31
f a ≡ b mod m and c ≡ d mod m, then?
a + c ≡ b + d mod m a − c ≡ b − d mod m ac ≡ bd mod m
32
Let m,a ∈ Z, m \> 0. Then gcd(a,m) = 1 if and only if there is?
An integer r such that ra ≡ 1 mod m
33
Let a ∈ Z, m ∈ N. An integer *r* such that *ar ≡ 1 mod m* is called?
An inverse for a modulo m
34
Let X be a set. A ***permutation*** of X is a?
***Bijective*** function from X to X
35
The set of permutations of X is denoted?
Perm(X)
36
An equivlence relation is thus if and only if?
It is reflexive, symmetric and transative
37
State a formula relating the cardinalities of A,B, A ∪ B and A ∩ B
|A ∪ B| = |A| + |B| - | A ∩ B | |A x B| = |A| x |B|
38
The Pigeonhole principle states that there can only be an injection...
A x B → A ∪ B if |A x B| ≤ |A ∪ B|