#please do not post homework
Kenneth Chan
Math 454
HW 4
1.CP({a,b,c},{b,c,d}); {[a,b],[a,c],[a,d],[b,b],[b,c],[b,d],[c,b],[c,c],[c,d]}
CheckMulti({1,2},{3,4}); True
CheckAdd({1,2,3},{3,4,5}) False
member([d,o,r,o,n],Words({d,o,n,r},5))=all possible sets using the letters d o n r to make a 5 letter set with no restrictions on how many time
one letter can be used.
2.n=77 after n=77 A27 no longer appears 
3.A1=(3,6,9,12,15) A2=(5,10,15)
PIE2:=(U,A1,A2) local U,A1,A2,C:
option remember:

if not type(U,set) then
print(U, "is not a set"):
Return(FAIL):
fi:

if not type(A1,set) then
print(A1, "is not a set"):
Return(FAIL):
fi:

if not type(A2,set) then
print(A2, "is not a set"):
Return(FAIL):

if not false then
evalb(Mynops(U union A1)=Mynops(U)+Mynops(A1)
print(A1, "is a subset of U"):
Return(FAIL):
fi:

if not false then
evalb(Mynops(U union A2)=Mynops(U)+Mynops(A2)
print(A2, "is a subset of U"):
Return(FAIL):
fi:

if Comp(U,A1) intersect Comp(U,A2)<>{} then
print(A1,A2, "have the common elements", Comp(U,A1) intersect Comp(U,A2):
fi:

C:=|U|-|A1|-|A2|+|A1 intersect A2|:

end: