Number Props Flashcards
- Only # = to it’s opposite
- Multiple of all #’s
- Not a factor of any # except itself
- An even number
- Neither negative nor positive
0 (Properties of Zero)
How to find “trailing zeroes” or number of 10s in a large #
Find the number of 2’s and 5’s you have. Whichever number is represented the least amount of times is the number of trailing zeros
odd #/odd# =
odd
even/odd =
even
odd x odd =
or
odd x odd x odd =
odd
odd - even =
or
even - odd =
odd
odd + even =
or
even + odd =
odd
even - even =
even
odd - odd =
even
odd + odd =
even
Odd Integers
Can be represented by (2n+1) or (2n-1)
where “n” is odd
Even Integers
Can be represented by (2n) where “n” is an interger Has an even units digit Divisible by 2
Prime #’s
2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101
Total # of factors for a given integer
Step 1: Determine prime factorization for integer
Step 2: Add 1 to the value of each exponent
Step 3: Multiply those values (i.e. “new exponents”), the product is your answer.
The # of unique prime factors does not change if…
the number in question is raised to any other positive integer power
LCM (Definition)
the smallest positive integer into which all of the numbers in question will divide into
or
the smallest positive multiple of all numbers in the set
Finding the LCM of a set of positive integers
Step 1: Prime factorize all integers in set.
Step 2: Of any repeated prime factors, only take the ones with the largest exponent.
Step 3: Take any non repeated prime factors.
Step 4: Multiply numbers from Step 2 & 3. ** If numbers in set do not share any prime factors, then multiply all numbers in the set.
Numbers divisible by 4
Last two digits of the number are divisible by 4 Any number that ends in “00” All multiples of 100
Numbers divisible by 8
Divide the last 3 digits of even number to determine Any number that ends in 000 All multiples of 1000
Numbers divisible by 11
The (sum of the odd-numbered digits) - (sum of the even-numbered digits) = number divisible by 11
Numbers divisible by 12
Number is divisible by BOTH 3 & 4
Finding the GCF
Step 1: Prime factorize each int. in the set. Put prime factors in exponent form
Step 2: Identify repeated prime factors
Step 3: Of the repeated prime factors, take only the one with the smallest exponent. Discard non-repeated prime factors
Step 4: Multiply numbers found in Step 3 ** If the set has no prime factors in common, the answer is 1.
Formula for division w/ a remainder
X = YQ + R
or

“4” Units Digit Pattern
4-6-4-6