Practice Set 1: Foundation & Conceptual Drill
Comprehensive 25-question practice drill mirroring Chapter 8 Exercise 1 with fresh thematic scenarios and mathematically verified solutions.
Practice Set 1: Foundation & Speed Mastery
This practice set covers core foundation concepts and speed calculation patterns for Numbers & Number Theory. Work through all 25 questions under timed conditions to test concept retention.
Traps and tips
- Carefully parse the reference base before applying percentage or ratio multipliers.
- Verify whether units require conversion (hours to minutes, km/h to m/s).
- Cross-check your intermediate algebraic steps against physical constraints.
Practice questions
Question 1 · Foundation Drill
When the sum of the recurring decimals is expressed as an irreducible fraction , where and are co-prime positive integers, what is the value of ?
Show answer and explanation
Answer: (A) 173
To convert mixed recurring decimals of the form to a fraction, subtract the non-repeating digits from the full sequence of digits to form the numerator, and place it over a denominator composed of as many 9s as repeating digits followed by as many 0s as non-repeating digits. Here, and . Their sum is , which simplifies upon dividing by 9 to the irreducible fraction . Thus, , , and their sum is .
Question 2 · Foundation Drill
A set contains exactly 35 distinct prime numbers such that the sum of all elements in is an even integer. If denotes the product of all 35 prime numbers in , what is the remainder when is divided by 4?
Show answer and explanation
Answer: (A) 2
Since 2 is the only even prime number and all other primes are odd, the sum of 35 odd primes would be odd. Because the sum of the 35 distinct primes is given as even, the set must contain an odd number of even terms; hence 2 must be an element of the set. With distinct primes, 2 appears with an exponent of exactly 1 in the prime factorization of their product . The remaining 34 primes are all odd, so their product is odd, taking the form . Therefore, , which leaves a remainder of 2 when divided by 4.
Question 3 · Foundation Drill
What is the total number of factors of the composite number ?
Show answer and explanation
Answer: (A) 468
To calculate the total number of factors of a composite expression, first reduce all composite bases to their prime factorizations before summing the exponents. Here, , , and . Combining powers yields . The number of factors is given by .
Question 4 · Foundation Drill
In how many ways can the integer be expressed as a product of two distinct positive factors (where the order of factors does not matter)?
Show answer and explanation
Answer: (A) 52
Every factor of has a unique complementary factor . When is a perfect square, one of the factors is , which pairs with itself. For , the total number of factors is . Since the question requires the two factors to be distinct, we must discard the case . The remaining factors pair up into distinct pairs. If the problem had not required distinct factors, the answer would have been .
Question 5 · Foundation Drill
Let be the square of a 7-digit repunit. What is the sum of all digits in the decimal expansion of ?
Show answer and explanation
Answer: (A) 49
Squaring a repunit with ones creates a symmetric numerical pyramid . For , , so the expansion is . The sum of the digits is . A universal property for any repunit with digits is that the sum of the digits of its square is always .
Question 6 · Foundation Drill
In how many distinct ways can the natural number be expressed as a product of two co-prime natural numbers?
Show answer and explanation
Answer: (A) 16
To express a natural number as the product of two co-prime factors and , no prime factor can divide both and . Hence, each distinct prime power must be assigned as an indivisible unit to either or . For distinct prime factors, there are ordered pairs . Since multiplication is commutative, the number of unordered pairs is . Here, has distinct prime factors (). Thus, the number of ways is .
Question 7 · Foundation Drill
A natural number is called a perfect number if the sum of all its proper positive divisors (all positive divisors strictly less than ) equals . If are all the distinct positive divisors of a perfect number (including and ), what is the exact value of the sum of their reciprocals, ?
Show answer and explanation
Answer: (B) 2
By definition, a number is perfect if the sum of its proper divisors equals , meaning the sum of all its divisors is . For any positive integer , the sum of the reciprocals of all its divisors equals because each reciprocal can be written as , and the set of complementary divisors is identical to the set of divisors . Therefore, .
Question 8 · Foundation Drill
How many positive integers strictly less than are co-prime to ?
Show answer and explanation
Answer: (A) 2 3^11
Euler's Totient function counts the number of positive integers less than and co-prime to . For a prime power , the only numbers not co-prime to are multiples of . There are multiples of up to , so . For , we have and , yielding .
Question 9 · Foundation Drill
Let , where and are positive integers. How many positive integers strictly less than are co-prime to , expressed in terms of ?
Show answer and explanation
Answer: (A) 8N/35
To find the number of integers less than that are co-prime to , we determine . First, express in prime factors: . The distinct prime factors are and . Evaluating the totient product gives .
Question 10 · Foundation Drill
What is the sum of all natural numbers strictly less than that are co-prime to ?
Show answer and explanation
Answer: (A) 1080
The sum of all positive integers less than and co-prime to is given by , because each co-prime pairs with to form a sum of . For , the prime factorization is . The totient is . Thus, the sum is .
Question 11 · Foundation Drill
What is the exact value of the product ?
Show answer and explanation
Answer: (A) 9999999676
Direct long multiplication with large numbers is error-prone and time-consuming in competitive examinations like CAT and IPMAT. By recognizing that both numbers deviate by exactly from , we instantly convert the problem into . Because contributes seven nines () and , the resulting product is . Common traps include miscounting the number of nines or making a mental arithmetic error when computing .
Question 12 · Foundation Drill
Let , , and be three positive integers having digits, digits, and digits respectively in their standard decimal representations. If , what is the complete set of all possible values for the total number of digits in ?
Show answer and explanation
Answer: (A) Either 30, 31, or 32
The number of digits of an integer is governed by its order of magnitude. If an integer has digits, its base- logarithm lies in . For the product of three integers of , , and digits, the sum of logarithms lies in . Taking the floor of the logarithm plus one yields the integer range . A common mistake is assuming the product can only have digits (32) or only digits (31), overlooking the lower boundary where all three numbers start with small leading digits (e.g., 1), which yields 30 digits.
Question 13 · Foundation Drill
How many digits are there in the standard decimal representation of , where denotes a four-digit positive integer whose thousands digit is ?
Show answer and explanation
Answer: (A) Only 15
A common misconception in power-of-integer questions is that unknown digits make the total digit count indeterminate. However, by substituting the extremal values ( and ), we find that and . Both extremes share the same exponent without crossing the threshold. Thus, every possible choice of digits and produces an integer that strictly possesses digits.
Question 14 · Foundation Drill
What is the sum of all the positive factors of the integer ?
Show answer and explanation
Answer: (A) 38440
The sum of divisors is calculated by taking the product of the sums of powers for each prime factor: . Distractor represents the sum of only the even factors (which excludes , giving ). Distractor results from mistakenly including instead of ().
Question 15 · Foundation Drill
If is a non-zero real number such that , what is the value of ?
Show answer and explanation
Answer: (A) 79
Symmetric reciprocal equations of the form are solved by repeated application of the formula . First, squaring gives . Squaring once more gives . The most common test-taker traps are forgetting to subtract the second time (yielding ), or incorrectly computing .
Question 16 · Foundation Drill
Which of the following polynomials is a factor of the quartic expression ?
Show answer and explanation
Answer: (A) x^2 - 3x + 4
The polynomial can be rewritten as . Using the difference of squares identity , this factors into . Thus, is a factor.
Question 17 · Foundation Drill
What is the greatest natural number that always divides for all positive integers ?
Show answer and explanation
Answer: (B) 480
Using the identity , the expression is equivalent to . Since is always divisible by for all positive integers , the expression is always divisible by . Substituting gives , proving that 480 is the greatest integer that divides the expression for all .
Question 18 · Foundation Drill
If is an odd positive integer, which of the following numbers always divides ?
Show answer and explanation
Answer: (C) 11
For any odd integer , the sum of -th powers is divisible by . Substituting and , we find that is divisible by for all odd . Any divisor of 44 also divides the expression. Since 11 is a prime factor of 44 (), is always divisible by 11.
Question 19 · Foundation Drill
If , , and are non-zero real numbers such that , what is the value of the algebraic expression ?
Show answer and explanation
Answer: (D) 3
Combining the fractions over the common denominator gives . Using the conditional cubic identity, whenever , the sum of cubes satisfies . Substituting this relation into the fraction yields .
Question 20 · Foundation Drill
A positive integer leaves a remainder of 37 when divided by 48. Let be the remainder when is divided by 24, and let be a possible remainder when is divided by 96. Which of the following is a possible value of ?
Show answer and explanation
Answer: (B) 98
A number leaving remainder 37 upon division by 48 can be written as . Dividing by 24 gives remainder . Dividing by 96 yields remainder when is even, or when is odd. The possible values of are and . Among the choices, 98 is the only possible value.
Question 21 · Foundation Drill
Let and denote the least common multiple (LCM) and the highest common factor (HCF), respectively, of the three integers and . What is the value of the ratio ?
Show answer and explanation
Answer: (B) 30
The least common multiple takes the highest power of every prime factor present among the numbers, while the highest common factor takes the lowest power of every prime factor. Rather than multiplying out large values like and before dividing, we can directly compute the ratio by taking the difference between the maximum and minimum exponent for each prime factor: .
Question 22 · Foundation Drill
What is the least common multiple (LCM) of the four fractions and ?
Show answer and explanation
Answer: (A) 6
A common mistake in finding the LCM of fractions is applying the rule directly to unsimplified fractions. Here, unsimplified calculation yields . However, the formula is only mathematically valid when each fraction is in irreducible form. Reducing each fraction gives and , whose true LCM is .
Question 23 · Foundation Drill
When a positive integer is divided by , the remainder is . Which of the following could be the remainder when is divided by ?
Show answer and explanation
Answer: (C) 35
When two divisors share a common factor , any number must leave a consistent remainder modulo regardless of whether it is divided by or . Here, . Since , . Therefore, any valid remainder upon division by 63 must satisfy and . The only possible remainders are 14, 35, and 56. Among the choices 21, 28, 35, and 49, only 35 meets this criterion.
Question 24 · Foundation Drill
What is the units digit of the product ?
Show answer and explanation
Answer: (D) 8
The units digit of a product is found by multiplying the units digits of each individual term. Powers of 7 have a 4-step cycle (7, 9, 3, 1), so . Powers of 8 have a 4-step cycle (8, 4, 2, 6), so . Powers of 9 alternate between 9 and 1 with period 2, so . The product of these terminal digits is , which leaves a units digit of 8.
Question 25 · Foundation Drill
What is the units digit of the sum ?
Show answer and explanation
Answer: (C) 6
The units digit of any large power is determined entirely by the units digit of base and the value of . For , the base ends in 3 and , so the last digit is . For , the base ends in 7 and , so the last digit is . Adding the two results gives .
Study this concept with interactive practice in PrepSoc.
Open the concept library