Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged discrete-mathematics
0
votes
1
answer
91
Kenneth Rosen Edition 7 Exercise 1.3 Question 13 (Page No. 35)
Use truth tables to verify the absorption laws. a) p ∨ (p ∧ q) ≡ p b) p ∧ (p ∨ q) ≡ p
Use truth tables to verify the absorption laws.a) p ∨ (p ∧ q) ≡ p b) p ∧ (p ∨ q) ≡ p
pavan singh
574
views
pavan singh
asked
Jan 21, 2023
Mathematical Logic
kenneth-rosen
discrete-mathematics
propositional-logic
+
–
0
votes
1
answer
92
Kenneth Rosen Edition 7 Exercise 1.3 Question 12 (Page No. 35)
Show that each conditional statement in Exercise 10 is a tautology without using truth tables.
Show that each conditional statement in Exercise 10 is a tautology without using truth tables.
pavan singh
325
views
pavan singh
asked
Jan 21, 2023
Mathematical Logic
kenneth-rosen
discrete-mathematics
propositional-logic
+
–
0
votes
1
answer
93
Kenneth Rosen Edition 7 Exercise 1.3 Question 11 (Page No. 35)
Show that each conditional statement in Exercise 9 is a tautology without using truth tables.
Show that each conditional statement in Exercise 9 is a tautology without using truth tables.
pavan singh
370
views
pavan singh
asked
Jan 21, 2023
Mathematical Logic
kenneth-rosen
discrete-mathematics
propositional-logic
+
–
0
votes
0
answers
94
Kenneth Rosen Edition 7 Exercise 1.3 Question 10 (Page No. 35)
Show that each of these conditional statements is a tautology by using truth tables. a) [¬p ∧ (p ∨ q)] → q b) [(p → q) ∧ (q → r)] → (p → r) c) [p ∧ (p → q)] → q d) [(p ∨ q) ∧ (p → r) ∧ (q → r)] → r
Show that each of these conditional statements is a tautology by using truth tables.a) [¬p ∧ (p ∨ q)] → qb) [(p → q) ∧ (q → r)] → (p → r)c) [p ∧ (p →...
pavan singh
492
views
pavan singh
asked
Jan 21, 2023
Mathematical Logic
kenneth-rosen
discrete-mathematics
propositional-logic
+
–
0
votes
0
answers
95
set, relation
Consider the partition of a set having 3 block of 5 elements each, 4 block of 2 elements each and 2 block of 3 elements in each block. Find the cardinality of equivalence relation.
Consider the partition of a set having 3 block of 5 elements each, 4 block of 2 elements each and 2 block of 3 elements in each block.Find the cardinality of equivalence ...
someshawasthi
448
views
someshawasthi
asked
Jan 17, 2023
Set Theory & Algebra
discrete-mathematics
set-theory
+
–
2
votes
1
answer
96
Variance of X in envelope question
Three letters are placed into three addressed envelopes randomly. A random variable X denotes the number of letters placed into corresponding envelopes. The variance of X is __________.
Three letters are placed into three addressed envelopes randomly. A random variable X denotes the number of letters placed into corresponding envelopes. The variance of X...
h4kr
580
views
h4kr
asked
Jan 15, 2023
Probability
probability
discrete-mathematics
+
–
0
votes
2
answers
97
Kenneth Rosen Edition 7 Exercise 1.2 Question 39 (Page No. 24)
Freedonia has fifty senators. Each senator is either honest or corrupt. Suppose you know that at least one of the Freedonian senators is honest and that, given any two Freedonian senators, at least one is corrupt. Based on ... you determine how many Freedonian senators are honest and how many are corrupt? If so, what is the answer?
Freedonia has fifty senators. Each senator is either honest or corrupt. Suppose you know that at least one of the Freedonian senators is honest and that, given any two Fr...
pavan singh
1.5k
views
pavan singh
asked
Jan 12, 2023
Mathematical Logic
kenneth-rosen
discrete-mathematics
propositional-logic
+
–
0
votes
0
answers
98
#selfdoubt
Let n players enter a chess tournament. How many tournament trees are possible? RULES: a player is eliminated after one loss and games are played until only one entrant is left(assume no ties) My approach: (please check if it is correct) there are 3 possible binary tree skeletons w.r.t ... )C2 * (n-4)C2 *...*1} * 2^(n-1) similarly we can do the remaining cases. Is the above method right?
Let n players enter a chess tournament. How many tournament trees are possible?RULES: a player is eliminated after one loss and games are played until only one entrant is...
robinofautumn
317
views
robinofautumn
asked
Jan 11, 2023
Combinatory
discrete-mathematics
graph-theory
combinatory
binary-tree
+
–
1
votes
2
answers
99
Kenneth Rosen Edition 7 Exercise 1.2 Question 37 (Page No. 24)
Suppose there are signs on the doors to two rooms. The sign on the first door reads In this room there is a lady, and in the other one there is a tiger ; and the sign on the second door reads In one of these rooms, ... tiger. Suppose that you know that one of these signs is true and the other is false. Behind which door is the lady?
Suppose there are signs on the doors to two rooms. The sign on the first door reads “In this room there is a lady, and in the other one there is a tiger”; and the sig...
pavan singh
1.3k
views
pavan singh
asked
Jan 9, 2023
Mathematical Logic
kenneth-rosen
discrete-mathematics
propositional-logic
+
–
1
votes
2
answers
100
Kenneth Rosen Edition 7 Exercise 1.2 Question 36 (Page No. 24))
Four friends have been identified as suspects for an unauthorized access into a computer system. They have made statements to the investigating authorities. Alice said Carlos did it. John said I did not do it. Carlos said ... reasoning. b) If the authorities also know that exactly one is lying, who did it? Explain your reasoning.
Four friends have been identified as suspects for an unauthorized access into a computer system. They have made statements to the investigating authorities. Alice said“...
pavan singh
2.0k
views
pavan singh
asked
Jan 9, 2023
Mathematical Logic
kenneth-rosen
discrete-mathematics
propositional-logic
+
–
0
votes
1
answer
101
Made Easy Test Series | Discrete Maths | POSET | Chain length
50 51 52 53
50515253
Souvik33
494
views
Souvik33
asked
Jan 5, 2023
Graph Theory
made-easy-test-series
discrete-mathematics
+
–
0
votes
1
answer
102
Set Theory, Basic | Power of a set
Given set A= {a,b}$^3$ What do the formed set look like and what is |A| (cardinility of A)
Given set A= {a,b}$^3$What do the formed set look like and what is |A| (cardinility of A)
Souvik33
389
views
Souvik33
asked
Jan 5, 2023
Set Theory & Algebra
discrete-mathematics
set-theory
self-doubt
+
–
0
votes
0
answers
103
Set Theory Test Series Question
Statement 1: If $A\subseteq B$ and $B \subseteq A$ then $A= B$ Statement 2: If $A= B$ then $A\subseteq B$ or $B \subseteq A$ Which of these statements are true? Statement 1 is standard definition of Equivalence of 2 sets, so always true. Statement 2 seems to be true but I am not sure.
Statement 1: If $A\subseteq B$ and $B \subseteq A$ then $A= B$Statement 2: If $A= B$ then $A\subseteq B$ or $B \subseteq A$Which of these statements are true?Statement 1 ...
Sunnidhya Roy
386
views
Sunnidhya Roy
asked
Jan 4, 2023
Set Theory & Algebra
set-theory&algebra
discrete-mathematics
+
–
3
votes
0
answers
104
graph theory
Let $G=(V,E)$ where $V=\left \{ 1,2,3,4,.....,150\right \}$ and $(u,v) \in E$ if either $(u mod v) =0$ or $(v mod u)=0$.The Chromatic number of G is ?
Let $G=(V,E)$ where $V=\left \{ 1,2,3,4,.....,150\right \}$ and $(u,v) \in E$ if either $(u mod v) =0$ or $(v mod u)=0$.The Chromatic number of G is ?
Kabir5454
427
views
Kabir5454
asked
Jan 2, 2023
Graph Theory
zeal
graph-theory
discrete-mathematics
graph-coloring
numerical-answers
+
–
0
votes
0
answers
105
Self Doubt
A relation R1 : aRb iff (a congruent b) modulo 5 and relation R2 : aRb iff (a congruent b modulo 7). What will be R1 U R2 ?
A relation R1 : aRb iff (a congruent b) modulo 5 and relation R2 : aRb iff (a congruent b modulo 7). What will be R1 U R2 ?
curious mind
310
views
curious mind
asked
Jan 1, 2023
Mathematical Logic
discrete-mathematics
self-doubt
+
–
22
votes
1
answer
106
Recurrence Relation - Self Doubt
What is the recurrence relation for the ternary strings of length $n$ which can be constructed using 0,1 or 2 only such that the number of 0’s and number of 1's is odd ?
What is the recurrence relation for the ternary strings of length $n$ which can be constructed using 0,1 or 2 only such that the number of 0’s and number of 1's is od...
P C
1.5k
views
P C
asked
Dec 31, 2022
Combinatory
recurrence-relation
discrete-mathematics
+
–
2
votes
1
answer
107
All reflexive relations are anti-symmetric
Is the statement true that all reflexive relations are anti-symmetric?
Is the statement true that all reflexive relations are anti-symmetric?
h4kr
338
views
h4kr
asked
Dec 27, 2022
Set Theory & Algebra
relations
discrete-mathematics
+
–
0
votes
0
answers
108
Maths
Can anyone please suggest any single resource which has a comprehensive list of Trigonometric Identities which might be useful to solve sums ?? (Inverses, Half angles, Double Angles, Sum rule, Product Rule etc.).
Can anyone please suggest any single resource which has a comprehensive list of Trigonometric Identities which might be useful to solve sums ?? (Inverses, Half angles, Do...
Sunnidhya Roy
261
views
Sunnidhya Roy
asked
Dec 20, 2022
Mathematical Logic
trigonometry
engineering-mathematics
discrete-mathematics
+
–
1
votes
1
answer
109
First Order Logic: Gate@Zeal Test series
Shoto
721
views
Shoto
asked
Dec 12, 2022
Mathematical Logic
zeal
mathematical-logic
first-order-logic
discrete-mathematics
+
–
0
votes
1
answer
110
Discrete mathematics kenneth rosen
Determine whether the premises If I do not leave my home early or get stuck in a traffic jam, I will be late to my class and get scolded by my teacher , If I am late to my class, I will miss the attendance for the day , and ... today lead to the conclusion Therefore, I have left my home early today . Explain which rules of inference are used for each step.
Determine whether the premises “If I do not leave my home early or get stuck in a traffic jam, I will be late to my class and get scolded by my teacher”, “If I am l...
benzini
723
views
benzini
asked
Nov 29, 2022
Mathematical Logic
discrete-mathematics
mathematical-logic
kenneth-rosen
+
–
0
votes
1
answer
111
problem from Kenneth Rosen's Discrete Mathematics and its Applications, Section 1.5 - 1.7
Please solve the question. Question: Express each of these system specifications using predicates, quantifiers, and logical connectives. a. Any user with a Gmail account can access services from any Google products. b. ... power failure. d. There is a node whose adjacent nodes are not connected to each other.
Please solve the question. Question: Express each of these system specifications using predicates, quantifiers, and logicalconnectives.a. Any user with a Gmail account ca...
Akif
608
views
Akif
asked
Nov 27, 2022
Unknown Category
discrete-mathematics
mathematical-logic
first-order-logic
+
–
0
votes
1
answer
112
Solve the simultaneous recurrence relations
an = an−1 + bn−1 bn = an−1 − bn−1 with a0 = 1 and b0 = 2.
an = an−1 + bn−1bn = an−1 − bn−1with a0 = 1 and b0 = 2.
chinman12
364
views
chinman12
asked
Nov 25, 2022
Combinatory
discrete-mathematics
counting
recurrence-relation
descriptive
+
–
3
votes
0
answers
113
gateforum
h4kr
413
views
h4kr
asked
Nov 19, 2022
Mathematical Logic
gateforum-test-series
discrete-mathematics
mathematical-logic
+
–
2
votes
0
answers
114
gateforum
h4kr
111
views
h4kr
asked
Nov 19, 2022
Mathematical Logic
gateforum-test-series
discrete-mathematics
mathematical-logic
engineering-mathematics
+
–
0
votes
1
answer
115
graph theory ,discrete math
how many subgraph with atleast 1 vertex does k2 have? (graph theory question)
how many subgraph with atleast 1 vertex does k2 have? (graph theory question)
shuham kumar
391
views
shuham kumar
asked
Nov 18, 2022
Mathematical Logic
discrete-mathematics
graph-theory
+
–
0
votes
0
answers
116
Madeasy Test series 2023 Discrete Maths
vishnu777
247
views
vishnu777
asked
Nov 2, 2022
Mathematical Logic
made-easy-test-series
group-theory
discrete-mathematics
+
–
1
votes
0
answers
117
Ace Academy Test Series Qn#7
A hash function h maps 16-bit inputs to 8 bit hash values. What is the largest k such that in any set of 1000 inputs, there are atleast k inputs that h maps to the same hash value? 3 4 10 64
A hash function h maps 16-bit inputs to 8 bit hash values. What is the largest k such that in any set of 1000 inputs, there are atleast k inputs that h maps to the same h...
Souvik33
394
views
Souvik33
asked
Oct 30, 2022
DS
ace-test-series
data-structures
hashing
pigeonhole-principle
discrete-mathematics
+
–
0
votes
0
answers
118
Ace Academy Test Series
A hash function h maps 16-bit inputs to 8 bit hash values. What is the largest k such that in any set of 1000 inputs, there are atleast k inputs that h maps to the same hash value? 3 4 10 64
A hash function h maps 16-bit inputs to 8 bit hash values. What is the largest k such that in any set of 1000 inputs, there are atleast k inputs that h maps to the same h...
Souvik33
317
views
Souvik33
asked
Oct 30, 2022
DS
ace-test-series
data-structures
hashing
pigeonhole-principle
discrete-mathematics
+
–
0
votes
2
answers
119
Let 𝐼(𝑥)be the statement “𝑥has an Internet connection” and 𝐶(𝑥,𝑦)be the statement “𝑥and𝑦have chatted over the Internet,” where the domain for the variables 𝑥and 𝑦consists of all students in your class. Use quantifiers to express the followingstatement:“Everyone in your class with an Internet connection has chatted over the Internet with at least one other student in your class.
VASEEMUN
698
views
VASEEMUN
asked
Oct 29, 2022
Mathematical Logic
discrete-mathematics
first-order-logic
+
–
0
votes
1
answer
120
Translate the given statement into propositional logicexpressions:“A man qualifies for the marathon if his best previous time is less than 3 hours and a woman qualifies for the marathon if her best previous time is less than 3.5 hours.
VASEEMUN
690
views
VASEEMUN
asked
Oct 29, 2022
Mathematical Logic
discrete-mathematics
mathematical-logic
propositional-logic
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
...
80
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register