Ask
Login
TAGGED IN

Discrete Mathematics

Follow this tag to get notifications whenever a new post is added

ALL TAGS
6
votes
1
answer
66k
views
1
answer
Prove that the set G = (1, 2, 3, 4, 5, 6) is an abelian group under multiplication modulo 7.
discrete mathematics updated 18 months ago by sagarkolekar ★ 11k
2
votes
1
answer
45k
views
1
answer
R be a relation on set of integers Z defined by R = {(x, y) | x-y is divisible by 3} Show that R is an equivalence relation and describe the equivalence classes.
discrete mathematics updated 18 months ago by sagarkolekar ★ 11k
0
votes
1
answer
41k
views
1
answer
Define group, monoid, semigroup.
discrete mathematics updated 2.2 years ago by pedsangini276 • 4.7k
2
votes
1
answer
36k
views
1
answer
Prove that in a full binary tree with n vertices, the number of pendant vertices is (n+1)/2.
discrete mathematics updated 2.3 years ago by sagarkolekar ★ 11k
5
votes
1
answer
32k
views
1
answer
Draw Hasse Diagram of $D_{42}$, Find the complement of each element in $D_{42}$.
discrete mathematics updated 20 months ago by sagarkolekar ★ 11k
0
votes
1
answer
30k
views
1
answer
Find transitive closure using Warshall's Algorithm.
discrete mathematics updated 2.3 years ago by pedsangini276 • 4.7k
1
vote
1
answer
29k
views
1
answer
A survey of 500 television watchers produced the following information:
discrete mathematics updated 2.2 years ago by pedsangini276 • 4.7k
3
votes
1
answer
28k
views
1
answer
Let A={1, 2, 3, 4} and R={(1, 2), (2, 3), (3, 4), (2, 1)}. Find the transitive closure using Warshall's algorithm.
discrete mathematics updated 2.3 years ago by pedsangini276 • 4.7k
2
votes
1
answer
27k
views
1
answer
Explain Pigeonhole principle and Extended Pigeonhole Principle. Show that if 7 colors are used to paint 50 bicycles, at least 8 bicycles will be of same color.
discrete mathematics updated 2.2 years ago by pedsangini276 • 4.7k
3
votes
1
answer
22k
views
1
answer
Determine the number of edges in a graph with 6 nodes, 2 nodes of degree 4 and 4 nodes of degree 2. Draw two such graphs.
discrete mathematics updated 2.3 years ago by sagarkolekar ★ 11k
2
votes
1
answer
21k
views
1
answer
Consider the group G = (1,2,3,4,5,6) under multiplication modulo 7 a) Find multiplication table of G b) find Inverse of every element
discrete mathematics updated 2.2 years ago by pedsangini276 • 4.7k
3
votes
1
answer
21k
views
1
answer
Find the generating function for the following sequence 1,2,3,4,5,6.........
discrete mathematics updated 2.3 years ago by pedsangini276 • 4.7k
0
votes
1
answer
20k
views
1
answer
Draw its Hasse diagram. P(A) is the power set of A.
discrete mathematics updated 18 months ago by sagarkolekar ★ 11k
2
votes
1
answer
19k
views
1
answer
Draw the Hasse Diagram of the following: 1. $D_{105}$ 2. $D_{72}$
discrete mathematics updated 2.2 years ago by sagarkolekar ★ 11k
1
vote
1
answer
19k
views
1
answer
How many vertices are necessary to construct a graph with exactly 6 edges in which each vertex is of degree 2.
discrete mathematics updated 2.3 years ago by sagarkolekar ★ 11k
2
votes
1
answer
19k
views
1
answer
Draw the Hasse diagram of $D_{60}$. Also find whether it is a lattice.
discrete mathematics updated 2.3 years ago by pedsangini276 • 4.7k
0
votes
1
answer
19k
views
1
answer
How many symmetric and reflexive relations are there on a set with n elements?
discrete mathematics updated 2.3 years ago by sagarkolekar ★ 11k
1
vote
1
answer
18k
views
1
answer
Show that if every element in a group is its own inverse, then the group must be abelian.
discrete mathematics updated 2.3 years ago by pedsangini276 • 4.7k
2
votes
1
answer
18k
views
1
answer
$6^{n+2}+ 7^{2n+1}$ is divisible by 43.
discrete mathematics updated 2.3 years ago by pedsangini276 • 4.7k
0
votes
1
answer
17k
views
1
answer
Prove p^ (qVr) and (p^ q)V(p^r) are logically equivalent.
discrete mathematics updated 2.3 years ago by pedsangini276 • 4.7k
3
votes
1
answer
17k
views
1
answer
Functions f, g, h are defined on a set, X= {1,2,3} as f= {(1,2) (2,3) (3,1)} g = {(1,2} (2,1) {3,3)) h = {(1, 1 ) (2,2) (3,1)} (i) Find fog, g o f are they equal ? (ii) Find fogoh and fohog.
discrete mathematics updated 2.2 years ago by pedsangini276 • 4.7k
0
votes
1
answer
16k
views
1
answer
Let A=(a, b, c). Show that (P{A}, C) is a poset. Draw its Hasse Diagram. P(A) is the power set of A.
discrete mathematics updated 2.3 years ago by pedsangini276 • 4.7k
2
votes
1
answer
15k
views
1
answer
State and explain Pigeonhole principle, extended Pigeonhole principle.How many numbers must be selected from the set{1, 2, 3, 4, 5, 6 }to guarantee that at least one pair of these numbers add up to 7?
discrete mathematics updated 2.2 years ago by pedsangini276 • 4.7k
0
votes
1
answer
14k
views
1
answer
Draw the Hasse diagram of the following sets under the partial order relation divides and indicate which are chains. justify your answer.
discrete mathematics updated 2.0 years ago by sagarkolekar ★ 11k
2
votes
1
answer
14k
views
1
answer
Prove that $8^n - 3^n$ is a multiple of 5 by mathematical Induction, n>=1.
discrete mathematics updated 2.3 years ago by pedsangini276 • 4.7k
<prev • 116 results • page 1 of 5 • next >