ABSTRACT MATHEMATICS

BASIC METHODIOLOGY AND HOW TO APPLY

?
when integer is 2k
EVEN
1 of 11
when integer is 2k+1
ODD
2 of 11
when integer is divisible by a number, i.e. 7
7k
3 of 11
Division theorem is to look for
REMAINDERS
4 of 11
when statement is false
COUNTER EXAMPLE
5 of 11
when statement is true
DIRECT PROOF
6 of 11
A proof by exhaustion
TRIAL AND ERROR
7 of 11
A proof by contradiction
WHEN IT DOES NOT MAKE SENSE
8 of 11
Truth tables
logic tables
9 of 11
Converse statement (which is not equal)
when 1 implies 2 ( leads to), converse means 2 implies 1
10 of 11
contrapositive statement
1 implies 2, contrapositive is NOT 2 implies NOT 1
11 of 11

Other cards in this set

Card 2

Front

when integer is 2k+1

Back

ODD

Card 3

Front

when integer is divisible by a number, i.e. 7

Back

Preview of the front of card 3

Card 4

Front

Division theorem is to look for

Back

Preview of the front of card 4

Card 5

Front

when statement is false

Back

Preview of the front of card 5
View more cards

Comments

No comments have yet been made

Similar Mathematics resources:

See all Mathematics resources »