PE 4 - Numbers | Algebra - Number Theory
Join our Telegram Group for CAT/MBA Preparation.
If S is the sum of all two-digit numbers that give a remainder of 5 when they are divided by 11, what is the remainder when S is divided by 11?
Answer: 7
Join our Telegram Group for CAT/MBA Preparation.
Explanation :
Any number that when divided by 11 gives a remainder of 5 will be of the form 11k + 5.
Since we only need two-digit numbers, k will range from 1 to 8, as 11 × 1 + 5 = 16 and 11 × 9 + 5 = 93.
These numbers form an AP with first term = 16 and last term as 93.
Thus, sum of these numbers
S = 8/2 × (16 + 104) = 480
Dividing S by 11, the remainder comes out to be 7.
Hence, 7.
Workspace:
In a garden there are 50 plants, planted in rows with the same number of plants in each row. The number of flowers on every plant of a row is the square of the row number. If the total number of flowers is 550, find the number of rows?
Answer: 5
Join our Telegram Group for CAT/MBA Preparation.
Explanation :
Let the number of rows be r and number of plants in each row be p.
∴ r × p = 50 …(1)
Number of flowers on a plant in nth row = n2
∴ Total number of flowers in nth row is n2 × p.
Total number of flowers in the garden = p × (12 + 22 + 32 + … + r2) = 550
⇒ pr(r + 1)(2r + 1)/6 = 550
⇒ 50 × (r + 1)(2r + 1)/6 = 550 [from (1): rp = 50]
⇒ (r + 1)(2r + 1) = 66 = 6 × 11
⇒ k = 5.
Hence, 5.
Workspace:
(a + b)! is divisible by which of the following? (a and b are positive integers)
- (a)
a!
- (b)
b!
- (c)
a! × b!
- (d)
All of the above
Answer: Option D
Join our Telegram Group for CAT/MBA Preparation.
Explanation :
(a + b) is greater than both a and b, hence (a + b)! will always be divisible by a! or b!.
Now, let us check a! × b!
= =
Now, (a + 1) × (a + 2) × … × b is product of b natural numbers, which will always be divisible by b!
∴ is an integer
⇒ is an integer i.e., (a + b)! is divisible by a! × b!
Hence, option (d).
Workspace:
What is the remainder when 500-digit 1223334444…. is divided by 8?
Answer: 2
Join our Telegram Group for CAT/MBA Preparation.
Explanation :
To find remainder of any number when divided by 8, we need to find remainder of last 3 digits of the number when divided by 8.
Here we need to find the last 3 digits of 1223334444… (500 digits)
The given number is formed by writing consecutive natural numbers as many times.
1 is written once, 2 is written twice, 3 is written thrice and so on.
By the time number 1 is over, only 1 digit is written.
By the time number 2 is over, (1 + 2 =) 3 digits are written.
By the time number 3 is over, (1 + 2 + 3 =) 6 digits are written.
…
By the time all single digit numbers are written, (1 + 2 + 3 + … + 9 =) 45 digits are written.
By the time number 11 is over, 45 + 2 × 11 = 67 digits are written.
…
By the time number 23 is over, 45 + 2 × (11 + 12 + 13 + … + 23 =) 487 digits are written.
Now thirteen digits are remaining which will be formed by writing 24 repeatedly.
The last three digits of this number will be 242.
∴ The last 3 digits of the given number is 242.
Remainder when 242 is divided by 8 = 2.
∴ Remainder when the given number is divided by 8 = 2.
Hence, 2.
Workspace:
If N is the smallest positive integer that is not prime and does not divide 30!. How many factors does N have?
Answer: 4
Join our Telegram Group for CAT/MBA Preparation.
Explanation :
30! is divisible by all prime numbers less than 30.
∴ The smallest prime number that is not its factor is 31.
But N should not be a prime factor.
∴ N must be kept as small as possible i.e., 31 × 2 = 62.
The factors of 62 are 1, 2, 31 and 62, i.e., 4.
Hence, 4.
Workspace:
The nine-digit number 6454389p6 is divisible by 36. Find the value of p.
- (a)
0
- (b)
9
- (c)
0 or 9
- (d)
None of these
Answer: Option B
Join our Telegram Group for CAT/MBA Preparation.
Explanation :
For a number to be divisible by 36, it should be divisible by 4 as well as 9.
Divisibility by 9: Sum of digits should be divisible by 9.
Sum of the digits = 6 + 4 + 5 + 4 + 3 + 8 + 9 + p + 6 = 45 + p
(45 + p) should be divisible by 9, hence p can be 0 or 9.
Divisibility by 4: Last two digits should be divisible by 4.
p6 should be divisible by 4.
Case 1: p = 0, 06 is not divisible by 4
Case 2: p = 9, 96 is divisible by 4
∴ For p = 9, the given number is divisible by both 9 and 4, hence divisible by 36.
Hence, option (b).
Workspace:
n! has 249 zeros, value of n can be:
- (a)
845
- (b)
777
- (c)
1003
- (d)
941
- (e)
1108
Answer: Option C
Join our Telegram Group for CAT/MBA Preparation.
Explanation :
Numbers of trailing zeros in n! is same as highest power of 5 in n!.
We will have to check options here. Let us first check for 941, since it is the middle number of all the options.
Highest power of 5 in 941! =
+ + + = 188 + 37 + 7 + 1 = 233
Now let us check the next higher option i.e., option (c)
+ + + = 200 + 40 + 8 + 1 = 249
∴ The number of trailing zeros in 1003! is 249.
Hence, option (c).
Workspace:
What is the remainder when the series 11 + 22 + 33 + … + 99 is divided by 5?
- (a)
0
- (b)
1
- (c)
2
- (d)
3
Answer: Option C
Join our Telegram Group for CAT/MBA Preparation.
Explanation :
Using the cyclicity property we calculate the last digit of each term in the above series.
Last digit of
11 = 1
22 = 4
33 = 7
44 = 6
55 = 5
66 = 6
77 = 3
88 = 6
99 = 9
The sum of all the last digits = 47, which when divided by 5 leaves a remainder of 2.
∴ The remainder when 11 + 22 + 33 + … + 99 is divided by 5 is 2.
Hence, option (c).
Workspace:
If m and n are integers divisible by 7, which of the following is not necessarily true?
- (a)
(m – n) is divisible by 7
- (b)
(m2 – n2) is divisible by 49
- (c)
(m + n) is divisible by 14
- (d)
None of these
Answer: Option C
Join our Telegram Group for CAT/MBA Preparation.
Explanation :
Let m = 7a and n = 7b (both are multiples of 7)
Option (a): m – n = 7(a - b) is divisible by 7.
Option (b): m2 – n2 = 49(a2 - b2) is divisible by 49.
Option (c): m + n = 7(a + b) is divisible by 14 only when (a + b) is even.
∴ Option (c) is not necessarily true.
Hence, option (c).
Workspace:
What is the least number that must be subtracted from 1995, so that the remainder when divided by 5, 7, and 11 is 3?
- (a)
72
- (b)
24
- (c)
67
- (d)
None of these
Answer: Option C
Join our Telegram Group for CAT/MBA Preparation.
Explanation :
When a number N is divided by 5, 7 and 11, the remainder is 3.
N = k × LCM (5, 7, 11) + 3, where k = 1, 2, 3… and so on.
N = 385k + 3
When k = 5, N = 1928.
So, the number to be subtracted from 1995 is = 1995 – 1928 = 67.
Hence, option (c).
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.