Quiz : Testez vos connaissances en arithmétique (3ème année secondaire)

Question 1 sur 10 10:00

[{"id":14478,"question":"Quel est le PGCD de 48 et 18 ?","option_a":"6","option_b":"12","option_c":"18","option_d":"24","option_e":"","option_f":"","bonne_reponse":"A","explication":"En utilisant l'algorithme d'Euclide : 48 = 2×18 + 12 ; 18 = 1×12 + 6 ; 12 = 2×6 + 0. Le dernier reste non nul est 6, donc PGCD(48, 18) = 6.","points":1,"type":"qcm","actif":1,"section_id":null,"ordre":0},{"id":14479,"question":"Un nombre premier est toujours impair.","option_a":"Vrai","option_b":"Faux","option_c":"","option_d":"","option_e":"","option_f":"","bonne_reponse":"B","explication":"Le nombre 2 est un nombre premier et il est pair. Donc l'affirmation est fausse.","points":1,"type":"qcm","actif":1,"section_id":null,"ordre":0},{"id":14480,"question":"Quelle est la décomposition en facteurs premiers de 60 ?","option_a":"2² × 3 × 5","option_b":"2 × 3² × 5","option_c":"2 × 3 × 5²","option_d":"2³ × 3 × 5","option_e":"","option_f":"","bonne_reponse":"A","explication":"60 = 2 × 30 = 2 × 2 × 15 = 2 × 2 × 3 × 5 = 2² × 3 × 5.","points":1,"type":"qcm","actif":1,"section_id":null,"ordre":0},{"id":14481,"question":"Si a ≡ b (mod m), alors m divise (a - b).","option_a":"Vrai","option_b":"Faux","option_c":"","option_d":"","option_e":"","option_f":"","bonne_reponse":"A","explication":"Par définition, a ≡ b (mod m) signifie que m divise (a - b). Donc l'affirmation est vraie.","points":1,"type":"qcm","actif":1,"section_id":null,"ordre":0},{"id":14482,"question":"Quel est le PPCM de 8 et 12 ?","option_a":"24","option_b":"48","option_c":"36","option_d":"16","option_e":"","option_f":"","bonne_reponse":"A","explication":"PPCM(8, 12) = (8 × 12) \/ PGCD(8, 12) = 96 \/ 4 = 24.","points":1,"type":"qcm","actif":1,"section_id":null,"ordre":0},{"id":14483,"question":"Le nombre 1 est considéré comme un nombre premier.","option_a":"Vrai","option_b":"Faux","option_c":"","option_d":"","option_e":"","option_f":"","bonne_reponse":"B","explication":"Par définition, un nombre premier doit avoir exactement deux diviseurs distincts : 1 et lui-même. Le nombre 1 n'a qu'un seul diviseur, donc il n'est pas premier.","points":1,"type":"qcm","actif":1,"section_id":null,"ordre":0},{"id":14484,"question":"Quelle est la solution de l'équation 7x + 5y = 1 ?","option_a":"x = -2, y = 3","option_b":"x = 2, y = -3","option_c":"x = 3, y = -4","option_d":"x = -3, y = 4","option_e":"","option_f":"","bonne_reponse":"A","explication":"En utilisant l'algorithme d'Euclide étendu : PGCD(7, 5) = 1 = 7×(-2) + 5×3, donc une solution est x = -2 et y = 3.","points":1,"type":"qcm","actif":1,"section_id":null,"ordre":0},{"id":14485,"question":"Si un nombre est divisible par 4 et par 6, alors il est divisible par 24.","option_a":"Vrai","option_b":"Faux","option_c":"","option_d":"","option_e":"","option_f":"","bonne_reponse":"B","explication":"Un nombre divisible par 4 et 6 doit être divisible par le PPCM(4, 6) = 12, mais pas nécessairement par 24. Par exemple, 12 est divisible par 4 et 6 mais pas par 24.","points":1,"type":"qcm","actif":1,"section_id":null,"ordre":0},{"id":14486,"question":"Quel est le reste de la division de 1234 par 7 ?","option_a":"2","option_b":"3","option_c":"4","option_d":"5","option_e":"","option_f":"","bonne_reponse":"C","explication":"1234 ÷ 7 = 176 avec un reste de 2, car 7 × 176 = 1232 et 1234 - 1232 = 2.","points":1,"type":"qcm","actif":1,"section_id":null,"ordre":0},{"id":14487,"question":"Le théorème de Bézout s'applique uniquement aux nombres premiers.","option_a":"Vrai","option_b":"Faux","option_c":"","option_d":"","option_e":"","option_f":"","bonne_reponse":"B","explication":"Le théorème de Bézout s'applique à tous les entiers, pas seulement aux nombres premiers. Il énonce que pour deux entiers a et b, il existe des entiers x et y tels que ax + by = PGCD(a, b).","points":1,"type":"qcm","actif":1,"section_id":null,"ordre":0}]