<?xml version="1.0" encoding="UTF-8"?>
<!-- Maths Convergence — QCM au format Moodle XML — licence CC BY-NC-SA 4.0 -->
<quiz>
<question type="category"><category><text>$course$/Maths Convergence/Expertes/Maths expertes · Chapitre 3 — PGCD. Théorème de Bézout et théorème de Gauss</text></category></question>
<question type="multichoice"><name><text>e3-01</text></name><questiontext format="html"><text><![CDATA[\(\operatorname{PGCD}(48\,;180)\) est égal à :]]></text></questiontext><generalfeedback format="html"><text><![CDATA[Algorithme d'Euclide : \(180=48\times3+36\), \(48=36\times1+12\), \(36=12\times3+0\).]]></text></generalfeedback><defaultgrade>1</defaultgrade><penalty>0</penalty><hidden>0</hidden><single>true</single><shuffleanswers>true</shuffleanswers><answernumbering>abc</answernumbering><answer fraction="100" format="html"><text><![CDATA[\(12\)]]></text><feedback format="html"><text></text></feedback></answer><answer fraction="0" format="html"><text><![CDATA[\(6\)]]></text><feedback format="html"><text></text></feedback></answer><answer fraction="0" format="html"><text><![CDATA[\(36\)]]></text><feedback format="html"><text></text></feedback></answer><answer fraction="0" format="html"><text><![CDATA[\(720\)]]></text><feedback format="html"><text></text></feedback></answer></question>
<question type="multichoice"><name><text>e3-02</text></name><questiontext format="html"><text><![CDATA[Dans l'algorithme d'Euclide appliqué à \(a\) et \(b\), le PGCD de \(a\) et \(b\) est :]]></text></questiontext><generalfeedback format="html"><text><![CDATA[À chaque étape, \(\operatorname{PGCD}(a\,;b)=\operatorname{PGCD}(b\,;r)\) ; la dernière ligne a un reste nul et le PGCD est le dernier reste non nul.]]></text></generalfeedback><defaultgrade>1</defaultgrade><penalty>0</penalty><hidden>0</hidden><single>true</single><shuffleanswers>true</shuffleanswers><answernumbering>abc</answernumbering><answer fraction="100" format="html"><text><![CDATA[le dernier reste non nul]]></text><feedback format="html"><text></text></feedback></answer><answer fraction="0" format="html"><text><![CDATA[le premier reste]]></text><feedback format="html"><text></text></feedback></answer><answer fraction="0" format="html"><text><![CDATA[le dernier quotient]]></text><feedback format="html"><text></text></feedback></answer><answer fraction="0" format="html"><text><![CDATA[le premier quotient]]></text><feedback format="html"><text></text></feedback></answer></question>
<question type="multichoice"><name><text>e3-03</text></name><questiontext format="html"><text><![CDATA[Si \(a=bq+r\) est la division euclidienne de \(a\) par \(b\), alors \(\operatorname{PGCD}(a\,;b)\) est égal à :]]></text></questiontext><generalfeedback format="html"><text><![CDATA[Les diviseurs communs de \(a\) et \(b\) sont exactement ceux de \(b\) et \(r=a-bq\).]]></text></generalfeedback><defaultgrade>1</defaultgrade><penalty>0</penalty><hidden>0</hidden><single>true</single><shuffleanswers>true</shuffleanswers><answernumbering>abc</answernumbering><answer fraction="100" format="html"><text><![CDATA[\(\operatorname{PGCD}(b\,;r)\)]]></text><feedback format="html"><text></text></feedback></answer><answer fraction="0" format="html"><text><![CDATA[\(\operatorname{PGCD}(q\,;r)\)]]></text><feedback format="html"><text></text></feedback></answer><answer fraction="0" format="html"><text><![CDATA[\(\operatorname{PGCD}(a\,;q)\)]]></text><feedback format="html"><text></text></feedback></answer><answer fraction="0" format="html"><text><![CDATA[\(r\)]]></text><feedback format="html"><text></text></feedback></answer></question>
<question type="multichoice"><name><text>e3-04</text></name><questiontext format="html"><text><![CDATA[Deux entiers consécutifs \(n\) et \(n+1\) sont toujours :]]></text></questiontext><generalfeedback format="html"><text><![CDATA[\((n+1)\times1+n\times(-1)=1\) : d'après le théorème de Bézout, ils sont premiers entre eux.]]></text></generalfeedback><defaultgrade>1</defaultgrade><penalty>0</penalty><hidden>0</hidden><single>true</single><shuffleanswers>true</shuffleanswers><answernumbering>abc</answernumbering><answer fraction="100" format="html"><text><![CDATA[premiers entre eux]]></text><feedback format="html"><text></text></feedback></answer><answer fraction="0" format="html"><text><![CDATA[des nombres premiers]]></text><feedback format="html"><text></text></feedback></answer><answer fraction="0" format="html"><text><![CDATA[de PGCD égal à \(2\)]]></text><feedback format="html"><text></text></feedback></answer><answer fraction="0" format="html"><text><![CDATA[de PGCD égal à \(n\)]]></text><feedback format="html"><text></text></feedback></answer></question>
<question type="multichoice"><name><text>e3-05</text></name><questiontext format="html"><text><![CDATA[Un couple d'entiers \((u\,;v)\) tel que \(7u+5v=1\) est :]]></text></questiontext><generalfeedback format="html"><text><![CDATA[\(7\times(-2)+5\times3=-14+15=1\). Les autres couples donnent \(-1\), \(2\) et \(11\).]]></text></generalfeedback><defaultgrade>1</defaultgrade><penalty>0</penalty><hidden>0</hidden><single>true</single><shuffleanswers>true</shuffleanswers><answernumbering>abc</answernumbering><answer fraction="100" format="html"><text><![CDATA[\((-2\,;3)\)]]></text><feedback format="html"><text></text></feedback></answer><answer fraction="0" format="html"><text><![CDATA[\((2\,;-3)\)]]></text><feedback format="html"><text></text></feedback></answer><answer fraction="0" format="html"><text><![CDATA[\((1\,;-1)\)]]></text><feedback format="html"><text></text></feedback></answer><answer fraction="0" format="html"><text><![CDATA[\((3\,;-2)\)]]></text><feedback format="html"><text></text></feedback></answer></question>
<question type="multichoice"><name><text>e3-06</text></name><questiontext format="html"><text><![CDATA[L'équation \(9x+6y=12\) admet des solutions entières car :]]></text></questiontext><generalfeedback format="html"><text><![CDATA[L'équation \(ax+by=c\) a des solutions entières si et seulement si \(\operatorname{PGCD}(a\,;b)\) divise \(c\).]]></text></generalfeedback><defaultgrade>1</defaultgrade><penalty>0</penalty><hidden>0</hidden><single>true</single><shuffleanswers>true</shuffleanswers><answernumbering>abc</answernumbering><answer fraction="100" format="html"><text><![CDATA[\(\operatorname{PGCD}(9\,;6)=3\) divise \(12\)]]></text><feedback format="html"><text></text></feedback></answer><answer fraction="0" format="html"><text><![CDATA[\(9\) et \(6\) sont premiers entre eux]]></text><feedback format="html"><text></text></feedback></answer><answer fraction="0" format="html"><text><![CDATA[\(12\) est pair]]></text><feedback format="html"><text></text></feedback></answer><answer fraction="0" format="html"><text><![CDATA[\(9+6\) est supérieur à \(12\)]]></text><feedback format="html"><text></text></feedback></answer></question>
<question type="multichoice"><name><text>e3-07</text></name><questiontext format="html"><text><![CDATA[Si \(5\) divise \(3n\), alors :]]></text></questiontext><generalfeedback format="html"><text><![CDATA[\(\operatorname{PGCD}(5\,;3)=1\) : d'après le théorème de Gauss, \(5\) divise \(n\).]]></text></generalfeedback><defaultgrade>1</defaultgrade><penalty>0</penalty><hidden>0</hidden><single>true</single><shuffleanswers>true</shuffleanswers><answernumbering>abc</answernumbering><answer fraction="100" format="html"><text><![CDATA[\(5\) divise \(n\)]]></text><feedback format="html"><text></text></feedback></answer><answer fraction="0" format="html"><text><![CDATA[\(3\) divise \(n\)]]></text><feedback format="html"><text></text></feedback></answer><answer fraction="0" format="html"><text><![CDATA[\(15\) divise \(n\)]]></text><feedback format="html"><text></text></feedback></answer><answer fraction="0" format="html"><text><![CDATA[\(n=5\)]]></text><feedback format="html"><text></text></feedback></answer></question>
<question type="multichoice"><name><text>e3-08</text></name><questiontext format="html"><text><![CDATA[Si \(6\) divise \(4n\), alors on peut affirmer que :]]></text></questiontext><generalfeedback format="html"><text><![CDATA[\(6\mid4n\) donne \(3\mid2n\), et \(3\) est premier avec \(2\) : \(3\mid n\) (Gauss). Pour \(n=3\), \(4n=12\) est divisible par \(6\) alors que \(6\nmid3\) et \(2\nmid3\).]]></text></generalfeedback><defaultgrade>1</defaultgrade><penalty>0</penalty><hidden>0</hidden><single>true</single><shuffleanswers>true</shuffleanswers><answernumbering>abc</answernumbering><answer fraction="100" format="html"><text><![CDATA[\(3\) divise \(n\)]]></text><feedback format="html"><text></text></feedback></answer><answer fraction="0" format="html"><text><![CDATA[\(6\) divise \(n\)]]></text><feedback format="html"><text></text></feedback></answer><answer fraction="0" format="html"><text><![CDATA[\(2\) divise \(n\)]]></text><feedback format="html"><text></text></feedback></answer><answer fraction="0" format="html"><text><![CDATA[\(4\) divise \(n\)]]></text><feedback format="html"><text></text></feedback></answer></question>
<question type="multichoice"><name><text>e3-09</text></name><questiontext format="html"><text><![CDATA[Si \(4\) et \(9\) divisent l'entier \(N\), alors :]]></text></questiontext><generalfeedback format="html"><text><![CDATA[\(4\) et \(9\) sont premiers entre eux : leur produit divise \(N\) (corollaire du théorème de Gauss).]]></text></generalfeedback><defaultgrade>1</defaultgrade><penalty>0</penalty><hidden>0</hidden><single>true</single><shuffleanswers>true</shuffleanswers><answernumbering>abc</answernumbering><answer fraction="100" format="html"><text><![CDATA[\(36\) divise \(N\)]]></text><feedback format="html"><text></text></feedback></answer><answer fraction="0" format="html"><text><![CDATA[\(13\) divise \(N\)]]></text><feedback format="html"><text></text></feedback></answer><answer fraction="0" format="html"><text><![CDATA[\(N=36\)]]></text><feedback format="html"><text></text></feedback></answer><answer fraction="0" format="html"><text><![CDATA[on ne peut rien dire de plus]]></text><feedback format="html"><text></text></feedback></answer></question>
<question type="multichoice"><name><text>e3-10</text></name><questiontext format="html"><text><![CDATA[Les solutions dans \(\mathbb Z^2\) de l'équation \(3x=5y\) sont les couples :]]></text></questiontext><generalfeedback format="html"><text><![CDATA[\(5\mid3x\) et \(5\) est premier avec \(3\), donc \(x=5k\) ; alors \(15k=5y\) et \(y=3k\).]]></text></generalfeedback><defaultgrade>1</defaultgrade><penalty>0</penalty><hidden>0</hidden><single>true</single><shuffleanswers>true</shuffleanswers><answernumbering>abc</answernumbering><answer fraction="100" format="html"><text><![CDATA[\((5k\,;3k)\), \(k\in\mathbb Z\)]]></text><feedback format="html"><text></text></feedback></answer><answer fraction="0" format="html"><text><![CDATA[\((3k\,;5k)\), \(k\in\mathbb Z\)]]></text><feedback format="html"><text></text></feedback></answer><answer fraction="0" format="html"><text><![CDATA[\((5\,;3)\) uniquement]]></text><feedback format="html"><text></text></feedback></answer><answer fraction="0" format="html"><text><![CDATA[\((0\,;0)\) uniquement]]></text><feedback format="html"><text></text></feedback></answer></question>
<question type="multichoice"><name><text>e3-11</text></name><questiontext format="html"><text><![CDATA[Pour un entier naturel non nul \(n\), \(\operatorname{PGCD}(n\,;n+2)\) peut valoir :]]></text></questiontext><generalfeedback format="html"><text><![CDATA[Le PGCD divise \((n+2)-n=2\) : il vaut \(1\) si \(n\) est impair, \(2\) si \(n\) est pair.]]></text></generalfeedback><defaultgrade>1</defaultgrade><penalty>0</penalty><hidden>0</hidden><single>true</single><shuffleanswers>true</shuffleanswers><answernumbering>abc</answernumbering><answer fraction="100" format="html"><text><![CDATA[\(1\) ou \(2\)]]></text><feedback format="html"><text></text></feedback></answer><answer fraction="0" format="html"><text><![CDATA[\(1\) seulement]]></text><feedback format="html"><text></text></feedback></answer><answer fraction="0" format="html"><text><![CDATA[\(2\) seulement]]></text><feedback format="html"><text></text></feedback></answer><answer fraction="0" format="html"><text><![CDATA[\(n\)]]></text><feedback format="html"><text></text></feedback></answer></question>
<question type="multichoice"><name><text>e3-12</text></name><questiontext format="html"><text><![CDATA[La forme irréductible de la fraction \(\dfrac{84}{126}\) est :]]></text></questiontext><generalfeedback format="html"><text><![CDATA[\(\operatorname{PGCD}(84\,;126)=42\) et l'on divise numérateur et dénominateur par \(42\).]]></text></generalfeedback><defaultgrade>1</defaultgrade><penalty>0</penalty><hidden>0</hidden><single>true</single><shuffleanswers>true</shuffleanswers><answernumbering>abc</answernumbering><answer fraction="100" format="html"><text><![CDATA[\(\dfrac23\)]]></text><feedback format="html"><text></text></feedback></answer><answer fraction="0" format="html"><text><![CDATA[\(\dfrac{14}{21}\)]]></text><feedback format="html"><text></text></feedback></answer><answer fraction="0" format="html"><text><![CDATA[\(\dfrac46\)]]></text><feedback format="html"><text></text></feedback></answer><answer fraction="0" format="html"><text><![CDATA[\(\dfrac{42}{63}\)]]></text><feedback format="html"><text></text></feedback></answer></question>
</quiz>
