Sigv

Subject : Mathematics Paper Set : 1

Standard : 11 Pnc Date : 23-07-2025
Total Mark : 100 Time : 1H:0M

(11) Ten different letters of an alphabet are given. Words with

......... Mathematics - Section A (MCQ) .........
five letters are formed from these given letters. Then the
number of words which have at least one letter repeated is
(1) How many numbers of five digits can be formed from the (A) 69760 (B) 30240
numbers 2, 0, 4, 3, 8 when repetition of digits is not allowed
(A) 96 (B) 120 (C) 99748 (D) None of these

(C) 144 (D) 14 (12) The number of ways in which 6 rings can be worn on the
four fingers of one hand is
(2) The least value of natural number n satisfying (A) 46 (B) 6 C4
C(n, 5) + C(n, 6) > C(n + 1, 5) is
(A) 11 (B) 10 (C) 64 (D) None of these

(C) 12 (D) 13 (13) The number of positive integral solutions of a b c = 30 is

(A) 30 (B) 27
(3) Number of 4−digit numbers that are less than or equal to
2800 and either divisible by 3 or by 11 , is equal to ............. (C) 8 (D) None of these
(A) 710 (B) 712 (14) The number of 3−digit numbers, that are divisible by either
(C) 714 (D) 716 2 or 3 but not divisible by 7 is ..........
(A) 513 (B) 512
(4) A natural number has prime factorization given by
n = 2x 3y 5z , where y and z are such that y + z = 5 and (C) 514 (D) 511
y −1 + z −1 = 56 , y > z. Then the number of odd divisors of n, (15) A father with 8 children takes them 3 at a time to the
including 1, is ..... .
gv

Zoological gardens, as often as he can without taking the

(A) 11 (B) 6 same 3 children together more than once. The number of
(C) 6x (D) 12 times he will go to the garden is
Si

(A) 336 (B) 112

(5) n Cr +n−1 Cr + ......+r Cr =
(A) n+1 Cr (B) n+1
Cr+1 (C) 56 (D) None of these
(16) All the letters of the word P U BLIC are written in all
(C) n+2
Cr (D) 2n
possible orders and these words are written as in a
(6) The number of ways of selecting two numbers a and b, dictionary with serial numbers. Then the serial number of
a ∈ {2, 4, 6, . . . ., 100} and b ∈ {1, 3, 5, . . . ., 99} such the word P U BLIC is
that 2 is the remainder when a + b is divided by 23 is....... (A) 580 (B) 582
(A) 109 (B) 110
(C) 578 (D) 576
(C) 108 (D) 154
(17) A number is called a palindrome if it reads the same
(7) Let m and n, (m < n) be two 2−digit numbers. Then the backward as well as forward. For example 285582 is a six
total numbers of pairs ( m, n ), such that gcd(m, n) = 6, is digit palindrome. The number of six digit palindromes, which
_______. are divisible by 55, is ...... .
(A) 61 (B) 62 (A) 110 (B) 1000
(C) 63 (D) 64 (C) 10 (D) 100
(8) In how many ways can 5 boys and 5 girls sit in a circle so (18) An envelope has space for at most 3 stamps. If you are given
that no two boys sit together three stamps of denomination 1 , and three stamps of
(A) 5! × 5 ! (B) 4 ! × 5 ! denomination a, (a > 1), the least positive integer for which
there is no stamp value is
(C) 5!×5!
(D) None of these
2 (A) 7 (B) 8
(9) Ifn
P3 +n Cn−2 = 14n, then n =
(C) 9 (D) 10
(A) 5 (B) 6
(19) The sum of all positive divisors of 960 is
(C) 8 (D) 10
(A) 3048 (B) 3087
(10) The number of matrices of order 3 × 3, whose entries are
either 0 or 1 and the sum of all the entries is a prime number, (C) 3047 (D) 2180
is.... (20) Let the set S = {2, 4, 8, 16, . . . ..512} be partitioned into 3
(A) 282 (B) 283 sets A, B, C with equal number of elements such that
(C) 284 (D) 281 A ∪ B ∪ C = S and A ∩ B = B ∩ C = A ∩ C = ϕ. The maximum

1
 number of such possible partitions of S is equal to :
(A) 1680 (B) 1520
(C) 1710 (D) 1640
(21) The lines L1 , L2 , . . . , L20 are distinct. For n = 1, 2, 3, . . . , 10 all
the lines L2n−1 are parallel to each other and all the lines L2n
pass through a given point P . The maximum number of
points of intersection of pairs of lines from the set
{L1 , L2 , . . . , L20 } is equal to :
(A) 425 (B) 101
(C) 357 (D) 110
(22) An n-digit number is a positive number with exactly n digits.
Nine hundred distinct n-digit numbers are to be formed
using only the three digits 2, 5 and 7. The smallest value of n
for which this is possible is
(A) 6 (B) 7
(C) 8 (D) 9
(23) Suppose Anil’s mother wants to give 5 whole fruits to Anil
from a basket of 7 red apples, 5 white apples and 8 oranges.
If in the selected 5 fruits, at least 2 orange, at least one red
apple and at least one white apple must be given, then the
number of ways, Anil’s mother can offer 5 fruits to Anil is
........
(A) 6860 (B) 6859
(C) 6850 (D) 6589
(24) Let S = {(a, b)a, b ∈ Z, 0 ≤ a, b ≤ 18}. The number of lines
in R2 passing through (0, 0) and exactly one other point in S
is
(A) 16 (B) 22
(C) 28 (D) 32
gv

(25) 5− digit numbers are to be formed using 2, 3, 5, 7, 9 without

repeating the digits. If p be the number of such numbers
Si

that exceed 20000 and q be the number of those that lie

between 30000 and 90000, then p : q is
(A) 6 : 5 (B) 3 : 2
(C) 4 : 3 (D) 5 : 3

2
 Sigv

Subject : Mathematics Paper Set : 1

Pnc Date : 23-07-2025
Standard : 11
Total Mark : 100 (Answer Key) Time : 1H:0M

Mathematics - Section A (MCQ)

1-A 2-A 3-A 4-D 5-B 6-C 7-D 8-B 9-A 10 - A

11 - A 12 - A 13 - B 14 - C 15 - C 16 - B 17 - D 18 - A 19 - A 20 - A
21 - B 22 - B 23 - A 24 - A 25 - D

gv
Si

3
 Sigv

Subject : Mathematics Paper Set : 1

Pnc Date : 23-07-2025
Standard : 11
Total Mark : 100 (Solutions) Time : 1H:0M

Solution:(Correct Answer:D)
......... Mathematics - Section A (MCQ) .........
y+z =5
1 1 5
(1) How many numbers of five digits can be formed from the y + z = 6 y>z
⇒ y = 3, z = 2
numbers 2, 0, 4, 3, 8 when repetition of digits is not allowed
⇒ n = 2x · 33 · 52 = (2.2.2 . . .)(3.3.3)(5.5)
(A) 96 (B) 120 Number of odd divisors = 4 × 3 = 12
(C) 144 (D) 14
(5) n Cr +n−1 Cr + ......+r Cr =
Solution:(Correct Answer:A) (A) n+1 Cr (B) n+1
Cr+1
(a) Numbers are 2, 0, 4, 3, 8 (C) n+2
Cr (D) 2 n
Numbers can be formed
= (Total) -(those beginning with 0) Solution:(Correct Answer:B)
= 5! − 4! = 120 − 24 = 96. (b) r Cr +r+1 Cr +r+2 Cr ......+n−1 Cr +n Cr
=r+1 Cr+1 +r+1 Cr +r+2 Cr + .....+n−1 Cr +n Cr
(2) The least value of natural number n satisfying =r+2 Cr+1 +r+2 Cr + .....+n−1 Cr +n Cr
C(n, 5) + C(n, 6) > C(n + 1, 5) is =r+3 Cr+1 + ......+n−1 Cr +n Cr .
On solving similar way, we get
(A) 11 (B) 10 n−1
Cr+1 +n Cr +n Cr =n Cr+1 +n Cr =n+1 Cr+1 .
(C) 12 (D) 13
(6) The number of ways of selecting two numbers a and b,
ss
Solution:(Correct Answer:A) a ∈ {2, 4, 6, . . . ., 100} and b ∈ {1, 3, 5, . . . ., 99} such
(a) n C5 + n C6 > n+1 C5 == > n+1 C6 > that 2 is the remainder when a + b is divided by 23 is.......
la

n+1
C5
== > 6!(n+1)! 5! . (n−4)! (A) 109 (B) 110
. (n−5)! . (n+1)! > 1
dc

== > (n−4)
6 > 1 (C) 108 (D) 154
== > n − 4 > 6 ⇒ n > 10 Solution:(Correct Answer:C)
Hence according to options n = 11.
Ve

a ∈ {2, 4, 6, 8, 10, . . . ., 100}

b ∈ {1, 3, 5, 7, 9, . . . ., 99}
(3) Number of 4−digit numbers that are less than or equal to Now, a + b ∈ {25, 71, 117, 163}
2800 and either divisible by 3 or by 11 , is equal to ............. (i) a + b = 25, no. of ordered pairs (a, b) is 12
(A) 710 (B) 712 (ii) a + b = 71, no. of ordered pairs (a, b) is 35
(C) 714 (D) 716 (iii) a + b = 117, no. of ordered pairs (a, b) is 42
(iv) a + b = 163, no. of ordered pairs (a, b) is 19
Solution:(Correct Answer:A) ∴ total = 108 pairs
1000 − 2799 (7) Let m and n, (m < n) be two 2−digit numbers. Then the
Divisible by 3 total numbers of pairs ( m, n ), such that gcd(m, n) = 6, is
1002 + (n − 1)3 = 2799 _______.
n = 600
(A) 61 (B) 62
Divisible by 11
[ ]
1 − 2799 →[ 2799 = [254] = 254 (C) 63 (D) 64
]
11
1 − 999 = 99911 = 90 Solution:(Correct Answer:D)
1000 − 2799 = 254 − 90 = 164
Let m = 6a, n = 6b
Divisible by 33
[ ] m<n⇒a<b
1 − 2799 →[ 2799 ] = 84
33 where a b are co-prime numbers also since m n are 2 digit
1 − 999 → 33 = 30
999
nos, so
1000 − 2799 → 54 10 ≤ m ≤ 99 10 ≤ n ≤ 99
∴ n(3) + n(11) − n(33) i.e. 2 ≤ a ≤ 16 2 ≤ b ≤ 16
600 + 164 − 54 = 710 (∵ a is integer )
Now
(4) A natural number has prime factorization given by 2 ≤ a < b ≤ 16 a b are co-prime
n = 2x 3y 5z , where y and z are such that y + z = 5 and ∴ if
y −1 + z −1 = 56 , y > z. Then the number of odd divisors of n, a = 2, b = 3, 5, 7, 9, 11, 13, 15
including 1, is ..... . a = 3, b = 4, 5, 7, 8, 10, 11, 13, 14, 16
(A) 11 (B) 6 a = 4, b = 5, 7, 9, 11, 13, 15
(C) 6x (D) 12 a = 5, b = 6, 7, 8, 9, 11, 12, 13, 14, 16

4
 a = 6, b = 7, 11, 13 (13) The number of positive integral solutions of a b c = 30 is
a = 7, b = 8, 9, 10, 11, 12, 13, 15, 16 (A) 30 (B) 27
a = 8, b = 9, 11, 13, 15
a = 9, b = 10, 11, 13, 14, 16 (C) 8 (D) None of these
a = 10, b = 11, 13 Solution:(Correct Answer:B)
a = 11, b = 12, 13, 14, 15, 16
(b) We have, 30 = 2 × 3 × 5. So, 2 can be assigned to either
a = 12, b = 13
a or b or c i.e.2 can be assigned in 3 ways.
a = 13, b = 14, 15, 16
Similarly, each of 3 and 5 can be assigned in 3 ways.
a = 14, b = 15
Thus, the no. of solutions are 3 × 3 × 3 = 27.
a = 15, b = 16
64 ordered pairs
(14) The number of 3−digit numbers, that are divisible by either
2 or 3 but not divisible by 7 is ..........
(8) In how many ways can 5 boys and 5 girls sit in a circle so
(A) 513 (B) 512
that no two boys sit together
(A) 5! × 5 ! (B) 4 ! × 5 ! (C) 514 (D) 511
(C) 5!×5!
2 (D) None of these Solution:(Correct Answer:C)
Divisible by 2 → 450
Solution:(Correct Answer:B)
Divisible by 3 → 300
(b) Since total number of ways in which boys can occupy Divisible by 7 → 128
any place is (5 − 1) ! = 4 ! and the 5 girls can be sit Divisible by 2 and 7 → 64
accordingly in 5 ! ways. Divisible by 3 and 7 → 43
Hence required number of ways are 4 ! × 5 !. Divisible by 2 and 3 → 150
Divisible by 2, 3 and 7 → 21
(9) If n P3 +n Cn−2 = 14n, then n = ∴ Total numbers = 450 + 300 − 150 − 64 − 43 + 21 = 514
(A) 5 (B) 6
(15) A father with 8 children takes them 3 at a time to the
(C) 8 (D) 10
Zoological gardens, as often as he can without taking the
Solution:(Correct Answer:A) same 3 children together more than once. The number of
(a) By inspection n = 5. times he will go to the garden is
(A) 336 (B) 112
ss
(10) The number of matrices of order 3 × 3, whose entries are (C) 56 (D) None of these
either 0 or 1 and the sum of all the entries is a prime number,
la

is.... Solution:(Correct Answer:C)

dc

(A) 282 (B) 283 (c) The number of times he will go to the garden is same as
(C) 284 (D) 281 the number of selecting 3 children from 8.
Therefore the required number =8 C3 = 56.
Ve

Solution:(Correct Answer:A)
  (16) All the letters of the word P U BLIC are written in all
a11 a12 a13
A =  a21 a22 a23  aij ∈ {0, 1} possible orders and these words are written as in a
a31 a32 a33 dictionary with serial numbers. Then the serial number of
∑ the word P U BLIC is
aij = 2, 3, 5, 7
Total matrix = 9 C2 + 9 C3 + 9 C5 + 9 C7 (A) 580 (B) 582
= 282 (C) 578 (D) 576

(11) Ten different letters of an alphabet are given. Words with Solution:(Correct Answer:B)
five letters are formed from these given letters. Then the B . . . . . . . . . . . . . . . → 5! = 120
number of words which have at least one letter repeated is C . . . . . . . . . . . . . . . . . . → 5! = 120
(A) 69760 (B) 30240 I . . . . . . . . . . . . . . . . . . → 5! = 120
L . . . . . . . . . . . . . . . . . . 5! = 120
(C) 99748 (D) None of these P B . . . . . . . . . . . . . . . → 4! = 24
P C . . . . . . . . . . . . . . . . . . → 4! = 24
Solution:(Correct Answer:A)
P L . . . . . . . . . . . . . . . → 4! = 24
(a) Number of words in which all the 5 letters are repeated P I . . . . . . . . . . . . . . . → 4! = 24
= 105 = 100000 and the number of words in which no letter P ∪ BC . . . . . . . . . → 2! = 2
is repeated are 10 P5 = 30240. P ∪ BI . . . . . . . . . → 2! = 2
Hence the required number of ways are P ∪ BLC . . . . . . . → 1! = 1
=100000 − 30240 = 69760. P ∪ BLIC . . . . . . →= 1
Serial number = 4(120) + 4(24) + 6 = 582
(12) The number of ways in which 6 rings can be worn on the
four fingers of one hand is (17) A number is called a palindrome if it reads the same
(A) 46 (B) 6 C4 backward as well as forward. For example 285582 is a six
(C) 64 (D) None of these digit palindrome. The number of six digit palindromes, which
are divisible by 55, is ...... .
Solution:(Correct Answer:A) (A) 110 (B) 1000
(a) It is obvious. (C) 10 (D) 100

5
 Solution:(Correct Answer:D) Solution:(Correct Answer:B)
5 a b b a 5 L1 , L3 , L5 , − − L19 are Parallel
It is always divisible by 5 and 11. L2 , L4 , L6 , − − L20 are Concurrent
So, required number = 10 × 10 = 100 Total points of intersection = 20 C2 − 10 C2 − 10 C2 + 1
= 101
(18) An envelope has space for at most 3 stamps. If you are given (22) An n-digit number is a positive number with exactly n digits.
three stamps of denomination 1 , and three stamps of Nine hundred distinct n-digit numbers are to be formed
denomination a, (a > 1), the least positive integer for which using only the three digits 2, 5 and 7. The smallest value of n
there is no stamp value is for which this is possible is
(A) 7 (B) 8 (A) 6 (B) 7
(C) 9 (D) 10 (C) 8 (D) 9
Solution:(Correct Answer:A) Solution:(Correct Answer:B)
(a) (b) Since at any place, any of the digits 2, 5 and 7 can be
An envelope has space for at most 3 stamps. Three stamps used, total number of such positive n-digit numbers are 3n .
of denomination is 1 and three stamps of denomination is a. Since we have to form 900 distinct numbers,
The value of stamps of envelope must be hence 3n ≥ 900 ⇒ n = 7.
1 + 1 + 1 = 3, a + a + a = 3a
a + a + 1 = 2a + 1, a + 1 + 1 = a + 2 (23) Suppose Anil’s mother wants to give 5 whole fruits to Anil
a > 1, If a = 2 from a basket of 7 red apples, 5 white apples and 8 oranges.
then maximum value of stamps is If in the selected 5 fruits, at least 2 orange, at least one red
3×2=6 apple and at least one white apple must be given, then the
∴ Least positive integer has not stamp value is 7. number of ways, Anil’s mother can offer 5 fruits to Anil is
........
(19) The sum of all positive divisors of 960 is (A) 6860 (B) 6859
(A) 3048 (B) 3087 (C) 6850 (D) 6589
(C) 3047 (D) 2180
Solution:(Correct Answer:A)
Solution:(Correct Answer:A) 7 Red apple(RA),5 white apple (W A),8 oranges(O),5 fruits
ss
(a) Given number is 960, we know that 960 = 26 × 31 × 51 . to be selected (Note:- fruits taken different) Possible
selections :- (2O, 1RA, 2W A) or (2O, 2RA, 1W A) or (
la

Therefore bases are p1 = 2, p2 = 3 and p3 = 5. and powers

a1 = 6, a2 = 1 and a3 = 1. 3O, 1RA, 1W A)
dc

Thus ⇒ 8 C2 7 C1 5 C2 + 8 C2 7 C2 5 C1 + 8 C3 7 C1 5 C1
( sum of all
) (theapositive ) (divisors of)960
⇒ 1960 + 2940 + 1960
p1 a1 +1 −1 p2 2 +1 −1 p3 a3 +1 −1
=
( 6+1p1 −1
) ( 1+1 p2 −1 ) ( 1+1 p)3 −1 ⇒ 6860
Ve

2 −1 3 −1 5 −1
= 2−1 3−1 5−1 = (127)(4)(6) = 3048.
(24) Let S = {(a, b)a, b ∈ Z, 0 ≤ a, b ≤ 18}. The number of lines
in R2 passing through (0, 0) and exactly one other point in S
(20) Let the set S = {2, 4, 8, 16, . . . ..512} be partitioned into 3 is
sets A, B, C with equal number of elements such that (A) 16 (B) 22
A ∪ B ∪ C = S and A ∩ B = B ∩ C = A ∩ C = ϕ. The maximum (C) 28 (D) 32
number of such possible partitions of S is equal to :
(A) 1680 (B) 1520 Solution:(Correct Answer:A)
(a)
(C) 1710 (D) 1640 We have,
S = {(a, b) : a, b ∈ Z, 0 ≤ a, b ≤ 18}
Solution:(Correct Answer:A)
Number of line in R2 passing through (0, 0) and one other
(3!3!3!)3! × 3!
9!
point in S is 34.
(1, 17), (2, 17), (3, 17), . . . , (18, 17) = 17 points
(17, 1), (17, 2), (17, 3), . . . , (17, 18) = 17 points
∴ Total number of lines = 34

(25) 5− digit numbers are to be formed using 2, 3, 5, 7, 9 without

repeating the digits. If p be the number of such numbers
that exceed 20000 and q be the number of those that lie
between 30000 and 90000, then p : q is
(A) 6 : 5 (B) 3 : 2
(21) The lines L1 , L2 , . . . , L20 are distinct. For n = 1, 2, 3, . . . , 10 all
(C) 4 : 3 (D) 5 : 3
the lines L2n−1 are parallel to each other and all the lines L2n
pass through a given point P . The maximum number of Solution:(Correct Answer:D)
points of intersection of pairs of lines from the set 0 0 0 0 0 place
{L1 , L2 , . . . , L20 } is equal to : p :
5 4 3 2 1 ways
(A) 425 (B) 101 Total no. of ways = 5! = 120
(C) 357 (D) 110 Since all numbers are > 20, 000

6
∴ all numbers 2, 3, 5, 7, 9 can come at first place.
0 0 0 0 0 place
q :
3 4 3 2 1 ways
Total no. of ways = 3 × 4! = 72
( ∴ 2 and 9 can not be put at first place)
So, p : q = 120 : 72 = 5 : 3

ss
la
dc
Ve