[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fO3Gnjb9ZBaKB5kPQSYky49MmxiRiIGSp2uTeEwU2yBo":3},{"id":4,"source":5,"question":6,"options":7,"answer":12,"related":13,"type":18,"origin":65,"createTime":20},58382718,"v1","S是有限集,A,B,C是S的子集,下列说法正确的是",[8,9,10,11],"|S-A|=|S|-|A|","|A-B|=|A|-|B|","|A∪B∪C|=|A|+|B|+|C|-|A∩B|-|A∩C|-|B∩C|","|A-B∪C|=|A|-|B∩A|-|C∩A|+|C∩B∩A|",[],[14,21,28,34,40,46,52,59],{"id":4,"source":5,"question":6,"options":15,"answer":16,"related":17,"type":18,"origin":19,"createTime":20},[8,9,10,11],[],[],1,null,"2023-06-11T23:20:10+08:00",{"id":22,"source":5,"question":23,"options":24,"answer":25,"related":26,"type":27,"origin":19,"createTime":20},58382719,"6个不同小球放入3个相异盒子,每盒非空的不同放法数是(填数字)",[],[],[],2,{"id":29,"source":5,"question":30,"options":31,"answer":32,"related":33,"type":27,"origin":19,"createTime":20},58382720,"S={1,2,...,56160}中既能被36又能被54整除的数的个数是(填数字)",[],[],[],{"id":35,"source":5,"question":36,"options":37,"answer":38,"related":39,"type":27,"origin":19,"createTime":20},58382721,"a,b,c,d,e这5个字母构成的a不排第一位,b不排第二位的全排列有多少个?(填数字)",[],[],[],{"id":41,"source":5,"question":42,"options":43,"answer":44,"related":45,"type":27,"origin":19,"createTime":20},58382722,"M={1,2,3,4,5,6,7}中不包含1或不包含2的组合共有多少个",[],[],[],{"id":47,"source":5,"question":48,"options":49,"answer":50,"related":51,"type":27,"origin":19,"createTime":20},58382723,"不超过1000的正整数中有多少个能至少被8,10,12中的某一个整除?(填数字)",[],[],[],{"id":53,"source":5,"question":54,"options":55,"answer":56,"related":57,"type":58,"origin":19,"createTime":20},58382724,"容斥原理的低阶形式是人们在长期生活实践中总结出来的,有明显的直观性,所以它与加法原则一样被看成公理而无需加以证明",[],[],[],3,{"id":60,"source":5,"question":61,"options":62,"answer":63,"related":64,"type":58,"origin":19,"createTime":20},58382725,"容斥原理是加法原则的推广,加法原则是容斥原理的特殊情况",[],[],[],{"courseName":66,"courseImg":67,"workName":68,"workId":69,"count":70,"courseId":71},"组合数学-2023","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F3b775050fe74f74d3ba68348d5d53f98.jpg","作业6","work_26830672",8,"85674f6c997cfa78b9af41dca14432b3"]