Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Kunalbag7
2
votes
1
TIFR CSE 2022 | Part A | Question: 2
We would like to invite a minimum number $n$ of people (their birthdays are independent of each other) to a party such that the expected number of pairs of people that share the same birthday is at least $1.$ What should $n$ be? (Ignore leap years, so ... birthdays fall with equal probability on each of the $365$ days of the year.) $23$ $28$ $92$ $183$ $366$
We would like to invite a minimum number $n$ of people (their birthdays are independent of each other) to a party such that the expected number of pairs of people that sh...
818
views
answered
Nov 19, 2022
Probability
tifr2022
probability
expectation
+
–
0
votes
2
TIFR CSE 2022 | Part B | Question: 14
Let $G$ be a directed graph (with no self-loops or parallel edges) with $n \geq 2$ vertices and $m$ edges. Consider the $n \times m$ incidence matrix $M$ of $G$, whose rows are indexed by the vertices of $G$ and the columns by the edges of $G$ ... . Then, what is the rank of $M?$ $m-1$ $m-n+1$ $\lceil m / 2\rceil$ $n-1$ $\lceil n / 2\rceil$
Let $G$ be a directed graph (with no self-loops or parallel edges) with $n \geq 2$ vertices and $m$ edges. Consider the $n \times m$ incidence matrix $M$ of $G$, whose ro...
467
views
answered
Nov 9, 2022
Graph Theory
tifr2022
graph-theory
graph-connectivity
rank-of-matrix
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register