Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged discrete-mathematics
3
votes
1
answer
2161
MATRIX
Let A be a $3 \times 3$ matrix with integer entries such that $|A| =1$. What is the maximum possible number of entries of A that are even?
Let A be a $3 \times 3$ matrix with integer entries such that $|A| =1$. What is the maximum possible number of entries of A that are even?
Supremo
770
views
Supremo
asked
Jan 19, 2017
Set Theory & Algebra
matrix
linear-algebra
discrete-mathematics
+
–
0
votes
1
answer
2162
Graph Theory
Let G be a undirected graph with 35 edges and degree of each vertex is at least 3 then maximum number of vertices possible in G is (A) 22 (B) 23 (C) 24 (D) 25 P.S. Explain with ease, if possible!
Let G be a undirected graph with 35 edges and degree of each vertex is at least 3 then maximum number of vertices possible in G is(A) 22(B) 23(C) 24(D) 25P.S. Explain wit...
smartmeet
832
views
smartmeet
asked
Jan 18, 2017
Graph Theory
graph-theory
engineering-mathematics
discrete-mathematics
+
–
0
votes
1
answer
2163
MadeEasy Subject Test: Engineering Mathematics - Sets
can someone help me with example how A can be answer??
can someone help me with example how A can be answer??
S Ram
679
views
S Ram
asked
Jan 18, 2017
Set Theory & Algebra
made-easy-test-series
discrete-mathematics
set-theory
+
–
0
votes
0
answers
2164
MadeEasy Subject Test: Engineering Mathematics - First Order Logic
Hradesh patel
504
views
Hradesh patel
asked
Jan 16, 2017
Mathematical Logic
made-easy-test-series
discrete-mathematics
mathematical-logic
+
–
1
votes
2
answers
2165
Test by Bikram | Mock GATE | Test 1 | Question: 48
State whether the following statements are true or false? $(P\to Q) \rightarrow (Q\to P)$ always holds, for all propositions $P, Q$. $\left ( \left ( P\vee Q \right )\rightarrow Q \right )$ $\rightarrow$ ... true, $b$ is false Both $a$ and $b$ are true $a$ is false, $b$ is true. Both $a$ and $b$ are false.
State whether the following statements are true or false?$(P\to Q) \rightarrow (Q\to P)$ always holds, for all propositions $P, Q$.$\left ( \left ( P\vee Q \right )\right...
Bikram
762
views
Bikram
asked
Jan 16, 2017
GATE
tbb-mockgate-1
discrete-mathematics
mathematical-logic
propositional-logic
+
–
8
votes
3
answers
2166
Test by Bikram | Mock GATE | Test 1 | Question: 18
Which of the following is not a Boolean algebra under the operation '\'? \: is a divisor, $D_{p}$: divisor of $p$ $\left \{ D18; \ \right \}$ $\left \{ D21; \ \right \}$ $\left \{ D110; \ \right \}$ $\left \{ D91; \ \right \}$
Which of the following is not a Boolean algebra under the operation '\'? \: is a divisor, $D_{p}$: divisor of $p$$\left \{ D18; \ \right \}$$\left \{ D21; \ \right \}$$...
Bikram
1.8k
views
Bikram
asked
Jan 16, 2017
Set Theory & Algebra
tbb-mockgate-1
boolean-algebra
discrete-mathematics
lattice
+
–
1
votes
1
answer
2167
Test by Bikram | Mock GATE | Test 1 | Question: 14
Match the following $List I$ with $List II$ : $W(x)$: $x$ is a worker $A(x)$: $x$ likes Anand List -I a. No worker like Anand b. Some worker like Anand c. If someone s a worker, he likes Anand List II p. $\sim$\forall x$[ $W(x)$ $\rightarrow$ $\sim$A(x) ]$ ... $]$ $a-r, b-q, c-p$ $a-p, b-q, c-r$ $a-r, b-p, c-q$ $a-q, b-p, c-r$
Match the following $List I$ with $List II$ :$W(x)$: $x$ is a worker$A(x)$: $x$ likes AnandList -Ia. No worker like Anand b. Some worker lik...
Bikram
520
views
Bikram
asked
Jan 16, 2017
GATE
tbb-mockgate-1
discrete-mathematics
mathematical-logic
first-order-logic
+
–
1
votes
0
answers
2168
GROUP THEORY
Can someone tell whether these topics are important in GROUP THEORY? ISOMORPHIC GROUPS NORMAL GROUPS COSETS.
Can someone tell whether these topics are important in GROUP THEORY?ISOMORPHIC GROUPSNORMAL GROUPSCOSETS.
sushmita
409
views
sushmita
asked
Jan 14, 2017
Set Theory & Algebra
set-theory&algebra
group-theory
discrete-mathematics
+
–
0
votes
1
answer
2169
MadeEasy Subject Test: Engineering Mathematics - First Order Logic
#plz explain 1st and 2nd ???
#plz explain 1st and 2nd ???
Hradesh patel
455
views
Hradesh patel
asked
Jan 12, 2017
Mathematical Logic
made-easy-test-series
discrete-mathematics
first-order-logic
+
–
0
votes
0
answers
2170
Graph Theory
Çșȇ ʛấẗẻ
161
views
Çșȇ ʛấẗẻ
asked
Jan 12, 2017
Programming in C
graph-theory
discrete-mathematics
+
–
2
votes
2
answers
2171
#Chromatic number , Planarity
Let G be a planar graph such that every face is bordered by exactly 3 edges.Which of the following can never be the value for χ(G) ? (where χ(G) is the chromatic number of G) a) 2 b) 3 c) 4 d) None of these PS : (Explain: "every face is bordered by exactly 3 edges. ")
Let G be a planar graph such that every face is bordered by exactly 3 edges.Which of the following can never be the value for χ(G) ? (where χ(G) is the chromatic number...
smartmeet
1.3k
views
smartmeet
asked
Jan 11, 2017
Graph Theory
graph-theory
discrete-mathematics
graph-coloring
+
–
0
votes
4
answers
2172
GateForum Test Series: Graph Theory - Graph Coloring
The Chromatic Number of Cycle Graph with 7 vertices _____
The Chromatic Number of Cycle Graph with 7 vertices _____
Jason GATE
2.3k
views
Jason GATE
asked
Jan 9, 2017
Graph Theory
gateforum-test-series
engineering-mathematics
discrete-mathematics
graph-theory
graph-coloring
+
–
2
votes
1
answer
2173
doubt
Arnabi
352
views
Arnabi
asked
Jan 8, 2017
Mathematical Logic
discrete-mathematics
+
–
1
votes
1
answer
2174
maths
When the curves, y = log10x and y = x–1 are drawn in x – y plane. The number of times they intersect for values x ≥ 1 is ________.
When the curves, y = log10x and y = x–1 are drawn in x – y plane. The number of times they intersect for values x ≥ 1 is ________.
thor
334
views
thor
asked
Jan 7, 2017
Mathematical Logic
discrete-mathematics
engineering-mathematics
+
–
4
votes
0
answers
2175
Relations and Combinatorics
$\begin{align*} &S = \left \{ G_i \;\; | \; G_i \in \text{ lebeled trees with 4 vertices} \right \} \\ &\text{Relation } \quad R = \left \{ {\color{red}{\left ( G_i,G_j \right )}} \; | G_i,G_j \in S \;\; \text{and} \;\; G_i,G_j \;\; \text{are} \;\; \text{isomorphic to each other} \right \} \end{align*}$ No of equivalent classes of $R$ ?
$\begin{align*} &S = \left \{ G_i \;\; | \; G_i \in \text{ lebeled trees with 4 vertices} \right \} \\ &\text{Relation } \quad R = \left \{ {\color{red}{\left ( G_i,G_j \...
dd
670
views
dd
asked
Jan 6, 2017
Combinatory
discrete-mathematics
combinatory
relations
graph-theory
+
–
0
votes
0
answers
2176
Rosen-Counting
Once a computerworm infects a personal computer via an infected e-mail message, it sends a copy of itself to 100 email addresses it finds in the electronic message mailbox on this personal computer. What is the maximum number of different computers this one ... message to be forwarded five times? I wanted to verify this answer and method,there is no answer given for this question.
Once a computerworm infects a personal computer via aninfected e-mail message, it sends a copy of itself to 100 emailaddresses it finds in the electronic message mailboxo...
Surajit
518
views
Surajit
asked
Jan 6, 2017
Combinatory
discrete-mathematics
+
–
3
votes
2
answers
2177
discrete
find the solution of the recurence relation an =3an-1 + 2n initial conditon is given as a1=3 ?
find the solution of the recurence relationan =3an-1 + 2n initial conditon is given as a1=3 ?
Deepak Yadav
408
views
Deepak Yadav
asked
Jan 5, 2017
Mathematical Logic
discrete-mathematics
+
–
2
votes
1
answer
2178
graph theory
Assumed undirected graph G is connected. G has 6vertices and 10 edges. Find the minimum number of edges whose deletion from graph G is always guarantee that it will become disconnected.
Assumed undirected graph G is connected. G has 6vertices and 10 edges. Findthe minimum number of edges whose deletion from graph G is always guaranteethat ...
sanyam53
968
views
sanyam53
asked
Jan 3, 2017
Graph Theory
graph-theory
graph-connectivity
discrete-mathematics
+
–
1
votes
1
answer
2179
TheTrevTutor discrete maths 2 videos
I want to know how good are the videos of discrete maths by TheTrevTutor. Has anyone been following the videos while preparing for GATE? https://www.youtube.com/watch?v=DBugSTeX1zw&list=PLDDGPdw7e6Aj0amDsYInT_8p6xTSTGEi2
I want to know how good are the videos of discrete maths by TheTrevTutor. Has anyone been following the videos while preparing for GATE? https://www.youtube.com/watch?v=D...
Daggerhunt
303
views
Daggerhunt
asked
Dec 30, 2016
Combinatory
combinatory
discrete-mathematics
+
–
3
votes
1
answer
2180
Combinatorics
The answer given is n-k+1C2 but couldn't understand how both are related
The answer given is n-k+1C2 but couldn't understand how both are related
Prajwal Bhat
501
views
Prajwal Bhat
asked
Dec 29, 2016
Combinatory
combinatory
discrete-mathematics
+
–
2
votes
1
answer
2181
Number of Solutions for the quation
How many integral solutions exist for the system of equations x+y+z =15 where 0<=x,y,z<=10 ? Ans given is 620. I am getting 91 Could someone point out the flaw in the below logic? Mehod Used : There are 10 stars and 3 bins with multi choose 17C2 = 136 Invalid Solutions (Any of them assigned >=11 ) 3C1 * N( x+y+z = 4) => 3*6C2 = 15 *3 =45 136-45=91
How many integral solutions exist for the system of equations x+y+z =15 where 0<=x,y,z<=10 ? Ans given is 620. I am getting 91Could someone point out the flaw in the belo...
yg92
327
views
yg92
asked
Dec 29, 2016
Combinatory
combinatory
discrete-mathematics
+
–
7
votes
1
answer
2182
TIFR CSE 2016 | Part B | Question: 9
Which of the following graphs DOES NOT have an Eulerian circuit? (Recall that an Eulerian circuit in an undirected graph is a walk in the graph that starts at a vertex and returns to the vertex after traveling on each edge exactly once.) $K_{9, 9}$ $K_{8, 8}$ $K_{12, 12}$ $K_9$ The ...
Which of the following graphs DOES NOT have an Eulerian circuit? (Recall that an Eulerian circuit in an undirected graph is a walk in the graph that starts at a vertex an...
go_editor
2.2k
views
go_editor
asked
Dec 29, 2016
Graph Theory
tifr2016
discrete-mathematics
graph-theory
euler-graph
normal
+
–
0
votes
0
answers
2183
Kenneth Rosen Edition 6th Exercise 8.3 Question 53 (Page No. 555)
The complementary graph G' of a simple graph G has the same vertices as G. Two vertices are adjacent in G' if and only if they are not adjacent in G. Define Qn' (Hypercube complement). Answer given :-The ... are differing by 0 bit,as these are also not there in original graph ,so it must be in complementary graph?
The complementary graph G' of a simple graph G has the same vertices as G. Two vertices are adjacent in G' if and only if they are not adjacent in G. Define Qn' (Hyperc...
rahul sharma 5
512
views
rahul sharma 5
asked
Dec 27, 2016
Graph Theory
kenneth-rosen
discrete-mathematics
+
–
1
votes
3
answers
2184
Kenneth Rosen Edition 6th Exercise 6.1 Question 9d (Page No. 401)
Solve the recurrence relation $a_n = a_{n-1} + 2n + 3, a_0 = 4$
Solve the recurrence relation $a_n = a_{n-1} + 2n + 3, a_0 = 4$
Rounak Agarwal
869
views
Rounak Agarwal
asked
Dec 22, 2016
Combinatory
kenneth-rosen
discrete-mathematics
combinatory
recurrence-relation
+
–
19
votes
4
answers
2185
TIFR CSE 2017 | Part A | Question: 5
How many distinct ways are there to split $50$ identical coins among three people so that each person gets at least $5$ coins? $3^{35}$ $3^{50}-2^{50}$ $\binom{35}{2}$ $\binom{50}{15} \cdot 3^{35}$ $\binom{37}{2}$
How many distinct ways are there to split $50$ identical coins among three people so that each person gets at least $5$ coins?$3^{35}$$3^{50}-2^{50}$$\binom{35}{2}$$\bino...
go_editor
4.0k
views
go_editor
asked
Dec 21, 2016
Combinatory
tifr2017
combinatory
discrete-mathematics
normal
balls-in-bins
+
–
0
votes
1
answer
2186
Kenneth Rosen Edition 6th Exercise 1.5 Question 9 e (Page No. 73)
1. What is good for corporations is good for the United States. 2. What is good for the United States is good for you. 3. What is good for the corporations is for you to buy lots of stuffs What are the valid conclusions? Please explain the solution
1. What is good for corporations is good for the United States.2. What is good for the United States is good for you.3. What is good for the corporations is for you to bu...
rahul sharma 5
432
views
rahul sharma 5
asked
Dec 20, 2016
Mathematical Logic
kenneth-rosen
discrete-mathematics
mathematical-logic
+
–
2
votes
1
answer
2187
Kenneth Rosen Edition 6th Exercise 5.1 Question 5 (Page No. 344)
Question: Six different airlines fly from New York to Denver and seven fly from Denver to San Francisco. How many different pairs of airlines can you choose on which to book a trip from New York to San Francisco via ... an airline for the continuation flight to San Francisco ? How many of these pairs involve more than one airline ?
Question: Six different airlines fly from New York to Denver and seven fly from Denver to San Francisco. How many different pairs of airlines can you choose on which to b...
Rounak Agarwal
2.5k
views
Rounak Agarwal
asked
Dec 19, 2016
Combinatory
kenneth-rosen
combinatory
discrete-mathematics
counting
+
–
0
votes
1
answer
2188
MadeEasy Test Series: Set Theory & Algebra - Groups
Which of the following is true? Every lower triangular matrix is group under multiplication operation where all elements of diagonal are non zero numbers. Every diagonal matrix is group under multiplication operation, where all elements of ... under addition operation where all elements are real numbers. Both (a) and b) Why is C incorrect?
Which of the following is true?Every lower triangular matrix is group under multiplication operation where all elements of diagonal are non zero numbers.Every diagonal ma...
Kai
791
views
Kai
asked
Dec 15, 2016
Set Theory & Algebra
made-easy-test-series
engineering-mathematics
discrete-mathematics
set-theory&algebra
group-theory
+
–
0
votes
0
answers
2189
Relation
Which of the following is/are true ? A. $\text{R}$ is a reflexive relation on a set $\text{A}$, then $\text{R}^{n}$ is reflexive for all $n\geq0$ B. Relation $\text{R}$ on set $A$ is reflexive if and only if inverse relation $R^{-1}$ is reflexive. C Relation $\text{R}$ on set ... $M_{S\circ R} = M_R \; \odot M_S$ where $\odot$ is boolean product.
Which of the following is/are true ?A. $\text{R}$ is a reflexive relation on a set $\text{A}$, then $\text{R}^{n}$ is reflexive for all $n\geq0$B. Relation $\text{R}$ on ...
dd
293
views
dd
asked
Dec 14, 2016
Set Theory & Algebra
relations
discrete-mathematics
+
–
0
votes
1
answer
2190
Relation composition
$R$ and $S$ are two relations on a set $A$ $\begin{align*} M_R = \begin{bmatrix} 1 & 0 & 1 \\ 1 & 0 & 0 \\ 0 & 1 & 0 \\ \end{bmatrix} \qquad M_S = \begin{bmatrix} 0 & 1 & 1 \\ 0 & 1 & 0 \\ 1 & 1 & 0 \\ \end{bmatrix} \end{align*}$ Then matrices for $R \cap S$ and $R \cup S$ ?
$R$ and $S$ are two relations on a set $A$$$\begin{align*} M_R = \begin{bmatrix} 1 & 0 & 1 \\ 1 & 0 & 0 \\ 0 & 1 & 0 \\ \end{bmatrix} \qquad M_S = \begin{bmatrix} 0 & 1 &...
dd
561
views
dd
asked
Dec 14, 2016
Set Theory & Algebra
relations
discrete-mathematics
+
–
Page:
« prev
1
...
68
69
70
71
72
73
74
75
76
77
78
...
80
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register