Quiz — Réesumé Arithmétiques.pdf

Question 1 sur 10 20:00

[{"id":7345,"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":"Le PGCD de 48 et 18 est 6, car 6 est le plus grand nombre qui divise à la fois 48 et 18.","points":1,"type":"qcm","actif":1,"section_id":null,"ordre":0,"_debug_answer_data_type":"string","_debug_answer_data_preview":"{\"correct\": \"a\", \"options\": {\"a\": \"6\", \"b\": \"12\", \"c\": \"18\", \"d\": \"24\"}}","_debug_options_count":4},{"id":7346,"question":"Un nombre premier est un nombre qui n'a que deux diviseurs : 1 et lui-même.","option_a":"Vrai","option_b":"Faux","option_c":"","option_d":"","option_e":"","option_f":"","bonne_reponse":"a","explication":"C'est exact : un nombre premier est un nombre naturel supérieur à 1 qui n'a pas d'autres diviseurs que 1 et lui-même.","points":1,"type":"qcm","actif":1,"section_id":null,"ordre":0,"_debug_answer_data_type":"string","_debug_answer_data_preview":"{\"correct\": \"a\", \"options\": {\"a\": \"Vrai\", \"b\": \"Faux\", \"c\": \"\", \"d\": \"\"}}","_debug_options_count":4},{"id":7347,"question":"Quel est le PPCM de 5 et 7 ?","option_a":"25","option_b":"35","option_c":"40","option_d":"50","option_e":"","option_f":"","bonne_reponse":"b","explication":"Le PPCM de 5 et 7 est 35, car 35 est le plus petit multiple commun à ces deux nombres.","points":1,"type":"qcm","actif":1,"section_id":null,"ordre":0,"_debug_answer_data_type":"string","_debug_answer_data_preview":"{\"correct\": \"b\", \"options\": {\"a\": \"25\", \"b\": \"35\", \"c\": \"40\", \"d\": \"50\"}}","_debug_options_count":4},{"id":7348,"question":"L'algorithme d'Euclide permet de calculer le PPCM.","option_a":"Vrai","option_b":"Faux","option_c":"","option_d":"","option_e":"","option_f":"","bonne_reponse":"b","explication":"Faux : l'algorithme d'Euclide est utilisé pour calculer le PGCD, pas le PPCM.","points":1,"type":"qcm","actif":1,"section_id":null,"ordre":0,"_debug_answer_data_type":"string","_debug_answer_data_preview":"{\"correct\": \"b\", \"options\": {\"a\": \"Vrai\", \"b\": \"Faux\", \"c\": \"\", \"d\": \"\"}}","_debug_options_count":4},{"id":7349,"question":"La décomposition en facteurs premiers de 60 est :","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":"b","explication":"La décomposition correcte de 60 est 2² × 3 × 5, car 60 = 4 × 3 × 5.","points":1,"type":"qcm","actif":1,"section_id":null,"ordre":0,"_debug_answer_data_type":"string","_debug_answer_data_preview":"{\"correct\": \"b\", \"options\": {\"a\": \"2 × 3 × 5\", \"b\": \"2² × 3 × 5\", \"c\": \"2 × 3² × 5\", \"d\": \"2","_debug_options_count":4},{"id":7350,"question":"Si deux nombres sont premiers entre eux, leur PGCD est égal à 1.","option_a":"Vrai","option_b":"Faux","option_c":"","option_d":"","option_e":"","option_f":"","bonne_reponse":"a","explication":"C'est exact : deux nombres sont premiers entre eux si leur PGCD est 1.","points":1,"type":"qcm","actif":1,"section_id":null,"ordre":0,"_debug_answer_data_type":"string","_debug_answer_data_preview":"{\"correct\": \"a\", \"options\": {\"a\": \"Vrai\", \"b\": \"Faux\", \"c\": \"\", \"d\": \"\"}}","_debug_options_count":4},{"id":7351,"question":"Quel est le PGCD de 21 et 35 ?","option_a":"3","option_b":"5","option_c":"7","option_d":"10","option_e":"","option_f":"","bonne_reponse":"c","explication":"Le PGCD de 21 et 35 est 7, car 7 est le plus grand nombre qui divise à la fois 21 et 35.","points":1,"type":"qcm","actif":1,"section_id":null,"ordre":0,"_debug_answer_data_type":"string","_debug_answer_data_preview":"{\"correct\": \"c\", \"options\": {\"a\": \"3\", \"b\": \"5\", \"c\": \"7\", \"d\": \"10\"}}","_debug_options_count":4},{"id":7352,"question":"Le PPCM de deux nombres premiers distincts est toujours égal à leur produit.","option_a":"Vrai","option_b":"Faux","option_c":"","option_d":"","option_e":"","option_f":"","bonne_reponse":"a","explication":"C'est vrai : si deux nombres sont premiers entre eux, leur PPCM est égal à leur produit.","points":1,"type":"qcm","actif":1,"section_id":null,"ordre":0,"_debug_answer_data_type":"string","_debug_answer_data_preview":"{\"correct\": \"a\", \"options\": {\"a\": \"Vrai\", \"b\": \"Faux\", \"c\": \"\", \"d\": \"\"}}","_debug_options_count":4},{"id":7353,"question":"Quel est le PPCM de 8 et 12 ?","option_a":"16","option_b":"24","option_c":"36","option_d":"48","option_e":"","option_f":"","bonne_reponse":"b","explication":"Le PPCM de 8 et 12 est 24, car 24 est le plus petit multiple commun à ces deux nombres.","points":1,"type":"qcm","actif":1,"section_id":null,"ordre":0,"_debug_answer_data_type":"string","_debug_answer_data_preview":"{\"correct\": \"b\", \"options\": {\"a\": \"16\", \"b\": \"24\", \"c\": \"36\", \"d\": \"48\"}}","_debug_options_count":4},{"id":7354,"question":"L'algorithme d'Euclide repose sur des soustractions successives.","option_a":"Vrai","option_b":"Faux","option_c":"","option_d":"","option_e":"","option_f":"","bonne_reponse":"a","explication":"C'est vrai : l'algorithme d'Euclide utilise des divisions successives, mais peut aussi être présenté avec des soustractions.","points":1,"type":"qcm","actif":1,"section_id":null,"ordre":0,"_debug_answer_data_type":"string","_debug_answer_data_preview":"{\"correct\": \"a\", \"options\": {\"a\": \"Vrai\", \"b\": \"Faux\", \"c\": \"\", \"d\": \"\"}}","_debug_options_count":4}]