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
2861
logic question
what is the missing no in following series 500,1800,100, _ , 20,50,4 explain with logic
what is the missing no in following series500,1800,100, _ , 20,50,4 explain with logic
Saurabh Sawarkar
401
views
Saurabh Sawarkar
asked
Jul 30, 2018
0
votes
1
answer
2862
Doubt
Can someone show the derivation of number of one-one functions(f: A->B) is nPm where |A|=m and |B|=n?
Can someone show the derivation of number of one-one functions(f: A->B) is nPm where |A|=m and |B|=n?
aditi19
183
views
aditi19
asked
Jul 30, 2018
1
votes
1
answer
2863
Discrete maths approach
Can you please guide me how to approach discrete maths? I want prepare it alongside with what's being taught at classroom coaching, please suggest resources and strategy
Can you please guide me how to approach discrete maths? I want prepare it alongside with what's being taught at classroom coaching, please suggest resources and strategy
Ajaaz
496
views
Ajaaz
asked
Jul 30, 2018
Set Theory & Algebra
discrete-mathematics
combinatory
set-theory&algebra
mathematical-logic
linear-algebra
+
–
1
votes
2
answers
2864
What is the correct translation of the following statement into mathematical logic
What is the correct translation of the following statement into mathematical logic? “Every student who walks talks” (I) ∀x ((student(x) & walk (x)) → talk (x))) (II) ∀x (student(x) → (walk (x) → talk (x))) (III) ¬ ∃x ((student(x) & walk (x)) & ¬(talk (x)))) Please explain
What is the correct translation of the following statement into mathematical logic? “Every student who walks talks”(I) ∀x ((student(x) & walk (x)) → talk (x))) (I...
Pawan Kumar 7
1.7k
views
Pawan Kumar 7
asked
Jul 29, 2018
Mathematical Logic
mathematical-logic
first-order-logic
+
–
1
votes
2
answers
2865
self doubt
if R1and R2 are two antisymmetric relations on a set then R1 - R2 and R1 intersection R2 are also antisymmetrical?
if R1and R2 are two antisymmetric relations on a set then R1 - R2 and R1 intersection R2 are also antisymmetrical?
namvar
1.6k
views
namvar
asked
Jul 29, 2018
0
votes
0
answers
2866
self doubt
is empty relation R={ } on en empty set A={ } is equivalence?
is empty relation R={ } on en empty set A={ } is equivalence?
namvar
544
views
namvar
asked
Jul 29, 2018
Set Theory & Algebra
discrete-mathematics
+
–
1
votes
1
answer
2867
Zeal Workbook: Graph Theory - Graph Connectivity
Prove that every graph with n vertices and k components has atleast n-k edges.
Prove that every graph with n vertices and k components has atleast n-k edges.
Prince Sindhiya
421
views
Prince Sindhiya
asked
Jul 29, 2018
Graph Theory
zeal
graph-theory
graph-connectivity
zeal-workbook
+
–
4
votes
2
answers
2868
MADEEASY
Consider a set S={1000,1001,1002........,9999}. The numbers in set S having atleast one digit as 2 and atleast one digit as 5 are?
Consider a set S={1000,1001,1002........,9999}. The numbers in set S having atleast one digit as 2 and atleast one digit as 5 are?
Utkarsh Joshi
1.4k
views
Utkarsh Joshi
asked
Jul 28, 2018
Combinatory
counting
+
–
0
votes
1
answer
2869
Kenneth Rosen Edition 6th Exercise 6.1 Question 4 (Page No. 400)
Show that the sequence {an} is a solution of the recurrence relation an = -3an-1 + 4an-2 if a) an = 0 b) an = 1 c) an = (-4)n d) an = 2(-4)n + 3 In the question What is sequence {an} ?? And how to solve this kind of question?
Show that the sequence {an} is a solution of the recurrence relation an = -3an-1 + 4an-2 ifa) an = 0b) an = 1c) an = (-4)nd) an = 2(-4)n + 3In the question What is sequen...
Sandy Sharma
6.6k
views
Sandy Sharma
asked
Jul 28, 2018
Combinatory
kenneth-rosen
discrete-mathematics
recurrence-relation
+
–
0
votes
1
answer
2870
Kenneth H. Rosen 7th edition 5.5
How many ways are there to distribute five balls into three boxes if each box must have atleast one ball in it and if the balls are labelled but the boxes are unlabelled?
How many ways are there to distribute five balls into three boxes if each box must have atleast one ball in it and if the balls are labelled but the boxes are unlabelled?...
snehasarkar
299
views
snehasarkar
asked
Jul 28, 2018
1
votes
2
answers
2871
Sets and relations
If A is a set of positive odd elements less than 10. Then what is the cardinality of set A?
If A is a set of positive odd elements less than 10. Then what is the cardinality of set A?
AIkiran01
920
views
AIkiran01
asked
Jul 28, 2018
Set Theory & Algebra
combinatory
set-theory&algebra
+
–
0
votes
0
answers
2872
Does all the sets are counted here ??
cool_dude
131
views
cool_dude
asked
Jul 26, 2018
Mathematical Logic
discrete-mathematics
+
–
1
votes
1
answer
2873
Permutations
The number of permutations of ‘n’ different things taken not more than ‘r’ at a time, with repetitions being allowed, is (a) (nr – 1)/ (n – 1) (b) (nr – 1) / (n – 1)! (c) n(nr – 1)/ (n – 1) (d) (nr – 1) / n!
The number of permutations of ‘n’ different things taken not more than ‘r’ at a time, withrepetitions being allowed, is(a) (nr – 1)/ (n – 1) (b) (nr –...
shubham6596
616
views
shubham6596
asked
Jul 25, 2018
Combinatory
combinatory
+
–
0
votes
0
answers
2874
Kenneth Rosen Edition 6th Exercise 1.4 Question 9 (Page No. 59)
Let L(x, y) be the statement x loves y, where the domain for both x and y consists of all people in the world. Use quantifiers to express each of these statements. g) There is exactly one person whom everybody loves ... There is someone who loves no one besides himself or herself. How these are represented???? The answer given is:-
Let L(x, y) be the statement “x loves y,” where the domainfor both x and y consists of all people in the world.Use quantifiers to express each of these statements.g) ...
Sandy Sharma
380
views
Sandy Sharma
asked
Jul 25, 2018
Mathematical Logic
kenneth-rosen
discrete-mathematics
quantifiers
mathematical-logic
+
–
0
votes
0
answers
2875
logic (coursera)
Consider a propositional language with three propositional constants - mushroom, purple, and poisonous - each indicating the property suggested by its spelling. Using these propositional constants, encode the following English sentences as Propositional Logic sentences. Use ~ ... use <=> for ⇔ when entering compound sentences. A mushroom is not poisonous unless it is purple.
Consider a propositional language with three propositional constants - mushroom, purple, and poisonous - each indicating the property suggested by its spelling. Using the...
hitendra singh
1.2k
views
hitendra singh
asked
Jul 24, 2018
Mathematical Logic
propositional-logic
+
–
0
votes
1
answer
2876
logic course (coursera)
Consider a propositional language with three propositional constants - mushroom, purple, and poisonous - each indicating the property suggested by its spelling. Using these propositional constants, encode the following English sentences as Propositional Logic sentences. ... <=> for ⇔ when entering compound sentences. A mushroom is not poisonous unless it is purple.
Consider a propositional language with three propositional constants - mushroom, purple, and poisonous - each indicating the property suggested by its spelling. Using the...
Hitendra Singh 1
558
views
Hitendra Singh 1
asked
Jul 24, 2018
Mathematical Logic
propositional-logic
+
–
0
votes
0
answers
2877
How it is possible?
cool_dude
172
views
cool_dude
asked
Jul 24, 2018
Combinatory
discrete-mathematics
+
–
0
votes
0
answers
2878
Show that T is a maximum spanning tree for G
Let G=(V,E) a connected graph, and p:E−>R a weight function. We denote |v|=n and E={e1,e2,...,em}, we suppose that ∀i p(ei)≤p(ei+1). 1-Show that in a connected graph G, if T and T′ are two distinct partial ... spaninnig tree on G. 3- Give the complexity of the determination of Tm. Can some one help me in the second and third question? Thank you.
Let G=(V,E) a connected graph, and p:E−>R a weight function. We denote |v|=n and E={e1,e2,...,em}, we suppose that ∀i p(ei)≤p(ei+1).1-Show that in a connected graph...
abram19000
241
views
abram19000
asked
Jul 24, 2018
Graph Theory
graph-theory
graph-algorithms
+
–
1
votes
0
answers
2879
Kenneth Rosen Edition 6th Exercise 1.4 Question 7 e,f (Page No. 58)
Let T (x, y) mean that student x likes cuisine y, where the domain for x consists of all students at your school and the domain for y consists of all cuisines. Express each of these statements by a simple English sentence. e ... have the same opinion (either they both like it or they both do not like it). How to reach the answers?
Let T (x, y) mean that student x likes cuisine y, where thedomain for x consists of all students at your school andthe domain for y consists of all cuisines. Express each...
Sandy Sharma
823
views
Sandy Sharma
asked
Jul 24, 2018
Mathematical Logic
kenneth-rosen
discrete-mathematics
mathematical-logic
quantifiers
+
–
0
votes
0
answers
2880
doubt
Q: Identify pigeon and pigeonhole : Suppose that a computer science laboratory has 15 workstations and 10 servers. A cable can be used to directly connect a workstation to a server. For each server, only one direct connection to that server can be active at any ... to every server (using 150 connections), what is the minimum number of direct connections needed to achieve this goal? (ans 60)
Q: Identify pigeon and pigeonhole :Suppose that a computer science laboratory has 15 workstations and 10 servers. A cable can be used to directly connect a workstation to...
cool_dude
218
views
cool_dude
asked
Jul 24, 2018
Mathematical Logic
discrete-mathematics
+
–
Page:
« prev
1
...
139
140
141
142
143
144
145
146
147
148
149
...
357
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register