Multiples, Factors & Primes

Multiples, factors, and prime numbers describe fundamental relationships between integers. A multiple is built by repeated multiplication, a factor divides exactly, and a prime number has exactly two distinct positive factors: 1 and itself. These ideas are central to divisibility, number structure, and efficient problem solving because they help you classify numbers, test divisibility quickly, and reason about how integers are connected.

• Multiples are numbers of the form $an$, where $a$ is a fixed integer and $n$ is a positive integer. This means a multiple is created by repeated addition or multiplication of the original number, so multiples form an infinite sequence for any non-zero integer. You use this idea when listing values in a times table or checking whether one number belongs to another number's pattern.
• Factors are integers that divide a given number exactly, with no remainder. If $a$ is a factor of $b$, then there exists an integer $k$ such that $b = ak$, which is why factors and multiples are inverse viewpoints of the same relationship. This is useful whenever a question asks whether a number divides evenly or asks for all exact divisors.
• A common multiple of two or more integers is a number that is a multiple of each of them, while a common factor divides each of them exactly. These ideas matter because many number problems depend on comparing two lists at once rather than studying a single number in isolation. They are especially important when checking shared structure between integers.
• A prime number is an integer greater than 1 with exactly two distinct positive factors: 1 and itself. This definition matters because it separates numbers that cannot be broken into smaller whole-number factors from those that can. Prime numbers act like the basic building blocks of whole numbers.
• A composite number is an integer greater than 1 that has more than two positive factors. This means it can be written as a product of smaller integers, so it has internal factor structure that primes do not. Distinguishing prime from composite is essential in classification questions and divisibility reasoning.
• The number 1 is not prime because it has only one positive factor, not two. This is an important definition point, because many mistakes in number theory begin when 1 is incorrectly treated as a prime. Keeping 1 separate preserves the uniqueness of prime factorization.
• The number 2 is the only even prime because every other even number is divisible by 2 and also by itself, so it has at least three factor-related facts to consider. In practice, this makes 2 a special case that should always be remembered in prime-number questions. It often appears in exam traps designed to test careful reading.

• The relationship between factors and multiples comes from the equation $b = ak$. If this equation holds for integers $a$, $b$, and $k$, then $a$ is a factor of $b$ and $b$ is a multiple of $a$. This principle explains why divisibility can be described from either direction.
• Factors of a positive integer occur in pairs. If $d$ is a factor of $n$, then $\frac{n}{d}$ is also a factor, because $d \times \frac{n}{d} = n$. This pairing is why factor searches become more efficient and why lists of factors often look symmetrical around the square root.
• To test whether a number is prime, you only need to check possible factors up to $\sqrt{n}$. If a number had a factor greater than $\sqrt{n}$, it would pair with a factor smaller than $\sqrt{n}$, so one of the pair would already have been found earlier. This principle makes prime testing faster and more systematic.
• Divisibility rules work because of how place value behaves in base 10. For example, tests for 2, 5, and 10 depend on the last digit, while tests for 3 and 9 depend on the sum of the digits because powers of 10 leave predictable remainders modulo 3 and 9. These shortcuts let you recognize factors without full division.
• Every integer greater than 1 is either prime or can be built from primes. This is the foundation of number structure, because composite numbers can always be broken down into smaller factors until primes remain. Prime numbers therefore play the role of irreducible pieces in arithmetic.

Key idea: A number is divisible by another number exactly when division leaves remainder $0$.

• If a number is divisible by two integers that are coprime, then it is divisible by their product. For instance, divisibility by 2 and 3 together guarantees divisibility by 6 because 2 and 3 share no factor other than 1. This principle helps you combine divisibility information efficiently.

Listing multiples

• To list multiples of a number $a$, start at $a$ and keep adding $a$ each time. This works because the multiples are $a, 2a, 3a, 4a, \dots$, so each term is one more group of $a$ than the previous term. Use this when asked for the first few multiples or for multiples in a given interval.
• To find multiples within a range, identify the smallest multiple of $a$ that is at least the lower bound, then continue adding $a$ until you pass the upper bound. This is more efficient than writing a very long list from the beginning. It is especially useful in exam questions with boundaries such as "between" or "up to".

Finding all factors

• To find all factors of a positive integer $n$, test divisibility starting from 1 upward and record factor pairs. Whenever $d$ divides $n$, both $d$ and $\frac{n}{d}$ belong in the factor list, which avoids missing large factors. This method is reliable because every exact divisor appears in one of these pairs.
• Stop testing once you reach $\sqrt{n}$. Beyond this point, factor pairs start repeating in reverse order, so continued checking wastes time and increases the chance of duplication. This stopping rule is a key efficiency technique.

Using divisibility tests

• Use divisibility tests before long division whenever possible. For example, divisibility by 2 depends on the last digit being even, divisibility by 5 depends on ending in 0 or 5, and divisibility by 10 depends on ending in 0. These tests quickly eliminate impossible factors.
• For divisibility by 3 or 9, add the digits of the number and test that sum instead. This works because base-10 place values preserve remainder behavior modulo 3 and 9, so the digit sum carries the relevant divisibility information. It is one of the fastest checks for identifying non-primes and composite structure.

Testing for primality

• To decide whether a number is prime, first rule out obvious small factors such as 2, 3, and 5 using divisibility rules. Then test odd divisors up to $\sqrt{n}$. If none divides exactly, the number is prime.
• This method is efficient because any composite number must have a factor pair, and one member of that pair must be no larger than $\sqrt{n}$. It prevents unnecessary calculations and gives a clear stopping point.

• Multiples and factors are related, but they answer opposite questions. A multiple is built from a number by multiplication, while a factor fits into a number by exact division. This distinction matters because students often confuse "numbers in the times table" with "numbers that divide exactly".

• Prime and composite numbers are not just labels; they describe the internal factor structure of an integer. A prime has exactly two distinct positive factors, while a composite has more than two. This matters when deciding whether factorization can continue or has reached a final building block.

• Common factor and common multiple should not be mixed up. Common factors are shared exact divisors and are therefore at most as large as the smaller number, while common multiples are shared products and can extend indefinitely. This difference helps you estimate whether an answer is sensible before finalizing it.
• A number being even does not make it composite in every case. The number 2 is even and prime, while every other even number greater than 2 is composite because it has at least the factors 1, 2, and itself. This is one of the most tested special cases in basic number theory.

• Read the command word carefully before doing any calculations. "List the multiples" requires generating values in order, while "find the factors" requires exact divisors of one fixed number. Many lost marks come from answering the right style of question for the wrong concept.
• Use divisibility rules first to save time and reduce arithmetic errors. Quick checks for 2, 3, 5, 9, and 10 often reveal factors immediately or rule them out, which is faster than repeated trial division. This is especially helpful under time pressure.
• When finding all factors, write them in pairs and in ascending order. Pairing prevents missed values, and ordering helps you see whether a number has been repeated or omitted. Examiners often award full credit more easily when the structure of the work is clear.
• For prime testing, stop at $\sqrt{n}$ and show the checks you made. This demonstrates method as well as answer, which matters if working marks are available. It also avoids the common mistake of continuing long after the result is already certain.
• Always check special cases such as 1 and 2. The number 1 is not prime, and 2 is prime even though it is even, so these two values often appear in trick questions. A brief mental check of these exceptions can prevent an otherwise avoidable error.

Exam takeaway: If a question asks for all factors, your final list should be complete, ordered, and contain no duplicates.

• Estimate whether your answer is reasonable by thinking about size and meaning. Factors of a number cannot exceed the number itself, while multiples usually grow larger as the list continues. This quick sense check often catches classification mistakes before you move on.

• A very common error is to confuse factor with multiple. For example, students may list numbers in a times table when the question actually asks for numbers that divide exactly into a given value. This happens because both ideas involve multiplication, so always ask whether you are building numbers or breaking one number down.
• Another frequent mistake is to call 1 a prime number. The definition of prime requires exactly two distinct positive factors, but 1 has only one. Remembering this protects later topics such as unique prime factorization from becoming inconsistent.
• Students often forget that all factors of a number must divide with no remainder. If division produces a fraction or decimal, then the tested value is not a factor, even if it is numerically close. This matters because approximate thinking is not enough in divisibility questions.
• When listing all factors, it is easy to miss one member of a factor pair or to stop too early. Writing both entries of each pair at once and then arranging the full set in order reduces this risk. This is especially important for numbers with many divisors.
• Some learners assume that a number is prime simply because it is not even. That is incorrect, because odd numbers can still be divisible by 3, 5, 7, or other integers. Prime testing must involve checking for any non-trivial factor, not just checking whether the number is even.

• Multiples and factors connect directly to divisibility, which is a foundation for many later topics in arithmetic and algebra. Being able to detect exact division quickly supports fraction work, simplification, and algebraic manipulation. These ideas therefore reappear far beyond basic number classification.
• Prime numbers are central to prime factorization, where every composite integer can be expressed as a product of primes. This works because primes are the indivisible building blocks of integers, so decomposition eventually stops at them. Understanding primes now makes later work with highest common factor and lowest common multiple much easier.
• Common factors and common multiples support work with fractions. Common factors help with simplifying, while common multiples help with finding common denominators for addition and subtraction. This shows that number structure is not isolated; it directly supports efficient calculation.
• In algebra, the same ideas appear symbolically. Expressions such as $k, 2k, 3k, 4k$ are multiples of $k$, and factorization in algebra mirrors the arithmetic idea of breaking a quantity into exact parts. This connection helps bridge numerical reasoning and symbolic reasoning.
• These concepts also prepare students for more advanced ideas such as modular arithmetic, Euclid's algorithm, and proofs about divisibility. Even at an introductory level, learning why divisibility tests and prime checks work builds habits of mathematical justification rather than memorization alone.