Understanding factors and multiples is essential for mastering the basics of number theory, which appears frequently in various mathematical contexts. These concepts are foundational in solving problems related to divisibility, prime numbers, and least common multiples, among others.
Consider the number 120. Which of the following numbers are factors of 120?
I. 5
II. 6
III. 7
A. I and II only
B. I and III only
C. II and III only
D. None of the above
Factors are numbers that divide into another number completely without leaving a remainder. Multiples, on the other hand, are products obtained when a number is multiplied by an integer.
For the number 120:
Thus, the correct answer is B. I and III only.
Questions might ask you to identify the LCM or GCD of a set of numbers, or determine if a number is prime or composite based on its factors.
We recommend the following when it comes to memory work in this area:
What is the greatest common divisor of and ?
A. 2
B. 3
C. 4
D. 6
The answer is C. As noted in the Definitions section, both divisor and factor refer to a number that divides evenly into another number. That means, in turn, that the greatest common divisor (identical to the greatest common factor) must be the largest number that divides into two or more numbers. Choice A doesn’t work here because, although is a divisor of both and , it is not the largest divisor. Choice B is not right because divides evenly into but not into . Similarly, choice D gives us a number that divides into but not into . Choice C proposes the largest number that is a divisor of both and .
Which of the following is both a multiple of and a factor of ?
A. 15
B. 30
C. 45
D. 60
The answer is B. Choice A doesn’t work because 15 is a factor of 90 but not a multiple of 6. Choice C has the same problem. Meanwhile, Choice D features the opposite conditions: 60 is a multiple of 6 but not a factor of 90.
If a number is a multiple of , which of the following must be true?
I. It is a multiple of 2.
II. It is a multiple of 3.
III. It is a multiple of 4.A. I and II only
B. II and III only
C. I, II, and III
D. None of the above
The answer is A. We can approach this problem by recognizing that the prime factors of are and . This means that any multiple of must also be multiples of and . In one step, we’ve confirmed that statements I and II are true. What about statement III? For a number to be a multiple of , it must contain two ’s as factors. But we only know for sure that this number contains one . So statement III goes too far for us to know for certain.
If you prefer to plug in numbers, you could try , , and . All three of those numbers are multiples of and , so this exercise appears to confirm statements I and II. Regarding statement III, although and and multiples of , is not, so we have proved that statement III does not work.
How many integers between and (inclusive) are both composite (non-prime) and odd?
A. 1
B. 2
C. 3
D. 4
The answer is C. Let’s begin by removing the even numbers and leaving ourselves with only , , , , and . Which of these appear to be composite? Certainly , since its last digits tells us it’s divisible by . Let’s use our divisibility trick for with the other numbers; which of them have digits that add up to a multiple of ? It looks like and fit the bill while and do not.
A handy way to speed up your process with primes is to memorize the perfect squares through at least (you should definitely do this for its own benefit!). If a number is smaller than a perfect square and is not prime, it must be divisible by the prime numbers smaller than the square root of that perfect square. For example, if a number is less than , which is , if it’s not prime it must be divisible by the prime numbers less than : , , or . Using this strategy, we can confidently say that and are prime because they are divisible by none of these factors.
It looks like we have three composite, odd numbers. But can we be sure that and are not composite? A good thing to remember is that the smallest composite, odd number not divisible by or is . So with smaller numbers, if an odd number is not divisible by or , you can be confident that it is prime.
Which of the following integers is NOT a factor of ?
A. 7
B. 9
C. 11
D. 13
The answer is B. This is a difficult problem to approach without a calculator. Remember the UnCLES Method: look at the answers! The way the question is phrased, three of the answers must evenly divide into , so we can begin anywhere. Why not start with since , which is reasonably close to ? Since and is a multiple of , we can see that works. But let’s use that to our advantage by finding the actual quotient; if goes into 100 times and we then subtracted a total of nine ’s, then the quotient must be .
(There is also a cool divisibility trick for , but this will apply only rarely, so feel free to skip to the next paragraph if you’d like to save time. If the sum of the odd-ordered (first, third, fifth, etc.) digits of a number is equal to the sum of the even-ordered digits of the number, or if the sums differ by or a multiple of , then is a factor of that number. We can see at a glance that the year is divisible by , since , and that is also divisible by since is exactly less than . One can see at a glance that 1,001 must be divisible by .)
We now have a much smaller number to work with, but the number is still difficult. Does have any factors besides and itself? It might not seem so at first because, since its digits don’t add up to a multiple of , is not divisible by . It clearly doesn’t divide by , so let’s try . If you realize that goes into both and , then must go evenly into , which s . (There is also a cool trick involving two numbers equidistant from a multiple of : in this case . This always works with numbers on opposite sides of -multiples: so, . And goes in times, so have our other two factors of the original number: and !
Before we leave this question, we would be remiss not to mention that there is a faster way to arrive at the solution here. You are looking for the answer choice that is NOT a factor of . As a reminder, the “adding the digits” trick works not just with but with also. If a number’s digits don’t add to a multiple of , then the number itself is not divisible by . We can test this with and see right away that it’s not divisible by … which gives us the answer right away!