Skip to content
N4

Prime numbers, factors (divisors), multiples, common factors and multiples, highest common factor, lowest common multiple, prime factorisation with product notation and unique factorisation theorem

Factors, multiples and primes

Worked answers, methods and verified real exam appearances for N4 on Edexcel GCSE Maths 1MA1.

Explanation

  • A prime number has exactly two positive factors, 11 and itself; 11 is not prime. Every integer greater than 11 has a unique prime factorisation apart from the order of its factors.
  • Produce it with a factor tree or repeated division, then write repeated factors using powers. For two or more numbers, the highest common factor uses every shared prime with its smallest exponent.
  • The lowest common multiple uses every prime present with its largest exponent.
  • This method avoids double-counting factors and also supports problems about making a product into a square or cube.
  • Examiners require the factorisation to contain primes only.

Worked example

180n180n is a cube number, where nn is a positive integer. Find the smallest possible nn.

  1. 1.Prime factorise: 180=22×32×5180=2^2\times3^2\times5.
  2. 2.A cube needs exponents in multiples of 33, so supply 21×31×522^1\times3^1\times5^2.
  3. 3.Evaluate n=2×3×25=150n=2\times3\times25=150 and check 180n=27000=303180n=27000=30^3.

Answer: n=150n=150.

Common mistakes

  • Don't include 11 in a list of prime numbers.
  • Don't stop a factor tree with a composite number at an endpoint.
  • Don't use the larger exponents for the HCF instead of for the LCM.

Exam tip

For HCF or LCM questions, write both prime-power decompositions first so the method marks remain available.

Worked practice

Q1
Tier 1 · Easy

1

Write 756756 as a product of its prime factors.

(2)

(Total for Question 1 is 2 marks)

Mark scheme

Mark scheme for question 1
QuestionAnswerMarkMark scheme
1
  • 756=22×33×7756=2^2\times3^3\times7
2Divide successively by primes: 756=2×378=22×189=22×33×7756=2\times378=2^2\times189=2^2\times3^3\times7.
Q2
Tier 2 · Standard

2

Find both the HCF and the LCM of 8484 and 126126.

(3)

(Total for Question 2 is 3 marks)

Mark scheme

Mark scheme for question 2
QuestionAnswerMarkMark scheme
2
  • HCF =42=42
  • LCM =252=252
3Use 84=22×3×784=2^2\times3\times7 and 126=2×32×7126=2\times3^2\times7. The smaller common powers give 2×3×7=422\times3\times7=42. The largest powers give 22×32×7=2522^2\times3^2\times7=252.
Q3
Tier 3 · Hard

3

180n180n is a cube number, where nn is a positive integer. Find the smallest possible value of nn.

(4)

(Total for Question 3 is 4 marks)

Mark scheme

Mark scheme for question 3
QuestionAnswerMarkMark scheme
3
  • n=150n=150
4Prime factorise 180=22×32×5180=2^2\times3^2\times5. A cube needs every exponent to be a multiple of 33, so multiply by 2×3×522\times3\times5^2. Therefore n=2×3×25=150n=2\times3\times25=150, and 180n=27000=303180n=27000=30^3.
Q4
Tier 1 · Easy

4

Write down all the prime factors of 4242.

(1)

(Total for Question 4 is 1 mark)

Mark scheme

Mark scheme for question 4
QuestionAnswerMarkMark scheme
4
  • 22, 33 and 77
142=2×3×742=2\times3\times7, and each of 22, 33 and 77 is prime.
Q5
Tier 2 · Standard

5

Find the smallest multiple of both 1212 and 1818 that is greater than 100100.

(2)

(Total for Question 5 is 2 marks)

Mark scheme

Mark scheme for question 5
QuestionAnswerMarkMark scheme
5
  • 108108
212=22×312=2^2\times3 and 18=2×3218=2\times3^2, so their LCM is 22×32=362^2\times3^2=36. The first multiple of 3636 greater than 100100 is 36×3=10836\times3=108.
Q6
Tier 3 · Hard

6

nn is a positive multiple of 1515 less than 100100. The HCF of 6060 and nn is 1515. Work out all the possible values of nn.

(3)

(Total for Question 6 is 3 marks)

Mark scheme

Mark scheme for question 6
QuestionAnswerMarkMark scheme
6
  • n=15,45,75n=15,45,75
3The multiples of 1515 below 100100 are 15,30,45,60,75,9015,30,45,60,75,90. Their HCFs with 6060 are respectively 15,30,15,60,15,3015,30,15,60,15,30, so the required values are 1515, 4545 and 7575.
Q7
Tier 2 · Standard

7

A club has 9696 red counters, 144144 blue counters and 168168 green counters. The counters are put into the greatest possible number of identical bags with none left over. Work out the total number of counters in each bag.

(3)

(Total for Question 7 is 3 marks)

Mark scheme

Mark scheme for question 7
QuestionAnswerMarkMark scheme
7
  • 1717 counters
3The HCF of 9696, 144144 and 168168 is 2424, so there are 2424 bags. Each bag contains 96÷24=496\div24=4 red, 144÷24=6144\div24=6 blue and 168÷24=7168\div24=7 green counters. This is 4+6+7=174+6+7=17 counters.
Q8
Tier 3 · Hard

8

nn is a positive integer. The HCF of nn and 7272 is 1818. The LCM of nn and 7272 is 360360. Work out nn. Your method must be shown.

(4)

(Total for Question 8 is 4 marks)

Mark scheme

Mark scheme for question 8
QuestionAnswerMarkMark scheme
8
  • n=90n=90
4Since the HCF is 1818, nn is a multiple of 1818. Since the LCM is 360360, nn is a factor of 360360. The multiples of 1818 that divide 360360 are 18,36,72,90,180,36018,36,72,90,180,360. Checking these conditions leaves n=90n=90, because HCF(90,72)=18\operatorname{HCF}(90,72)=18 and LCM(90,72)=360\operatorname{LCM}(90,72)=360.
Q9
Tier 3 · Hard

9

A whole number leaves a remainder of 55 when it is divided by 1818 and also when it is divided by 2424. Work out the smallest three-digit number with this property.

(4)

(Total for Question 9 is 4 marks)

Mark scheme

Mark scheme for question 9
QuestionAnswerMarkMark scheme
9
  • 149149
4Subtracting 55 from the number must give a common multiple of 1818 and 2424. Since 18=2×3218=2\times3^2 and 24=23×324=2^3\times3, their LCM is 23×32=722^3\times3^2=72. The first multiple, 7272, gives 7777, which is not three-digit; the next gives 144+5=149144+5=149.
Q10
Tier 3 · Hard

10

The number 27×35×522^7\times3^5\times5^2 has a factor that is a cube number. Work out its greatest factor that is a cube number.

(4)

(Total for Question 10 is 4 marks)

Mark scheme

Mark scheme for question 10
QuestionAnswerMarkMark scheme
10
  • 17281728
4Every exponent in a cube number is a multiple of 33. The greatest allowed exponents are therefore 66 for the factor 22, 33 for the factor 33 and 00 for the factor 55. The required factor is 26×33=64×27=17282^6\times3^3=64\times27=1728.

Verified exam appearances

SeriesPaperQuestionMarksCalculatorTierLinks
2023-112FQ11AllowedFoundationQPMS
2024-063FQ222AllowedFoundationQPMS
2023-111HQ34Non-calculatorHigherQPMS
2023-062FQ51AllowedFoundationQPMS
2019-111FQ203Non-calculatorFoundationQPMS
2023-062FQ212AllowedFoundationQPMS
2021-112FQ62AllowedFoundationQPMS
2019-113FQ11AllowedFoundationQPMS
2023-113FQ243AllowedFoundationQPMS
2022-111HQ82Non-calculatorHigherQPMS
2023-061FQ72Non-calculatorFoundationQPMS
2019-062FQ31AllowedFoundationQPMS
2019-061HQ32Non-calculatorHigherQPMS
2024-063HQ12AllowedHigherQPMS
2022-062FQ41AllowedFoundationQPMS
2021-113FQ21AllowedFoundationQPMS
2022-063FQ212AllowedFoundationQPMS
2024-111FQ41Non-calculatorFoundationQPMS
2024-062FQ41AllowedFoundationQPMS
2022-113FQ51AllowedFoundationQPMS
2021-112FQ224AllowedFoundationQPMS
2023-063FQ243AllowedFoundationQPMS
2024-063FQ122AllowedFoundationQPMS
2022-061HQ22Non-calculatorHigherQPMS
2023-113HQ53AllowedHigherQPMS
2019-061FQ41Non-calculatorFoundationQPMS
2022-061FQ242Non-calculatorFoundationQPMS
2019-113FQ41AllowedFoundationQPMS
2023-111FQ204Non-calculatorFoundationQPMS
2023-062HQ22AllowedHigherQPMS
2022-111FQ41Non-calculatorFoundationQPMS
2019-061FQ242Non-calculatorFoundationQPMS
2024-113FQ164AllowedFoundationQPMS
2019-113FQ204AllowedFoundationQPMS
2022-111HQ13Non-calculatorHigherQPMS
2024-113FQ31AllowedFoundationQPMS
2024-062FQ213AllowedFoundationQPMS
2024-062HQ23AllowedHigherQPMS
2022-063FQ31AllowedFoundationQPMS
2019-111HQ13Non-calculatorHigherQPMS
2022-111FQ193Non-calculatorFoundationQPMS
2019-063FQ21AllowedFoundationQPMS
2023-063HQ53AllowedHigherQPMS
2019-062HQ174AllowedHigherQPMS
2021-112HQ24AllowedHigherQPMS

Other points in N Number

Want help turning this into marks?

Bring N4 or any tricky specification point, and we can work through the method and exam wording together.