Dark Mode

Hot questions in Discrete Mathematics

0 votes

1 answer

5701

focus _GATE asked in Combinatory Dec 17, 2016

315 views

2 votes

2 answers

5702

Determine whether the relation is reflexive, symmetric, antisymmetric or transitive?
(Question 2 of Exercise 7.1 Relations in Discrete mathematics and its application by Rosen 7th edition) The relation below is on the set (1, 2, 3, 4}. Determine whether the relation is reflexive, ... must be NO PROPERTY HOLDS FOR THIS RELATION but the answer given in the book is TRANSITIVE. Please explain?

Jaspreet Singh asked in Set Theory & Algebra May 5, 2016

by Jaspreet Singh

1.6k views

0 votes

1 answer

5703

#mathsGeneratingFunction
x31⋅(1−x16)⋅(1−x15)⋅(1−x26)⋅$\frac{1}{(1-x)^{3}}$ find the coefficient of x52 ??

papesh asked in Mathematical Logic Dec 9, 2016

by papesh

401 views

1 vote

1 answer

5704

partion of vertex

iita asked in Graph Theory Dec 16, 2016

by iita

250 views

8 votes

1 answer

5705

Groups theory
Let $G:$ be a group. $a^5=e,\quad aba^{-1}=b^2,\quad a,b,\in G$ Then which of the following is an order of $b$? $31$ $32$ $30$ $2$

Rahul Jain25 asked in Set Theory & Algebra Oct 11, 2016

by Rahul Jain25

914 views

0 votes

0 answers

5706

E = 2N -3
I read in https://gateoverflow.in/28955/given-vertex-edges-how-find-non-isomorphic-graphs-possible question explanantion,it was written that e=2n-3 where e= number of edges and n is no of vertices. how is it derived??can anyone tell me the source??

Akriti sood asked in Graph Theory Dec 24, 2016

157 views

0 votes

2 answers

5707

past gate question
$\lim_{n \to \infty } \frac{10^{n}+n^{20}}{n!} = 0$ Please explain how

Anand Vijayan asked in Mathematical Logic Dec 1, 2016

by Anand Vijayan

420 views

1 vote

0 answers

5708

GATEBOOK
There are 5 bins labelled 1,2,3,4,5. Now there are 5 numbers 1,2,3,4,5. How many combinations exist such that 1,2,3 all arent at proper place? Now, we can easily solve using inclusion-exclusion principle. But, sometimes this principle counts duplicates ... which always gives correct answers. This is the first problem where I am not able to set up a recurrance relation. Could anyone help?

Sushant Gokhale asked in Combinatory Nov 23, 2016

by Sushant Gokhale

690 views

0 votes

1 answer

5709

Kenneth Rosen Edition 6th Exercise 8.2 Question 54 (Page No. 555)
If G is a simple graph with 15 edges and $\bar G$ has 13 edges, how many vertices does G have?

dd asked in Graph Theory Nov 22, 2016

by dd

612 views

0 votes

0 answers

5710

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.

dd asked in Set Theory & Algebra Dec 14, 2016

by dd

302 views

0 votes

1 answer

5711

Kenneth Rosen Edition 7 Exercise 1.2 Question 11 (Page No. 23)
Are these system specifications consistent? The router can send packets to the edge system only if it supports the new address space. For the router to support the new address space it is necessary that the latest software ... edge system if the latest software release is installed, The router does not support the new address space.

go_editor asked in Set Theory & Algebra Apr 16, 2016

6.4k views

1 vote

1 answer

5712

mathematics
TRUE/FALSE? There exist two uncountable sets such that their intersection is countably infinite. PLZ someone give one example.......

dileswar sahu asked in Set Theory & Algebra Oct 22, 2016

by dileswar sahu

1.4k views

1 vote

2 answers

5713

KISHALAY DAS asked in Set Theory & Algebra Oct 28, 2016

by KISHALAY DAS

950 views

0 votes

0 answers

5714

Gate Computer Science group Fb post

Shreya Roy asked in Set Theory & Algebra Nov 28, 2016

618 views

1 vote

1 answer

5715

Lattice topological order

monty asked in Set Theory & Algebra Nov 18, 2016

by monty

584 views

0 votes

0 answers

5716

GATE CSE 1990 | Question: 17b
Show, using resolution, that the following well-formed formula is valid for all interpretations: $\left(\forall x \forall y \left(f \left(x, y \right) \Leftarrow \neg y \left(y, x \right) = \left(\forall x \left(f \left(x, x \right)\right)$ closed

makhdoom ghaya asked in Mathematical Logic Nov 26, 2016

by makhdoom ghaya

510 views

2 votes

1 answer

5717

Kenneth Rosen Edition 6th Exercise 1.2 Question 15 (Page No. 23)
Each inhabitant of a remote village always tells the truth or always lies. A villager will give only a Yes or a No response to a question a tourist asks. Suppose you are a tourist visiting this area and come to a ... is standing at the fork in the road. What one question can you ask the villager to determine which branch to take?

go_editor asked in Mathematical Logic Apr 16, 2016

4.6k views

3 votes

0 answers

5718

graph theory
For which values of m and n is Km,n regular?

sourav. asked in Graph Theory Aug 10, 2016

1.9k views

0 votes

0 answers

5719

Graph theory
proof :- A connected graph any two paths of maximum length share at least one vertex

Neal Caffery asked in Graph Theory Dec 12, 2016

by Neal Caffery

236 views

0 votes

1 answer

5720

set theory
whether true or false? If a relation R on set A is irreflexive and transitive then R is antisymmetric. I am getting false but answer is true..can someone explain with examples

cse23 asked in Set Theory & Algebra Nov 22, 2016

by cse23

591 views

Page:

« prev
1
...
281
282
283
284
285
286
287
288
289
290
291
...
355
next »