Scribd
Upload
12 views4 pages

Number System Practice Exercises

The document contains a series of practice exercises focused on number systems, including calculations and properties of digits, integers, and divisibility rules. It presents various mathematical problems and solutions, illustrating concepts such as prime and composite numbers, even and odd integers, and arithmetic operations. Additionally, it includes examples of how to derive specific numbers and their characteristics through systematic reasoning.

Uploaded by

pratikmishrab
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
12 views4 pages

Number System Practice Exercises

The document contains a series of practice exercises focused on number systems, including calculations and properties of digits, integers, and divisibility rules. It presents various mathematical problems and solutions, illustrating concepts such as prime and composite numbers, even and odd integers, and arithmetic operations. Additionally, it includes examples of how to derive specific numbers and their characteristics through systematic reasoning.

Uploaded by

pratikmishrab
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

NUMBER SYSTEM : PRACTICE EXERCISE

1. (c)
No. of digits required M 19
=
1 – 9  9 digits L 7
10 – 99  2 × [(199 – 10) + 1] = 2 × 90 = 180 & KL = 221
100 – 185  3 × [(185 – 100) + 1] = 3 × 86 = 258 K × L = 221 = 17 × 13
Total no. of digits = 9 + 180 + 258 = 447 digits. Therefore, J = 19, K = 17, L = 13 & M = 7
J + K + L + M = 19 + 17 + 13 + 7 = 56
2. (a)
Checking option wise: 8. (a)
a+b+d–c 7 is the single digit which when multiplied by 1234, the unit’s
Now, ‘C’ can be odd or even. If ‘C’ is odd, we get even + even + digit and the thousand’s digit will be same in the product
odd – odd = even. If ‘C’ is even, we get odd + odd + even – even 1234 × 7 = 8638
= even. The other two digits are 63.
Hence, option (a) is correct. 9. (c)
3. (d) Three digit number greater than 700 whose two digits are
If n is an integer i.e. 3. equal are
(i) n2 = (3)2 = 9 707, 711, 722, 727, 733, 737, 744, 747, 770, 755, 757, 766,
(ii) 2n + 1 = 2 × 3 + 1 = 7 767, 770, 771, 772, 773, 774, 775, 776, 778, 779, 787, 788,
(iii) n + 2 = 3 + 2 = 5 797, 799, 800, 808, 811, 818, 822, 828, 833, 838, 844, 848,
(iv) 2n = 2 × 3 = 6 855, 858, 886, 868, 877, 878, 880, 881, 882, 883, 884, 885,
Hence, 2n is always be even. 886, 887, 889, 898, 899, 900, 909, 911, 919, 922, 929, 933,
939, 944, 949, 955, 959, 966, 969, 977, 979, 988, 989, 990,
4. (d)
991, 992, 993, 994, 995, 996, 997, 998
x = prime, y = composite.
y – x can be even if x = 2 and y is any even number.
Alternate Method:
xy can be even if x = 2 or y is an even number.
Number starting with 7
xy 7 _ _ (11, _____ 99) = 8 (not including 77)
can be even if x = 2 and y = 10. 7 _ 7 (0 _____ 9) = 9 (not including 7)
x
Hence, none of these is true. 7 7 _ (0 _____9) = 9 (not including 7)
Total 8 + 9 + 9 = 26
5. (c)
10. (a)
Let a, b and c be 4, 5 & 6 respectively.
largest four digit number using the digits = 8210
(1) c – a = 2
smallest four digit number using the digits = 1028
6–4=2
difference between them = 7182
(2) abc = 4 × 5 × 6 = 120 = even integer
a+ b + c 4 + 5 + 6 15 11. (d)
(3) = = = an integer Seema tore out last 25 pages
3 3 5
Numbers on last 25 pages were = 143, 144, .......... 192.
Hence, I, II & III all follows.
n
6. (d) Sum of all numbers = 2a   n  1  d 
Let p and q be 4 & 5 respectively. 2
3p 3  4 50
(1) q = 5 = Not an integer  2  143   50  1  1 
2 

ZENITH
(2) pq = 4 × 5 = 20 = even integer. = 25 [286 + 49]
(3) 2 (p + q) = 2(4 + 5) = 2 × 9 = 18 = even integer. = 8375.
(4) 2p + q = 2 × 4 + 5 = 8 + 5 = 13 = odd integer. 12. (d)
7. (d) Checking by option,
According to question, Put x = 4.
KLM = 4199 ...(i)
JKL = 1547 ...(ii)  19  30  32  4
On dividing equation (i) by (ii), we get
KLM 4199  19  30  6
=
JKL 1547  19  6
=5

For more practice visit: [Link] 1


ZENITH
creating new dimensions
13. (a)
19
25n>512 i.e. given remainder 6.
n
n
5 
2
> 512 i.e. n = 13.
2n 19. (b)
 5 > 512 General form of that numbers = (15 (5x + 2) + 5).
On comparing, we get = 75x + 35
2n > 12 Minimum value of x = 0
n > 6 i.e. 7. i.e. 35.
14. (b) 20. (c)
33 33 General form of that number is
10  2 10 2
S   = 7(5 (4x + 3) + 2) + 4
3 3 3 = 140x + 123
1 2 Smallest such number = 123.
= 33 times Digit three + + and remainder with 8, 5 and 6 = 3, 0, 3.
3 3
21. (d)
= 33 times digit three + 1
= 100. The number’s general form
6 (8(9x + 2) + 4) + 3
15. (b) = 432x + 123.
y = n2 + 18n + 92 minimum value of the number is 123.
y = n2 + 18n + 81 + 11.
22. (b)
y = (n + 9)2 + 11
n = – 13 or – 4 will satisfy the equation. unit digit of (25678)2345  8
(3485)4857 = 5
16. (b) Required digit = 8 × 5 = 0
16n2  7n  6 23. (c)
n 76B
For divisibility of 8 =
6 8
 16n  7  B can be 0 or 8
n
for divisibility of 5, last digit i.e. B has to be 0.
Factors of n will give integral values.
For divisibility of 9
1, 2, 3 and 6.
7 + 9 + A + 8 + 5 + 6 + 7 + 7 + 6 + 0 = 55 + A
17. (c) 55 + A should be completely divisible 9.
41000  55 + A = 63
Remainder = A=8
7
 A & B are 8 & 0 respectively..
333
 43   4 24. (d)
=   Given that B is even digit
7
So, be divided by 9.
333
 64   4 8 + 9 + 7 + 6 + 5 + A + 4 + B = 39 + A + B
= 39 + A + B = 45 ...(i)
7
or 39 + A + B = 54 ...(ii)
333
 63  1   4 From equation (i)

ZENITH
= A+B=6
7
2+4=6
333
 1  4 From equation (ii)
= = Remainder is 4. A + B = 15
7
9 + 6 = 15
18. (b) 8 + 7 = 15
Let n by that divisor. So, first number will be (na + 9) and There are at most too pair of values of A & B are possible.
second number will be (nb + 10).
Sum of numbers = n(a + b) + 19. 25. (a)
Let n be 2.
n  a  b   19 then n(n + 1) (n + 2) = 2 × ( 2+ 1) (2 + 2)
Remainder of is 6.
n = 2 × 3 × 4 = 24

For more practice visit: [Link] 2


ZENITH
creating new dimensions
Let n be 3 Lowest marks he can fetch with all wrong answers
then n(n + 1) (n + 2) = 3 (3 + 1) ( 3 + 2)
= 3 × 4 × 5 = 60.  1 1 1
    10  20   70  
 10 5 2
26. (a)
n (n + 1) (n + 2) will always be an even number and always = – (1 + 4 + 35)
divisible by 3. But number will always be divisible when n is = – 40.
even. So, the maximum difference = 100 – (– 40)
= 140.
27. (a)
(19K – 3K) will always be divisible by 16 if n is odd while (18m 33. (a)
– 11m) will always be divisible by 8, if n is Even. If N, N + 2 & N + 4 are prime number it is possible at value of
K K m m
Hence, (19 – 3 ).(18 – 11 ) will be divisible by 112 if K is N = 3.
odd and m is even. i.e. 3, 5, 7.
Therefore, no. of possible solution of N is 1.
28. (d)
Divisibility of 8 = last three digit divisible by 8. 34. (d)
Last three digit of this series is 555 Prime number greater than 35 is 37
On dividing 555 by 8, we get 3 as remainder 2 2
 37   34   36  1   34
p2 + 34 =
29. (d) 12 12
100 2
No. which are divisible by 3 = = 33 
1  34 35

3
12 2
100 100
No. which are divisible by 4 = = = 25 36  1
3 4 
12
100 Remainder is –1 or 11.
No. which are divisible by 12 = =8
12
35. (b)
No. which are divisible by 3 & 4 but not 12 W = 1, 2, 3, 4, 5
= (33 – 8) + (25 – 8) 2n – n = 25 – 5 = 27 (not prime)
= 42. 2n – n = 24 – 4 = 12 (not prime)
Remaining numbers = 100 – 42 = 58. 2n – n = 23 – 3 = 5 (prime)
30. (a) 22 – 2 = 2 (prime)
Product of number from 1 to 30 = 30! For two values of n, 2n – 2 is prime number.
No. of 3’s in 301 36. ()
301 301
  2
3 3 37. (b)
10 + 3 =13 LCM of 14, 21, and 42 is 42.
31. (d) i.e. all three bells will toll together after 42 mins.
In (22! + 17894!) highest power of 5 will depends on only 22! So, after 11:24 am bells will toll at 12:06 pm.
So, highest power of 5 in 22! is 38. (d)
22! 850 – 490 = 360
4 850 – 250 = 600
5 490 – 250 = 240
32. (b) HCF of (360, 600, 240) is 120

ZENITH
Out of 100 questions. i.e. highest number of lot size that can be dropped from air
craft is 120.
1 Let number of damaged package be (x).
10 questions carry negative marks.
10 (850 – x), (490 – x) & (250 – x)
for being the multiple of 120.
1 x has to be 10.
20 questions carry negative marks.
5 So, the packets drop from each aircraft is 840, 480 & 240
So, minimum number of packets
1
70 questions carry negative marks. 840 480 240
2   
Highest marks ha can fetch is 100. 120 120 12
= 7 + 4 + 2 = 13.

For more practice visit: [Link] 3


ZENITH
creating new dimensions
39. (b)
Difference = 9699 – 7179
= 2520
Factors of 2520  23 × 32 × 51 × 71
For one or more zeros
Set of 2 & 5 is required.
i.e. 22 × 32 × 71 × 10
Total possible factors (3 × 3 ×2) = 18.
40. (a)
LCM of 7, 8 & 13 is 728.
Number of soldiers all in the form of 728k + 3.
Using the options, we get the value of the number of soldiers.
41. (b)
The number of sticks be 18 as
818 = 4 × x + 2
818 = 5 × y + 3
Now, means when she bundle them in group of 12 she left
with 2 sticks.
42. (c)
Quantity of rice Banti had 149 kg and 177 kg.
Rice packed = (149 – 5) & (177 – 9)
= 144 & 168
HCF 144 & 168 weight of each bag i.e. 24.
On mixing both the quantities = 149 + 177 = 326 kg
Weight of new bag = 1.25 × 24 = 30
Rice remain after = 326 – 30 × 10 = 326 – 300 = 26 kg
43. (c)
2 × (25)x = (52)x.
(25)x + (25)x = (52)x
This is possible only for Base – 8
i.e. x = 8
44. (a)
(abc)7 = (cba)9
a × 72 + b × 71 + c × 70 = c × 92 + b × 91 + c × 90
49a + 7b + c = k81c + 9b + a
48a – 2b – 80c = 0
Only possible value of a, b and c that satisfy the equation are
2, 8 and 1 respectively.
So, a + b + c = 11.

ZENITH
For more practice visit: [Link] 4
ZENITH
creating new dimensions

Common questions

Powered by AI

Three-digit numbers greater than 700 with two equal digits are determined through structured approaches, like iterating through digits while confirming equal placements and value bounds are respected. Computations go, position-wise, modify search like starting calculations from 7×_ or limiting specific digit occurrences, ensuring logic clarity .

The maximum score difference in an exam scenario with negative marking is calculated by taking the highest possible score achievable (100 in this case) and the lowest possible score based on the negative marking per question. Given negative ones are distributed among different sets of questions, the worst case yields -40 (1+4+35 negative marks for the wrong answers). Therefore, the maximum possible score difference is 100 - (-40) = 140 .

A particular prime number sequence like N, N+2, N+4 being prime is unique given constraints because such a triplet must start at 3 only (yielding 3, 5, 7). Larger sequence attempts lead to failures under divisibility tests since there's close clustering with occupation rule by non-primes in larger number gaps .

The total number of digits from 1 to 185 is calculated by categorizing numbers based on the number of digits: from 1 to 9, there are 9 digits; from 10 to 99, there are 90 numbers each with 2 digits, totaling 180 digits; and from 100 to 185, there are 86 numbers each with 3 digits, totaling 258 digits. Adding these, the total number of digits is 447 .

Mathematical induction proves that n(n + 1)(n + 2) is divisible by 6 for any integer n. This works since among three consecutive integers n, n+1, n+2: one is divisible by 2 (even), and one is divisible by 3 (since three consecutive numbers must include a multiple of three), showing the expression's product covers divisibility by 6 .

A number is divisible by both 3 and 4 but not by 12 if it is divisible by the least common multiple of 3 and 4, which is 12, but not completely by 12 itself. For numbers up to 100, those divisible by 3 or 4 but not 12 is calculated as 33 (divisible by 3) and 25 (divisible by 4) minus the 8 numbers divisible by 12, leaving 42 .

The highest number of lot size, which can be evenly dropped from aircraft carrying loads of 850, 490, and 250, is calculated by finding the highest common factor (HCF) of the differences between these numbers: 360, 600, and 240. The HCF is 120. This implies that the maximum number of lot size that can be evenly dropped is 120; hence from each aircraft, respectively, 840, 480, and 240 packets can be dropped .

To calculate the smallest number with a constant modulo remainder for various divisors, apply the Chinese Remainder Theorem principles, manipulating given expressions like 7(5(4x + 3) + 2) + 4 to determine the smallest satisfying such conditions. Compute for base cases to identify a general sequence or value meeting multiple constraints .

In a series context, to calculate the remainder when dividing by 12, consider the divisibility rules to ensure components add up to conform with expected modular arithmetic. Specific properties, such as a series ending in particular sequences like a number divisible by 8 or multiples influencing divisibility, determine the resulting remainders .

Determine digit pair by analyzing individual divisibility. E.g., for divisibility by 8, check last digits; for 5, the last must be 0; for 9, sum the digits to a multiple of 9. Thus, for a given set of digits such as 76B and a number composed like 7+9+A+8+etc., ensuring divisibility involves strategic positioning to satisfy each criterion, resulting in specific choices for A and B (often necessitating trials equaling sums accordingly).

You might also like