Register
Filter

Most viewed questions in Discrete Mathematics

3 votes
1 answer
2241
probability distribution
A arrives at office at 8-10am regularly; B arrives at 9-11 am every day. Probability that one day B arrives before A? [Assume arrival time of both A and B are uniformly distributed]
A arrives at office at 8-10am regularly; B arrives at 9-11 am every day. Probability that one day B arrives before A? [Assume arrival time of both A and B are uniformly d...
User Avatar
2 votes
3 answers
2242
Lattice
How to pick an option from this I feel like both c and d are correct what do you day?
How to pick an option from this I feel like both c and d are correct what do you day?
User Avatar
0 votes
0 answers
2243
Madeeasy CBT1
User Avatar
1 votes
2 answers
2244
IISc CDS (MTech-R)
Number of distinct simple graphs possible, given 8 vertices and not considering self loops?
Number of distinct simple graphs possible, given 8 vertices and not considering self loops?
User Avatar
0 votes
1 answer
2245
Quantifiers Problem
User Avatar
2 votes
2 answers
2246
graph theory
Maximum no of edges in a triangle-free, simple planar graph with 10 vertices
Maximum no of edges in a triangle-free, simple planar graph with 10 vertices
User Avatar
0 votes
0 answers
2250
Boolean Algebra Lattice Discrete Mathematics
Boolean algebra is a bounded distributed complemented lattice, also lattice is a poset thus it satisfies reflexive , antisymmetric and transitive properties. Does Boolean Algebra satisfy commutative law?
Boolean algebra is a bounded distributed complemented lattice, also lattice is a poset thus it satisfies reflexive , antisymmetric and transitive properties. Does Boolean...
User Avatar
0 votes
2 answers
2253
Graph Theory
let G=(V,E) be an connected graph, let $\left | V \right |= n$ Find largest value of n such that i) G is complete & ii) G is bipartite with valid proof
let G=(V,E) be an connected graph, let $\left | V \right |= n$Find largest value of n such thati) G is complete &ii) G is bipartitewith valid proof
User Avatar
0 votes
0 answers
2254
Directed graph
How many distinct directed graphs are there nodes labeled 1, 2, 3, 4? [consider graphs with no multiple edges and loops]
How many distinct directed graphs are there nodes labeled 1, 2, 3, 4? [consider graphs with no multiple edges and loops]
User Avatar
0 votes
3 answers
2255
The number of colors needed to edge color a simple graph with maximum degree Δ is?
The number of colors needed to edge color a simple graph with maximum degree Δ is? Is this there in portion?
The number of colors needed to edge color a simple graph with maximum degree Δ is?Is this there in portion?
User Avatar
3 votes
2 answers
2256
Manipulation of sum
Prove the identity: $\begin{align*} &\sum_{i=0}^{n}\sum_{j=0}^{i} a_ia_j = \frac{1}{2}\left ( \left ( \sum_{i=0}^{n}a_i \right )^2 + \left ( \sum_{i=0}^{n}a_i^2 \right )\right ) \end{align*}$
Prove the identity:$$\begin{align*} &\sum_{i=0}^{n}\sum_{j=0}^{i} a_ia_j = \frac{1}{2}\left ( \left ( \sum_{i=0}^{n}a_i \right )^2 + \left ( \sum_{i=0}^{n}a_i^2 \right )\...
User Avatar
4 votes
1 answer
2259
Propositional Logic
Which of the following is/are TRUE? $(∀x)(∃y) J(x,y) \equiv (∃y)(∀x) J(x,y)$ $(∃x)(∀y) J(x,y) \equiv (∀y)(∃x) J(x,y)$ $(∀x)(∀y) J(x,y) \equiv (∀y)(∀x) J(x,y)$ $(∃x)(∃y) J(x,y) \equiv (∃y)(∃x) J(x,y)$
Which of the following is/are TRUE?$(∀x)(∃y) J(x,y) \equiv (∃y)(∀x) J(x,y)$$(∃x)(∀y) J(x,y) \equiv (∀y)(∃x) J(x,y)$$(∀x)(∀y) J(x,y) \equiv (∀y)(∀x...
User Avatar
1 votes
2 answers
2260
Probability question on a pair of dice
I think the ans should be C, but the given answer is A. Anyone can explain please?
I think the ans should be C, but the given answer is A. Anyone can explain please?
User Avatar
Page: