Prime Factor Decomposition

• Fundamental Theorem of Arithmetic ensures that prime factorisation is unique for every integer greater than 1. This principle guarantees consistency in calculations involving HCF, LCM, and number classification.

• Divisibility structure allows composite numbers to be decomposed through repeated division by primes. This works because every composite number must contain at least one prime factor, forming the foundation for recursive splitting.

• Prime irreducibility means primes cannot be factored further except into 1 and themselves. This makes them ideal endpoints for each branch of a factor tree and ensures all factor trees terminate naturally.

• Factor pairing means any composite number can be expressed as a product of two smaller integers, at least one of which is composite unless the number is prime. This supports the initial step of splitting numbers in any valid manner.

• Order independence guarantees that no matter which factor pairs are chosen at each step, the final set of prime factors is always identical. This allows flexible strategies without affecting correctness.

• Factor tree construction begins by selecting any pair of factors of a composite number and splitting each non-prime factor recursively. This method visually organises the decomposition and helps avoid missed factors.

• Repeated prime division involves dividing the number by the smallest prime that fits at each step, continuing until only 1 remains. This method is efficient because it ensures primes appear in ascending order, simplifying index notation.

• Checking divisibility early allows rapid identification of small prime factors such as 2, 3, or 5. Using divisibility rules helps streamline the decomposition, especially for larger numbers.

• Index notation application involves grouping identical prime factors and rewriting them as powers, such as converting $2 \times 2 \times 3 \times 3 \times 3$ into $2^2 \times 3^3$. This makes further operations like comparing factorizations easier.

• Verification step should multiply all prime factors back together to confirm the product returns the original number. This is important because an incorrect factor at any stage would propagate errors throughout the decomposition.

Prime vs. Composite

• Prime numbers cannot be broken down into smaller factors, making them the final nodes in any factorisation process, whereas composite numbers must be decomposed further. Recognising this distinction determines when to stop splitting in a factor tree.

Factor Tree Methods

• Prime division uses only primes at each step, ensuring a clean and systematic decomposition, while general factor splitting allows any factor pair, which may be easier initially but often creates more branches. The choice affects clarity rather than correctness because both yield the same prime list.

Index Representation vs. Repeated Multiplication

• Repeated multiplication lists factors separately, which is helpful when first learning the method, while index notation condenses repeated primes, supporting more efficient use in algebra. Choosing between them depends on whether readability or compactness is needed.

• Always show decomposition steps clearly, because exam questions typically award method marks for the visible splitting process. Using a factor tree or repeated division ensures clarity and avoids lost marks due to unexplained results.

• Start with small primes, as they quickly reduce numbers and simplify subsequent steps. This approach also reduces the likelihood of overlooking a factor that leads to an incorrect decomposition.

• Use index notation in final answers, since many exam mark schemes expect primes with powers. This demonstrates command of the concept and produces compact, elegant expressions.

• Double-check the product by multiplying your prime factors back together before finalising. This verification acts as a safeguard against arithmetic slips made during branching or division.

• Be mindful of large numbers, as they may hide multiple small prime factors. Breaking them down gradually improves accuracy and reduces computational load.

• Stopping too early occurs when students incorrectly assume a number is prime without checking small divisors. Ensuring divisibility by 2, 3, and 5 greatly reduces this risk and helps maintain accuracy.

• Using non-prime endpoints in factor trees leads to incomplete or incorrect factorisation. Each branch must end in a genuine prime; otherwise, decomposition is not finished.

• Misusing index notation by incorrectly grouping primes or combining powers introduces significant errors in later calculations. Careful grouping and recounting primes prevents these mistakes.

• Assuming different factor trees yield different answers is a misconception because all valid trees lead to the same prime factorisation. This misunderstanding can make students doubt correct results unnecessarily.

• Confusing factors and multiples can cause incorrect starting points in the factor tree. Remembering that factors divide the number exactly helps ensure proper splitting.

• Prime factorisation as a foundation for HCF and LCM allows these values to be computed systematically by comparing powers of shared primes. This connects decomposition to broader number theory methods.

• Recognising perfect squares and cubes becomes easier once numbers are expressed using index notation because even exponents correspond to squares and multiples of three correspond to cubes. This supports solving root and exponent problems.

• Algebraic manipulation benefits from prime factor decomposition because factor patterns can simplify expressions and reveal hidden structure. This is especially useful when simplifying rational expressions.

• Cryptography applications rely on the difficulty of decomposing very large numbers into primes. While basic factorisation is simple on small integers, this opens doors to deeper mathematical ideas.

• Number classification tasks such as identifying square-free numbers depend heavily on understanding prime powers. Decomposition thus acts as a versatile analytical tool.