All Exams  >   Year 5  >   Year 5 Mathematics IGCSE (Cambridge)  >   All Questions

All questions of Number, Square Numbers for Year 5 Exam

A number is divisible by 2 if:
  • a)
    It ends in an even digit.
  • b)
    It is a prime number.
  • c)
    It ends in an odd digit.
  • d)
    It is a square number.
Correct answer is option 'A'. Can you explain this answer?

A number is divisible by 2 if its ones digit is even, which includes the digits 0, 2, 4, 6, and 8. This simple rule helps quickly determine divisibility without performing long division, making it a handy tool in arithmetic.

Which of the following is a prime number?
  • a)
    9
  • b)
    21
  • c)
    17
  • d)
    15
Correct answer is option 'C'. Can you explain this answer?

A prime number has exactly two distinct positive divisors: 1 and itself. The number 17 meets this criterion since its only divisors are 1 and 17. Recognizing prime numbers is crucial in number theory and has applications in cryptography.

What is the Sieve of Eratosthenes used for?
  • a)
    To find square roots.
  • b)
    To determine divisibility by 10.
  • c)
    To calculate factorials.
  • d)
    To identify prime numbers.
Correct answer is option 'D'. Can you explain this answer?

Vp Classes answered
The Sieve of Eratosthenes is an ancient algorithm used to identify all prime numbers up to a specified integer. By systematically crossing out the multiples of each prime starting from 2, the remaining numbers are primes. This efficient method highlights how primes can be found without direct division.

What is the significance of the Sieve of Eratosthenes in identifying prime numbers?
  • a)
    It calculates the product of all prime numbers under 100.
  • b)
    It provides a method to find the sum of all prime numbers.
  • c)
    It allows for the identification of prime numbers up to a specified limit by systematically eliminating non-prime numbers.
  • d)
    It determines whether a number is odd or even.
Correct answer is option 'C'. Can you explain this answer?

The Sieve of Eratosthenes is an efficient algorithm used to identify all prime numbers up to a given limit, typically 100. It works by iteratively marking the multiples of each prime number starting from 2, thus eliminating non-prime numbers. This method not only highlights the beauty of number theory but also serves as a foundational technique in computational mathematics for generating lists of primes efficiently.

What defines a prime number?
  • a)
    A number that can be divided by any integer without a remainder.
  • b)
    A number that is a perfect square.
  • c)
    A number that has exactly two distinct positive divisors: 1 and itself.
  • d)
    A number that can be formed by adding two square numbers.
Correct answer is option 'C'. Can you explain this answer?

Vp Classes answered
A prime number is defined as a natural number greater than 1 that has exactly two distinct positive divisors: 1 and itself. For instance, the number 7 is prime because its only divisors are 1 and 7. Interestingly, the number 2 is the only even prime number, highlighting that all other even numbers can be divided by 2, thus having more than two divisors.

Chapter doubts & questions for Number, Square Numbers - Year 5 Mathematics IGCSE (Cambridge) 2025 is part of Year 5 exam preparation. The chapters have been prepared according to the Year 5 exam syllabus. The Chapter doubts & questions, notes, tests & MCQs are made for Year 5 2025 Exam. Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests here.

Chapter doubts & questions of Number, Square Numbers - Year 5 Mathematics IGCSE (Cambridge) in English & Hindi are available as part of Year 5 exam. Download more important topics, notes, lectures and mock test series for Year 5 Exam by signing up for free.

Top Courses Year 5