Algebra - Number Theory - Previous Year CAT/MBA Questions
The best way to prepare for Algebra - Number Theory is by going through the previous year Algebra - Number Theory CAT questions. Here we bring you all previous year Algebra - Number Theory CAT questions along with detailed solutions.
Click here for previous year questions of other topics.
It would be best if you clear your concepts before you practice previous year Algebra - Number Theory CAT questions.
For any natural number n, let an be the largest integer not exceeding √n. Then the value of a1 + a2 + a3 + ... + a50 is
Answer: 217
Text Explanation :
Workspace:
The sum of all four-digit numbers thatn can be formed with the distinct non-zero digits a, b, c and d, with each digit appearing exactly once in every number, is 153310 + n, where n is a single digit natural number. Then, the value of (a + b + c + d + n) is
Answer: 31
Text Explanation :
Workspace:
Let x, y, and z be real numbers satisfying
4(x2 + y2 + z2) = a,
4(x - y - z) = 3 + a
Then a equals
- (a)
1
- (b)
4
- (c)
3
- (d)
Answer: Option C
Text Explanation :
Workspace:
When 10100 is divided by 7, the remainder is
- (a)
3
- (b)
6
- (c)
1
- (d)
4
Answer: Option D
Text Explanation :
Workspace:
If x and y are real numbers such that 4x2 + 4y2 - 4xy - 6y + 3 = 0, then the value of (4x + 5y) is
Answer: 7
Text Explanation :
Workspace:
When 3333 is divided by 11, the remainder is
- (a)
5
- (b)
6
- (c)
1
- (d)
10
Answer: Option A
Text Explanation :
Workspace:
If 1068 is divided by 13, the remainder is
- (a)
9
- (b)
8
- (c)
4
- (d)
5
Answer: Option A
Text Explanation :
Workspace:
If x and y are real numbers such that x2 + (x – 2y - 1)2 = -4y(x + y), then the value of x - 2y is?
- (a)
1
- (b)
-1
- (c)
2
- (d)
0
Answer: Option A
Text Explanation :
Given, x2 + (x – 2y - 1)2 = -4y(x + y)
⇒ x2 + (x – 2y - 1)2 = -4yx - 4y2
⇒ x2 + 4yx + 4y2 + (x – 2y - 1)2 = 0
⇒ (x2 + 2 × x × 2y + (2y)2) + (x – 2y - 1)2 = 0
⇒ (x + 2y)2 + (x – 2y - 1)2 = 0
Sum of squares of two number can be 0 only when both the numbers are 0.
∴ x + 2y = 0 and x – 2y – 1 = 0
⇒ x – 2y = 1
Hence, option (a).
Workspace:
Let n be the least positive integer such that 168 is a factor of 1134n. If m is the least positive integer such that 1134n is a factor of 168m, then m + n equals
- (a)
24
- (b)
12
- (c)
15
- (d)
9
Answer: Option C
Text Explanation :
168 = 23 × 21 = 23 × 3 × 7
1134 = 2 × 567 = 2 × 34 × 7
Now (1134)n = 2n × 34n × 7n
Since 168 (23 × 3 × 7) completely divides 1134n (2n × 34n × 7n)
⇒ Power of 2 in 1134n ≥ Power of 2 in 168
⇒ n ≥ 3
Similarly, we can check for power of 3 and power of 7 and we get the least value of n = 3.
Now (168)m = 23m × 3m × 7m
Since 1134n (2n × 34n × 7n = 23 × 312 × 73) completely divides 168m (23m × 3m × 7m)
⇒ Power of 3 in 168m ≥ Power of 3 in 1134n
⇒ m ≥ 12
Similarly, we can check for power of 2 and power of 7 and we get the least value of m = 12.
∴ n + m = 3 + 12 = 15
Hence, option (c).
Concept:
Workspace:
For any natural numbers m, n and k, such that k divides both m + 2n and 3m + 4n, k must be a common divisor of
- (a)
m and n
- (b)
m and 2n
- (c)
2m and 3n
- (d)
2m and n
Answer: Option B
Text Explanation :
For any natural numbers m, n and k, such that k divides both m + 2n and 3m + 4n, k must be a common divisor of
k divides m + 2n ⇒ m + 2n = a × k ...(1)
k divides 3m + 4n ⇒ 3m + 4n = b × k ...(2)
(1) × 3 - (2)
⇒ 3m + 6n - (3m + 4n) = 3ak - bk
⇒ 2n = (3a - b)k
∴ 2n is divisible by k
(2) - (1) × 2
⇒ 3m + 4n - 2(m + 2n) = bk - 2ak
⇒ m = (b - 2a)k
∴ m is divisible by k
∴ 2n and m are divisible by k
⇒ k is common divisor of 2n and m.
Hence, option (b).
Workspace:
The number of positive integers less than 50, having exactly two distinct factors other than 1 and itself, is
Answer: 15
Text Explanation :
Positive integers having exactly two distinct factors other than 1 and itself will be of the form a × b or a3, where a and b are prime numbers.
Case 1: a × b < 50. Possible combinations are:
If one of them is 2, the other prime number can be 3, 5, 7, 11, 13, 17, 19, 23 i.e., 8 possibilities.
If one of them is 3, the other prime number can be 5, 7, 11, 13 i.e., 4 possibilities.
If one of them is 5, the other prime number can be 7 i.e., 1 possibility.
∴ 13 cases.
Case 2: a3. Possible values of a are 2 and 3 i.e., numbers are 8 and 27.
∴ 2 cases.
∴ Total 13 + 2 = 15 such numbers are possible.
Hence, 15.
Concept:
Workspace:
If p2 + q2 - 29 = 2pq - 20 = 52 - 2pq, then the difference between the maximum and minimum possible value of (p3 - q3) is
- (a)
243
- (b)
378
- (c)
189
- (d)
486
Answer: Option B
Text Explanation :
If p2 + q2 - 29 = 2pq - 20 = 52 - 2pq, then the difference between the maximum and minimum possible value of (p3 - q3) is
Given, p2 + q2 - 29 = 2pq - 20
⇒ p2 + q2 - 2pq = 29 - 20
⇒ (p - q)2 = 9
⇒ p - q = ± 3
Also given, p2 + q2 - 29 = 52 - 2pq
⇒ p2 + q2 + 2pq = 81
⇒ (p + q)2 = 81
⇒ p + q = ± 9
Case 1: p - q = + 3 and p + q = + 9
Solving these 2 equations we get, p = 6 and q = 3
∴ p3 - q3 = 216 - 27 = 189
Case 2: p - q = - 3 and p + q = + 9
Solving these 2 equations we get, p = 3 and q = 6
∴ p3 - q3 = 27 - 216 = - 189
Case 3: p - q = + 3 and p + q = - 9
Solving these 2 equations we get, p = - 3 and q = - 6
∴ p3 - q3 = (-27) - (-216) = 189
Case 4: p - q = - 3 and p + q = - 9
Solving these 2 equations we get, p = - 6 and q = - 3
∴ p3 - q3 = - 216 - (-27) = - 189
∴ Highest possible value of p3 - q3 = 189 least possible value of p3 - q3 = - 189.
∴ Required difference = 189 - (-189) = 378
Hence, option (b).
Workspace:
For some real numbers a and b, the system of equations x + y = 4 and (a + 5)x + (b2 -15)y = 8b has infinitely many solutions for x and y. Then, the maximum possible value of ab is?
- (a)
15
- (b)
25
- (c)
33
- (d)
55
Answer: Option C
Text Explanation :
A system of linear equations a1x + b1y = c1 and a2x + b2y = c2 has infinite solutions if
= =
For, x + y = 4 and (a + 5)x + (b2 -15)y = 8b to have infinite solution
⇒ = = ...(1)
⇒ 8b = 4(b2 -15)
⇒ 4b2 - 8b - 60 = 0
⇒ b2 - 2b - 15 = 0
⇒ (b - 5)(b + 3) = 0
⇒ b = 5 or -3
From (1): ⇒ a + 5 = b2 - 15
⇒ a = b2 - 20
∴ a = 5 when b = 5 ⇒ ab = 25
or, a = -11 when b = -3 ⇒ ab = 33
∴ Maximum value of ab = -11 × -3 = 33
Hence, option (c).
Workspace:
Let n and m be two positive integers such that there are exactly 41 integers greater than 8m and less than 8n, which can be expressed as powers of 2. Then, the smallest possible value of n + m is?
- (a)
44
- (b)
14
- (c)
16
- (d)
42
Answer: Option C
Text Explanation :
8m = 23m and 8n = 23n
Now, 23m < 2x < 23n
We have to find least possible value of (m + n) such that there are 41 possible values of x.
Least possible of m = 1, hence we get, 23 < 2x < 23n
Now, x can be any interger from 4 till 44 (41 values).
∴ Least possible value of 3n = 45, hence n = 15.
∴ Least possible value of m + n = 1 + 15 = 16.
Hence, option (c).
Workspace:
The sum of the first two natural numbers, each having 15 factors (including 1 and the number itself), is
Answer: 468
Text Explanation :
A number having 15 factors can be of the form:
a14 or a4 × b2
Case 1: a14
The smallest possible such number = 214 = 1024 × 16 > 16000
Case 2: a4 × b2
The smallest possible such number = 24 × 32 = 16 × 9 = 144
The second smalled possible such number = 34 × 22 = 81 × 4 = 324
∴ The required sum = 144 + 324 = 468.
Hence, 468.
Workspace:
Let a and b be natural numbers. If a2 + ab + a = 14 and b2 + ab + b = 28, then (2a + b) equals
- (a)
9
- (b)
10
- (c)
8
- (d)
7
Answer: Option C
Text Explanation :
Given a and b are natural numbers.
a2 + ab + a = 14
⇒ a(a + b + 1) = 14 = 1 × 14 or 2 × 7
Case 1: a = 1 and a + b + 1 = 14
⇒ b = 12
a = 1 and b = 12 does not satisfy b2 + ba + b = 28
Case 2: a = 2 and a + b + 1 = 7
⇒ b = 4
a = 2 and b = 4 satisfies b2 + ba + b = 28
∴ 2a + b = 4 + 4 = 8
Hence, option (c).
Workspace:
Let A be the largest positive integer that divides all the numbers of the form 3k + 4k + 5k and B be the largest positive integer that divides all the numbesr of the form 4k + 3(4k) + 4k+2, where k is any positive integer. Then (A + B) equals
Answer: 82
Text Explanation :
Given, 3k + 4k + 5k
put k = 1, we have 3k + 4k + 5k = 3 + 4 + 5 = 12
put k = 2, we have 3k + 4k + 5k = 9 + 16 + 25 = 50
The only common factor between 12 and 50 is 2.
3k + 4k + 5k is always even for any value of k, and hence always divisible by 2.
∴ A = 2
Given, 4k + 3(4k) + 4k+2
= 4k(1 + 3 + 42)
= 4k × 20
For k ≥ 1, this number is always divisible by 4 × 20 = 80
∴ B = 80
⇒ A + B = 2 + 80 = 82.
Hence, 82.
Workspace:
For natural numbers x, y and z, if xy + yz = 19 and yz + xz = 51, then the minimum possible value of xyz is
Answer: 34
Text Explanation :
x, y and z are natural numbers.
⇒ xy + yz = 19
⇒ y(x + z) = 19 = 1 × 19
∴ y = 1 and x + z = 19 [x + z ≥ 2, since they are natural numbers] …(1)
Also, yz + xz = 51
⇒ z(1 + x) = 51 = 3 × 17 or 1 × 51
Case 1: z = 3 and 1 + x = 17
⇒ x = 16
But then x + z = 19
Hence, this case is accepted.
⇒ xyz = 16 × 1 × 3 = 84
Case 2: z = 17 and 1 + x = 3
⇒ x = 2
But then x + z = 19
Hence, this case is accepted.
⇒ xyz = 2 × 1 × 17 = 34
Case 3: z = 1 and 1 + x = 51
⇒ x = 50
But then x + z = 51
Hence, this case is rejected.
Case 4: z = 51 and 1 + x = 1
⇒ x = 0
But x should be a natural number.
Hence, this case is rejected.
∴ Lowest possible value of xyz = 34 [Case 2].
Hence, 34.
Workspace:
If a and b are non-negative real numbers such that a + 2b = 6, then the average of the maximum and minimum values of (a + b) is:
- (a)
4
- (b)
4.5
- (c)
3.5
- (d)
3
Answer: Option B
Text Explanation :
Given, a + 2b = 6.
⇒ a + b = 6 - b
∴ (a + b) will be maximum when b is least. Least value of b can be 0, since b cannot be negative.
⇒ (a + b)max = 6
∴ (a + b) will be minimum when b is highest. Highest value of b can be 3, since a cannot be negative.
⇒ (a + b)min = 3
⇒ Average of highest and lowest values of (a + b) = = 4.5
Hence, option (b).
Workspace:
For some natural number n, assume that (15,000)! is divisible by (n!)!. The largest possible value of n is:
- (a)
6
- (b)
5
- (c)
7
- (d)
4
Answer: Option C
Text Explanation :
For (15,000)! to be completely divisible by (n!)!, n! ≤ 15,000
Now we know,
6! = 720
7! = 5,040
8! = 40,320
∵ n ≤ 15,000, highest value n can take is 7
Hence, option (c).
Workspace:
A school has less than 5000 students and if the students are divided equally into teams of either 9 or 10 or 12 or 25 each, exactly 4 are always left out. However, if they are divided into teams of 11 each, no one is left out. The maximum number of teams of 12 each that can be formed out of the students in the school is
Answer: 150
Text Explanation :
The number of students will be of the form = LCM(9, 10, 12, 25) × k + 4 = 900k + 4
The number of students is less than 5000 and also completely divisible by 11. This is possible when k = 2 and hence the number the students = 1804.
Maximum number of groups of 12 students that can be formed = Quotient of [1804 / 12] = 150
Hence, 150.
Workspace:
For a 4-digit number, the sum of its digits in the thousands, hundreds and tens places is 14, the sum of its digits in the hundreds, tens and units places is 15, and the tens place digit is 4 more than the units place digit. Then the highest possible 4-digit number satisfying the above conditions is
Answer: 4195
Text Explanation :
Let the thousands, hundreds, tens and units digits be a, b, c and d.
Given, sum of its digits in the thousands, hundreds and tens places is 14
a + b + c = 14 …(1)
The sum of its digits in the hundreds, tens and units places is 15
b + c + d = 15 …(2)
(2) – (1) ⇒ a = d – 1 …(3)
The tens place digit is 4 more than the units place digit ⇒ c = d + 4 …(4)
For the number to be highest possible d should also be highest possible.
Highest possible of d is 5 (from (4)).
∴ highest possible value of c = 9 and that of a = 4
From (1), b = 14 – a – c = 1
∴ The highest such number is 4195
Hence, 4195.
Workspace:
Consider the pair of equations: x2 – xy – x = 22 and y2 – xy + y = 34. If x > y, then x – y equal.
- (a)
8
- (b)
7
- (c)
6
- (d)
4
Answer: Option A
Text Explanation :
Given x2 – xy – x = 22 and y2 – xy + y = 34.
Adding both the equations
⇒ x2 + y2 – 2xy - (x – y) = 56
⇒ (x - y)2 – (x - y) = 56
⇒ (x - y)(x - y - 1) = 56
Let (x – y) = a [a > 0 since x > y]
⇒ a(a - 1) = 56
⇒ a2 – a – 56 = 0
⇒ (a – 8)(a + 7) = 0
⇒ a = 8 or -7 (rejected)
∴ a = x - y = 8
Hence, option (a).
Workspace:
The cost of fencing a rectangular plot is ₹ 200 per ft along one side, and ₹ 100 per ft along the three other sides. If the area of the rectangular plot is 60000 sq. ft, then the lowest possible cost of fencing all four sides, in INR, is
- (a)
160000
- (b)
120000
- (c)
100000
- (d)
90000
Answer: Option B
Text Explanation :
Let the two sides of the rectangle be ‘l’ and ‘b’ ft.
⇒ l × b = 60,000
Cost of fencing = 200 × l + 100 × (l + 2b) = 100 (3l + 2b)
To minimize cost we need to minimize 3l + 2b
Now, we know AP ≥ GP
⇒ ≥
⇒ 3l + 2b ≥ 2 × √
⇒ 3l + 2b ≥ 1200
∴ Minimum cost of fencing = 100 × 1200 = 1,20,000.
Hence, option (b).
Workspace:
How many 3-digit numbers are there, for which the product of their digits is more than 2 but less than 7?
Answer: 21
Text Explanation :
Let the digits of the 3-digit number be p, q, & r.
∴ 2 < p × q × r < 7
⇒ p × q × r can take the values 3, 4, 5, or 6.
Let's start with prime numbers 3 & 5.
Since they are prime, they can't be split, and hence if one of p, q or r is 3, the remaining two should be 1.
So, the possible combinations are
If p × q × r = 3
The number can be {113, 131, 311}
If p × q × r = 5
The number can be {115, 151, 511}
If p × q × r = 4
4 can be written as 1 × 2 × 2 or 1 × 1 × 4.
Therefore, the possible combinations of p, q, r are {122, 212, 221, 114, 141, 411}
If p × q × r = 6
6 can be written as 1 × 3 × 2 or 1 × 1 × 6.
Therefore, the possible combinations of p, q, r are {123, 132, 213, 231, 312, 321, 116, 161, 611}
Therefore, the total number of possibilities are 3 + 3 + 6 + 9 = 21.
Hence, 21.
Workspace:
Feedback
Help us build a Free and Comprehensive Preparation portal for various competitive exams by providing us your valuable feedback about Apti4All and how it can be improved.