import{E as k,ag as C,r as p,c as d,b5 as o,f as m,a as c,aV as $,aL as n,s as l,l as q}from"./index-XCg2QAX4.js";const w="Solve problems with finding common divisors",j=!0,H="mathLive",Q=!0,N="AMCHybride",M="8c05e",F="3A12-1";function E(){k.call(this),this.consigne="",this.nbQuestionsModifiable=!0,this.nbQuestions=3,this.nbCols=2,this.nbColsCorr=2,this.tailleDiaporama=3,this.video="",this.interactifType="mathLive",this.sup="4",this.nouvelleVersion=function(){this.listeQuestions=[],this.listeCorrections=[],this.autoCorrection=[];const T=C({saisie:this.sup,min:1,max:3,melange:4,defaut:4,nbQuestions:this.nbQuestions,shuffle:!1}),g=[2,3,5,7,11];for(let a=0,i,f,b,u,h,s,v=0;a<this.nbQuestions&&v<50;){const e=p(30,39),x=p(0,4),r=g[x],y=p(0,4,[x]),t=g[y];switch(T[a]){case 1:this.interactif&&!d.isAmc?(i=`A florist has ${r*e} iris and ${t*e} roses. <br>`,i+="He wants, by using all his flowers, to make as many bouquets as possible.",i+="all containing the same number of irises and the same number of roses. <br>",i+="Give the maximum number of bouquets that the florist can make",i+="and the composition of the bouquet.<br><br>",b=o(0)+`Maximum number of bouquets:${m(20)}`,i+=b,i+=c(this,3*a,"inline largeur25")+"<br><br>",s=o(0),s+=`- The divisors of ${r*e} are: ${$(r*e).join(",")}.<br>`,s+=`${m(2)}- The divisors of ${t*e} are: ${$(t*e).join(",")}.<br>`,s+=`${e} is the largest number that divides both ${r*e} and ${t*e}.<br>`,s+=" The maximum number of bouquets is therefore: "+n(`${e}`)+".<br><br>",l(this,3*a,e),u=o(1)+`Number of irises in each bouquet:${m(8)}`,i+=u,i+=c(this,3*a+1,"inline largeur25")+"<br><br>",s+=o(1)+` $${r*e} \\div ${e} = ${r}$<br>`,s+="The number of irises in each bouquet is: "+n(` ${r}`)+".<br><br>",l(this,3*a+1,r),h=o(2)+" Number of roses in each bouquet: ",i+=h,i+=c(this,3*a+2,"inline largeur25")+"<br>",s+=o(2)+` $${t*e} \\div ${e} = ${t}$<br>`,s+="The number of roses in each bouquet is: "+n(` ${t}`)+".<br><br>",l(this,3*a+2,t)):(i=`A florist has ${r*e} iris and ${t*e} roses. <br>`,i+="He wants, by using all his flowers, to make as many bouquets as possible.",i+="all containing the same number of irises and the same number of roses. <br><br>",f=i,b=o(0)+"What is the maximum number of bouquets?<br><br>",i+=b,s=o(0),s+=`- The divisors of ${r*e} are: ${$(r*e).join(",")}.<br>`,s+=`${m(2)}- The divisors of ${t*e} are: ${$(t*e).join(",")}.<br>`,s+=`${e} is the largest number that divides both ${r*e} and ${t*e}.<br>`,s+=" The maximum number of bouquets is therefore: "+n(`${e}`)+".<br><br>",u=o(1)+"How many irises are in each bouquet?<br><br>",i+=u,s+=o(1)+` $${r*e} \\div ${e} = ${r}$<br>`,s+="The number of irises in each bouquet is: "+n(` ${r}`)+".<br><br>",h=o(2)+"How many roses are in each bouquet?<br><br>",i+=h,s+=o(2)+` $${t*e} \\div ${e} = ${t}$<br>`,s+="The number of roses in each bouquet is: "+n(` ${t}`)+".<br><br>");break;case 2:this.interactif&&!d.isAmc?(i=`A teacher organizes an educational outing to Futuroscope for his 3rd grade students. He is accompanied by ${r*e} boys and ${t*e} girls. <br>`,i+="He wishes to distribute all the students into as many groups as possible.",i+="all containing the same number of boys and the same number of girls. <br>",i+="Give the maximum number of groups that the teacher can carry out",i+="and the composition of each group.<br><br>",b=o(0)+`Maximum number of groups:${m(26)}`,i+=b,i+=c(this,3*a,"inline largeur25")+"<br><br>",s=o(0),s+=`- The divisors of ${r*e} are: ${$(r*e).join(",")}.<br>`,s+=`${m(2)}- The divisors of ${t*e} are: ${$(t*e).join(",")}.<br>`,s+=`${e} is the largest number that divides both ${r*e} and ${t*e}.<br>`,s+=" The maximum number of groups is therefore: "+n(`${e}`)+".<br><br>",l(this,3*a,e),u=o(1)+"Number of boys in each group: ",i+=u,i+=c(this,3*a+1,"inline largeur25")+"<br><br>",s+=o(1)+` $${r*e} \\div ${e} = ${r}$<br>`,s+="The number of boys in each group is: "+n(` ${r}`)+".<br><br>",l(this,3*a+1,r),h=o(2)+` Number of girls in each group:${m(6)}`,i+=h,i+=c(this,3*a+2,"inline largeur25")+"<br>",s+=o(2)+` $${t*e} \\div ${e} = ${t}$<br>`,s+="The number of girls in each group is: "+n(` ${t}`)+".<br><br>",l(this,3*a+2,t)):(i=`A teacher organizes an educational outing to Futuroscope for his 3rd grade students. He is accompanied by ${r*e} boys and ${t*e} girls. <br>`,i+="He wishes to distribute all the students into as many groups as possible.",i+="all containing the same number of boys and the same number of girls. <br><br>",f=i,b=o(0)+"What is the maximum number of groups?<br><br>",i+=b,s=o(0),s+=`- The divisors of ${r*e} are: ${$(r*e).join(",")}.<br>`,s+=`${m(2)}- The divisors of ${t*e} are: ${$(t*e).join(",")}.<br>`,s+=`${e} is the largest number that divides both ${r*e} and ${t*e}.<br>`,s+=" The maximum number of groups is therefore: "+n(`${e}`)+".<br><br>",u=o(1)+"How many boys are in each group?<br><br>",i+=u,s+=o(1)+` $${r*e} \\div ${e} = ${r}$<br>`,s+="The number of boys in each group is: "+n(` ${r}`)+".<br><br>",h=o(2)+"What is the number of girls in each group?<br><br>",i+=h,s+=o(2)+` $${t*e} \\div ${e} = ${t}$<br>`,s+="The number of girls in each group is: "+n(` ${t}`)+".<br><br>");break;default:this.interactif&&!d.isAmc?(i=`A baker has ${r*e} croissants and ${t*e} brioches. <br>`,i+="He wants, by using all his pastries, to make as many baskets as possible",i+="all containing the same number of croissants and the same number of brioches. <br>",i+="Give the maximum number of baskets that the baker can make",i+="and the composition of each basket.<br><br>",b=o(0)+`Maximum number of bins: ${m(30)}`,i+=b,i+=c(this,3*a,"inline largeur25")+"<br><br>",s=o(0),s+=`- The divisors of ${r*e} are: ${$(r*e).join(",")}.<br>`,s+=`${m(2)};- The divisors of ${t*e} are: ${$(t*e).join(",")}.<br>`,s+=`${e} is the largest number that divides both ${r*e} and ${t*e}.<br>`,s+=" The maximum number of bins is therefore: "+n(`${e}`)+".<br><br>",l(this,3*a,e),u=o(1)+"Number of croissants in each basket: ",i+=u,i+=c(this,3*a+1,"inline largeur25")+"<br><br>",s+=o(1)+` $${r*e} \\div ${e} = ${r}$<br>`,s+="The number of croissants in each basket is: "+n(` ${r}`)+".<br><br>",l(this,3*a+1,r),h=o(2)+` Number of brioches in each basket:${m(2)}`,i+=h,i+=c(this,3*a+2,"inline largeur25")+"<br>",s+=o(2)+` $${t*e} \\div ${e} = ${t}$<br>`,s+="The number of buns in each basket is: "+n(` ${t}`)+".<br><br>",l(this,3*a+2,t)):(i=`A baker has croissant ${r*e}s and brioche ${t*e}s. <br>`,i+="He wants, by using all his pastries, to make as many baskets as possible",i+="all containing the same number of croissants and the same number of brioches. <br><br>",f=i,b=o(0)+"What is the maximum number of bins?<br><br>",i+=b,s=o(0),s+=`- The divisors of ${r*e} are: ${$(r*e).join(",")}.<br>`,s+=`${m(2)}- The divisors of ${t*e} are: ${$(t*e).join(",")}.<br>`,s+=`${e} is the largest number that divides both ${r*e} and ${t*e}.<br>`,s+=" The maximum number of bins is therefore: "+n(`${e}`)+".<br><br>",u=o(1)+"How many croissants are in each basket?<br><br>",i+=u,s+=o(1)+` $${r*e} \\div ${e} = ${r}$<br>`,s+="The number of croissants in each basket is: "+n(` ${r}`)+".<br><br>",h=o(2)+"How many buns are in each basket?<br><br>",i+=h,s+=o(2)+` $${t*e} \\div ${e} = ${t}$<br>`,s+="The number of buns in each basket is: "+n(` ${t}`)+".<br><br>");break}this.questionJamaisPosee(a,r,t,e)&&(d.isAmc&&(this.autoCorrection[a]={enonce:"",enonceAvant:!1,propositions:[{type:"AMCNum",propositions:[{texte:s,statut:"",reponse:{texte:f+"<br>"+b,valeur:e,param:{digits:2,decimals:0,signe:!1,approx:0}}}]},{type:"AMCNum",propositions:[{texte:"",statut:"",reponse:{texte:u,valeur:r,param:{digits:2,decimals:0,signe:!1,approx:0}}}]},{type:"AMCNum",propositions:[{texte:"",statut:"",reponse:{texte:h,valeur:t,param:{digits:2,decimals:0,signe:!1,approx:0}}}]}]}),this.listeQuestions.push(i),this.listeCorrections.push(s),a++),v++}q(this)},this.besoinFormulaireTexte=["Choice of problems",`Numbers separated by hyphens
1: Florist
2: Teacher
3: Baker
4: Combination`]}export{Q as amcReady,N as amcType,E as default,j as interactifReady,H as interactifType,F as ref,w as titre,M as uuid};
//# sourceMappingURL=3A12-1-RvwBidKO.js.map