DM Assignment 1 OSS

Subject: Discrete Mathematical Structures
Subject Code: MATH231

Last Date of submission: 9th Sept, 2016
Assignment No.1
A. SET THEORY
Ques 1: Show that A = {2, 3, 4, 5} is not a subset of B={x| X N, x is even}
Ques 2: Refer the universal set U = {1, 2, 3., 9} and the sets
A= {1, 2, 3, 4, 5}
B= {4, 5, 6, 7}
C= {5, 6, 7, 8, 9}
D= {1, 3, 5, 7, 9}
F= {1, 5, 9}
Find
a. A U B and AB
b. D U F and DF
c. Ac and Ec
d. A\B, B\A, D\E and F\D
e. Symmetric difference between A and B ; D and E; E and F
Ques 3: Show that we can have A B= A C without B = C
Ques 4: Find using values of sets from question 2
a. A (B U E)
b. (A\E)C
c. (A D)\B
d. (B F) U (C E)
Ques 5: In Venn Diagram represent two arbitrary sets A and B. Shade
a. ABC
b. (B|A)C
Ques 6: Determine the validity of the Following argument:
S1: All my friends are musicians
S2: John is my Friend
S3: None of my neighbors are musicians
S: John is not my neighbor
Ques 7: Show that the set of Positive Rational number is Countable. Let the list of
positive rational numbers as sequence r1 , r2 , r3, r4,. rn, Note that every Positive
rational number is a quotient p/q of positive integers.
Ques 8: Find the cardinality of the set A U B where A and B are any arbitrary sets.
Ques 9: Among Integers 1 to 300
a. How many of them are divisible neither by 3 nor by 5 , nor by 7?
b. How many of them are divisible by 3 but not by 5 nor by 7?
Ques 10: It is known that in university 60 % of professors play tennis , 50 % of them
play bridge , 70% jog, 20 % play tennis and bridge, 40 % play bridge and jog and 30 %
play tennis and jog. If someone claimed that 20 % professors jog and play tennis and
bridge, would you believe his claim? Why?
Ques 11: Draw a Venn diagram and test the validity of the following argument:
All guilty people will be arrested. All thieves are guilty people. Therefore, all thieves
will be arrested.
Ques12:
a. Prove the identity: (A U B) ( A U BC ) = A
b. Prove (A U B) \(A B) = ( A/B) U (B|A)
Ques 13:
a. Find all the partitions of S = {1,2,3}
b. Determine the power set Power (A) of A = {a,b,c,d}
B. FUNCTIONS
Ques14: let the functions f and g be defined by f(x)=2x+1 and g(x)=x2 2. Find the
formula defining the composition function g o f.
Ques 15: Let f: R R be defines by f(x) = 2x-3. Now f is one to one and onto; hence f
has an inverse function f-1. Find the formula for f-1?
Ques 16: Find the cardinal number of each set?
A. A ={a,b,c,d.y, z}
B. B= {1,-3,-5,11,-28}
C. C={x:x N, x2= 5}
D. D= {10, 20, 30, 40, 50,}
E. E= {6, 7, 8, 9,}
Ques 17: Let a and b be positive integers, and suppose Q is defined recursively as
follows:
Q(a, b) =0
if a <b
Q((a-b), b)+1
if b<=a
Find :
a. Q(2,5)
b. Q(12,5)
c. What does this function do? Find Q(5861,7)
Ques 18: Sketch the graph of:
a. F(x) = x2+x-6
b. G(x)= x3-3x2-x+3
Ques 19: Consider functions f:A B and g: B C. Prove the following:
A. if f and g are one to one , then the composition function gof is one to one.
B. If f and g are onto functions, then go f is an onto function.
Ques 20: Find the domain of the real valued functions:
a. f(x)= 81-x2
b. f(x)= 25-x2
c. f(x)= x2-3x-4
d. f(x)= 1/ x-2
Ques 21: Let X={1,2,3,4}. Determine whether or not each relation is a function from X
into X.
a. f={(2,3), (1,4),(2,1),(3,2),(4,4)}
b. g={(3,1),(4,2),(1,1)}
c. h= {(2,1), (3,4),(1,4),(2,1),(4,4)}
Ques 22: Consider the following functions and compute:
a.
b.
c.
d.
gof
ho(gof)
(hog)of
Stat e the necessary and sufficient condition on f and g so that:
(1)
g0f is an onto function
(2)
gof to be one to one
(3)
gof to be one to one onto
e. Construct an example to show that for two functions f and g from A to A, in
general, fog g o f
C. RELATIONS
Ques 23:
a. Given : A= {1,2}, b= { x,y,z} and C= {3,4} Find: A X B X C
b. Let A= { 1,2 }, B={a,b,c} and C= {c, m, d}. Find (A X B) (A X C) and (B C)
c. Prove (A
d. X B) (A X C) = A X (B C)
Ques 24: Let A= {1,2,3,4,6} and let r be the relation on a defined by x divides y,
written x|y.(Note x|y iff there exists an integer z such that xz=y.)
a) Write R as a set of ordered pairs
b) Draw its directed graph.
c) Find the inverse relation R-1 of R. Can R-1 be described in word?
Ques 25: Let R and S be the following relations on A ={1,2,3}:
R={(1,1),(1,2),(2,3),(3,1),(3,3)}, S={(1,2),(1,3),(2,1),(3,3)}
Find
a. R S, R U S, Rc
b. RoS
c. S2=SoS
Ques 26: Given A= {1,2,3,4}. Consider the following relation in A:
R= {(1,1),(2,2),(2,3),(3,2),(4,2),(4,4)}
a. Draw its Directed Graph.
b. Is R i) Reflexive ii) Symmetric iii)Transitive or iv) antisymmetric?
c. Find R2 = Ro R
Ques 27: Let A be a set of non zero integers and let be the relation on A X A defined
by (a, b) (c, d) whenever ad= bc. Prove that is an equivalence relation?
Ques 28: Let R be the following equivalence relation on the set A ={ ,2,3,4,5,6}:
R= {(1,2),(1,5),(2,2),(2,3),(2,6),(3,2),(3,3),(3,6),(4,4),(5,1),(5,5),(6,2),(6,3),(6,6)}
Find the partition of A induced by R, i.e. find the equivalence classes of R.
Ques 29: From the following Digraphs, write relation as set of ordered pairs and check
for equivalence or partial ordering.
a.
b.
c. Draw a digraph for relation R on A. A={ 1,2,3,4,5,6,7,8}. Let xRy whenever y is

divisible by x. Is R equivalence relation? Is R Partial Ordering?
D. The PigeonHole Principle

Ques 30: Let L be a list (not necessarily in alphabetic order) of the 26 letters in the
English alphabet (which consists of 5 vowels, A, E, I, O <u and 21 consonants)
a. Show that L has a sublist consisting of four or more consecutive consonants.
b. Assuming L begins with a vowel, say A, show that L has a sublist consisting of
five or more consecutive consonants.
Ques 31: Find the minimum number n of integers to be selected from S= {1,2,,9} so
that:
a. The sum of two of the n integers is even.
b. The Difference of two of the n integers is 5.
E. MATHEMATICAL INDUCTION
Ques 32: Prove the proposition that the sum of the first n positive integers is n(n+1)/2;
that is
P(n):1+2++n=1/2n(n+1)
Ques 33: Prove the proposition P that the sum of the squares of the first positive integers
is n(n+1)(2n+1)/6; that is
P(n):12+22+.+n2=n(n+1)(2n+1)/6
Ques 34: Use mathematical induction to prove that 1 + 2 + 3 + ... + n = n (n + 1) / 2 for

all positive integers n.
Ques 35: Use mathematical induction to prove De Moivre's theorem
[ R (cos t + i sin t) ] n = R n(cos nt + i sin nt),
for n a positive integer.
Ques 36: Prove that for any positive integer number n , n 3 + 2 n is divisible by 3
F. RECURRENCE RELATIONS
Ques 37: Compute the first four terms of the sequence defined by each of the following
recurrence relations:
a. An= nan-1+n2an-2
b. An= a2n-1 for n>=2
c. An = an-1 an-3 for n>=3
d. An =6an-1
Ques 38: Predict the formula for the following recurrence relation by substitution
method.
Tn=1
n=2
And tn=2tn-1 +1
n>2
Ques 39: Using iterative (substitution) method, predict a solution for following
recurrence relation
Tn =0 for n = 0
and
Tn = tn-1 + 4n
for n>=1
Ques 40: Solve the following Recurrence

Tn = 7tn-1 10tn-2
Subject to initial conditions
Tn = 5 for n=0
Tn =16 for n=1
Ques 41: Find the solution for the recurrence relation
Tn=-3an-1-3an-2-an-3
With initial conditions
T0=1 for n=0
T1 = -2 for n=1
T3= -1 for n=2

DM Assignment 1 OSS

Uploaded by

Copyright:

Available Formats

DM Assignment 1 OSS

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

DM Assignment 1 OSS

Uploaded by

Copyright:

Available Formats

Subject: Discrete Mathematical Structures

Subject Code: MATH231

c. Draw a digraph for relation R on A. A={ 1,2,3,4,5,6,7,8}. Let xRy whenever y is

D. The PigeonHole Principle

Ques 34: Use mathematical induction to prove that 1 + 2 + 3 + ... + n = n (n + 1) / 2 for

Ques 40: Solve the following Recurrence

You might also like