The argument is p→~q,~r→p,q|–r in true table in mathematical foundations of computer science
Let R={(1,2),(1,4),(2,1),(2,4),(3,2),(3,4)}
R={(1,2),(1,4),(2,1),(2,4),(3,2),(3,4)}
is a relation on set A={1,2,3,4}
A={1,2,3,4}
Suppose a Rn b
means that there is a path of length n from a
to b
Which of the elements are R3?
Suppose there are 10 male and 6 female professors to teach Discrete mathematics. In how
many ways a student can choose Discrete mathematics professor.
list the ordered pairs in the equivalence relations R induced by these partitions of p { {1} , {3} , { 2,4,5,6} rt he set of { 1,2,3,4,5,6}
solve the recurrence t(n)=(t(n/2)^2) assuming t(1)=1
A committee of 8 is to be formed from 16 men and 10 women.
In how many ways can the committee be formed if
i) there are no restrictions.
ii) there must be 4 men and 4 women.
iii) there should be an even number of women.
iv) there are more women than men.
v) there are atleast 6 men.
A committee of 8 is to be formed from 16 men and 10 women.
In how many ways can the committee be formed if
i) there are no restrictions.
ii) there must be 4 men and 4 women.
iii) there should be an even number of women.
iv) there are more women than men.
v) there are atleast 6 men.
Let an denote the number of surjective (onto) functions f : {1, 2, . . . , n} −→
{1, 2, 3} such that f(1) < f(2). Give a Θ estimate for an.
An engineer designs at least one robot a day for 30 days. If a total of 45
robots have been designed, then show that there must have been a series of consecutive
days when exactly 14 robots were designed.
I come to class whenever there is going to be a quiz this statement is inverse converse and contarpositve?