#C23.txt: April 14, 2016, Dr. Z.'s Expmatgh class, Satisfiability (or rather Tautologicality) Help:=proc(): print(`IsTa(D1,n), Inter1(S1,S2), Inter(S), Wt(S) , Wtr(S,r), NuPts(D1,n)`) : print(`IsTb(D1,n) `): end: with(combinat): ##stuff from C22.txt #C22.txt, April 11, 2016 #"Tautologically" of Disjunctive normal form DNF Help22:=proc(): print(`RC(n,r), RDNF(n,r,K) ,SubCube(C,n), TF(D1,n) `): end: #Group Class assignment: #Producer: Andrew Lohr #Associate Producer for real Math: Anthony #Associate Producer for human interface: Alejandro #Actors for real math: {John C., Keith, Bryan, Jinyoung}; #Actors for stories (under Alejandro): {Ali,Xukai, Emily, Mingjia} #Sanitation engineer: Richard V. #Becky: can pick what she wants #RC(n,r): a random disjunction in n veriables with r terms #Data structre for a single conjunction is a susbet of {1,2,..,n,-1, ..., -n} #such that i and -i can't be together. For example #not x3 AND x7 AND not x9= {-3,7,-9}. RC:=proc(n,r) local S,a,b,ra1,ra2: ra1:=rand(1..n): ra2:=rand(0..1): S:={}: while nops(S)=1 then RETURN(true,r): fi: od: FAIL: end: