Number Properties Flashcards
Basic formula for odd/even numbers
Even integers can be represented by 2n, where n is an integer, and odd integers can be represented by either 2n – 1, or by 2n + 1, where n is an integer.
Result when adding/subtracting odd/even numbers
When adding or subtracting two numbers, if both numbers are even, or both numbers are odd, the result will be even. Otherwise, if one is even and one odd, the result will be odd.
Result when multiplying odd/even numbers
- even x any number [including multiple numbers] = even
- odd x odd = odd. with multiple numbers, if all odd, product will be odd
Result when dividing odd/even numbers
- even / odd = even
- odd / odd = odd
- even / even = even or odd
Steps to find all positive factors of a number
Step 1: Prime factorization of number.
Step 2: Add 1 to the value of each exponent
Step 3: Multiply the values
example: 12000
prime factorization = 2^5 * 3^1 * 5^3
Add one = (5+1)(1+2)(3+1)
Multiply=634
Factors = 48
Unique prime factors when a number is raised to a power
If some number x has y unique prime factors, then x (where n is a positive integer) will have the same y unique prime factors.
How to find least common multiple of set of numbers
- Find the prime factorization of each number
- Of repeated prime factors [i.e. same base] take only the prime factor with the largest power.
- Minus the repeated PFs, multiply them
LCM of two numbers that do not share prime factors
If two numbers X and Y do not share prime factors, the LCM is XY. If they do, it is some number less than XY.
How to find greatest common factor of set of numbers
- Find the prime factorization of each number
- Identify repeated prime factors amongst the numbers
- Of any repeated prime factors, take only those with smallest exponent. If no exponent, use ‘1’.
- Multiple the numbers to find the GCF
Relationship between LCM and GCF
If the LCM of x and y is p and the GCF of x and y is q, then xy = pq.
That is, xy = LCM(x, y) × GCF(x, y).
How to find # of unique prime number in set of numbers
The LCM will provide the number of unique prime numbers in a set
How to use LCM for finding coinciding rate or times
The LCM can be used to determine when two processes that occur at differing rates or times will coincide.
For example, let’s say that blinking light L flashes once every 32 seconds, and blinking light M flashes once every 12 seconds. If both lights flash together at 8:00:00 PM, when will be the next time the lights will flash together again?
The two lights will next flash together at the LCM of 32 seconds and 12 seconds.
The product of any n consecutive integers will always be divisible by n!.
The product of any n consecutive integers will always be divisible by n!.
Also, the product of any n consecutive integers must be divisible by all of the factors of n!.
The product of n consecutive even integers will always be divisible by 8
The product of n consecutive even integers will always be divisible by 8
For example, 10 × 12 = 120, and 120 is divisible by 8, because 120/8=15
Formula for dividends, divisors, quotients, remainders
If an integer x is the dividend (numerator), an integer y is the divisor (denominator), Q is the integer quotient of the division, and r is the nonnegative remainder of the division, then:
x/y = q + r/y
What are potential ranges for remainders?
A remainder must be a non-negative integer that is less than the divisor.
Example: If a and b are positive integers, what is the difference between the largest possible remainder and the smallest possible remainder when a is divided by b?
1) a = 9x, where x is a positive integer.
2) b=7
Statement 2 alone is sufficient. Since remainder must be less than divisor, the range of the remainder is 6-0= 6.
What are trailing zeros?
In whole numbers, trailing zeros are created by (5 × 2) pairs. Each (5 × 2) pair creates one trailing zero. Thus, the number of trailing zeros of a number is the number of (5 × 2) pairs in the prime factorization of that number.
Example: ⇒ 5,200 can be expressed as 52 × 100 = 52 × 10^2 and has 2 trailing zeros
How to find number of digits in equation? Example, how many numbers in 25^10 * 8^6
Step 1: Prime factorize the number
Step 2: Count the number of (5 x 2) pairs. Each pair contributes to one trailing zero.
Step 3: Collect the number of unpaired 5s or 2s, along with other nonzero prime factors (if any) and multiply them together. Count the number of digits in this product.
Step 4: : Sum the number of digits from steps 2 and 3.
What are leading zeros?
In fractions, we’re going to look at what we’ll refer to as “leading zeros.” Leading zeros are the zeros that occur to the right of the decimal point but before the first nonzero number.
Ex:
.4311 has no leading zeros
.01 has one leading zero
.001 has two leading zeros
when denominator is not a perfect power of ten: to find number of leading zeros
If X is an integer with k digits, and if X is not a perfect power of 10, then 1/X will have K-1 leading zeros.
A perfect power of ten is an integer where the prime factorization contains equal amounts of 5s and 2s.
when denominator is a perfect power of ten: to find number of leading zeros
If X is an integer with k digits, and if X is a perfect power of 10, then 1/X will have K-2 leading zeros
Steps for finding number of primes in a factorial
To determine the (largest) number of a prime number x that divides into y!, we perform the following steps:
- Divide y by X^1, X^2, X^3.. etc until the quotient is 0.
- Add the quotients from the previous divisions; that sum represents the number of prime number x in the prime factorization of y!. Ignore any remainders
If denominator is not a prime number but a product of primes, break the number into prime factorials and follow the above steps with the largest prime factor. [Example, if the denominator is 15^n, break into 5^n and 3^n and find the number of times 5^n goes into the factorial]