Scribd
Upload
187 views3 pages

Complete Prime Factorization - 4024

Uploaded by

Syed Taimoor
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
187 views3 pages

Complete Prime Factorization - 4024

Uploaded by

Syed Taimoor
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

IJK O & A Level

Complete Prime Factorization

1 Find the highest common factor (HCF) of 72 and 90.

2 Work out the highest common factor (HCF) of 75 and 105.

3 (a) Write 308 as a product of its prime factors.

(b) Find the highest common factor (HCF) of 308 and 66.

4 Find the Highest Common Factor (HCF) of 36 and 54 .

5 234 = 2 × 32 × 13 1872 = 24 × 32 × 13 234 × 1872 = 438 048

Use this information to write 438 048 as a product of its prime factors.

6 Find the highest common factor (HCF) of 84 and 105.

7 Rita is going to make some cheeseburgers for a party.


She buys some packets of cheese slices and some boxes of burgers.
There are 20 cheese slices in each packet.
There are 12 burgers in each box.
Rita buys exactly the same number of cheese slices and burgers.
i) How many packets of cheese slices and how many boxes of burgers does she buy?
Rita wants to put one cheese slice and one burger into each bread roll.
She wants to use all the cheese slices and all the burgers.

ii) How many bread rolls does Rita need?

8 Matt and Dan cycle around a cycle track.


Each lap Matt cycles takes him 50 seconds.
Each lap Dan cycles takes him 80 seconds.
Dan and Matt start cycling at the same time at the start line.
Work out how many laps they will each have cycled when they are next at the start line together.

9 Write 3.6 × 103 as a product of powers of its prime factors.


Show your working clearly.
10 Here are three lamps.

Lamp A flashes every 20 seconds.


Lamp B flashes every 45 seconds.
Lamp C flashes every 120 seconds.

The three lamps start flashing at the same time.


How many times in one hour will the three lamps flash at the same time?

11 (a) Write 720 as a product of its prime factors.


Show your working clearly.
(b) Find the smallest whole number that 720 can be multiplied by to give a square number.

12 (a) Find the highest common factor (HCF) of 96 and 120.

A = 23 × 5 × 72 × 11
(b) B = 24 × 7 × 11
C = 3 × 52
Find the lowest common multiple (LCM) of A , B and C .
A = 35 × 5 × 73 Given that
13
B = 23 × 3 × 74 the HCF of B and C is 23× 7
C = 2p × 5q × 7 r the LCM of A and C is 24× 35× 52× 73

Find the value of p , the value of q and the value of r .

14 i) Write 84 as a product of its prime factors.

ii) N is a two-digit number.


The lowest common multiple (LCM) of 84 and N is 504.

Find N .
15 N =24 ×3×75
PN =K , where P is an integer and K is a square number.

Find the smallest value of P .

16 Liz buys packets of coloured buttons.


There are 8 red buttons in each packet of red buttons.
There are 6 silver buttons in each packet of silver buttons.
There are 5 gold buttons in each packet of gold buttons.
Liz buys equal numbers of red buttons, silver buttons and gold buttons.
How many packets of each colour of buttons did Liz buy?

17 (a) Find the lowest common multiple (LCM) of 40 and 56.

(b) A = 23 × 3 × 5 B = 22 × 3 × 52
Write down the highest common factor (HCF) of A and B.

18 A machine has a buzzer that sounds every 50 minutes.


The machine also has a bell that sounds every 80 minutes.
The buzzer and the bell sound together at 10 am.
Find the time at which they next sound together.

19 Find the highest odd number that is a factor of 60 and a factor of 90.
20 Buses to Acton leave a bus station every 24 minutes.
Buses to Barton leave the same bus station every 20 minutes.
A bus to Acton and a bus to Barton both leave the bus station at 9 00 am.
When will a bus to Acton and a bus to Barton next leave the bus station at the same time?

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy