import{E as u,aj as l,h as i,cA as o,c,p as h,l as d,aR as f}from"./index-XCg2QAX4.js";const m=!0,v="qcmMult",p=!0,k="qcm",C="Use divisibility criteria (several possible)",$="fa2eb",g="6N43-2";function T(){u.call(this),this.spacing=1,this.spacingCorr=1,this.nbQuestions=5,this.nbColsCorr=1,this.nbCols=1,this.sup=!1,this.listeAvecNumerotation=!1,this.nouvelleVersion=function(){this.modeQcm=this.interactif,this.autoCorrection=[],this.modeQcm?this.consigne="Put a cross in the appropriate box (or appropriate boxes).":this.consigne="Complete the table by putting yes or no in each box.",this.listeQuestions=[],this.listeCorrections=[],this.autoCorrection=[];const b=l(["div2","div3","div39","div5","div25","div23","div239","div35","div2359","divrien"],this.nbQuestions),t=[];let n,a;const r=[],s=[7,13,17,19,23,29,37,43,47,53,59,67,73,79,83,89,97,103,107,109,113,127,137,139,149,157,163,167,173,179,193,197,199,223,227,229,233,239,257,263,269,277,281,283,293];a="",n="";for(let e=0;e<this.nbQuestions;e++){switch(this.autoCorrection[e]={},this.autoCorrection[e].options={},b[e]){case"div2":t[e]=2*(this.sup?i(s.slice(30)):i(s))*(this.sup?i(s.slice(30)):1),r[e]=`${o(t[e])} & \\color{blue}{\\text{yes}} & \\text{no} & \\text{no} & \\text{no} \\\\`,this.autoCorrection[e].propositions=[{texte:"2",statut:!0,feedback:"Correct !"},{texte:"3",statut:!1,feedback:"The sum of the digits is not divisible by 3."},{texte:"5",statut:!1,feedback:"The ones digit is neither 0 nor 5."},{texte:"9",statut:!1,feedback:"The sum of the digits is not divisible by 9."},{texte:"none of these numbers",statut:!1,feedback:"The ones digit is 0, 2, 4, 6 or 8, so it is divisible by 2."}],this.autoCorrection[e].enonce=`$${o(t[e])}$ is divisible by
`;break;case"div3":t[e]=3*(this.sup?i(s.slice(30)):i(s))*(this.sup?i(s.slice(30)):1),r[e]=`${o(t[e])} & \\text{no} & \\color{blue}{\\text{yes}} & \\text{no} & \\text{no} \\\\`,this.autoCorrection[e].propositions=[{texte:"2",statut:!1,feedback:"The ones digit is neither 0, nor 2, nor 4, nor 6, nor 8. It is not divisible by 2."},{texte:"3",statut:!0,feedback:"Correct !"},{texte:"5",statut:!1,feedback:"The ones digit is neither 0 nor 5."},{texte:"9",statut:!1,feedback:"The sum of the digits is not divisible by 9."},{texte:"none of these numbers",statut:!1,feedback:"This number is divisible by 3 because the sum of its digits is divisible by 3."}],this.autoCorrection[e].enonce=`$${o(t[e])}$ is divisible by
`;break;case"div39":t[e]=9*(this.sup?i(s.slice(30)):i(s))*(this.sup?i(s.slice(30)):1),r[e]=`${o(t[e])} & \\text{no} & \\color{blue}{\\text{yes}} & \\text{no} & \\color{blue}{\\text{yes}} \\\\`,this.autoCorrection[e].propositions=[{texte:"2",statut:!1,feedback:"The ones digit is neither 0, nor 2, nor 4, nor 6, nor 8. It is not divisible by 2."},{texte:"3",statut:!0,feedback:"Correct !"},{texte:"5",statut:!1,feedback:"The ones digit is neither 0 nor 5."},{texte:"9",statut:!0,feedback:"Correct !"},{texte:"none of these numbers",statut:!1,feedback:"This number is divisible by 9 and by 3 because the sum of its digits is divisible by 9."}],this.autoCorrection[e].enonce=`$${o(t[e])}$ is divisible by
`;break;case"div5":t[e]=5*(this.sup?i(s.slice(30)):i(s))*(this.sup?i(s.slice(30)):1),r[e]=`${o(t[e])} & \\text{no} & \\text{no} & \\color{blue}{\\text{yes}} & \\text{no} \\\\`,this.autoCorrection[e].propositions=[{texte:"2",statut:!1,feedback:"The ones digit is neither 0, nor 2, nor 4, nor 6, nor 8. It is not divisible by 2."},{texte:"3",statut:!1,feedback:"The sum of the digits is not divisible by 3."},{texte:"5",statut:!0,feedback:"Correct !"},{texte:"9",statut:!1,feedback:"The sum of the digits is not divisible by 9."},{texte:"none of these numbers",statut:!1,feedback:`This number is divisible by 5 because its units digit is $${t[e].toString().charAt(t[e].toString().length-1)}$.`}],this.autoCorrection[e].enonce=`$${o(t[e])}$ is divisible by
`;break;case"div25":t[e]=10*(this.sup?i(s.slice(30)):i(s))*(this.sup?i(s.slice(30)):1),r[e]=`${o(t[e])} & \\color{blue}{\\text{yes}} & \\text{no} & \\color{blue}{\\text{yes}} & \\text{no} \\\\`,this.autoCorrection[e].propositions=[{texte:"2",statut:!0,feedback:"Correct !"},{texte:"3",statut:!1,feedback:"The sum of the digits is not divisible by 3."},{texte:"5",statut:!0,feedback:"Correct !"},{texte:"9",statut:!1,feedback:"The sum of the digits is not divisible by 9."},{texte:"none of these numbers",statut:!1,feedback:"This number is a multiple of 10. It is therefore divisible by 2 and by 5."}],this.autoCorrection[e].enonce=`$${o(t[e])}$ is divisible by
`;break;case"div23":t[e]=6*(this.sup?i(s.slice(30)):i(s))*(this.sup?i(s.slice(30)):1),r[e]=`${o(t[e])} & \\color{blue}{\\text{yes}} & \\color{blue}{\\text{yes}} & \\text{no} & \\text{no} \\\\`,this.autoCorrection[e].propositions=[{texte:"2",statut:!0,feedback:"Correct !"},{texte:"3",statut:!0,feedback:"Correct !"},{texte:"5",statut:!1,feedback:"The ones digit is neither 0 nor 5."},{texte:"9",statut:!1,feedback:"The sum of the digits is not divisible by 9."},{texte:"none of these numbers",statut:!1,feedback:"This number is an even number. It is therefore divisible by 2."}],this.autoCorrection[e].enonce=`$${o(t[e])}$ is divisible by
`;break;case"div239":t[e]=18*(this.sup?i(s.slice(30)):i(s))*(this.sup?i(s.slice(30)):1),r[e]=`${o(t[e])} & \\color{blue}{\\text{yes}} & \\color{blue}{\\text{yes}} & \\text{no} & \\color{blue}{\\text{yes}} \\\\`,this.autoCorrection[e].propositions=[{texte:"2",statut:!0,feedback:"Correct !"},{texte:"3",statut:!0,feedback:"Correct !"},{texte:"5",statut:!1,feedback:"The ones digit is neither 0 nor 5."},{texte:"9",statut:!0,feedback:"Correct !"},{texte:"none of these numbers",statut:!1,feedback:"This number is an even number. It is therefore divisible by 2."}],this.autoCorrection[e].enonce=`$${o(t[e])}$ is divisible by
`;break;case"div35":t[e]=15*(this.sup?i(s.slice(30)):i(s))*(this.sup?i(s.slice(30)):1),r[e]=`${o(t[e])} & \\text{no} & \\color{blue}{\\text{yes}} & \\color{blue}{\\text{yes}} & \\text{no} \\\\`,this.autoCorrection[e].propositions=[{texte:"2",statut:!1,feedback:"The ones digit is neither 0, nor 2, nor 4, nor 6, nor 8. It is not divisible by 2."},{texte:"3",statut:!0,feedback:"Correct !"},{texte:"5",statut:!0,feedback:"Correct !"},{texte:"9",statut:!1,feedback:"The sum of the digits is not divisible by 9."},{texte:"none of these numbers",statut:!1,feedback:"This number is an even number. It is therefore divisible by 2."}],this.autoCorrection[e].enonce=`$${o(t[e])}$ is divisible by
`;break;case"div2359":t[e]=90*(this.sup?i(s.slice(30)):i(s))*(this.sup?i(s.slice(30)):1),r[e]=`${o(t[e])} & \\color{blue}{\\text{yes}} & \\color{blue}{\\text{yes}} & \\color{blue}{\\text{yes}} & \\color{blue}{\\text{yes}} \\\\`,this.autoCorrection[e].propositions=[{texte:"2",statut:!0,feedback:"Correct !"},{texte:"3",statut:!0,feedback:"Correct !"},{texte:"5",statut:!0,feedback:"Correct !"},{texte:"9",statut:!0,feedback:"Correct !"},{texte:"none of these numbers",statut:!1,feedback:"This number is an even number. It is therefore divisible by 2."}],this.autoCorrection[e].enonce=`$${o(t[e])}$ is divisible by
`;break;case"divrien":t[e]=i(s)*(this.sup?i(s.slice(30)):1),r[e]=`${o(t[e])} & \\text{no} & \\text{no} & \\text{no} & \\text{no} \\\\`,this.autoCorrection[e].propositions=[{texte:"2",statut:!1,feedback:"This number is an odd number. It is not divisible by 2."},{texte:"3",statut:!1,feedback:"The sum of the digits is not divisible by 3."},{texte:"5",statut:!1,feedback:"The ones digit is neither 0 nor 5."},{texte:"9",statut:!1,feedback:"The sum of the digits is not divisible by 9."},{texte:"none of these numbers",statut:!0,feedback:"Correct !"}],this.autoCorrection[e].enonce=`$${o(t[e])}$ is divisible by
`;break}this.autoCorrection[e].options={ordered:!0,lastChoice:4},!c.isAmc&&this.modeQcm&&(n+=`$${o(t[e])}$ is divisible by:`,n+=h(this,e).texte,n+="<br>")}if(c.isHtml&&!this.modeQcm&&(n=`$\\def\\arraystretch{2.5}\\begin{array}{|l|c|c|c|c|}
`),!c.isHtml&&!this.modeQcm&&(n=`

$\\begin{array}{|l|c|c|c|c|}
`),!c.isAmc&&!this.modeQcm){n+=`\\hline
`,n+=`\\text{... is divisible} & \\text{by }2 & \\text{by }3 & \\text{by }5 & \\text{by }9\\\\
`,n+=`\\hline
`;for(let e=0;e<this.nbQuestions;e++)n+=`${o(t[e])} & & & & \\\\
`,n+=`\\hline
`;n+=`\\end{array}
$`}if(c.isHtml&&(a=`$\\def\\arraystretch{2.5}\\begin{array}{|l|c|c|c|c|}
`),!c.isHtml&&!c.isAmc&&(a=`$\\begin{array}{|l|c|c|c|c|}
`),!c.isAmc){a+=`\\hline
`,a+=`\\text{... is divisible} & \\text{by }2 & \\text{by }3 & \\text{by }5 & \\text{by }9\\\\
`,a+=`\\hline
`;for(let e=0;e<this.nbQuestions;e++)a+=r[e],a+=`\\hline
`;a+=`\\end{array}$
`}this.listeQuestions.push(n),this.listeCorrections.push(a),c.isAmc||(this.interactif?d(this):f(this))},this.besoinFormulaireCaseACocher=["Big numbers",!1]}export{m as amcReady,v as amcType,T as default,p as interactifReady,k as interactifType,g as ref,C as titre,$ as uuid};
//# sourceMappingURL=6N43-2-5uMwlBi2.js.map