Question 1 :
Choose the correct answer from the given four options in the question: If two positive integers a and b are written as $a = x^3y^2$ and $b = xy^3$; x, y are prime numbers, then HCF (a, b) is ________.
Question 2 :
Any positive odd integer is of the form 6q + 1, or 6q + 3, or 6q + 5, where q is some integer. TRUE or FALSE ?
Question 5 :
The square of an odd positive integer can be of the form 6q + 1 or 6q + 3 for some integer q. Is it true?
Question 6 :
A sweetseller has 420 kaju barfis and 130 badam barfis. She wants to stack them in such a way that each stack has the same number, and they take up the least area of the tray. What is the number of that can be placed in each stack for this purpose?
Question 8 :
Without actually performing the long division, state whether $\frac{17}{8}$ will have a terminating decimal expansion or a non-terminating repeating decimal expansion.
Question 9 :
Can the number $6^n$, n being a natural number, end with the digit 5 ?
Question 10 :
For any positive integer n, $n^3$– n is divisible by 6. Is it True or False?
Question 11 :
Given that HCF (306, 657) = 9, find LCM (306, 657).
Question 12 :
Use Euclid's division algorithm to find the HCF of : 135 and 225
Question 16 :
The numbers 525 and 3000 are both divisible only by 3, 5, 15, 25 and 75. What is HCF (525, 3000)?
Question 17 :
There is a circular path around a sports field. Sonia takes 18 minutes to drive one round of the field, while Ravi takes 12 minutes for the same. Suppose they both start at the same point and at the same time, and go in the same direction. After how many minutes will they meet again at the starting point?
Question 18 :
What are the LCM and HCF of 8, 9 and 25?
Question 19 :
Without actually performing the long division, state whether $\frac{64}{455}$ will have a terminating decimal expansion or a non-terminating repeating decimal expansion.
Question 20 :
An army contingent of 616 members is to march behind an army band of 32 members in a parade. The two groups are to march in the same number of columns. What is the maximum number of columns in which they can march?