Term
|
Definition
a whole number that has exactly two different whole number factors
e.g. 1 and itself |
|
|
Term
|
Definition
| a whole number greater than one that has more than two factors |
|
|
Term
|
Definition
| If mn = p, then m and n are factors of p |
|
|
Term
|
Definition
| p is a multiple of m if mn = p |
|
|
Term
|
Definition
| If mn = p and m is not zero, then m is a divisor of p |
|
|
Term
|
Definition
| p is divisible by m is p/m is a whole number |
|
|
Term
|
Definition
| p is the product of m and n if p = mn |
|
|
Term
|
Definition
a number that is the sum of its factors other than itself
e.g. 6: 1 + 2 + 3 |
|
|
Term
| unique factorization theorem / fundamental theorem of arithmetic |
|
Definition
| the fact that every whole number greater than 1 is either prime or can be expressed as the product of prime numbers uniquely (except possibly for order) |
|
|
Term
|
Definition
| a diagram that organizes the factors of a composite number into prime factors |
|
|
Term
|
Definition
a number written as a product of prime numbers
e.g. 32: 2^5 |
|
|
Term
|
Definition
if 2 is a factor of the ones digit
if the last digit is 0, 2, 4, 6, or 8 |
|
|
Term
|
Definition
if 5 is a factor of the ones digit
if the last digit is a 0 or a 5 |
|
|
Term
|
Definition
| if the sum of the digits of the whole number is divisible by 3 |
|
|
Term
|
Definition
if 4 is a factor of the number formed by the final two digits
if the last two digits are divisible by 4 |
|
|
Term
| general divisibility tests to test for composite factors m*n |
|
Definition
if a number p is divisible by m and also by n, and if m and n are relatively prime, then the number p is divisible by the number m*n
e.g. divisibility by 6: if divisible by 2 and 3 |
|
|
Term
|
Definition
| when testing n, need only check for factors less than or equal to sqrt(n) |
|
|
