Flashcards in NumThry Deck (27):

1

## set equivalence

### 1

2

## (in)finite set

### 2

3

## countable

###
3

defn, 7 examples

4

## cardinality

###
4

defn, 4 axioms

5

## cardinality of injective and surjective function

### 5

6

## power set of A

### 6

7

## uncountable

### 7

8

## totally ordered set

###
8

3 statements

9

## well ordered set

### 9

10

## a divides b

### 10

11

## prime number

###
11

defn, first up to 50, property

12

## prime number theorem

###
12

\pi(x)

13

## composite number

### 13

14

## divisibility rules

###
14

for 2,3,4,5,6,8,9,10

15

## relatively prime

### 15

16

## divisible by relatively prime numbers

### 16

17

## division algorithm

### 17

18

## fundamental theorem of arithmetic

### 18

19

## how to find gcd/lcm

### 19

20

## Euclidean algorithm

### 20

21

## corollary of Euclidean algorithm

### 21

22

## Diophantine equation

### 22

23

## Fermat's last theorem

### 23

24

## solving ax+by=c

### 24

25

## congruent modulo n

### 25

26

## congruence equation ax = b(mod n)

### 26

27