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