Level 6 Assignment 8 (Divisibility) Final
Level 6 Assignment 8 (Divisibility) Final
ASSIGNMENT
Level - I
1. How many four digit numbers with the two middle digits 97 are divisible by 45?
3. Find the smallest number written only with ones which is divisible by 333…33 (one hundred 3’s in
the representation).
4. For any n > 1 prove that the sum of any n consecutive odd natural numbers is a composite number
5. A positive number is divided by 100 to get a remainder thrice as the quotient. If the number is divisible
by 11, then how many such numbers are possible that are less than 100000?
6. Both the end digits of a 99-digit number N are 2. N is divisible by 11, then all the middle digits are
(a) 1 (b) 2 (c) 3 (d) 4
7. 461 + 462 + 463 + 464 is divisible by
(a) 3 (b) 10 (c) 11 (d) 13
8. If xmyn = 7889 where x and y are prime number, then the value of x + y is________
(a) 30 (b) 60 (c)100 (d) 300
9. If the nine-digit number 9m2365n48 is completely divisible by 88, what is the value of (m2 × n2), for
the smallest value of n, where m and n are natural numbers?
(a) 64 (b) 32 (c) 36 (d) 20
10. If the 5-digit number 676xy is divisible by 3, 7 and 11, then what is the value of (3x - 5y)?
(a) 9 (b) 11 (c) 10 (d) 7
Level - II
11. Prove that 22225555 + 55552222 is divisible by 7.
Answers Key
1. (-) 2. (11) 3. (3) 4. (-) 5. (1,2,3) 6. (d)
7. (b) 8. (a) 9. (a) 10. (a) 11. (7) 12. (a,b,c,d)
13. (8) 14. (94) 15. (-)
Solutions
Level - I
1. How many four digit numbers with the two middle digits 97 are divisible by 45?
Sol: a97b
b must be 0, 5
(i) for b = 0
a + 16 divisible by 9
a=2
(ii) for b = 5
a + 21 divisible by 9
a = 6,
3
3. Find the smallest number written only with ones which is divisible by 333…33 (one hundred 3’s in
the representation).
Sol: This number is written with three hundred l's. Indeed, it is divisible
by 3 and it is divisible by 111 ... 11 (one hundred 1's), which are co-prime. To prove
that this is the minimum number required we notice first that the required number
must have a number of digits divisible by 100-otherwise it would not be divisible
by 111 ... 11 (one hundred l's). Secondly, the numbers 111 ... 11 (one hundred l's) and 111 ... 11 (two
hundred l's) are not divisible by 3.
4. For any n > 1 prove that the sum of any n consecutive odd natural numbers is a composite number
Sol. let the sum, 2a+1 + 2a+3 +…………+ 2a+2n-1=2an + n2 = n(n+2a)
5. A positive number is divided by 100 to get a remainder thrice as the quotient. If the number is divisible
by 11, then how many such numbers are possible that are less than 100000?
Ans. (3)
Sol.
6. Both the end digits of a 99-digit number N are 2. N is divisible by 11, then all the middle digits are
(a) 1 (b) 2 (c) 3 (d) 4
Ans. (d)
Sol. A number is divisible by 11 if the difference of the sum of digits at odd and even places be either
zero or multiple of 11.
4
8. If xmyn = 7889 where x and y are prime number, then the value of x + y is________
(a) 30 (b) 60 (c)100 (d) 300
Ans. (a)
Sol: 7889 = 73.231
x + y = 7 + 23 = 30
9. If the nine-digit number 9m2365n48 is completely divisible by 88, what is the value of (m2 × n2), for
the smallest value of n, where m and n are natural numbers?
(a) 64 (b) 32 (c) 36 (d) 20
Ans. (a)
Sol:
10. If the 5-digit number 676xy is divisible by 3, 7 and 11, then what is the value of (3x - 5y)?
(a) 9 (b) 11 (c) 10 (d) 7
5
Ans. (a)
Sol.:
Level - II
11. Prove that 22225555 + 55552222 is divisible by 7.
Sol: 22225555 + 55552222 - (35555+42222) + 35555+42222
2431111+161111 divisible by 243 + 16 which is divisible by 7.
a=8
14. Find at least one 100 digit number without zeroes in its decimal representation, which is divisible by
the sum of its digits.
Sol: Let us find, by trial and error, a number with the sum of its digits equal to 125.
Divisibility by 125 is determined by the last three digits of a number.
Thus, the number 111……..11599125 will do (the number beings with 94 ones)
15. Prove that there exists a natural number n such that the numbers n + 1, n+ 2, ...., n + 1989 are all
composite
Sol. The number n+ 1 must be composite. Let us try to keep things simple and make this number divisible
by 2. Then the number n + 2 must he composite too, but it cannot he a multiple of 2. Let us try again
to be simple and make this number divisible by 3. Proceeding as above we can try to find a number n
such that n + 1 is divisible by 2, n + 2 is divisible by 3. n + 3 is divisible by 4, et cetera. This is
equivalent to saying that n - 1 is divisible by 2. 3. 4. and 1990. Such a number is easy to find; for
example, 1990! will do. Finally, we can take 1990! + 1 as the number we are looking for.