Free CAT library

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 S=0.254‾+0.318‾S = 0.2\overline{54} + 0.3\overline{18} is expressed as an irreducible fraction pq\frac{p}{q}, where pp and qq are co-prime positive integers, what is the value of p+qp + q?

  1. A

    173

  2. B

    167

  3. C

    179

  4. D

    185

Show answer and explanation

Answer: (A) 173

To convert mixed recurring decimals of the form 0.abc‾0.a\overline{bc} 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, 0.254‾=254−2990=2529900.2\overline{54} = \frac{254 - 2}{990} = \frac{252}{990} and 0.318‾=318−3990=3159900.3\overline{18} = \frac{318 - 3}{990} = \frac{315}{990}. Their sum is 567990\frac{567}{990}, which simplifies upon dividing by 9 to the irreducible fraction 63110\frac{63}{110}. Thus, p=63p = 63, q=110q = 110, and their sum is p+q=173p + q = 173.

Question 2 · Foundation Drill

A set SS contains exactly 35 distinct prime numbers such that the sum of all elements in SS is an even integer. If PP denotes the product of all 35 prime numbers in SS, what is the remainder when PP is divided by 4?

  1. A

    2

  2. B

    0

  3. C

    1

  4. D

    Cannot be determined

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 PP. The remaining 34 primes are all odd, so their product is odd, taking the form 2k+12k + 1. Therefore, P=2(2k+1)=4k+2P = 2(2k + 1) = 4k + 2, 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 N=124×183×152N = 12^4 \times 18^3 \times 15^2?

  1. A

    468

  2. B

    396

  3. C

    432

  4. D

    60

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, 124=(22×3)4=28×3412^4 = (2^2 \times 3)^4 = 2^8 \times 3^4, 183=(2×32)3=23×3618^3 = (2 \times 3^2)^3 = 2^3 \times 3^6, and 152=(3×5)2=32×5215^2 = (3 \times 5)^2 = 3^2 \times 5^2. Combining powers yields N=28+3×34+6+2×52=211×312×52N = 2^{8+3} \times 3^{4+6+2} \times 5^2 = 2^{11} \times 3^{12} \times 5^2. The number of factors is given by (a1+1)(a2+1)(a3+1)=(11+1)(12+1)(2+1)=12×13×3=468(a_1 + 1)(a_2 + 1)(a_3 + 1) = (11 + 1)(12 + 1)(2 + 1) = 12 \times 13 \times 3 = 468.

Question 4 · Foundation Drill

In how many ways can the integer N=26×34×52N = 2^6 \times 3^4 \times 5^2 be expressed as a product of two distinct positive factors (where the order of factors does not matter)?

  1. A

    52

  2. B

    53

  3. C

    104

  4. D

    105

Show answer and explanation

Answer: (A) 52

Every factor aa of NN has a unique complementary factor b=N/ab = N/a. When NN is a perfect square, one of the factors is N\sqrt{N}, which pairs with itself. For N=26×34×52N = 2^6 \times 3^4 \times 5^2, the total number of factors is τ(N)=(6+1)(4+1)(2+1)=105\tau(N) = (6+1)(4+1)(2+1) = 105. Since the question requires the two factors to be distinct, we must discard the case a=b=N=360a = b = \sqrt{N} = 360. The remaining 105−1=104105 - 1 = 104 factors pair up into 1042=52\frac{104}{2} = 52 distinct pairs. If the problem had not required distinct factors, the answer would have been 105+12=53\frac{105+1}{2} = 53.

Question 5 · Foundation Drill

Let N=(1111111)2N = (1111111)^2 be the square of a 7-digit repunit. What is the sum of all digits in the decimal expansion of NN?

  1. A

    49

  2. B

    42

  3. C

    45

  4. D

    36

Show answer and explanation

Answer: (A) 49

Squaring a repunit with k≤9k \le 9 ones creates a symmetric numerical pyramid 123…(k−1)k(k−1)…321123\dots(k-1)k(k-1)\dots321. For N=(1111111)2N = (1111111)^2, k=7k = 7, so the expansion is 12345676543211234567654321. The sum of the digits is 2×(1+2+3+4+5+6)+7=2(21)+7=492 \times (1 + 2 + 3 + 4 + 5 + 6) + 7 = 2(21) + 7 = 49. A universal property for any repunit with k≤9k \le 9 digits is that the sum of the digits of its square is always k2=72=49k^2 = 7^2 = 49.

Question 6 · Foundation Drill

In how many distinct ways can the natural number N=25×34×53×72×111N = 2^5 \times 3^4 \times 5^3 \times 7^2 \times 11^1 be expressed as a product of two co-prime natural numbers?

  1. A

    1616

  2. B

    3232

  3. C

    360360

  4. D

    720720

Show answer and explanation

Answer: (A) 16

To express a natural number NN as the product of two co-prime factors AA and BB, no prime factor can divide both AA and BB. Hence, each distinct prime power piaip_i^{a_i} must be assigned as an indivisible unit to either AA or BB. For kk distinct prime factors, there are 2k2^k ordered pairs (A,B)(A, B). Since multiplication is commutative, the number of unordered pairs {A,B}\{A, B\} is 2k2=2k−1\frac{2^k}{2} = 2^{k-1}. Here, N=25×34×53×72×111N = 2^5 \times 3^4 \times 5^3 \times 7^2 \times 11^1 has k=5k = 5 distinct prime factors (2,3,5,7,112, 3, 5, 7, 11). Thus, the number of ways is 25−1=24=162^{5-1} = 2^4 = 16.

Question 7 · Foundation Drill

A natural number NN is called a perfect number if the sum of all its proper positive divisors (all positive divisors strictly less than NN) equals NN. If d1,d2,…,dkd_1, d_2, \dots, d_k are all the distinct positive divisors of a perfect number NN (including 11 and NN), what is the exact value of the sum of their reciprocals, ∑i=1k1di\sum_{i=1}^k \frac{1}{d_i}?

  1. A

    11

  2. B

    22

  3. C

    12\frac{1}{2}

  4. D

    44

Show answer and explanation

Answer: (B) 2

By definition, a number NN is perfect if the sum of its proper divisors equals NN, meaning the sum of all its divisors is σ(N)=2N\sigma(N) = 2N. For any positive integer NN, the sum of the reciprocals of all its divisors equals σ(N)N\frac{\sigma(N)}{N} because each reciprocal 1d\frac{1}{d} can be written as N/dN\frac{N/d}{N}, and the set of complementary divisors {N/d}\{N/d\} is identical to the set of divisors {d}\{d\}. Therefore, ∑d∣N1d=σ(N)N=2NN=2\sum_{d \mid N} \frac{1}{d} = \frac{\sigma(N)}{N} = \frac{2N}{N} = 2.

Question 8 · Foundation Drill

How many positive integers strictly less than 3123^{12} are co-prime to 3123^{12}?

  1. A

    2×3112 \times 3^{11}

  2. B

    3113^{11}

  3. C

    2×3122 \times 3^{12}

  4. D

    312−13^{12} - 1

Show answer and explanation

Answer: (A) 2 3^11

Euler's Totient function ϕ(N)\phi(N) counts the number of positive integers less than NN and co-prime to NN. For a prime power pkp^k, the only numbers not co-prime to pkp^k are multiples of pp. There are pkp=pk−1\frac{p^k}{p} = p^{k-1} multiples of pp up to pkp^k, so ϕ(pk)=pk−pk−1=pk−1(p−1)\phi(p^k) = p^k - p^{k-1} = p^{k-1}(p - 1). For N=312N = 3^{12}, we have p=3p = 3 and k=12k = 12, yielding ϕ(312)=311(3−1)=2×311\phi(3^{12}) = 3^{11}(3 - 1) = 2 \times 3^{11}.

Question 9 · Foundation Drill

Let N=6a×10b×14cN = 6^a \times 10^b \times 14^c, where a,b,a, b, and cc are positive integers. How many positive integers strictly less than NN are co-prime to NN, expressed in terms of NN?

  1. A

    8N35\frac{8N}{35}

  2. B

    4N15\frac{4N}{15}

  3. C

    16N35\frac{16N}{35}

  4. D

    12N35\frac{12N}{35}

Show answer and explanation

Answer: (A) 8N/35

To find the number of integers less than NN that are co-prime to NN, we determine ϕ(N)=N∏p∣N(1−1/p)\phi(N) = N \prod_{p \mid N} (1 - 1/p). First, express N=6a×10b×14cN = 6^a \times 10^b \times 14^c in prime factors: N=2a+b+c×3a×5b×7cN = 2^{a+b+c} \times 3^a \times 5^b \times 7^c. The distinct prime factors are 2,3,5,2, 3, 5, and 77. Evaluating the totient product gives ϕ(N)=N(1−1/2)(1−1/3)(1−1/5)(1−1/7)=N×12×23×45×67=8N35\phi(N) = N(1 - 1/2)(1 - 1/3)(1 - 1/5)(1 - 1/7) = N \times \frac{1}{2} \times \frac{2}{3} \times \frac{4}{5} \times \frac{6}{7} = \frac{8N}{35}.

Question 10 · Foundation Drill

What is the sum of all natural numbers strictly less than 9090 that are co-prime to 9090?

  1. A

    10801080

  2. B

    21602160

  3. C

    540540

  4. D

    2424

Show answer and explanation

Answer: (A) 1080

The sum of all positive integers less than NN and co-prime to NN is given by N2×ϕ(N)\frac{N}{2} \times \phi(N), because each co-prime kk pairs with N−kN - k to form a sum of NN. For N=90N = 90, the prime factorization is 2×32×52 \times 3^2 \times 5. The totient is ϕ(90)=90(1−1/2)(1−1/3)(1−1/5)=90×415=24\phi(90) = 90(1 - 1/2)(1 - 1/3)(1 - 1/5) = 90 \times \frac{4}{15} = 24. Thus, the sum is 902×24=45×24=1080\frac{90}{2} \times 24 = 45 \times 24 = 1080.

Question 11 · Foundation Drill

What is the exact value of the product 99982×10001899982 \times 100018?

  1. A

    9999999676

  2. B

    999999676

  3. C

    9999999686

  4. D

    9999999776

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 ±18\pm 18 from 100000100000, we instantly convert the problem into (105)2−182=1010−324(10^5)^2 - 18^2 = 10^{10} - 324. Because 1010−100010^{10} - 1000 contributes seven nines (99999990009999999000) and 1000−324=6761000 - 324 = 676, the resulting product is 99999996769999999676. Common traps include miscounting the number of nines or making a mental arithmetic error when computing 1000−3241000 - 324.

Question 12 · Foundation Drill

Let XX, YY, and ZZ be three positive integers having 88 digits, 1010 digits, and 1414 digits respectively in their standard decimal representations. If P=X×Y×ZP = X \times Y \times Z, what is the complete set of all possible values for the total number of digits in PP?

  1. A

    Either 30, 31, or 32

  2. B

    Either 31 or 32 only

  3. C

    Either 29, 30, or 31

  4. D

    Only 32

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 dd digits, its base-1010 logarithm lies in [d−1,d)[d-1, d). For the product of three integers of 88, 1010, and 1414 digits, the sum of logarithms lies in [7+9+13,8+10+14)=[29,32)[7+9+13, 8+10+14) = [29, 32). Taking the floor of the logarithm plus one yields the integer range {30,31,32}\{30, 31, 32\}. A common mistake is assuming the product can only have ∑di\sum d_i digits (32) or only ∑di−1\sum d_i - 1 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 (4ABC)4(4ABC)^4, where 4ABC4ABC denotes a four-digit positive integer whose thousands digit is 44?

  1. A

    Only 15

  2. B

    Only 14

  3. C

    Either 14 or 15

  4. D

    Cannot be determined without knowing A, B, and C

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 (40004000 and 50005000), we find that (4000)4=2.56×1014(4000)^4 = 2.56 \times 10^{14} and (5000)4=6.25×1014(5000)^4 = 6.25 \times 10^{14}. Both extremes share the same exponent 101410^{14} without crossing the 101510^{15} threshold. Thus, every possible choice of digits A,B,A, B, and CC produces an integer that strictly possesses 1515 digits.

Question 14 · Foundation Drill

What is the sum of all the positive factors of the integer N=24×33×52N = 2^4 \times 3^3 \times 5^2?

  1. A

    38440

  2. B

    37200

  3. C

    39680

  4. D

    19220

Show answer and explanation

Answer: (A) 38440

The sum of divisors σ(N)\sigma(N) is calculated by taking the product of the sums of powers for each prime factor: (1+2+4+8+16)(1+3+9+27)(1+5+25)=31×40×31=38440(1 + 2 + 4 + 8 + 16)(1 + 3 + 9 + 27)(1 + 5 + 25) = 31 \times 40 \times 31 = 38440. Distractor 3720037200 represents the sum of only the even factors (which excludes 20=12^0 = 1, giving 30×40×31=3720030 \times 40 \times 31 = 37200). Distractor 3968039680 results from mistakenly including 252^5 instead of 242^4 (32×40×3132 \times 40 \times 31).

Question 15 · Foundation Drill

If aa is a non-zero real number such that a+1a=11a + \frac{1}{a} = \sqrt{11}, what is the value of a4+1a4a^4 + \frac{1}{a^4}?

  1. A

    79

  2. B

    81

  3. C

    119

  4. D

    77

Show answer and explanation

Answer: (A) 79

Symmetric reciprocal equations of the form a+1a=ka + \frac{1}{a} = k are solved by repeated application of the formula (x+1/x)2=x2+1/x2+2(x + 1/x)^2 = x^2 + 1/x^2 + 2. First, squaring gives a2+1/a2=(11)2−2=9a^2 + 1/a^2 = (\sqrt{11})^2 - 2 = 9. Squaring once more gives a4+1/a4=92−2=79a^4 + 1/a^4 = 9^2 - 2 = 79. The most common test-taker traps are forgetting to subtract 22 the second time (yielding 8181), or incorrectly computing (11)2−2=119(11)^2 - 2 = 119.

Question 16 · Foundation Drill

Which of the following polynomials is a factor of the quartic expression P(x)=x4−x2+16P(x) = x^4 - x^2 + 16?

  1. A

    x2−3x+4x^2 - 3x + 4

  2. B

    x2+3x−4x^2 + 3x - 4

  3. C

    x2−x+4x^2 - x + 4

  4. D

    x2+4x^2 + 4

Show answer and explanation

Answer: (A) x^2 - 3x + 4

The polynomial x4−x2+16x^4 - x^2 + 16 can be rewritten as (x2+4)2−9x2(x^2 + 4)^2 - 9x^2. Using the difference of squares identity A2−B2=(A−B)(A+B)A^2 - B^2 = (A - B)(A + B), this factors into (x2−3x+4)(x2+3x+4)(x^2 - 3x + 4)(x^2 + 3x + 4). Thus, x2−3x+4x^2 - 3x + 4 is a factor.

Question 17 · Foundation Drill

What is the greatest natural number that always divides 232n−72n23^{2n} - 7^{2n} for all positive integers nn?

  1. A

    240

  2. B

    480

  3. C

    16

  4. D

    960

Show answer and explanation

Answer: (B) 480

Using the identity a2n−b2n=(a2)n−(b2)na^{2n} - b^{2n} = (a^2)^n - (b^2)^n, the expression is equivalent to 529n−49n529^n - 49^n. Since An−BnA^n - B^n is always divisible by A−BA - B for all positive integers nn, the expression is always divisible by 529−49=480529 - 49 = 480. Substituting n=1n = 1 gives 232−72=48023^2 - 7^2 = 480, proving that 480 is the greatest integer that divides the expression for all nn.

Question 18 · Foundation Drill

If nn is an odd positive integer, which of the following numbers always divides 31n+13n31^n + 13^n?

  1. A

    7

  2. B

    9

  3. C

    11

  4. D

    13

Show answer and explanation

Answer: (C) 11

For any odd integer nn, the sum of nn-th powers an+bna^n + b^n is divisible by (a+b)(a + b). Substituting a=31a = 31 and b=13b = 13, we find that 31n+13n31^n + 13^n is divisible by 31+13=4431 + 13 = 44 for all odd nn. Any divisor of 44 also divides the expression. Since 11 is a prime factor of 44 (44=4×1144 = 4 \times 11), 31n+13n31^n + 13^n is always divisible by 11.

Question 19 · Foundation Drill

If aa, bb, and cc are non-zero real numbers such that a+b+c=0a + b + c = 0, what is the value of the algebraic expression a2bc+b2ca+c2ab\frac{a^2}{bc} + \frac{b^2}{ca} + \frac{c^2}{ab}?

  1. A

    0

  2. B

    1

  3. C

    -3

  4. D

    3

Show answer and explanation

Answer: (D) 3

Combining the fractions over the common denominator abcabc gives a3+b3+c3abc\frac{a^3 + b^3 + c^3}{abc}. Using the conditional cubic identity, whenever a+b+c=0a + b + c = 0, the sum of cubes satisfies a3+b3+c3=3abca^3 + b^3 + c^3 = 3abc. Substituting this relation into the fraction yields 3abcabc=3\frac{3abc}{abc} = 3.

Question 20 · Foundation Drill

A positive integer NN leaves a remainder of 37 when divided by 48. Let r1r_1 be the remainder when NN is divided by 24, and let r2r_2 be a possible remainder when NN is divided by 96. Which of the following is a possible value of r1+r2r_1 + r_2?

  1. A

    58

  2. B

    98

  3. C

    74

  4. D

    122

Show answer and explanation

Answer: (B) 98

A number leaving remainder 37 upon division by 48 can be written as N=48k+37N = 48k + 37. Dividing NN by 24 gives remainder r1=37(mod24)=13r_1 = 37 \pmod{24} = 13. Dividing NN by 96 yields remainder r2=37r_2 = 37 when kk is even, or r2=37+48=85r_2 = 37 + 48 = 85 when kk is odd. The possible values of r1+r2r_1 + r_2 are 13+37=5013 + 37 = 50 and 13+85=9813 + 85 = 98. Among the choices, 98 is the only possible value.

Question 21 · Foundation Drill

Let LL and HH denote the least common multiple (LCM) and the highest common factor (HCF), respectively, of the three integers 144,216,144, 216, and 360360. What is the value of the ratio LH\frac{L}{H}?

  1. A

    15

  2. B

    30

  3. C

    60

  4. D

    120

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 L=2160L = 2160 and H=72H = 72 before dividing, we can directly compute the ratio by taking the difference between the maximum and minimum exponent for each prime factor: 24−3×33−2×51−0=2×3×5=302^{4-3} \times 3^{3-2} \times 5^{1-0} = 2 \times 3 \times 5 = 30.

Question 22 · Foundation Drill

What is the least common multiple (LCM) of the four fractions 615,820,1435,\frac{6}{15}, \frac{8}{20}, \frac{14}{35}, and 912\frac{9}{12}?

  1. A

    6

  2. B

    12

  3. C

    252

  4. D

    504

Show answer and explanation

Answer: (A) 6

A common mistake in finding the LCM of fractions is applying the rule LCM(numerators)/HCF(denominators)\text{LCM}(\text{numerators}) / \text{HCF}(\text{denominators}) directly to unsimplified fractions. Here, unsimplified calculation yields LCM(6,8,14,9)/HCF(15,20,35,12)=504/1=504\text{LCM}(6, 8, 14, 9) / \text{HCF}(15, 20, 35, 12) = 504 / 1 = 504. However, the formula is only mathematically valid when each fraction is in irreducible form. Reducing each fraction gives 25,25,25,\frac{2}{5}, \frac{2}{5}, \frac{2}{5}, and 34\frac{3}{4}, whose true LCM is LCM(2,3)HCF(5,4)=61=6\frac{\text{LCM}(2, 3)}{\text{HCF}(5, 4)} = \frac{6}{1} = 6.

Question 23 · Foundation Drill

When a positive integer NN is divided by 4242, the remainder is 1414. Which of the following could be the remainder when NN is divided by 6363?

  1. A

    21

  2. B

    28

  3. C

    35

  4. D

    49

Show answer and explanation

Answer: (C) 35

When two divisors share a common factor g=gcd⁡(d1,d2)g = \gcd(d_1, d_2), any number NN must leave a consistent remainder modulo gg regardless of whether it is divided by d1d_1 or d2d_2. Here, gcd⁡(42,63)=21\gcd(42, 63) = 21. Since N=42k+14N = 42k + 14, N≡14(mod21)N \equiv 14 \pmod{21}. Therefore, any valid remainder RR upon division by 63 must satisfy R≡14(mod21)R \equiv 14 \pmod{21} and 0≤R<630 \le R < 63. 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 (7684×8423×9517)(7^{684} \times 8^{423} \times 9^{517})?

  1. A

    2

  2. B

    4

  3. C

    6

  4. D

    8

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 7684=74k≡17^{684} = 7^{4k} \equiv 1. Powers of 8 have a 4-step cycle (8, 4, 2, 6), so 8423=84k+3≡28^{423} = 8^{4k+3} \equiv 2. Powers of 9 alternate between 9 and 1 with period 2, so 9517=9odd≡99^{517} = 9^{\text{odd}} \equiv 9. The product of these terminal digits is 1×2×9=181 \times 2 \times 9 = 18, which leaves a units digit of 8.

Question 25 · Foundation Drill

What is the units digit of the sum (42873)3825+(71457)4291(42873)^{3825} + (71457)^{4291}?

  1. A

    0

  2. B

    4

  3. C

    6

  4. D

    8

Show answer and explanation

Answer: (C) 6

The units digit of any large power BEB^E is determined entirely by the units digit of base BB and the value of E(mod4)E \pmod 4. For (42873)3825(42873)^{3825}, the base ends in 3 and 3825≡25≡1(mod4)3825 \equiv 25 \equiv 1 \pmod 4, so the last digit is 31=33^1 = 3. For (71457)4291(71457)^{4291}, the base ends in 7 and 4291≡91≡3(mod4)4291 \equiv 91 \equiv 3 \pmod 4, so the last digit is 73=343→37^3 = 343 \to 3. Adding the two results gives 3+3=63 + 3 = 6.

Study this concept with interactive practice in PrepSoc.

Open the concept library