PART ‘A’

References

CSIR-UGC NET December 2015 (Pure

Mathematics) Solved

Surajit Biswas

September 21, 2023

Surajit Biswas CSIR-UGC NET December 2015 (Pure Mathematics) Solved

 PART ‘A’
References

1. PART ‘A’

Surajit Biswas CSIR-UGC NET December 2015 (Pure Mathematics) Solved

 PART ‘A’
References

Question 1.
Suppose three meetings of a group of professors were arranged in
Mumbai, Delhi and Chennai. Each professor of the group attended
exactly two meetings. 21 professors attended Mumbai meeting, 27
attended Delhi meeting and 30 attended Chennai meeting. How
many of them attended both the Chennai and Delhi meetings?
(1) 18 (3) 26
(2) 24 (4) Cannot be found
from the above
information.

Surajit Biswas CSIR-UGC NET December 2015 (Pure Mathematics) Solved

 PART ‘A’
References

Answer.
Let MD be the number of professors who attended both the
Mumbai and Delhi meetings, DC be the number of professors who
attended both the Delhi and Chennai meetings, and CM be the
number of professors who attended both the Chennai and Mumbai
meetings. Then, we have

MD + DC = 27, (1)
DC + CM = 30, (2)
and CM + MD = 21. (3)

Adding equations (1), (2), and (3), we get

27 + 30 + 21
MD + DC + CM = = 39. (4)
2
Subtracting equation (3) from equation (4), we get
DC = 39 − 21 = 18.

Surajit Biswas CSIR-UGC NET December 2015 (Pure Mathematics) Solved

 PART ‘A’
References

Question 2.
The probability that a ticketless traveler is caught during a trip is
0.1. If the traveler makes 4 trips, the probability that he/she will
be caught during at least one of the trips is
(1) 1 − (0.9)4 (3) 1 − (1 − 0.9)4
(2) (1 − 0.9)4 (4) (0.9)4

Surajit Biswas CSIR-UGC NET December 2015 (Pure Mathematics) Solved

 PART ‘A’
References

Answer.
Given that the probability of getting caught on a single trip is 0.1,
we can calculate the probability of not getting caught on a single
trip as 0.9. Assuming that the four trips are independent, the
probability of not getting caught on any of the four trips is (0.9)4 .
Therefore, the probability of getting caught at least once is equal
to 1 minus the probability of not getting caught on any of the four
trips, which gives us a probability of 1 − (0.9)4 .

Surajit Biswas CSIR-UGC NET December 2015 (Pure Mathematics) Solved

 PART ‘A’
References

Question 3.
The minimum number of straight
lines required to connect the nine
points without lifting the pen or
retracing is
(1) 3 (3) 5
(2) 4 (4) 6

Answer.

Surajit Biswas CSIR-UGC NET December 2015 (Pure Mathematics) Solved

 PART ‘A’
References

Question 4.

Answer.

Surajit Biswas CSIR-UGC NET December 2015 (Pure Mathematics) Solved

 PART ‘A’
References

(1) (3)
(2) (4)
D. Dummit, R. Foote, Abstract Algebra (3rd Edition), Wiley
(2003).

Surajit Biswas CSIR-UGC NET December 2015 (Pure Mathematics) Solved

 PART ‘A’
References

Thank You

Surajit Biswas CSIR-UGC NET December 2015 (Pure Mathematics) Solved