Answer the following questions in separate paragraphs: 1. Types of Numbers. 2. Factors of a Number. 3. Prime Factorisation and Sieve of Eratosthenes.

Introduction

The aim of this essay is to explain prime factorization, including types of numbers, examples with explanations, methods to find prime factors, and how to identify prime and composite numbers. The essay is structured with an introduction, body, conclusion, and references.

Prime factorization is the process of expressing a composite number as a product of prime numbers. This unique decomposition is crucial in mathematics for simplifying fractions, finding GCD/LCM, and applications like cryptography.

Body

Types of numbers

Natural numbers are positive integers starting from 1: $1, 2, 3, \dots$. Prime numbers have exactly two distinct positive divisors: 1 and themselves, e.g., $2, 3, 5, 7$. Composite numbers have more than two positive divisors, e.g., $4, 6, 8, 9$. Note that 1 is neither prime nor composite.

Examples and explanations

Consider 12. Divisors: $1, 2, 3, 4, 6, 12$. More than two, so composite. Prime factorization:

$$12 \div 2 = 6$$ $$6 \div 2 = 3$$

3 is prime. So $12 = 2^{2} \times 3$.

Another example: 17. Divisors: $1, 17$. Only two, so prime. No factorization needed beyond itself.

Method of finding prime factors

Use trial division: Divide by smallest primes sequentially until the quotient is prime.

Example: Factorize 315.