Photo AI

3 (a) Write 504 as the product of its prime factors - OCR - GCSE Maths - Question 3 - 2017 - Paper 1

Question icon

Question 3

3--(a)-Write-504-as-the-product-of-its-prime-factors-OCR-GCSE Maths-Question 3-2017-Paper 1.png

3 (a) Write 504 as the product of its prime factors. (b) Find the lowest common multiple (LCM) of 180 and 504.

Worked Solution & Example Answer:3 (a) Write 504 as the product of its prime factors - OCR - GCSE Maths - Question 3 - 2017 - Paper 1

Step 1

Write 504 as the product of its prime factors.

96%

114 rated

Answer

To express 504 as a product of its prime factors, we start by dividing it by the smallest prime numbers:

  1. Divide 504 by 2: 5042=252504 \\ 2 = 252
  2. Divide 252 by 2: 2522=126252 \\ 2 = 126
  3. Divide 126 by 2: 1262=63126 \\ 2 = 63
  4. Divide 63 by 3: 633=2163 \\ 3 = 21
  5. Divide 21 by 3: 213=721 \\ 3 = 7
  6. 7 is a prime number.

Thus, the prime factorization of 504 is: 504=23×32×7504 = 2^3 \times 3^2 \times 7

Step 2

Find the lowest common multiple (LCM) of 180 and 504.

99%

104 rated

Answer

To find the LCM of 180 and 504, we first find the prime factorizations of both numbers:

For 180:

  1. Divide 180 by 2: 1802=90180 \\ 2 = 90
  2. Divide 90 by 2: 902=4590 \\ 2 = 45
  3. Divide 45 by 3: 453=1545 \\ 3 = 15
  4. Divide 15 by 3: 153=515 \\ 3 = 5
  5. 5 is a prime number.

Thus, the prime factorization of 180 is: 180=22×32×5180 = 2^2 \times 3^2 \times 5

Now, using the factorizations:

  • 504: 23×32×72^3 \times 3^2 \times 7
  • 180: 22×32×52^2 \times 3^2 \times 5

The LCM is found by taking the highest powers of each prime:

  • For 2: max(3, 2) = 3
  • For 3: max(2, 2) = 2
  • For 5: max(0, 1) = 1
  • For 7: max(1, 0) = 1

Thus: LCM(180,504)=23×32×51×71LCM(180, 504) = 2^3 \times 3^2 \times 5^1 \times 7^1 Calculating this gives: LCM(180,504)=8×9×5×7=2520LCM(180, 504) = 8 \times 9 \times 5 \times 7 = 2520

Join the GCSE students using SimpleStudy...

97% of Students

Report Improved Results

98% of Students

Recommend to friends

100,000+

Students Supported

1 Million+

Questions answered

;