Free CAT library

Practice Set 2: Advanced & CAT Exam-Level Drill

Rigorous 25-question advanced drill mirroring Chapter 8 Exercise 2 with multi-variable constraints and authentic CAT-level traps.

Practice Set 2: Advanced & CAT Exam-Level Drill

This advanced set tests multi-step problems, subtle algebraic traps, and non-trivial speed shortcuts for Numbers & Number Theory. Solve without looking at hints for full exam simulation.

Traps and tips

  • Watch out for multi-entity dependent chains where variables depend on intermediate quantities.
  • Check for boundary cases and integer constraints before picking options.
  • Leverage standard speed shortcuts to eliminate distractor options within 30 seconds.

Practice questions

Question 1 · CAT Level

If the value of the finite continued fraction

x = 2 + \cfrac{1}{3 + \cfrac{1}{1 + \cfrac{1}{2 + \cfrac{1}{1 + \cfrac{1}{3}}}}}}

is expressed in the irreducible form pq\frac{p}{q}, where pp and qq are co-prime positive integers, what is the value of p+qp + q?

  1. A

    183

  2. B

    179

  3. C

    187

  4. D

    191

Show answer and explanation

Answer: (A) 183

To evaluate the continued fraction x=[2;3,1,2,1,3]x = [2; 3, 1, 2, 1, 3], work from the bottom upwards: 1+13=431 + \frac{1}{3} = \frac{4}{3}, then 2+34=1142 + \frac{3}{4} = \frac{11}{4}, then 1+411=15111 + \frac{4}{11} = \frac{15}{11}, then 3+1115=56153 + \frac{11}{15} = \frac{56}{15}, and finally 2+1556=127562 + \frac{15}{56} = \frac{127}{56}. Because 127 is prime and does not divide 56, the fraction is irreducible with p=127p = 127 and q=56q = 56. Their sum is p+q=127+56=183p + q = 127 + 56 = 183. Alternatively, the standard convergent recurrence table computes p5=127p_5 = 127 and q5=56q_5 = 56 directly.

Question 2 · CAT Level

Let N=354a82bN = 354a82b be a 7-digit positive integer divisible by 36, where aa and bb are single decimal digits. What is the minimum possible value of (a−b)(a - b)?

  1. A

    -3

  2. B

    -2

  3. C

    5

  4. D

    -5

Show answer and explanation

Answer: (A) -3

For N=354a82bN = 354a82b to be divisible by 36, it must be divisible by both 4 and 9. For divisibility by 4, the number 2b2b formed by the last two digits must be divisible by 4, which gives b∈{0,4,8}b \in \{0, 4, 8\}. For divisibility by 9, the digital sum 3+5+4+a+8+2+b=22+a+b3 + 5 + 4 + a + 8 + 2 + b = 22 + a + b must be a multiple of 9, meaning a+b∈{5,14}a + b \in \{5, 14\}. Testing each candidate for bb: if b=0b = 0, then a=5a = 5 and a−b=5a - b = 5; if b=4b = 4, then a=1a = 1 and a−b=−3a - b = -3; if b=8b = 8, then a=6a = 6 and a−b=−2a - b = -2. The minimum value among these candidate differences is −3-3.

Question 3 · CAT Level

What is the largest natural number that divides 739, 969, and 1087 leaving remainders of 11, 17, and 23 respectively?

  1. A

    56

  2. B

    112

  3. C

    28

  4. D

    84

Show answer and explanation

Answer: (A) 56

When a number dd divides A,B,A, B, and CC leaving remainders r1,r2,r_1, r_2, and r3r_3, it must divide (A−r1)(A - r_1), (B−r2)(B - r_2), and (C−r3)(C - r_3) with d>max⁡(r1,r2,r3)d > \max(r_1, r_2, r_3). Here, 739−11=728739 - 11 = 728, 969−17=952969 - 17 = 952, and 1087−23=10641087 - 23 = 1064. Taking differences: 952−728=224952 - 728 = 224 and 1064−952=1121064 - 952 = 112. The greatest common divisor of these differences is 112. Testing factors of 112: 112 does not divide 728, but 56 divides 728 (56×1356 \times 13), 952 (56×1756 \times 17), and 1064 (56×1956 \times 19). Because 56>2356 > 23, the largest natural number satisfying the given conditions is 56.

Question 4 · CAT Level

A positive integer NN when divided successively by 11, 9, and 7 leaves remainders of 5, 4, and 3 respectively. If NN is the smallest such positive integer, what is the sum of the remainders obtained when NN is divided successively by 8 and 6?

  1. A

    3

  2. B

    5

  3. C

    7

  4. D

    10

Show answer and explanation

Answer: (A) 3

In successive division, each division operates on the quotient from the preceding step. Setting the last quotient to 0 yields the smallest positive dividend: q2=7(0)+3=3q_2 = 7(0) + 3 = 3, q1=9(3)+4=31q_1 = 9(3) + 4 = 31, and N=11(31)+5=346N = 11(31) + 5 = 346. Now, divide 346 successively by 8 and 6: dividing 346 by 8 gives a quotient of 43 and a remainder R1=2R_1 = 2; dividing that quotient 43 by 6 gives a quotient of 7 and a remainder R2=1R_2 = 1. The sum of these two remainders is R1+R2=2+1=3R_1 + R_2 = 2 + 1 = 3.

Question 5 · CAT Level

In a division operation, the divisor is 12 times the quotient and 5 times the remainder. If the remainder is 24, what is the value of the dividend?

  1. A

    1224

  2. B

    1200

  3. C

    1464

  4. D

    1248

Show answer and explanation

Answer: (A) 1224

According to the division algorithm, Dividend=(Divisor×Quotient)+Remainder\text{Dividend} = (\text{Divisor} \times \text{Quotient}) + \text{Remainder}. Given R=24R = 24 and Divisor=5R\text{Divisor} = 5R, the divisor is 5×24=1205 \times 24 = 120. Since the divisor is also 12 times the quotient, Quotient=12012=10\text{Quotient} = \frac{120}{12} = 10. Substituting these values into the division formula gives Dividend=(120×10)+24=1200+24=1224\text{Dividend} = (120 \times 10) + 24 = 1200 + 24 = 1224.

Question 6 · CAT Level

Two positive integers, when divided independently by a certain positive divisor DD, leave remainders of 347347 and 485485, respectively. When the sum of these two integers is divided by the same divisor DD, the remainder obtained is 114114. What is the value of the divisor DD?

  1. A

    832832

  2. B

    718718

  3. C

    604604

  4. D

    946946

Show answer and explanation

Answer: (B) 718

When two numbers leaving remainders r1r_1 and r2r_2 are added, the sum leaves a remainder of (r1+r2)(modD)(r_1 + r_2) \pmod D. Since r1,r2<Dr_1, r_2 < D, their sum r1+r2<2Dr_1 + r_2 < 2D. If r1+r2≥Dr_1 + r_2 \ge D, the remainder of the sum is r3=r1+r2−Dr_3 = r_1 + r_2 - D, which gives D=r1+r2−r3D = r_1 + r_2 - r_3. Substituting r1=347r_1 = 347, r2=485r_2 = 485, and r3=114r_3 = 114 yields D=347+485−114=718D = 347 + 485 - 114 = 718. Since 718>485718 > 485, it is the unique valid divisor.

Question 7 · CAT Level

Find the remainder when 5985^{98} is divided by 1919.

  1. A

    44

  2. B

    66

  3. C

    99

  4. D

    1515

Show answer and explanation

Answer: (A) 4

By Fermat's Little Theorem, ap−1≡1(modp)a^{p-1} \equiv 1 \pmod p for any prime pp and gcd⁡(a,p)=1\gcd(a, p) = 1. Since 1919 is prime, 518≡1(mod19)5^{18} \equiv 1 \pmod{19}. Dividing the exponent 9898 by 1818 gives 98=18×5+898 = 18 \times 5 + 8, so 598≡(518)5×58≡15×58≡58(mod19)5^{98} \equiv (5^{18})^5 \times 5^8 \equiv 1^5 \times 5^8 \equiv 5^8 \pmod{19}. By successive squaring, 52=25≡6(mod19)5^2 = 25 \equiv 6 \pmod{19}, 54≡62=36≡−2(mod19)5^4 \equiv 6^2 = 36 \equiv -2 \pmod{19}, and 58≡(−2)2=4(mod19)5^8 \equiv (-2)^2 = 4 \pmod{19}. Hence, the remainder is 44.

Question 8 · CAT Level

For how many natural numbers n≤60n \le 60 is (n−1)!(n-1)! not a multiple of nn?

  1. A

    1717

  2. B

    1919

  3. C

    1818

  4. D

    1616

Show answer and explanation

Answer: (C) 18

By Wilson's Theorem, (p−1)!≡−1(modp)(p-1)! \equiv -1 \pmod p for every prime pp, so (n−1)!(n-1)! is never a multiple of nn for prime nn. For any composite n>4n > 4, the factors of nn always appear in (n−1)!(n-1)!, making (n−1)!(n-1)! a multiple of nn. For n=1n = 1, 0!=10! = 1 is a multiple of 11. For n=4n = 4, 3!=63! = 6 is not a multiple of 44. Thus, (n−1)!(n-1)! is not a multiple of nn if and only if nn is prime or n=4n = 4. Up to 6060, there are 1717 prime numbers (2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,592, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59). Adding n=4n = 4 gives 17+1=1817 + 1 = 18 values.

Question 9 · CAT Level

Let mm be any positive even integer, and let u=m2+6mu = m^2 + 6m. What is the greatest positive integer that divides (u2+8u)(u^2 + 8u) for all such values of mm?

  1. A

    192192

  2. B

    9696

  3. C

    768768

  4. D

    384384

Show answer and explanation

Answer: (D) 384

Factor the expression u2+8u=u(u+8)u^2 + 8u = u(u + 8). Substituting u=m2+6mu = m^2 + 6m gives m(m+6)(m2+6m+8)=m(m+2)(m+4)(m+6)m(m + 6)(m^2 + 6m + 8) = m(m + 2)(m + 4)(m + 6). Since mm is even, let m=2km = 2k. The expression becomes 2k⋅2(k+1)⋅2(k+2)⋅2(k+3)=16k(k+1)(k+2)(k+3)2k \cdot 2(k + 1) \cdot 2(k + 2) \cdot 2(k + 3) = 16 k(k + 1)(k + 2)(k + 3). The product of any 44 consecutive integers is always divisible by 4!=244! = 24. Thus, the expression is always divisible by 16×24=38416 \times 24 = 384. For m=2m = 2, the expression equals 384384, proving that 384384 is the greatest such integer.

Question 10 · CAT Level

The HCF and LCM of two positive integers are 1818 and 21602160, respectively. If the sum of the two integers is 414414, what is the value of the larger integer?

  1. A

    144144

  2. B

    270270

  3. C

    288288

  4. D

    216216

Show answer and explanation

Answer: (B) 270

Let the numbers be 18a18a and 18b18b with gcd⁡(a,b)=1\gcd(a, b) = 1. Their LCM is 18ab=216018ab = 2160, so ab=120ab = 120. Their sum is 18(a+b)=41418(a + b) = 414, so a+b=23a + b = 23. The quadratic equation with roots aa and bb is t2−23t+120=0t^2 - 23t + 120 = 0, giving (t−15)(t−8)=0(t - 15)(t - 8) = 0. Thus, a=8a = 8 and b=15b = 15. Checking co-primality, gcd⁡(8,15)=1\gcd(8, 15) = 1. The numbers are 18×8=14418 \times 8 = 144 and 18×15=27018 \times 15 = 270. The larger integer is 270270.

Question 11 · CAT Level

What is the largest five-digit natural number that leaves a remainder of 66 when divided by 99 and a remainder of 44 when divided by 77?

  1. A

    99978

  2. B

    99984

  3. C

    99942

  4. D

    99996

Show answer and explanation

Answer: (A) 99978

Simultaneous congruence problems where divisors and remainders share a common difference (d−r=c)(d - r = c) are most swiftly solved via negative remainder theory. Here, 9−6=39 - 6 = 3 and 7−4=37 - 4 = 3, which establishes that N+3N + 3 is a multiple of lcm(9,7)=63\text{lcm}(9, 7) = 63, or equivalently N=63k−3N = 63k - 3. The largest five-digit number is 9999999999. Dividing 9999999999 by 6363 yields a quotient of 15871587 and a remainder of 1818. To obtain a remainder of −3-3 (or 6060) modulo 6363, we subtract 18−(−3)=2118 - (-3) = 21 from 9999999999, arriving at 9997899978. A common student error is subtracting 1818 directly to get 9998199981, forgetting that 9998199981 is an exact multiple of 6363 leaving zero remainder rather than 6060.

Question 12 · CAT Level

For any prime number p>3p > 3, what is the greatest positive integer that always divides (p2−1)(p2+11)(p^2 - 1)(p^2 + 11)?

  1. A

    144

  2. B

    288

  3. C

    576

  4. D

    72

Show answer and explanation

Answer: (B) 288

Every prime p>3p > 3 satisfies two fundamental properties: p2≡1(mod8)p^2 \equiv 1 \pmod 8 and p2≡1(mod3)p^2 \equiv 1 \pmod 3, which makes p2−1p^2 - 1 inherently divisible by 24=23×324 = 2^3 \times 3. The accompanying factor p2+11p^2 + 11 can be expressed as (p2−1)+12(p^2 - 1) + 12. Modulo 33, (p2−1)+12≡0+0=0(p^2 - 1) + 12 \equiv 0 + 0 = 0, giving an extra factor of 33. Modulo powers of 22, p2−1=8mp^2 - 1 = 8m, so p2+11=8m+12=4(2m+3)p^2 + 11 = 8m + 12 = 4(2m + 3), where 2m+32m + 3 is odd, contributing exactly 22=42^2 = 4. Multiplying these prime components yields 23+2×31+1=32×9=2882^{3+2} \times 3^{1+1} = 32 \times 9 = 288. Evaluating p=5p = 5 and p=7p = 7 yields 864864 and 28802880, confirming that gcd⁡(864,2880)=288\gcd(864, 2880) = 288 is the strict maximum.

Question 13 · CAT Level

Three titanium alloy rods have lengths of 330 cm330\text{ cm}, 462 cm462\text{ cm}, and 693 cm693\text{ cm}. They are to be cut into equal pieces of maximum possible integer length without any wastage. What is the minimum total number of pieces obtained?

  1. A

    33

  2. B

    45

  3. C

    49

  4. D

    55

Show answer and explanation

Answer: (B) 45

This problem tests the classic HCF optimization model where items of differing sizes must be partitioned into identical sub-units without wastage. The number of pieces is inversely proportional to the cut length, so minimizing the total count requires maximizing the cut length to gcd⁡(330,462,693)=33 cm\gcd(330, 462, 693) = 33\text{ cm}. A primary exam trap is selecting 3333 (Option A), which is the size of each piece rather than the total count of pieces. Another trap is selecting 4949 from unverified mental arithmetic. The correct count is (330+462+693)/33=1485/33=45(330 + 462 + 693) / 33 = 1485 / 33 = 45.

Question 14 · CAT Level

Find the largest positive integer kk such that 72k72^k divides 180!180!.

  1. A

    58

  2. B

    44

  3. C

    88

  4. D

    55

Show answer and explanation

Answer: (B) 44

Finding the highest power of a composite divisor p1a1p2a2p_1^{a_1} p_2^{a_2} requires evaluating Legendre's formula for both prime bases and determining which prime power acts as the limiting constraint. For 72=23×3272 = 2^3 \times 3^2 in 180!180!, E2(180!)=176E_2(180!) = 176, allowing ⌊176/3⌋=58\lfloor 176/3 \rfloor = 58 groups of 232^3. For 33, E3(180!)=88E_3(180!) = 88, which permits ⌊88/2⌋=44\lfloor 88/2 \rfloor = 44 groups of 323^2. The bottleneck is 4444. A common mistake is calculating only E2/3=58E_2/3 = 58 under the incorrect assumption that the prime with the higher exponent in 7272 (namely 232^3) is always the constraint, neglecting that powers of larger primes grow significantly slower.

Question 15 · CAT Level

Let nn be an integer strictly greater than 44. Which of the following numbers need NOT always divide the expression E=(n3−n)(n4−20n2+64)E = (n^3 - n)(n^4 - 20n^2 + 64)?

  1. A

    168

  2. B

    48

  3. C

    210

  4. D

    280

Show answer and explanation

Answer: (B) 48

By factorizing E=(n3−n)(n4−20n2+64)E = (n^3 - n)(n^4 - 20n^2 + 64), we obtain seven distinct linear terms: (n−4)(n−2)(n−1)n(n+1)(n+2)(n+4)(n - 4)(n - 2)(n - 1)n(n + 1)(n + 2)(n + 4). Although these are not seven consecutive integers (since n±3n \pm 3 are omitted), their modular projections modulo 77 (n−4≡n+3n - 4 \equiv n + 3 and n+4≡n−3n + 4 \equiv n - 3) and modulo 55 (n−4≡n+1n - 4 \equiv n + 1 and n+4≡n−1n + 4 \equiv n - 1) form complete residue systems, guaranteeing divisibility by both 77 and 55. Divisibility by 33 is assured by (n−1)n(n+1)(n - 1)n(n + 1). However, when nn is odd, only (n−1)(n - 1) and (n+1)(n + 1) are even, giving at most 23=82^3 = 8. Thus the greatest guaranteed divisor is 8×3×5×7=8408 \times 3 \times 5 \times 7 = 840. Since 168168, 210210, and 280280 are all factors of 840840, they always divide EE. The number 48=16×348 = 16 \times 3 requires four powers of 22, failing for n=5n = 5 where E(5)=22680=48×472.5E(5) = 22680 = 48 \times 472.5.

Question 16 · CAT Level

What is the sum of all positive integers strictly less than 84 that are co-prime to 84?

  1. A

    924

  2. B

    1008

  3. C

    1092

  4. D

    2016

Show answer and explanation

Answer: (B) 1008

The sum of all positive integers less than NN and co-prime to NN is given by N×ϕ(N)2\frac{N \times \phi(N)}{2}. For N=84=22×3×7N = 84 = 2^2 \times 3 \times 7, the number of co-prime residues is ϕ(84)=84×12×23×67=24\phi(84) = 84 \times \frac{1}{2} \times \frac{2}{3} \times \frac{6}{7} = 24. Therefore, the sum is 84×242=1008\frac{84 \times 24}{2} = 1008.

Question 17 · CAT Level

Three telemetry transmitters in an IoT sensor node transmit data simultaneously for 4 seconds at t=0t = 0. After each transmission burst, transmitter A enters sleep mode for 4124\frac{1}{2} seconds, transmitter B for 7137\frac{1}{3} seconds, and transmitter C for 8348\frac{3}{4} seconds. After their respective sleep periods, each transmitter immediately begins its next 4-second transmission burst. How many seconds after t=0t = 0 will all three transmitters begin transmitting simultaneously again?

  1. A

    51 seconds

  2. B

    102 seconds

  3. C

    153 seconds

  4. D

    204 seconds

Show answer and explanation

Answer: (B) 102 seconds

Each transmitter's cycle period is the sum of its transmission time and sleep time: TA=4+412=172T_A = 4 + 4\frac{1}{2} = \frac{17}{2} s, TB=4+713=343T_B = 4 + 7\frac{1}{3} = \frac{34}{3} s, and TC=4+834=514T_C = 4 + 8\frac{3}{4} = \frac{51}{4} s. The simultaneous transmission occurs at the LCM of these fractional periods. Using LCM(ab,cd,ef)=LCM(a,c,e)HCF(b,d,f)\text{LCM}\left(\frac{a}{b}, \frac{c}{d}, \frac{e}{f}\right) = \frac{\text{LCM}(a, c, e)}{\text{HCF}(b, d, f)}, we find LCM(17,34,51)=102\text{LCM}(17, 34, 51) = 102 and HCF(2,3,4)=1\text{HCF}(2, 3, 4) = 1. Thus, the next simultaneous transmission occurs after 102 seconds.

Question 18 · CAT Level

Let yy be an integer such that 1≤y≤61 \le y \le 6, and let x=y2−yx = y^2 - y. What is the greatest natural number that divides (x3−4x)(x^3 - 4x) for all possible values of yy?

  1. A

    12

  2. B

    24

  3. C

    48

  4. D

    96

Show answer and explanation

Answer: (C) 48

Factoring gives x3−4x=x(x−2)(x+2)x^3 - 4x = x(x - 2)(x + 2). Substituting x=y(y−1)x = y(y - 1) yields x(x−2)=(y−2)(y−1)y(y+1)x(x - 2) = (y - 2)(y - 1)y(y + 1), which represents four consecutive integers and is always divisible by 4!=244! = 24. The third factor x+2=y(y−1)+2x + 2 = y(y - 1) + 2 is an even number plus 2, hence always divisible by 2. Thus, the expression is always divisible by 24×2=4824 \times 2 = 48. Evaluating at y=3y = 3 gives 192 and at y=4y = 4 gives 1680; since gcd⁡(192,1680)=48\gcd(192, 1680) = 48, 48 is the greatest such integer.

Question 19 · CAT Level

For each integer k∈{1,2,3,…,90}k \in \{1, 2, 3, \dots, 90\}, a set SkS_k of six consecutive integers is defined as Sk={k,k+1,k+2,k+3,k+4,k+5}S_k = \{k, k+1, k+2, k+3, k+4, k+5\}. How many of these 90 sets contain at least one multiple of 7?

  1. A

    74

  2. B

    76

  3. C

    77

  4. D

    78

Show answer and explanation

Answer: (C) 77

A set of 6 consecutive integers misses a multiple of 7 if and only if the remainders modulo 7 are {1,2,3,4,5,6}\{1, 2, 3, 4, 5, 6\}, which occurs when k≡1(mod7)k \equiv 1 \pmod{7}. In the range 1≤k≤901 \le k \le 90, the integers of the form k=7m+1k = 7m + 1 correspond to m=0,1,2,…,12m = 0, 1, 2, \dots, 12, giving 12−0+1=1312 - 0 + 1 = 13 sets without any multiple of 7. Subtracting from the 90 total sets gives 90−13=7790 - 13 = 77 sets that contain at least one multiple of 7.

Question 20 · CAT Level

Let aa, bb, cc, and nn be positive integers satisfying the equation an+bn=cna^n + b^n = c^n. Which of the following inequalities MUST be true?

  1. A

    n≤min⁡(a,b,c)n \le \min(a, b, c)

  2. B

    n≥min⁡(a,b)n \ge \min(a, b)

  3. C

    c≥a+bc \ge a + b

  4. D

    a+b+c≤3na + b + c \le 3n

Show answer and explanation

Answer: (A) n (a, b, c)

By Fermat's Last Theorem, an+bn=cna^n + b^n = c^n has positive integer solutions only for n=1n = 1 and n=2n = 2. For n=1n = 1, a+b=ca + b = c means min⁡(a,b,c)=min⁡(a,b)≥1=n\min(a, b, c) = \min(a, b) \ge 1 = n. For n=2n = 2, (a,b,c)(a, b, c) is a Pythagorean triple with minimal legs ≥3\ge 3, meaning min⁡(a,b,c)≥3>2=n\min(a, b, c) \ge 3 > 2 = n. Hence, n≤min⁡(a,b,c)n \le \min(a, b, c) holds unconditionally for all positive integer solutions.

Question 21 · CAT Level

Which of the following statements is necessarily true?

  1. A

    The sum of any two distinct composite numbers is always a composite number.

  2. B

    For every prime number pp, the integer 2p−12^p - 1 is always a prime number.

  3. C

    If two positive integers aa and bb are co-prime, then (a+b)(a + b) and (a−b)(a - b) are always co-prime.

  4. D

    None of these

Show answer and explanation

Answer: (D) None of these

A universal mathematical statement requires a rigorous proof, whereas a single counterexample is sufficient to invalidate it. Statement A fails because the sum of two distinct composite numbers can be prime (for example, 4+9=134 + 9 = 13). Statement B fails because 2p−12^p - 1 is not prime for all primes pp; for p=11p = 11, 211−1=2047=23×892^{11} - 1 = 2047 = 23 \times 89 is composite. Statement C fails because if aa and bb are both odd co-prime integers (such as a=5a = 5 and b=3b = 3), then both a+b=8a + b = 8 and a−b=2a - b = 2 are even, giving gcd⁡(a+b,a−b)=2≠1\gcd(a+b, a-b) = 2 \ne 1. Hence, none of the statements is necessarily true.

Question 22 · CAT Level

Let NN be a composite positive integer that is not a perfect square. Consider the following three statements:

I. NN has at least one positive factor dd satisfying 1<d<N1 < d < \sqrt{N}.

II. The total number of positive factors of NN strictly less than (\sqrt{N}) is equal to the total number of positive factors of NN strictly greater than (\sqrt{N}).

III. Every factor of NN lying strictly between N\sqrt{N} and NN must be a composite number.

Which of the above statements is/are necessarily true?

  1. A

    Only I

  2. B

    Only I and II

  3. C

    Only II and III

  4. D

    I, II, and III

Show answer and explanation

Answer: (B) Only I and II

Every divisor dd of a positive integer NN corresponds to a unique paired divisor N/dN/d. Because NN is not a perfect square, N\sqrt{N} is irrational and no divisor equals N\sqrt{N}. For Statement I, a composite number must have at least one prime factor p≤Np \le \sqrt{N}; since NN is non-square, p<Np < \sqrt{N}, making Statement I true. For Statement II, the pairing d↔N/dd \leftrightarrow N/d is a bijection between divisors strictly less than N\sqrt{N} and divisors strictly greater than N\sqrt{N}, so their counts are identical, making Statement II true. For Statement III, testing N=10N = 10 gives factors {1,2,5,10}\{1, 2, 5, 10\} with 10≈3.16\sqrt{10} \approx 3.16; the factor 5 lies strictly between 10\sqrt{10} and 10 and is prime, disproving Statement III. Hence, only Statements I and II are necessarily true.

Question 23 · CAT Level

A payment processor needs to settle three separate transaction charges of 7474 cents, $1.16\text{\textdollar}1.16, and 8787 cents using the minimum total number of tokens selected from available denominations of 22 cents, 55 cents, 1010 cents, 2525 cents, and 5050 cents. What is the minimum total number of tokens required to settle all three transactions?

  1. A

    14

  2. B

    15

  3. C

    16

  4. D

    17

Show answer and explanation

Answer: (B) 15

Because all available denominations except 2 cents (50, 25, 10, and 5 cents) are divisible by 5, the number of 2-cent tokens is strictly constrained by the remainder of each charge modulo 5. Specifically, n2≡3A(mod5)n_2 \equiv 3A \pmod 5. For 74 cents, 74≡4(mod5)74 \equiv 4 \pmod 5, requiring at least two 2-cent tokens; the remaining 70 cents requires three tokens (50+10+1050 + 10 + 10), giving 5 tokens. For 116 cents, 116≡1(mod5)116 \equiv 1 \pmod 5, requiring at least three 2-cent tokens; the remaining 110 cents requires three tokens (50+50+1050 + 50 + 10), giving 6 tokens. For 87 cents, 87≡2(mod5)87 \equiv 2 \pmod 5, requiring at least one 2-cent token; the remaining 85 cents requires three tokens (50+25+1050 + 25 + 10), giving 4 tokens. Adding the minimum tokens across the three charges yields 5+6+4=155 + 6 + 4 = 15 tokens.

Question 24 · CAT Level

A cloud hosting provider charges $6.00\text{\textdollar}6.00 per compute unit for orders of up to 400400 units. For every additional batch of 2020 units purchased beyond 400400, the price of every unit in the entire order decreases by 1010 cents. What total order size maximizes the provider's total revenue?

  1. A

    600 units

  2. B

    700 units

  3. C

    800 units

  4. D

    1,000 units

Show answer and explanation

Answer: (C) 800 units

Let xx be the number of additional batches of 20 units purchased beyond 400. The total quantity ordered is Q=400+20xQ = 400 + 20x and the price per unit is P=6.00−0.10xP = 6.00 - 0.10x. The revenue function is the quadratic R(x)=(400+20x)(6.00−0.10x)=−2x2+80x+2400R(x) = (400 + 20x)(6.00 - 0.10x) = -2x^2 + 80x + 2400. Since the coefficient of x2x^2 is negative (−2-2), the maximum revenue occurs at the vertex x=−b2a=804=20x = -\frac{b}{2a} = \frac{80}{4} = 20. Substituting x=20x = 20 into the quantity equation yields the optimal order size Q=400+20(20)=800Q = 400 + 20(20) = 800 units, generating a maximum revenue of 800×4.00=3,200800 \times 4.00 = 3,200 dollars.

Question 25 · CAT Level

Let a,b,a, b, and cc be three positive integers such that a+b+c=6k+8a + b + c = 6k + 8, where kk is a positive integer. What is the minimum possible value of (a2+b2+c2)(a^2 + b^2 + c^2) in terms of kk?

  1. A

    12k2+32k+2012k^2 + 32k + 20

  2. B

    12k2+32k+2212k^2 + 32k + 22

  3. C

    12k2+32k+2412k^2 + 32k + 24

  4. D

    12k2+32k+2612k^2 + 32k + 26

Show answer and explanation

Answer: (B) 12k^2 + 32k + 22

When the sum of several positive integers is constant, the sum of their squares is minimized when the integers are as nearly equal as possible (differing by at most 1). Dividing 6k+86k + 8 by 3 gives a quotient of 2k+22k + 2 with a remainder of 2. Distributing this remainder yields the integers (2k+3)(2k + 3), (2k+3)(2k + 3), and (2k+2)(2k + 2). Squaring and summing these terms gives 2(2k+3)2+(2k+2)2=2(4k2+12k+9)+(4k2+8k+4)=12k2+32k+222(2k + 3)^2 + (2k + 2)^2 = 2(4k^2 + 12k + 9) + (4k^2 + 8k + 4) = 12k^2 + 32k + 22.

Study this concept with interactive practice in PrepSoc.

Open the concept library