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 , where and are co-prime positive integers, what is the value of ?
Show answer and explanation
Answer: (A) 183
To evaluate the continued fraction , work from the bottom upwards: , then , then , then , and finally . Because 127 is prime and does not divide 56, the fraction is irreducible with and . Their sum is . Alternatively, the standard convergent recurrence table computes and directly.
Question 2 · CAT Level
Let be a 7-digit positive integer divisible by 36, where and are single decimal digits. What is the minimum possible value of ?
Show answer and explanation
Answer: (A) -3
For to be divisible by 36, it must be divisible by both 4 and 9. For divisibility by 4, the number formed by the last two digits must be divisible by 4, which gives . For divisibility by 9, the digital sum must be a multiple of 9, meaning . Testing each candidate for : if , then and ; if , then and ; if , then and . The minimum value among these candidate differences is .
Question 3 · CAT Level
What is the largest natural number that divides 739, 969, and 1087 leaving remainders of 11, 17, and 23 respectively?
Show answer and explanation
Answer: (A) 56
When a number divides and leaving remainders and , it must divide , , and with . Here, , , and . Taking differences: and . The greatest common divisor of these differences is 112. Testing factors of 112: 112 does not divide 728, but 56 divides 728 (), 952 (), and 1064 (). Because , the largest natural number satisfying the given conditions is 56.
Question 4 · CAT Level
A positive integer when divided successively by 11, 9, and 7 leaves remainders of 5, 4, and 3 respectively. If is the smallest such positive integer, what is the sum of the remainders obtained when is divided successively by 8 and 6?
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: , , and . Now, divide 346 successively by 8 and 6: dividing 346 by 8 gives a quotient of 43 and a remainder ; dividing that quotient 43 by 6 gives a quotient of 7 and a remainder . The sum of these two remainders is .
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?
Show answer and explanation
Answer: (A) 1224
According to the division algorithm, . Given and , the divisor is . Since the divisor is also 12 times the quotient, . Substituting these values into the division formula gives .
Question 6 · CAT Level
Two positive integers, when divided independently by a certain positive divisor , leave remainders of and , respectively. When the sum of these two integers is divided by the same divisor , the remainder obtained is . What is the value of the divisor ?
Show answer and explanation
Answer: (B) 718
When two numbers leaving remainders and are added, the sum leaves a remainder of . Since , their sum . If , the remainder of the sum is , which gives . Substituting , , and yields . Since , it is the unique valid divisor.
Question 7 · CAT Level
Find the remainder when is divided by .
Show answer and explanation
Answer: (A) 4
By Fermat's Little Theorem, for any prime and . Since is prime, . Dividing the exponent by gives , so . By successive squaring, , , and . Hence, the remainder is .
Question 8 · CAT Level
For how many natural numbers is not a multiple of ?
Show answer and explanation
Answer: (C) 18
By Wilson's Theorem, for every prime , so is never a multiple of for prime . For any composite , the factors of always appear in , making a multiple of . For , is a multiple of . For , is not a multiple of . Thus, is not a multiple of if and only if is prime or . Up to , there are prime numbers (). Adding gives values.
Question 9 · CAT Level
Let be any positive even integer, and let . What is the greatest positive integer that divides for all such values of ?
Show answer and explanation
Answer: (D) 384
Factor the expression . Substituting gives . Since is even, let . The expression becomes . The product of any consecutive integers is always divisible by . Thus, the expression is always divisible by . For , the expression equals , proving that is the greatest such integer.
Question 10 · CAT Level
The HCF and LCM of two positive integers are and , respectively. If the sum of the two integers is , what is the value of the larger integer?
Show answer and explanation
Answer: (B) 270
Let the numbers be and with . Their LCM is , so . Their sum is , so . The quadratic equation with roots and is , giving . Thus, and . Checking co-primality, . The numbers are and . The larger integer is .
Question 11 · CAT Level
What is the largest five-digit natural number that leaves a remainder of when divided by and a remainder of when divided by ?
Show answer and explanation
Answer: (A) 99978
Simultaneous congruence problems where divisors and remainders share a common difference are most swiftly solved via negative remainder theory. Here, and , which establishes that is a multiple of , or equivalently . The largest five-digit number is . Dividing by yields a quotient of and a remainder of . To obtain a remainder of (or ) modulo , we subtract from , arriving at . A common student error is subtracting directly to get , forgetting that is an exact multiple of leaving zero remainder rather than .
Question 12 · CAT Level
For any prime number , what is the greatest positive integer that always divides ?
Show answer and explanation
Answer: (B) 288
Every prime satisfies two fundamental properties: and , which makes inherently divisible by . The accompanying factor can be expressed as . Modulo , , giving an extra factor of . Modulo powers of , , so , where is odd, contributing exactly . Multiplying these prime components yields . Evaluating and yields and , confirming that is the strict maximum.
Question 13 · CAT Level
Three titanium alloy rods have lengths of , , and . 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?
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 . A primary exam trap is selecting (Option A), which is the size of each piece rather than the total count of pieces. Another trap is selecting from unverified mental arithmetic. The correct count is .
Question 14 · CAT Level
Find the largest positive integer such that divides .
Show answer and explanation
Answer: (B) 44
Finding the highest power of a composite divisor requires evaluating Legendre's formula for both prime bases and determining which prime power acts as the limiting constraint. For in , , allowing groups of . For , , which permits groups of . The bottleneck is . A common mistake is calculating only under the incorrect assumption that the prime with the higher exponent in (namely ) is always the constraint, neglecting that powers of larger primes grow significantly slower.
Question 15 · CAT Level
Let be an integer strictly greater than . Which of the following numbers need NOT always divide the expression ?
Show answer and explanation
Answer: (B) 48
By factorizing , we obtain seven distinct linear terms: . Although these are not seven consecutive integers (since are omitted), their modular projections modulo ( and ) and modulo ( and ) form complete residue systems, guaranteeing divisibility by both and . Divisibility by is assured by . However, when is odd, only and are even, giving at most . Thus the greatest guaranteed divisor is . Since , , and are all factors of , they always divide . The number requires four powers of , failing for where .
Question 16 · CAT Level
What is the sum of all positive integers strictly less than 84 that are co-prime to 84?
Show answer and explanation
Answer: (B) 1008
The sum of all positive integers less than and co-prime to is given by . For , the number of co-prime residues is . Therefore, the sum is .
Question 17 · CAT Level
Three telemetry transmitters in an IoT sensor node transmit data simultaneously for 4 seconds at . After each transmission burst, transmitter A enters sleep mode for seconds, transmitter B for seconds, and transmitter C for seconds. After their respective sleep periods, each transmitter immediately begins its next 4-second transmission burst. How many seconds after will all three transmitters begin transmitting simultaneously again?
Show answer and explanation
Answer: (B) 102 seconds
Each transmitter's cycle period is the sum of its transmission time and sleep time: s, s, and s. The simultaneous transmission occurs at the LCM of these fractional periods. Using , we find and . Thus, the next simultaneous transmission occurs after 102 seconds.
Question 18 · CAT Level
Let be an integer such that , and let . What is the greatest natural number that divides for all possible values of ?
Show answer and explanation
Answer: (C) 48
Factoring gives . Substituting yields , which represents four consecutive integers and is always divisible by . The third factor is an even number plus 2, hence always divisible by 2. Thus, the expression is always divisible by . Evaluating at gives 192 and at gives 1680; since , 48 is the greatest such integer.
Question 19 · CAT Level
For each integer , a set of six consecutive integers is defined as . How many of these 90 sets contain at least one multiple of 7?
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 , which occurs when . In the range , the integers of the form correspond to , giving sets without any multiple of 7. Subtracting from the 90 total sets gives sets that contain at least one multiple of 7.
Question 20 · CAT Level
Let , , , and be positive integers satisfying the equation . Which of the following inequalities MUST be true?
Show answer and explanation
Answer: (A) n (a, b, c)
By Fermat's Last Theorem, has positive integer solutions only for and . For , means . For , is a Pythagorean triple with minimal legs , meaning . Hence, holds unconditionally for all positive integer solutions.
Question 21 · CAT Level
Which of the following statements is necessarily true?
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, ). Statement B fails because is not prime for all primes ; for , is composite. Statement C fails because if and are both odd co-prime integers (such as and ), then both and are even, giving . Hence, none of the statements is necessarily true.
Question 22 · CAT Level
Let be a composite positive integer that is not a perfect square. Consider the following three statements:
I. has at least one positive factor satisfying .
II. The total number of positive factors of strictly less than (\sqrt{N}) is equal to the total number of positive factors of strictly greater than (\sqrt{N}).
III. Every factor of lying strictly between and must be a composite number.
Which of the above statements is/are necessarily true?
Show answer and explanation
Answer: (B) Only I and II
Every divisor of a positive integer corresponds to a unique paired divisor . Because is not a perfect square, is irrational and no divisor equals . For Statement I, a composite number must have at least one prime factor ; since is non-square, , making Statement I true. For Statement II, the pairing is a bijection between divisors strictly less than and divisors strictly greater than , so their counts are identical, making Statement II true. For Statement III, testing gives factors with ; the factor 5 lies strictly between 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 cents, , and cents using the minimum total number of tokens selected from available denominations of cents, cents, cents, cents, and cents. What is the minimum total number of tokens required to settle all three transactions?
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, . For 74 cents, , requiring at least two 2-cent tokens; the remaining 70 cents requires three tokens (), giving 5 tokens. For 116 cents, , requiring at least three 2-cent tokens; the remaining 110 cents requires three tokens (), giving 6 tokens. For 87 cents, , requiring at least one 2-cent token; the remaining 85 cents requires three tokens (), giving 4 tokens. Adding the minimum tokens across the three charges yields tokens.
Question 24 · CAT Level
A cloud hosting provider charges per compute unit for orders of up to units. For every additional batch of units purchased beyond , the price of every unit in the entire order decreases by cents. What total order size maximizes the provider's total revenue?
Show answer and explanation
Answer: (C) 800 units
Let be the number of additional batches of 20 units purchased beyond 400. The total quantity ordered is and the price per unit is . The revenue function is the quadratic . Since the coefficient of is negative (), the maximum revenue occurs at the vertex . Substituting into the quantity equation yields the optimal order size units, generating a maximum revenue of dollars.
Question 25 · CAT Level
Let and be three positive integers such that , where is a positive integer. What is the minimum possible value of in terms of ?
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 by 3 gives a quotient of with a remainder of 2. Distributing this remainder yields the integers , , and . Squaring and summing these terms gives .
Study this concept with interactive practice in PrepSoc.
Open the concept library