Register

Recent questions tagged discrete-mathematics

0 votes
0 answers
121
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 ...
User Avatar
2 votes
1 answer
122
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...
User Avatar
0 votes
1 answer
128
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)
User Avatar
3 votes
0 answers
130
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 ?
User Avatar
0 votes
0 answers
131
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 ?
User Avatar
22 votes
1 answer
132
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...
User Avatar
2 votes
1 answer
133
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?
User Avatar
0 votes
0 answers
134
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...
User Avatar
3 votes
0 answers
139
gateforum
User Avatar
0 votes
1 answer
141
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)
User Avatar
1 votes
0 answers
143
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...
User Avatar
0 votes
0 answers
144
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...
User Avatar
1 votes
2 answers
147
KENNITH ROSEN LATTICE
Find a compatible total order for the divisibility relation on the set {1, 2, 3, 6, 8, 12, 24, 36}.
Find a compatible total order for the divisibility relationon the set {1, 2, 3, 6, 8, 12, 24, 36}.
User Avatar
0 votes
1 answer
148
Gate At Zeal
Question → If (G,*) is a group of order 960 and there exist a in G such that a^m=e for some integer m<=960 where e is identity element of G then total number of possible value of m is___________ Answer==28
Question → If (G,*) is a group of order 960 and there exist a in G such that a^m=e for some integer m<=960 where e is identity element of G then total number of possibl...
User Avatar
1 votes
1 answer
150
igate test series
Selection of how many integers from the first ten positive integers (1, 2, ...) guarantees that there must be a pair of these integers with a sum equal to 11 ?
Selection of how many integers from the first ten positive integers (1, 2, ...) guarantees that there must be a pair of these integers with a sum equal to 11 ?
User Avatar
Page: