Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged discrete-mathematics
1
votes
1
answer
1621
Set theory
Consider a set S $\left \{ 2,3,4,.....,23,24 \right \}$ and R is relation on S such that aRb if a divides b, then find the number of minimal elements in its hasse diagram
Consider a set S $\left \{ 2,3,4,.....,23,24 \right \}$ and R is relation on S such that aRb if a divides b, then find the number of minimal elements in its hasse diagram...
Mk Utkarsh
1.8k
views
Mk Utkarsh
asked
Mar 10, 2018
Set Theory & Algebra
discrete-mathematics
set-theory&algebra
relations
+
–
0
votes
1
answer
1622
Discrete mathematics C.L.Liu Solutions
Can I have solutions of ELEMENTS OF DISCRETE MATHEMATICS by C.L.Liu Solutions. Pls help
Can I have solutions of ELEMENTS OF DISCRETE MATHEMATICS by C.L.Liu Solutions. Pls help
MayankSharma
4.3k
views
MayankSharma
asked
Mar 9, 2018
Mathematical Logic
discrete-mathematics
+
–
0
votes
2
answers
1623
Kenneth Rosen Edition 6th Exercise 5.2 Example 9 (Page No. 350)
Suppose that a computer science laboratory has $15$ workstations and $10$ servers. A cable can be used to directly connect a workstation to a server. For each server, only one direct connection to that server ... of direct connections needed to achieve this goal? Please Explain in this question how pigeonhole principle is applied .
Suppose that a computer science laboratory has $15$ workstations and $10$ servers. A cable can be used to directly connect a workstation to a server. For each server, onl...
Abhinavg
782
views
Abhinavg
asked
Mar 6, 2018
Combinatory
kenneth-rosen
discrete-mathematics
counting
pigeonhole-principle
+
–
1
votes
3
answers
1624
Kenneth Rosen Edition 6th Exercise 5.5 Example 10 (Page No. 377)
How many ways are there to put four different employees into three indistinguishable offices when each office can contain any number of employees?
How many ways are there to put four different employees into three indistinguishable offices when each office can contain any number of employees?
Lakshman Bhaiya
4.5k
views
Lakshman Bhaiya
asked
Mar 2, 2018
Combinatory
kenneth-rosen
discrete-mathematics
counting
combinatory
+
–
0
votes
1
answer
1625
Rosen (Graph)
Show that an edge in a simple graph is a cut edge if and only if this edge is not a part of any simple circuit in the graph.
Show that an edge in a simple graph is a cut edge if and only if this edge is not a part of any simple circuit in the graph.
Mk Utkarsh
539
views
Mk Utkarsh
asked
Mar 1, 2018
Graph Theory
discrete-mathematics
graph-theory
+
–
0
votes
1
answer
1626
Kenneth Rosen Edition 6th Exercise 8.4 Question 70 (Page No. 565 )
How much storage is needed to represent a simple graph with n vertices and m edges using. a) adjacency lists? b) an adjacency matrix? c) an incidence matrix?
How much storage is needed to represent a simple graph with n vertices and m edges using.a) adjacency lists?b) an adjacency matrix?c) an incidence matrix?
Mk Utkarsh
2.5k
views
Mk Utkarsh
asked
Mar 1, 2018
Graph Theory
graph-theory
kenneth-rosen
discrete-mathematics
graph-connectivity
+
–
3
votes
2
answers
1627
Kenneth Rosen Edition 6th Exercise 5.3 Example 14 (Page No. 360)
How many bit strings of length $n$ contain exactly $r$ $1's$?
How many bit strings of length $n$ contain exactly $r$ $1's$?
Lakshman Bhaiya
1.3k
views
Lakshman Bhaiya
asked
Feb 28, 2018
Combinatory
discrete
discrete-mathematics
kenneth-rosen
counting
+
–
0
votes
1
answer
1628
Rosen Ex1.1 Q No. 45
Each inhabitant of a remote village always tells the truth or always lies. A villager will only give a "Yes" or a "No" response to a question a tourist asks. Suppose you are a tourist visiting this area and come to a fork in the ... A villager is standing at the fork in the road. What one question can you ask the villager to determine which branch to take?
Each inhabitant of a remote village always tells the truth or always lies. A villager will only give a "Yes" or a "No" response to a question a tourist asks. Suppose you ...
Harshita
653
views
Harshita
asked
Feb 25, 2018
Mathematical Logic
discrete-mathematics
mathematical-logic
puzzle
+
–
1
votes
1
answer
1629
Generating function doubt
Please give me clarification
Please give me clarification
Lakshman Bhaiya
584
views
Lakshman Bhaiya
asked
Feb 24, 2018
Combinatory
discrete-mathematics
generating-functions
+
–
1
votes
1
answer
1630
Generating Function
How to apply this theorem to $\frac{x^{3}}{1-x}$
How to apply this theorem to $\frac{x^{3}}{1-x}$
Mk Utkarsh
966
views
Mk Utkarsh
asked
Feb 23, 2018
Set Theory & Algebra
generating-functions
discrete-mathematics
+
–
0
votes
1
answer
1631
Self Doubt
What would be the execution order of the below statement? $A \implies B \implies C$
What would be the execution order of the below statement?$$A \implies B \implies C$$
Lakshman Bhaiya
601
views
Lakshman Bhaiya
asked
Feb 19, 2018
Mathematical Logic
discrete-mathematics
+
–
0
votes
1
answer
1632
Kenneth Rosen Edition 6th Exercise 1.3 Example 27 (Page No. 45)
Q)Consider these statements, of which the first three are and fourth is a valid conclusion. "All hummingbirds are richly colored." "No large birds live on honey." "Birds that do not live on honey are dull in color" "Hummingbirds are small." Express using quantifiers??
Q)Consider these statements, of which the first three are and fourth is a valid conclusion."All hummingbirds are richly colored.""No large birds live on honey.""Birds tha...
Lakshman Bhaiya
9.2k
views
Lakshman Bhaiya
asked
Feb 18, 2018
Mathematical Logic
propositional-logic
kenneth-rosen
discrete-mathematics
quantifiers
+
–
0
votes
0
answers
1633
Kenneth Rosen Edition 6th Exercise 7.4 (Page No. 488)
Let R be a relation on a set A. R may or may not have some property P, such as reflexivity, symmetry, or transitivity. If there is a relation S with property P containing R such that S is a subset of every relation with ... R, then S is called the closure Relations of R with respect to P. can someone explain this definition in simple words?
Let R be a relation on a set A. R may or may not have some property P, such as reflexivity, symmetry, or transitivity. If there is a relation S with property P containing...
Mk Utkarsh
422
views
Mk Utkarsh
asked
Feb 14, 2018
Set Theory & Algebra
discrete-mathematics
kenneth-rosen
set-theory&algebra
closure-property
+
–
1
votes
1
answer
1634
Composition of functions
There exist 3 sets(A,B,C) and 2 functions f and g. g be a function from set A to set B f be a function from set B to set C then composition of both the functions is denoted by $f \circ g$ which exists. Then what is the necessary condition for the following 2 functions for the existence of $g \circ f$ a) Injection b) Surjection c) Bijection d) None of these
There exist 3 sets(A,B,C) and 2 functions f and g.g be a function from set A to set Bf be a function from set B to set Cthen composition of both the functions is denoted ...
Mk Utkarsh
1.8k
views
Mk Utkarsh
asked
Feb 12, 2018
Set Theory & Algebra
discrete-mathematics
functions
+
–
2
votes
1
answer
1635
Mathematical Logic
All Tautologies are valid and all Valid arguments are tautologies True/ False
All Tautologies are valid and all Valid arguments are tautologies True/ False
Mk Utkarsh
391
views
Mk Utkarsh
asked
Feb 11, 2018
Mathematical Logic
mathematical-logic
discrete-mathematics
+
–
0
votes
1
answer
1636
Subject Topic- Mathematical Logic
Can someone please explain the highlighted text?
Can someone please explain the highlighted text?
Mk Utkarsh
428
views
Mk Utkarsh
asked
Feb 11, 2018
Mathematical Logic
mathematical-logic
discrete-mathematics
+
–
1
votes
1
answer
1637
Graph theory
If $N=(0,1,2,3 ....)$ , then $(N,+)$ is a Group. If $N=(1,2,3 ....)$ , then $(N,+)$ is a not Group. Which one to consider in exam ?
If $N=(0,1,2,3 ....)$ , then $(N,+)$ is a Group.If $N=(1,2,3 ....)$ , then $(N,+)$ is a not Group.Which one to consider in exam ?
Aspirant
378
views
Aspirant
asked
Feb 6, 2018
Mathematical Logic
group-theory
discrete-mathematics
+
–
1
votes
3
answers
1638
CMI2017-B-5
An undirected graph is $\text{connected}$ if, for any two vertices $\{u, v\}$ of the graph, there is a path in the graph starting at $u$ and ending at $v$. A tree is a connected, undirected graph that contains no cycle. A $\text{leaf}$ in a tree is a vertex that ... $ \in V_2$ or vice versa. Prove that if $G$ is a tree with at least two vertices, then $G$ is bipartite.
An undirected graph is $\text{connected}$ if, for any two vertices $\{u, v\}$ of the graph, there is a path in the graph starting at $u$ and ending at $v$. A tree is a co...
Tesla!
1.3k
views
Tesla!
asked
Feb 5, 2018
Graph Theory
cmi2017
engineering-mathematics
discrete-mathematics
graph-theory
graph-connectivity
descriptive
+
–
2
votes
3
answers
1639
CMI2017-B-4
In a party there are $2n$ participants, where $n$ is a positive integer. Some participants shake hands with other participants. It is known that there are no three participants who have shaken hands with each other. Prove that the total number of handshakes is not more than $n^2.$
In a party there are $2n$ participants, where $n$ is a positive integer. Some participants shake hands with other participants. It is known that there are no three partic...
Tesla!
1.0k
views
Tesla!
asked
Feb 5, 2018
Combinatory
cmi2017
engineering-mathematics
discrete-mathematics
combinatory
descriptive
+
–
2
votes
2
answers
1640
CMI2017-A-05
Let $G$ be an arbitrary graph on $n$ vertices with $4n − 16$ edges. Consider the following statements: There is a vertex of degree smaller than $8$ in $G$. There is a vertex such that there are less than $16$ vertices at a distance exactly $2$ from it. Which of the following is true: I Only II Only Both I and II Neither I nor II
Let $G$ be an arbitrary graph on $n$ vertices with $4n − 16$ edges. Consider the following statements:There is a vertex of degree smaller than $8$ in $G$.There is a ver...
Tesla!
1.2k
views
Tesla!
asked
Feb 4, 2018
Graph Theory
cmi2017
engineering-mathematics
discrete-mathematics
graph-theory
graph-connectivity
+
–
0
votes
1
answer
1641
maths
The average of 4 distinct prime numbers a, b, c, d is 35 where a < b < c < d. b and c are equidistant from 34 and; a and b are equidistant from 30 and; c and d are equidistant from 40; a and d are equidistant from 36 . The difference between a and d is?
The average of 4 distinct prime numbers a, b, c, d is 35 where a < b < c < d. b and c are equidistant from 34 and; a and b are equidistant from 30 and; c and d are equidi...
Rudra Pratap
1.5k
views
Rudra Pratap
asked
Feb 1, 2018
Mathematical Logic
discrete-mathematics
+
–
0
votes
1
answer
1642
Virtual Gate Test Series: Discrete Mathematics - Propositional Logic
Which of the following statements is TRUE about the propositional logic formula $S:\{(p→q)∧(¬q∨r)∧(r→s)\}→¬(p→s)$ $(A)$ S is a contradiction $(B)$ S is satisfiable but not valid $(C)$ S is valid $(D)$ None of the above
Which of the following statements is TRUE about the propositional logic formula$S:\{(p→q)∧(¬q∨r)∧(r→s)\}→¬(p→s)$$(A)$ S is a contradiction$(B)$ S is satis...
Utsav09
331
views
Utsav09
asked
Jan 31, 2018
Mathematical Logic
discrete-mathematics
mathematical-logic
virtual-gate-test-series
+
–
1
votes
0
answers
1643
# pair of sets
Given that X is a set of n elements. How many pairs of sets (A, B) exist such that A⊆B⊆S? a. 2n b. 2n+1 c. 3n
Given that X is a set of n elements. How many pairs of sets (A, B) exist such that A⊆B⊆S?a. 2nb. 2n+1c. 3n
Tuhin Dutta
378
views
Tuhin Dutta
asked
Jan 30, 2018
Set Theory & Algebra
discrete-mathematics
set-theory&algebra
+
–
0
votes
0
answers
1644
mock test
how they are equivalent
how they are equivalent
92komal
265
views
92komal
asked
Jan 29, 2018
Mathematical Logic
discrete-mathematics
+
–
2
votes
1
answer
1645
Function
srestha
566
views
srestha
asked
Jan 29, 2018
Set Theory & Algebra
functions
discrete-mathematics
+
–
2
votes
1
answer
1646
Mathematical Logic
$Student(a)$ : $a$ is a student $Loves(a,b)$ : $a$ loves $b$ Consider the following First Order Logic Statement: $\exists x (Student(x)\ \Lambda\ \forall y(student(y)\ \Lambda\ \sim(x=y)\Rightarrow Loves(y,x)\ ))$ Which of the following is ... by every other student There is a student who is not loved by every other student I think here B) and C) both could be answer, Isnot it??
$Student(a)$ : $a$ is a student$Loves(a,b)$ : $a$ loves $b$Consider the following First Order Logic Statement:$\exists x (Student(x)\ \Lambda\ \forall y(student(y)\ \Lamb...
srestha
746
views
srestha
asked
Jan 27, 2018
Mathematical Logic
discrete-mathematics
mathematical-logic
first-order-logic
+
–
1
votes
2
answers
1647
Graph Theory- vertex degree
Consider an undirected graph with n vertices, vertex 1 has degree 1, while each vertex 2,3......, n – 1 has degree 4. The degree of vertex n is unknown. Which of the following statement must be TRUE? a. Vertex n has degree 1. b. Graph is connected. c. There is a path from vertex 1 to vertex n. d. Spanning tree will include the edge connecting vertex 1 and n.
Consider an undirected graph with n vertices, vertex 1 has degree 1, while each vertex 2,3......, n – 1 has degree 4. The degree of vertex n is unknown. Which of the fo...
Tuhin Dutta
662
views
Tuhin Dutta
asked
Jan 27, 2018
Graph Theory
discrete-mathematics
graph-theory
+
–
2
votes
1
answer
1648
Self doubt Set
True/False $\left \{ \phi \right \} \neq \phi$
True/False$\left \{ \phi \right \} \neq \phi$
Mk Utkarsh
496
views
Mk Utkarsh
asked
Jan 26, 2018
Set Theory & Algebra
discrete-mathematics
+
–
1
votes
1
answer
1649
Propositional Logic
Not Valid does it mean not False ? also how to solve it ?
Not Valid does it mean not False ? also how to solve it ?
Salazar
759
views
Salazar
asked
Jan 26, 2018
Mathematical Logic
propositional-logic
discrete-mathematics
mathematical-logic
engineering-mathematics
+
–
Page:
« prev
1
...
50
51
52
53
54
55
56
57
58
59
60
...
80
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register