1 Any integer (not a fraction) is divisible by 1 Definition: The number d divides the number n, if

there is a k such that:

2 The last digit is even (0,2,4,6,8)
128 Yes
129 No n=dk d/n=k
This rule can be repeated when needed:
99996 (9+9+9+9+6 = 42, then 4+2=6) Yes

3 The sum of the digits is divisible by 3 Divisibility properties

381 (3+8+1=12, and 12÷3 = 4) Yes
217 (2+1+7=10, and 10÷3 = 3 1/3) No
4 The last 2 digits are divisible by 4
1312 is (12÷4=3) Yes
7019 is not (19÷4=4 3/4) No
5 The last digit is 0 or 5
175 Yes
809 No
6 Is even and is divisible by 3 (it passes both
the 2 rule and 3 rule above)
114 (even, and 1+1+4=6 and 6÷3 = 2)
Yes
308 (even, but 3+0+8=11 and 11÷3 = 3
2/3) No
1) d/0
2) d/n
3) 1/n
4) (Reflexivity Property) n/n
5) n/1 => n=-1
6) (Transitivity Property) d/n & n/m = d/m
7) (Multiplication Property) d/n => ad/an
8) (Cancellation Property) ad/an & a=0 = d/n
9) (Linearity Property) d/n and d/m => d/an +bm
for all a & b
10) (Comparison Property) If d&n are positive
and d/n then d<n

7 Double the last digit and subtract it from a

number made by the other digits. The result
must be divisible by 7. (We can apply this
rule to that answer again)
672 (Double 2 is 4, 67-4=63, and 63÷7=9)
Yes
105 (Double 5 is 10, 10-10=0, and 0 is
divisible by 7) Yes
905 (Double 5 is 10, 90-10=80, and
80÷7=11 3/7) No
8 The last three digits are divisible by 8
109816 (816÷8=102) Yes
216302 (302÷8=37 3/4) No
9 The sum of the digits is divisible by 9
(Note: This rule can be repeated when
needed)
1629 (1+6+2+9=18, and again, 1+8=9) Yes
2013 (2+0+1+3=6) No
10 The number ends in 0
220 Yes
221 No
SETS
Definition 0.1 If a is one of the objects of the set
A, we say that a is an element of A or a belongs to
A. This condition is denoted by a ϵ A. If it is not
true that a is an element of A, we write a ∉ A.
Definition 0.2 A set A is a subset of a set B
(denoted A ⊆ 𝐵) if every element of A is an element
of B; that is, if x ϵ A, then x ϵ B. In particular,
every set is a subset of itself. If it is not true
that A is a subset of B, this condition is denoted
by A ⊈ B. Thus A ⊈ B if and only if there is an x in
A that is not in B.
Definition 0.3 If A and B are sets, then we say that
A equals B, written A = B, whenever, for any x, x ϵ
A if and only if x ϵ B. If A ⊆ B and A ≠ B, we write
A ⊂ B and say that A is a proper subset of B.

11 Add and subtract digits in an alternating Theorem 0.1 For sets A and B, A = B if and only if A
pattern (add digit, subtract next digit, add is a subset of B and B is a subset of A; that is,
next digit, etc). Then check if that answer is A=B if and only if A ⊆ B and B ⊆ A.
divisible by 11.
1364 (+1−3+6−4 = 0) Yes
913 (+9−1+3 = 11) Yes Definition 0.4 The empty set, denoted by ∅ or by {},
3729 (+3−7+2−9 = −11) Yes is the set which contains no elements. The universal
987 (+9−8+7 = 8) No set 𝕌 is a set which has the property that all sets
under consideration are subsets of it.
12 The number is divisible by both 3 and 4 (it
passes both the 3 rule and 4 rule above)
648 Definition 0.5 The intersection of the sets A and B
(By 3? 6+4+8=18 and 18÷3=6 Yes) is the set of all elements that are in both A and B.
(By 4? 48÷4=12 Yes) The intersection of sets A and B is denoted A∩ B.
Both pass, so Yes
More succinctly, A ∩ B = {x : x ϵ A and x ϵ B}.
524
(By 3? 5+2+4=11, 11÷3= 3 2/3 No) Definition 0.6 The union of sets A and B is the set
(Don't need to check by 4) No of all elements that are in either A or B. The union
of sets A and B is denoted A ∪ B. Equivalently, A ∪
13 Add four times the last digit to the remaining
leading truncated number. If the result B = {x : x ϵ A or x ϵ B}.
is divisible by 13, then so was the first
number. Definition 0.7 Let A and B be sets. The difference
273 (27+3(4) = 39/13 = 3 Yes) between A and B denoted by A – B, is the set of all
elements which are in A but are not in B.
15 There is no one single rule
for divisibility by 15, but every number that Equivalently, A – B = {x : x ϵ A and x ∉ B}. The
is divisible by 15 must be divisible by the symmetric difference of A and B, denoted by A 𝛥 B,
factors of 15, namely 3 and 5. is the set (A – B) ∪ (B – A).
17 if you multiply the last digit by 5 and
Definition 0.8 The complement of a set A, denoted by
subtract that from the rest. If that result is
divisible by 17, then your number is divisible A’, is the set of all elements of the universe which
by 17. are not in A. Hence, A’ = 𝕌 – A = {x : x ϵ 𝕌 and x ∉
986 (98-5(6) = 68/17 = 6 Yes) A}.
19 Add 2 times the last digit to the remaining Definition 0.9 The power set of a set A, denoted by
number. Repeat the step . If the result is
divisible by 19, the original number is also P(A), is the set consisting of all subsets of A.
divisible by 19
11343 Definition 0.10 Let a and b be elements of a set.
1134+3(2)= 1140 Let (a, b) be the set {a,{a,b}}. The object (a,b) is
1140 called an ordered pair with first component a and
114+0(2)= 114
114 second component b. The Cartesian product of A and
11+4(2)= 19 B, denoted by A x B, is the set {(a,b) : a ϵ A and
Yes b ϵ B}. The set A x B consists of all ordered pairs
having the first component an element of A and the
25 A number is divisible by 25 if it ends with
second component an element of B.
00, 25, 50, or 75.
125 A number is divisible by 125, if its last three
figures are zeros or a multiple of 125.
Definition 0.11 A relation R between sets A and B is
a subset of A x B. If (a,b) ϵ R, we sometimes denote
this by aRb and say that a is related to b; or that
a is related to b by means of R.

Definition 0.12 Let R ⊆ A x B be a relation on A x

B. Then the relation 𝑅 −1 on B x A is defined by 𝑅 −1 =
{(b,a) : (a,b) ϵ R}. That is, (b,a) ϵ 𝑅 −1 if and
only if (a,b) ϵ R; or, equivalently, b𝑅 −1 a if and
only if aRb.

Definition 0.13 Let R ⊆ A x B be a relation on A x B

and S ⊆ B x C be a relation on B x C. The
composition of S and R is the relation T ⊆ A x C
defined by T = {(a,c) : there is an element b such
that (a,b) ϵ R and (b,c) ϵ S}. This set is denoted
by T = S ∘ R.

Definition 0.14 A relation R on A x A is reflexive

if for all a in A, (a,a) is in R. R is symmetric if
for all a and b in A, (a,b) in R implies that (b,a)
is in R. R is transitive if for all a, b, and c in
A, whenever (a,b) and (b,c) are in R, (a,c) is in R.
R is an antisymmetric if for all a and b in A,
whenever (a,b) and (b,a) are in R, a=b.