1.
(a) Few men are not scientist too.
(b) Every computer science major needs discrete mathematics.
2. if the bit string of 10 bits does not start with 0 but end with 1
that means we fixed the first and last bit with 1.
then the num of such strings will be 
3. given that,
with 
Now,
.............(1)
we have, 
then, 
then
from (1)

similarly go on.
so we can say that,

Hence

(2 pts each) Find a different equivalent form of the statements. Justify your answers using Laws...
(2 pts each) Find a different equivalent form of the statements. Justify your answers using Laws of equivalence or otherwise. (a) Not all men are Scientists. (b) If you are a computer science major you will need discrete mathematics. (10 pts) Let R be an equivalence relation on a non empty set X. So R C X X X. R is reflexive: Vx E X, (x,x) E R, R is symmetric: Vx, y E X, (x,y) E R = (y,x)...
(5 pts each) Give example of an explicit function f in each of the following category with properly written domain D and range R such that (a) There exists a subset S of D with f-'[F(S)] + S (b) There exists a subset T of R with f[f-(T)] #T (11) (3+3+ 5 + 5 + 2) Define functional completeness. Show that x + y = (x + y) + (x + y), x · y = (x + x) +...
specifically on finite
i pmu r the number of objøcts or ways. Leave your answers in fornsiala form, such as C(3, 2) nporkan?(2) Are repeats poasib Two points each imal digits will have at least one xpeated digin? I. This is the oounting problem Al ancmher so ask yourelr (1) ls onder ipo n How many strings of four bexadeci ) A Compuir Science indtructor has a stack of blue can this i For parts c, d. and e, suppose...