discrete test 2 Flashcards

1
Q

set

A

unordered collection of elements shown as xEs

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

sets are equal

A

if and only if they have the same elements number and order do not matter

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

cardinality |s|

A

the number of elements of the set (repetitions dont add anything

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

a is a subset of b iff (sideways u greater than thing

A

every element of a is in b

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

P(a)

A

the power set is the set of all subsets.

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

Cartesian products

A

A x B (write it you bastard)

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

union aUb

A

set of all elements in a or b and both aUb

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

intersection anb

A

just things that are in both a and b

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

symmetric difference(+)

A

denoted a (+) b

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

a - b

A

everything in a that isnt in b

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

a-

A

everything not in a

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

domain of a function

A

input set

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

range of a funciton

A

output set

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

one to one

A

if no output values get mapped to any input values

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

onto

A

if every element of the output is mapped to some input

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

bijection

A

both one to one and onto

17
Q

prove that it is a bijection

A
  1. prove one to one by setting equation equal to itself and canceling until x = x.
  2. prove that it is onto by solving for x separately in terms of y and plugging that in for x to get y = y
18
Q

floor

A

round down

19
Q

cieling

A

round up

20
Q

geometric sequence

A

terms in a sequence can be found by multiplying by common number r
an = a0(r^n)

21
Q

arithmetic sequences

A

terms in a sequence can be found by adding a common number d

an = a0 + (dn)

22
Q

does it satisfy the recurrence relation

A

plug it in

23
Q

find the sum of k as we go to n

A

n(n+1)/2

24
Q

modular arithematic

A

a|b iff ak = b for some k

25
Q

prime factorizations

A

make a tree of multiples down to primes

26
Q

find the gcd

A
  1. get the prime factorization

2. get the smallest powers of the ones that they both share

27
Q

find the lcm of each

A

take the larger power of each item. dont bother with repititons