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
Recent questions in Discrete Mathematics
0
votes
1
answer
1681
Self Doubt-LA
In a non-homogeneous equation Ax = b, x has a unique solution when $A^{-1}$ exists i.e x = $A^{-1}$b but when det(A) = 0 then we have infinite solution or many solution. please give a mathematical explanation of how the 2nd statement occurs?
In a non-homogeneous equation Ax = b, x has a unique solution when $A^{-1}$ exists i.e x = $A^{-1}$bbut when det(A) = 0 then we have infinite solution or many solution.p...
mrinmoyh
472
views
mrinmoyh
asked
May 26, 2019
Mathematical Logic
linear-algebra
system-of-equations
+
–
0
votes
3
answers
1682
Self Doubt-Combinatory
In how many ways we can put $n$ distinct balls in $k$ dintinct bins?? Will it be $n^{k}$ or $k^{n}$?? Taking example will be easy way to remove this doubt or some other ways possible??
In how many ways we can put $n$ distinct balls in $k$ dintinct bins??Will it be $n^{k}$ or $k^{n}$?? Taking example will be easy way to remove this doubt or some other wa...
srestha
652
views
srestha
asked
May 25, 2019
Combinatory
discrete-mathematics
combinatory
+
–
1
votes
2
answers
1683
Rosen 7e Exercise-8.5 Question-15 page no-558 Inclusion-Exclusion
How many permutations of the 10 digits either begin with the 3 digits 987, contain the digits 45 in the fifth and sixth positions, or end with the 3 digits 123?
How many permutations of the 10 digits either begin with the 3 digits 987, contain the digits 45 in the fifth and sixth positions, or end with the 3 digits 123?
aditi19
1.3k
views
aditi19
asked
May 24, 2019
Combinatory
discrete-mathematics
kenneth-rosen
inclusion-exclusion
+
–
0
votes
2
answers
1684
Hasse Doubt
what is the least upper bound of {a, b, c}?
what is the least upper bound of {a, b, c}?
aditi19
888
views
aditi19
asked
May 23, 2019
Set Theory & Algebra
hasse-diagram
set-theory&algebra
lattice
partial-order
+
–
2
votes
3
answers
1685
Made easy Test Series:Graph Theory+Automata
Consider a graph $G$ with $2^{n}$ vertices where the level of each vertex is a $n$ bit binary string represented as $a_{0},a_{1},a_{2},.............,a_{n-1}$, where each $a_{i}$ is $0$ or $1$ ... and $y$ denote the degree of a vertex $G$ and number of connected component of $G$ for $n=8.$ The value of $x+10y$ is_____________
Consider a graph $G$ with $2^{n}$ vertices where the level of each vertex is a $n$ bit binary string represented as $a_{0},a_{1},a_{2},.............,a_{n-1}$,where each $...
srestha
936
views
srestha
asked
May 23, 2019
Graph Theory
made-easy-test-series
graph-theory
theory-of-computation
+
–
6
votes
0
answers
1686
IISc CSA - Research Interview Question
Prove that the rank of the Adjacency Matrix which is associated with a $k-$ regular graph is $k.$
Prove that the rank of the Adjacency Matrix which is associated with a $k-$ regular graph is $k.$
ankitgupta.1729
677
views
ankitgupta.1729
asked
May 22, 2019
Graph Theory
graph-theory
linear-algebra
+
–
0
votes
1
answer
1687
Discrete mathematics #TEST_BOOK
I Have doubt about the language. Is it asking about the sum of elements if we make the GBL set for the given lattice .
I Have doubt about the language. Is it asking about the sum of elements if we make the GBL set for the given lattice .
Shawn Frost
473
views
Shawn Frost
asked
May 20, 2019
Set Theory & Algebra
discrete
lattice
+
–
1
votes
2
answers
1688
GateForum Question Bank :Graph Theory
What is the probability that there is an edge in an undirected random graph having 8 vertices? 1 1/8
What is the probability that there is an edge in an undirected random graph having 8 vertices?1 1/8
Hirak
2.1k
views
Hirak
asked
May 19, 2019
Graph Theory
graph-theory
discrete-mathematics
+
–
0
votes
2
answers
1689
Made Easy Test Series:Discrete Mathematics-Poset
Consider the following Posets: $I)\left ( \left \{ 1,2,5,7,10,14,35,70 \right \},\leq \right )$ $II)\left ( \left \{ 1,2,3,6,14,21,42 \right \},/ \right )$ $III)\left ( \left \{ 1,2,3,6,11,22,33,66 \right \},/ \right )$ Which of the above poset are isomorphic to $\left ( P\left ( S \right ),\subseteq \right )$ where $S=\left \{ a,b,c \right \}?$
Consider the following Posets:$I)\left ( \left \{ 1,2,5,7,10,14,35,70 \right \},\leq \right )$$II)\left ( \left \{ 1,2,3,6,14,21,42 \right \},/ \right )$$III)\left ( \lef...
srestha
1.1k
views
srestha
asked
May 18, 2019
Set Theory & Algebra
poset
made-easy-test-series
discrete-mathematics
+
–
1
votes
0
answers
1690
Self Doubt:Mathematical Logic
Represent these two statement in first order logic: $A)$ Only Alligators eat humans $B)$ Every Alligator eats humans Is Every represents $\equiv \exists$ and Only represents $\equiv \forall$ ?? Can we differentiate it with verb ‘eat’ and ‘eats’??
Represent these two statement in first order logic:$A)$ Only Alligators eat humans$B)$ Every Alligator eats humansIs Every represents $\equiv \exists$and Only represents ...
srestha
550
views
srestha
asked
May 18, 2019
Mathematical Logic
discrete-mathematics
mathematical-logic
first-order-logic
+
–
0
votes
0
answers
1691
Discrete Mathematics by Kenneth Rosen,section2.4,recursive functions
$C_{a}^{k}:\mathbb{N}^{k}\rightarrow \mathbb{N}$ I am studying discrete math from beginnings and came across this term in primitive recursive function.I don't know what $C_{a}^{k}$ means and does $\mathbb{N}$ means set of natural numbers?Someone please help me out.
$C_{a}^{k}:\mathbb{N}^{k}\rightarrow \mathbb{N}$I am studying discrete math from beginnings and came across this term in primitive recursive function.I don't know what $C...
souren
403
views
souren
asked
May 15, 2019
Set Theory & Algebra
discrete-mathematics
set-theory&algebra
kenneth-rosen
+
–
1
votes
2
answers
1692
Recurrence Relation Self-Doubt
What will be solution of recurrence relation if roots are like this: r1=-2, r2=2, r3=-2, r4=2 is this the case of repetitive roots?
What will be solution of recurrence relation if roots are like this: r1=-2, r2=2, r3=-2, r4=2is this the case of repetitive roots?
aditi19
863
views
aditi19
asked
May 14, 2019
Combinatory
relations
recurrence-relation
discrete-mathematics
combinational-circuit
+
–
0
votes
0
answers
1693
Rosen 7e Exercise 8.2 Questionno-26 page no-525 Recurrence Relation
What is the general form of the particular solution guaranteed to exist of the linear nonhomogeneous recurrence relation $a_n$=$6a_{n-1}$-$12a_{n-2}$+$8a_{n-3}$+F(n) if F(n)=$n^2$ F(n)=$2^n$ F(n)=$n2^n$ F(n)=$(-2)^n$ F(n)=$n^22^n$ F(n)=$n^3(-2)^n$ F(n)=3
What is the general form of the particular solution guaranteed to exist of the linear nonhomogeneous recurrence relation$a_n$=$6a_{n-1}$-$12a_{n-2}$+$8a_{n-3}$+F(n) ifF(n...
aditi19
569
views
aditi19
asked
May 14, 2019
Combinatory
kenneth-rosen
discrete-mathematics
recurrence-relation
+
–
0
votes
0
answers
1694
Rosen 7e Exercise-8.2 Question no-23 page no-525 Recurrence Relation
Consider the nonhomogeneous linear recurrence relation $a_n$=$3a_{n-1}$+$2^n$ in the book solution is given $a_n$=$-2^{n+1}$ but I’m getting $a_n$=$3^{n+1}-2^{n+1}$
Consider the nonhomogeneous linear recurrence relation $a_n$=$3a_{n-1}$+$2^n$in the book solution is given $a_n$=$-2^{n+1}$but I’m getting $a_n$=$3^{n+1}-2^{n+1}$
aditi19
659
views
aditi19
asked
May 13, 2019
Combinatory
kenneth-rosen
discrete-mathematics
recurrence-relation
+
–
1
votes
2
answers
1695
#probability(self doubt)
An automobile showroom has 10 cars, 2 of which are defective. If you are going to buy the 6th car sold that day at random, then the probability of selecting a defective car is??
An automobile showroom has 10 cars, 2 of which are defective. If you are going to buy the 6th car sold that day at random, then the probability of selecting a defective c...
G Shaheena
259
views
G Shaheena
asked
May 13, 2019
Combinatory
probability
+
–
0
votes
2
answers
1696
ACE Workbook:
ACE Workbook: Q) Let G be a simple graph(connected) with minimum number of edges. If G has n vertices with degree-1,2 vertices of degree 2, 4 vertices of degree 3 and 3 vertices of degree-4, then value of n is ? Can anyone give the answer and how to approach these problems. Thanks in advance.
ACE Workbook:Q) Let G be a simple graph(connected) with minimum number of edges. If G has n vertices with degree-1,2 vertices of degree 2, 4 vertices of degree 3 and 3 ve...
chandan2teja
1.0k
views
chandan2teja
asked
May 12, 2019
Graph Theory
graph-theory
+
–
1
votes
1
answer
1697
ISI2018-PCB-CS3
An $n-$variable Boolean function $f:\{0,1\}^n \rightarrow \{0,1\} $ is called symmetric if its value depends only on the number of $1’s$ in the input. Let $\sigma_n $ denote the number of such functions. Calculate the value of $\sigma_4$. Derive an expression for $\sigma_n$ in terms of $n$.
An $n-$variable Boolean function $f:\{0,1\}^n \rightarrow \{0,1\} $ is called symmetric if its value depends only on the number of $1’s$ in the input. Let $\sigma_n $ d...
akash.dinkar12
503
views
akash.dinkar12
asked
May 12, 2019
Set Theory & Algebra
isi2018-pcb-cs
engineering-mathematics
discrete-mathematics
set-theory&algebra
functions
descriptive
+
–
0
votes
1
answer
1698
ISI2018-PCB-A4
Let $A$ and $B$ are two non-empty finite subsets of $\mathbb{Z}$, the set of all integers. Define $A+B=\{a+b:a\in A,b\in B\}$.Prove that $\mid A+B \mid \geq \mid A \mid + \mid B \mid -1 $, where $\mid S \mid$ denotes the cardinality of finite set $S$.
Let $A$ and $B$ are two non-empty finite subsets of $\mathbb{Z}$, the set of all integers. Define $A+B=\{a+b:a\in A,b\in B\}$.Prove that $\mid A+B \mid \geq \mid A \mid ...
akash.dinkar12
469
views
akash.dinkar12
asked
May 12, 2019
Set Theory & Algebra
isi2018-pcb-a
set-theory&algebra
descriptive
+
–
6
votes
1
answer
1699
ISI2018-MMA-26
Let $C_i(i=0,1,2...n)$ be the coefficient of $x^i$ in $(1+x)^n$.Then $\frac{C_0}{2} – \frac{C_1}{3}+\frac{C_2}{4}-\dots +(-1)^n \frac{C_n}{n+2}$ is equal to $\frac{1}{n+1}\\$ $\frac{1}{n+2}\\$ $\frac{1}{n(n+1)}\\$ $\frac{1}{(n+1)(n+2)}$
Let $C_i(i=0,1,2...n)$ be the coefficient of $x^i$ in $(1+x)^n$.Then $\frac{C_0}{2} – \frac{C_1}{3}+\frac{C_2}{4}-\dots +(-1)^n \frac{C_n}{n+2}$ is equal to$\frac{1}{n+...
akash.dinkar12
1.9k
views
akash.dinkar12
asked
May 11, 2019
Combinatory
isi2018-mma
engineering-mathematics
discrete-mathematics
generating-functions
+
–
3
votes
3
answers
1700
ISI2018-MMA-15
Let $G$ be a finite group of even order. Then which of the following statements is correct? The number of elements of order $2$ in $G$ is even The number of elements of order $2$ in $G$ is odd $G$ has no subgroup of order $2$ None of the above.
Let $G$ be a finite group of even order. Then which of the following statements is correct?The number of elements of order $2$ in $G$ is evenThe number of elements of ord...
akash.dinkar12
3.2k
views
akash.dinkar12
asked
May 11, 2019
Set Theory & Algebra
isi2018-mma
engineering-mathematics
discrete-mathematics
set-theory&algebra
group-theory
+
–
Page:
« prev
1
...
80
81
82
83
84
85
86
87
88
89
90
...
356
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register