Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Recent
Hot!
Most votes
Most answers
Most views
Previous GATE
Featured
Most viewed questions in Discrete Mathematics
0
votes
1
answer
1681
In how many ways can 2n+1 seats in a congress be divided among 3 parties ?
In how many ways can $2n+1$ seats in a congress be divided among 3 parties so that coalition of any 2 parties will ensure them majority?
In how many ways can $2n+1$ seats in a congress be divided among 3 parties so that coalition of any 2 parties will ensure them majority?
radha gogia
1.1k
views
radha gogia
asked
Jan 27, 2016
Combinatory
combinatory
counting
+
–
2
votes
0
answers
1682
solve reccurrence (Non homogeneous , by taking partial solution)
A(n) = 7A(n-1) - 10A(n-2) + n , along with approach thankyou ,
A(n) = 7A(n-1) - 10A(n-2) + n , along with approach thankyou ,
sumit goyal 1
1.1k
views
sumit goyal 1
asked
Jan 15, 2018
0
votes
1
answer
1683
Kenneth Rosen Edition 7 Exercise 6.2 Question 6 (Page No. 405)
Let $d$ be a positive integer. Show that among any group of $d + 1$ (not necessarily consecutive) integers there are two with exactly the same remainder when they are divided by $d.$
Let $d$ be a positive integer. Show that among any group of $d + 1$ (not necessarily consecutive) integers there are two with exactly the same remainder when they are div...
admin
1.1k
views
admin
asked
Apr 29, 2020
Combinatory
kenneth-rosen
discrete-mathematics
counting
pigeonhole-principle
descriptive
+
–
0
votes
1
answer
1684
Kenneth Rosen Edition 7 Exercise 1.3 Question 44 (Page No. 36)
Show that $\sim$ and $\wedge$ form a functionally complete collection of logical operators. [Hint: First use a De Morgan law to show that $p \vee q$ is logically equivalent to $(\sim(\sim p \wedge \sim q)).$]
Show that $\sim$ and $\wedge$ form a functionally complete collection of logical operators. [Hint: First use a De Morgan law to show that $p \vee q$ is logically equivale...
Pooja Khatri
1.1k
views
Pooja Khatri
asked
Mar 16, 2019
Mathematical Logic
kenneth-rosen
discrete-mathematics
mathematical-logic
propositional-logic
difficult
+
–
0
votes
0
answers
1685
Gate_2018_Model_Paper
How to solve it for M^-1?
How to solve it for M^-1?
Harikesh Kumar
1.1k
views
Harikesh Kumar
asked
Jan 31, 2018
Mathematical Logic
inverseof
matrix
+
–
0
votes
2
answers
1686
permutations
The number of ways in which 6 rings can be worn on the four fingers of one hand is: a. 360 b. 4^6 c. 6C4 d. 6^4
The number of ways in which 6 rings can be worn on the four fingers of one hand is:a. 360b. 4^6c. 6C4d. 6^4
Desert_Warrior
1.1k
views
Desert_Warrior
asked
Feb 17, 2016
0
votes
1
answer
1687
propositional logic
Let p, q, and r be the propositions p :You get an A on the final exam. q :You do every exercise in this book. r :You get an A in this class. Write these propositions using p, q, and r and logical connectives (including negations) "You get an A on the final, but you don’t do every exercise in this book; nevertheless, you get an A in this class"
Let p, q, and r be the propositionsp :You get an A on the final exam.q :You do every exercise in this book.r :You get an A in this class.Write these propositions using p,...
Vicky rix
1.1k
views
Vicky rix
asked
Mar 2, 2017
Mathematical Logic
propositional-logic
discrete-mathematics
engineering-mathematics
mathematical-logic
first-order-logic
+
–
2
votes
2
answers
1688
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.1k
views
Tesla!
asked
Feb 4, 2018
Graph Theory
cmi2017
engineering-mathematics
discrete-mathematics
graph-theory
graph-connectivity
+
–
3
votes
0
answers
1689
combinatrics
How many 7 length bit strings have atleast 3 consecutive ones?
How many 7 length bit strings have atleast 3 consecutive ones?
Balaji Jegan
1.1k
views
Balaji Jegan
asked
Jan 22, 2018
Combinatory
combinatory
engineering-mathematics
discrete-mathematic
+
–
0
votes
1
answer
1690
If f is one-one and g is onto.Then what can we say about gof?
GateMaster Prime
1.1k
views
GateMaster Prime
asked
Jan 4, 2015
1
votes
1
answer
1691
Self Doubt on order of execution of statements in Propositional Logic for implication operator
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$
Tuhin Dutta
1.1k
views
Tuhin Dutta
asked
Nov 17, 2017
Mathematical Logic
discrete-mathematics
mathematical-logic
propositional-logic
first-order-logic
+
–
0
votes
0
answers
1692
Eigen vector correspond Eigen value 1
hem chandra joshi
1.1k
views
hem chandra joshi
asked
Nov 13, 2017
Mathematical Logic
engineering-mathematics
eigen-value
+
–
1
votes
2
answers
1693
MadeEasy Test Series: Mathematical Logic - First Order Logic
Pardon for the screenshot though. No idea of latex.
Pardon for the screenshot though. No idea of latex.
Shamim Ahmed
1.1k
views
Shamim Ahmed
asked
Jan 8, 2019
Mathematical Logic
made-easy-test-series
first-order-logic
mathematical-logic
+
–
1
votes
1
answer
1694
MadeEasy Test Series 2019: Discrete Mathematics - Set Theory & Algebra
Which of the following are Well ordered set $\left [ Z^{+},\leq \right ]$ $\left [ Z^{-},\leq \right ]$ $\left [ Z^{+},\geq \right ]$ $\left [ Z^{-},\geq \right ]$
Which of the following are Well ordered set$\left [ Z^{+},\leq \right ]$$\left [ Z^{-},\leq \right ]$$\left [ Z^{+},\geq \right ]$$\left [ Z^{-},\geq \right ]$
jatin khachane 1
1.1k
views
jatin khachane 1
asked
Jan 28, 2019
Set Theory & Algebra
made-easy-test-series
set-theory&algebra
+
–
0
votes
0
answers
1695
Propositional and First Order Logic GATE-CS-2006
In the question whether this statement is a tautology ((A ∨ B) → C)) ≡ ((A → C) ∨ (B → C)) , If I take first part ((A ∨ B) → C)) as P and second part ((A → C) ∨ (B → C)) as Q , do I need to prove P-->Q is true? or both P-->Q and Q-->P as true? I am confused about the ≡ symbol.
In the question whether this statement is a tautology ((A ∨ B) → C)) ≡ ((A → C) ∨ (B → C)) ,If I take first part ((A ∨ B) → C)) as P and second part ((A...
preps
1.1k
views
preps
asked
Sep 17, 2017
Mathematical Logic
discrete-mathematics
first-order-logic
mathematical-logic
propositional-logic
+
–
2
votes
1
answer
1696
Determining a given subset is partition or not?
Which of these collections of subsets are partitions of the set of bit strings of length 8? (a) the set of bit strings that end with 00, the set of bit strings that end with 01, the set of bit strings that end with 10, and the ... I can't find any overlapping elements between different partition of (b) and if there is any, then why not in (a).
Which of these collections of subsets are partitions of the set of bit strings of length 8?(a) the set of bit strings that end with 00, the set of bit strings that end wi...
SomnathKayal
1.1k
views
SomnathKayal
asked
Apr 5, 2016
Set Theory & Algebra
relational-algebra
relations
equivalence-class
set-theory&algebra
+
–
1
votes
1
answer
1697
discrete
Given a maximum matching M, if we pick one endpoint of each edge in M, this form a valid vertex cover. TRUE FALSE
Given a maximum matching M, if we pick one endpoint of each edge in M, this form a valid vertex cover. TRUE FALSE
ashutoshsharma
1.1k
views
ashutoshsharma
asked
Sep 21, 2017
Graph Theory
vertex-cover
+
–
1
votes
2
answers
1698
ISI2014-DCG-35
Let $A$ and $B$ be disjoint sets containing $m$ and $n$ elements respectively, and let $C=A \cup B$. Then the number of subsets $S$ (of $C$) which contains $p$ elements and also has the property that $S \cap A$ contains $q$ ... $\begin{pmatrix} m \\ p-q \end{pmatrix} \times \begin{pmatrix} n \\ q \end{pmatrix}$
Let $A$ and $B$ be disjoint sets containing $m$ and $n$ elements respectively, and let $C=A \cup B$. Then the number of subsets $S$ (of $C$) which contains $p$ elements a...
Arjun
1.1k
views
Arjun
asked
Sep 23, 2019
Set Theory & Algebra
isi2014-dcg
set-theory
disjoint-sets
+
–
0
votes
1
answer
1699
graph theory
in a directed graph if there is a directed path from any node u to v or vice versa for any pair of nodes of the graph ,the graph is? a. weakly connected unilaterally connected strongly connected disconnected
in a directed graph if there is a directed path from any node u to v or vice versa for any pair of nodes of the graph ,the graph is? a. weakly connectedunilaterally conne...
shipra tressa
1.1k
views
shipra tressa
asked
Dec 14, 2018
1
votes
1
answer
1700
ISI2014-DCG-5
Consider the sets defined by the real solutions of the inequalities $A = \{(x,y):x^2+y^4 \leq 1\} \:\:\:\:\:\:\: B=\{(x,y):x^4+y^6 \leq 1\}$ Then $B \subseteq A$ $A \subseteq B$ Each of the sets $A – B, \: B – A$ and $A \cap B$ is non-empty none of the above
Consider the sets defined by the real solutions of the inequalities$A = \{(x,y):x^2+y^4 \leq 1\} \:\:\:\:\:\:\: B=\{(x,y):x^4+y^6 \leq 1\}$ Then$B \subseteq A$$A \subsete...
Arjun
1.1k
views
Arjun
asked
Sep 23, 2019
Set Theory & Algebra
isi2014-dcg
set-theory
+
–
Page:
« prev
1
...
80
81
82
83
84
85
86
87
88
89
90
...
355
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register