class 6 Chapter 5: PRIME TIME –question bank

 

class 6 Chapter 5: PRIME TIME  –question bank

Class: 6

Subject: Mathematics (Ganita Prakash)

Chapter 5: Prime Time

---

Multiple Choice Questions (1 Mark Each)

1. Which of the following is a prime number?
a) 21
b) 33
c) 47
d) 51
(Competency: Identifying prime numbers)

2. The first number for which a player says 'idli-vada' in the game is:
a) 10
b) 15
c) 20
d) 30
(Competency: Finding common multiples)

3. Which pair of numbers is co-prime?
a) 18 and 35
b) 15 and 39
c) 30 and 415
d) 81 and 18
(Competency: Identifying co-prime numbers)

4. The prime factorisation of 84 is:
a) 2 x 2 x 21
b) 2 x 3 x 14
c) 2 x 2 x 3 x 7
d) 3 x 4 x 7
(Competency: Prime factorisation)

5. A number is divisible by 8 if:
a) Its last digit is even.
b) The number formed by its last two digits is divisible by 4.
c) The number formed by its last three digits is divisible by 8.
d) It is divisible by both 2 and 4.
(Competency: Applying divisibility rules)

6. The smallest number that is a multiple of both 4 and 6 is:
a) 12
b) 24
c) 36
d) 48
(Competency: Finding LCM)

7. Which of the following is a perfect number?
a) 10
b) 12
c) 6
d) 8
(Competency: Understanding properties of numbers)

8. The largest 2-digit prime number is:
a) 91
b) 93
c) 97
d) 99
(Competency: Identifying prime numbers)

9. A number is divisible by 5 if:
a) It is an odd number.
b) Its last digit is 0 or 5.
c) The sum of its digits is 5.
d) It ends with 0.
(Competency: Applying divisibility rules)

10. Twin primes are pairs of primes that differ by:
a) 1
b) 2
c) 3
d) 4
(Competency: Understanding properties of primes)

11. The sum of the first five prime numbers is:
a) 18
b) 26
c) 28
d) 30
(Competency: Calculation and properties of primes)

12. The number 1 is:
a) A prime number
b) A composite number
c) Neither prime nor composite
d) An even number
(Competency: Classifying numbers)

13. Which of the following numbers is divisible by 6?
a) 2341
b) 5732
c) 8460
d) 2953
(Competency: Applying divisibility rules)

14. The HCF of two co-prime numbers is always:
a) 0
b) 1
c) The smaller number
d) The larger number
(Competency: Relating HCF and co-prime numbers)

15. The prime factorisation of 1000 is:
a) 10³
b) 2³ x 5³
c) 2² x 5³
d) 2³ x 5²
(Competency: Prime factorisation)

16. A number is divisible by 9 if:
a) It is divisible by 3.
b) Its last digit is 9.
c) The sum of its digits is divisible by 9.
d) It is an odd number.
(Competency: Applying divisibility rules)

17. Which of the following is a composite number?
a) 17
b) 23
c) 31
d) 39
(Competency: Identifying composite numbers)

18. The smallest 4-digit number divisible by 3 is:
a) 1000
b) 1002
c) 1005
d) 1010
(Competency: Applying divisibility rules)

19. The number of factors of a prime number is:
a) 1
b) 2
c) 3
d) Infinite
(Competency: Understanding factors of primes)

20. The Sieve of Eratosthenes is used to find:
a) Multiples of a number
b) Prime numbers
c) Composite numbers
d) Common factors
(Competency: Understanding mathematical methods)

---

Assertion (A) and Reason (R) Type Questions (1 Mark Each)

Directions: In the following questions, a statement of assertion (A) is followed by a statement of reason (R). Mark the correct choice as:
a) Both A and R are true, and R is the correct explanation of A.
b) Both A and R are true, but R is NOT the correct explanation of A.
c) A is true, but R is false.
d) A is false, but R is true.

1. Assertion (A): 1 is neither a prime nor a composite number.
Reason (R): 1 has only one factor.
(Competency: Classifying numbers)

2. Assertion (A): 15 and 32 are co-prime numbers.
Reason (R): Two numbers are co-prime if their HCF is 1.
(Competency: Understanding co-prime numbers)

3. Assertion (A): All even numbers are composite numbers.
Reason (R): 2 is a prime number.
(Competency: Properties of even numbers and primes)

4. Assertion (A): The number 123456 is divisible by 3.
Reason (R): A number is divisible by 3 if the sum of its digits is divisible by 3. The sum of the digits of 123456 is 21, which is divisible by 3.
(Competency: Applying divisibility rules)

5. Assertion (A): The prime factorisation of a number is unique.
Reason (R): The order of factors does not matter in multiplication.
(Competency: Fundamental Theorem of Arithmetic)

6. Assertion (A): 91 is a prime number.
Reason (R): It has no factors other than 1 and itself.
(Competency: Identifying prime numbers)

7. Assertion (A): If a number is divisible by both 2 and 3, it is divisible by 6.
Reason (R): 6 is the LCM of 2 and 3.
(Competency: Applying divisibility rules)

8. Assertion (A): The numbers 0 and 1 are not considered prime numbers.
Reason (R): A prime number must have exactly two distinct factors.
(Competency: Definition of prime numbers)

9. Assertion (A): The HCF of two consecutive numbers is always 1.
Reason (R): Two consecutive numbers are always co-prime.
(Competency: Properties of consecutive numbers)

10. Assertion (A): The number 1001 is divisible by 7.
Reason (R): The difference between the number formed by the last three digits and the remaining part (1 - 1 = 0) is divisible by 7.
(Competency: Applying divisibility rules)

11. Assertion (A): Every composite number can be expressed as a product of primes.
Reason (R): This is known as the Fundamental Theorem of Arithmetic.
(Competency: Fundamental Theorem of Arithmetic)

12. Assertion (A): 45, 60, 75, and 90 are all multiples of 15.
Reason (R): 15 is a common factor of all these numbers.
(Competency: Understanding multiples and factors)

13. Assertion (A): The sum of two prime numbers is always even.
Reason (R): 2 is the only even prime number.
(Competency: Properties of prime numbers)

14. Assertion (A): 864 is divisible by 8.
Reason (R): The number formed by its last three digits, 864, is divisible by 8.
(Competency: Applying divisibility rules)

15. Assertion (A): The number 1 is a unique number.
Reason (R): It is the multiplicative identity.
(Competency: Properties of 1)

16. Assertion (A): The LCM of two co-prime numbers is their product.
Reason (R): Co-prime numbers have no common prime factors.
(Competency: Relating LCM and co-prime numbers)

17. Assertion (A): 0 is a multiple of every number.
Reason (R): 0 divided by any number gives 0.
(Competency: Understanding multiples)

18. Assertion (A): All numbers ending with 7 are prime numbers.
Reason (R): 27 is a composite number.
(Competency: Identifying prime and composite numbers)

19. Assertion (A): The divisibility rule for 4 involves the last two digits.
Reason (R): 100 is divisible by 4.
(Competency: Understanding divisibility rules)

20. Assertion (A): The number of prime numbers is finite.
Reason (R): Euclid proved that there are infinitely many primes.
(Competency: Knowledge about primes)

---

True or False (1 Mark Each)

1. The number 57 is prime. (True/False)
(Competency: Identifying prime numbers)

2. Every multiple of a number is greater than or equal to that number. (True/False)
(Competency: Understanding multiples)

3. 1 is the smallest prime number. (True/False)
(Competency: Identifying prime numbers)

4. The sum of two odd numbers is always even. (True/False)
(Competency: Properties of odd and even numbers)

5. If a number is divisible by 10, it must be divisible by 5. (True/False)
(Competency: Relating divisibility rules)

6. All prime numbers are odd. (True/False)
(Competency: Properties of prime numbers)

7. Two different numbers can have the same prime factorisation. (True/False)
(Competency: Fundamental Theorem of Arithmetic)

8. The HCF of two numbers is always a factor of their LCM. (True/False)
(Competency: Relationship between HCF and LCM)

9. A number is divisible by 3 if its last digit is divisible by 3. (True/False)
(Competency: Applying divisibility rules)

10. Co-prime numbers must be prime numbers. (True/False)
(Competency: Understanding co-prime numbers)

---

Short Answer Type Questions-I (2 Marks Each)

1. List all the factors of 36.
(Competency: Finding factors)

2. Find the common factors of 20 and 28.
(Competency: Finding common factors)

3. Write the prime factorisation of 98.
(Competency: Prime factorisation)

4. Find the smallest number that is divisible by both 6 and 8.
(Competency: Finding LCM)

5. Check whether 23456 is divisible by 4. Give a reason for your answer.
(Competency: Applying divisibility rules)

6. Is 1,23,456 divisible by 3? Justify your answer.
(Competency: Applying divisibility rules)

7. Find any two numbers which are multiples of 25 but not multiples of 50.
(Competency: Understanding multiples)

8. Find the HCF of 18 and 35.
(Competency: Finding HCF)

9. Write the smallest and largest 2-digit prime numbers.
(Competency: Identifying prime numbers)

10. If a number is divisible by 9, will it always be divisible by 3? Justify with an example.
(Competency: Relating divisibility rules)

11. Find the first three common multiples of 3 and 4.
(Competency: Finding common multiples)

12. State whether 31 and 44 are co-prime. Give reasons.
(Competency: Identifying co-prime numbers)

13. Find the missing number: The prime factorisation of ______ is 2³ × 3 × 5.
(Competency: Prime factorisation)

14. Find the sum of the first three composite numbers.
(Competency: Identifying composite numbers)

15. Can two numbers have 18 as their HCF and 380 as their LCM? Give reasons.
(Competency: Relationship between HCF and LCM)

---

Short Answer Type Questions-II (3 Marks Each)

1. Find the smallest number which when divided by 15, 20, and 25 leaves a remainder of 5 in each case.
(Competency: Finding LCM in context)

2. Three boys step off together from the same spot. Their steps measure 45 cm, 50 cm, and 60 cm respectively. What is the minimum distance each should cover so that all can cover the distance in complete steps?
(Competency: Real-life application of LCM)

3. Find the prime factorisation of 1728.
(Competency: Prime factorisation)

4. I am a number less than 100. Two of my factors are 3 and 5. One of my digits is 1 more than the other. Who am I? (Find all possible numbers)
(Competency: Problem-solving based on factors)

5. Find the greatest number that will divide 33, 87, and 129 leaving the same remainder in each case.
(Competency: Finding HCF in context)

6. Explain the Sieve of Eratosthenes. Use it to find all prime numbers between 1 and 30.
(Competency: Understanding and applying the Sieve)

7. Find the smallest 4-digit number which is divisible by 6, 8, and 9.
(Competency: Finding LCM)

8. Check whether 12ⁿ can end with the digit 0 for any natural number n. Justify your answer.
(Competency: Reasoning with prime factorisation)

9. Find the HCF and LCM of 144 and 180 by prime factorisation method.
(Competency: Finding HCF and LCM using prime factors)

10. A number is divisible by 11 if the difference between the sum of the digits at odd places and the sum of the digits at even places is either 0 or divisible by 11. Check the divisibility of 10934 by 11.
(Competency: Applying divisibility rule for 11)

---

Long Answer Type Questions (5 Marks Each)

1. a) Define prime and composite numbers with examples.
b) Find all prime numbers between 50 and 80 using the Sieve of Eratosthenes.
c) Explain why 0 and 1 are not considered prime numbers.
(Competency: Understanding, applying, and explaining concepts)

2. a) State the Fundamental Theorem of Arithmetic.
b) Find the prime factorisation of 1000 and 1728.
c) Using prime factorisation, find the HCF and LCM of 1000 and 1728.
(Competency: Stating theorem and application)

3. a) Explain the rules for divisibility by 2, 3, 4, 5, 8, 9, and 10 with examples.
b) Using these rules, check the divisibility of 12,345 by 3, 5, and 10. Check the divisibility of 10,248 by 4 and 8.
(Competency: Understanding and applying multiple divisibility rules)

4. a) What are co-prime numbers? Give examples.
b) Check whether 81 and 16 are co-prime.
c) Two numbers are co-prime and their product is 217. Find the numbers.
(Competency: Understanding and problem-solving with co-prime numbers)

5. a) Find the greatest number that divides 70 and 125 leaving remainders 5 and 8 respectively.
b) In a school, the duration of a period in junior section is 30 minutes and in senior section is 40 minutes. If the first bell for both sections rings at 9:00 AM, when will the two bells ring together again?
(Competency: Application of HCF and LCM in problems)

6. a) Define twin primes. List all twin prime pairs under 50.
b) Define perfect numbers. Verify that 28 is a perfect number.
c) Find the smallest perfect number.
(Competency: Understanding special types of numbers)

7. a) Find the smallest number which when increased by 17 is exactly divisible by 28, 36, and 45.
b) Three tankers contain 403 litres, 434 litres, and 465 litres of diesel respectively. Find the maximum capacity of a container that can measure the diesel of the three tankers an exact number of times.
(Competency: Complex application of LCM and HCF)

8. a) Is 7 x 11 x 13 + 13 a composite number? Justify your answer.
b) Check whether 15ⁿ can end with the digit zero for any natural number n.
c) Find the digit ‘a’ if 37a5 is divisible by 3.
(Competency: Reasoning and justification using number theory)

9. a) Draw a factor tree for 240.
b) Write its prime factorisation.
c) Using this, find the number of factors of 240. (Hint: If N = a^p x b^q x c^r, number of factors = (p+1)(q+1)(r+1))
(Competency: Factor tree, prime factorisation, and finding number of factors)

10. a) A merchant has 120 litres, 180 litres, and 240 litres of three kinds of oil. He wants to sell the oil by filling the three kinds of oil in tins of equal volume. What is the greatest possible volume of such a tin?
b) Traffic lights at three different road crossings change after every 48 seconds, 72 seconds, and 108 seconds respectively. If they change simultaneously at 7 a.m., at what time will they change simultaneously again?
(Competency: Real-life application of HCF and LCM)

---

Case-Based Questions (4 MCQs each)

Case Study 1: The Idli-Vada Game
In a game, children sit in a circle. They call out numbers from 1. For multiples of 3, they say 'Idli'. For multiples of 5, they say 'Vada'. For numbers which are multiples of both 3 and 5, they say 'Idli-Vada'.

1. On which number will a child first say 'Idli-Vada'?
a) 5
b) 10
c) 15
d) 30
(Competency: Finding common multiples)

2. Up to 30, how many times will 'Idli' be said?
a) 9
b) 10
c) 11
d) 12
(Competency: Counting multiples)

3. Up to 30, how many times will only 'Vada' be said (and not 'Idli-Vada')?
a) 3
b) 4
c) 5
d) 6
(Competency: Analyzing multiples)

4. If the game is played with rules for 4 ('Idli') and 6 ('Vada'), what is the first number for which a child will say 'Idli-Vada'?
a) 12
b) 18
c) 24
d) 36
(Competency: Finding LCM)

Case Study 2: Jumpy's Treasure Hunt
Jumpy can only jump in steps of equal size, starting from 0. He wins a treasure if he lands exactly on the number where it is placed. Grumpy places treasures on two numbers: 18 and 24.

1. Which of the following jump sizes will land Jumpy on both 18 and 24?
a) 3
b) 4
c) 5
d) 7
(Competency: Finding common factors)

2. What is the largest jump size that can land him on both treasures?
a) 2
b) 3
c) 6
d) 8
(Competency: Finding HCF)

3. If Grumpy wants to make it impossible for Jumpy to win both treasures with any jump size greater than 1, which pair of numbers should he choose?
a) 12 and 18
b) 15 and 28
c) 16 and 24
d) 20 and 30
(Competency: Identifying co-prime numbers)

4. If a jump size lands Jumpy on number A, then A must be a ______ of the jump size.
a) factor
b) multiple
c) divisor
d) prime
(Competency: Understanding multiples and factors)

Case Study 3: Packing Figs
Guna and Anshu are packing figs. Guna wants to pack 12 figs per box, and Anshu wants to pack 7 figs per box. They are exploring the different rectangular arrangements possible for each number.

1. How many different rectangular arrangements can Guna make for 12 figs?
a) 2
b) 3
c) 4
d) 6
(Competency: Finding number of factor pairs)

2. How many different rectangular arrangements can Anshu make for 7 figs?
a) 0
b) 1
c) 2
d) 7
(Competency: Properties of prime numbers)

3. Based on this, 7 is a ______ number.
a) Prime
b) Composite
c) Co-prime
d) Even
(Competency: Classifying numbers)

4. Which of the following numbers will have the most number of rectangular arrangements?
a) 17
b) 23
c) 36
d) 41
(Competency: Relating to number of factors)

Case Study 4: The Sieve of Eratosthenes
The Sieve of Eratosthenes is an ancient algorithm used to find all prime numbers up to any given limit. It works by iteratively marking the multiples of each prime number starting from 2.

1. The first step in the Sieve is to circle the number __ and cross out all its multiples.
a) 1
b) 2
c) 3
d) 4
(Competency: Understanding the Sieve method)

2. After circling 2 and crossing out its multiples, the next number to be circled is:
a) 3
b) 4
c) 5
d) 6
(Competency: Applying the Sieve method)

3. The numbers crossed out as multiples of 2 and 3 (like 6, 12, 18) are:
a) Prime numbers
b) Composite numbers
c) Co-prime numbers
d) Odd numbers
(Competency: Identifying composite numbers)

4. How many prime numbers are there between 1 and 50?
a) 14
b) 15
c) 16
d) 17
(Competency: Applying the Sieve and counting)

Case Study 5: Leap Years
A leap year has 366 days, with February having 29 days. The rule for leap years is: If a year is divisible by 4, it is a leap year, except for end-of-century years, which must be divisible by 400 to be leap years.

1. Which of the following was a leap year?
a) 1900
b) 1978
c) 2000
d) 2022
(Competency: Applying divisibility rules in context)

2. The year 2024 is a leap year. What will be the next leap year?
a) 2025
b) 2026
c) 2027
d) 2028
(Competency: Finding multiples)

3. How many leap years are there between the years 2001 and 2100?
a) 23
b) 24
c) 25
d) 26
(Competency: Problem-solving with divisibility)

4. A century year (like 2100, 2200) will be a leap year only if it is divisible by:
a) 4
b) 40
c) 100
d) 400
(Competency: Remembering the exception rule)