Quiz — 1613454985_89991_Exercice10 _ PPCM(Python)_ok.pdf

Question 1 sur 10 20:00

[{"id":109981,"question":"Quel est le PPCM de 12 et 18 ?","option_a":"24","option_b":"36","option_c":"48","option_d":"60","option_e":"","option_f":"","bonne_reponse":"b","explication":"Le PPCM de 12 et 18 est 36, car c'est le plus petit nombre divisible par les deux.","points":1,"type":"qcm","actif":1,"section_id":null,"ordre":0,"_debug_answer_data_type":"string","_debug_answer_data_preview":"{\"correct\": \"b\", \"options\": {\"a\": \"24\", \"b\": \"36\", \"c\": \"48\", \"d\": \"60\"}}","_debug_options_count":4},{"id":109982,"question":"La fonction Python pour calculer le PPCM est-elle intégrée dans la bibliothèque standard ?","option_a":"Vrai","option_b":"Faux","option_c":"","option_d":"","option_e":"","option_f":"","bonne_reponse":"b","explication":"Non, il faut la définir manuellement ou utiliser des bibliothèques comme math.gcd (pour Python 3.9+).","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":109983,"question":"Quel algorithme est couramment utilisé pour calculer le PPCM de deux nombres ?","option_a":"Algorithme de Dijkstra","option_b":"Algorithme d'Euclide","option_c":"Algorithme de tri rapide","option_d":"Algorithme de Fibonacci","option_e":"","option_f":"","bonne_reponse":"b","explication":"L'algorithme d'Euclide est utilisé pour calculer le PGCD, puis on en déduit le PPCM avec la formule : PPCM(a, b) = (a * b) \/ PGCD(a, b).","points":1,"type":"qcm","actif":1,"section_id":null,"ordre":0,"_debug_answer_data_type":"string","_debug_answer_data_preview":"{\"correct\": \"b\", \"options\": {\"a\": \"Algorithme de Dijkstra\", \"b\": \"Algorithme d'Euclide\", \"c\": \"Algor","_debug_options_count":4},{"id":109984,"question":"Peut-on calculer le PPCM de trois nombres en utilisant une seule fonction ?","option_a":"Vrai","option_b":"Faux","option_c":"","option_d":"","option_e":"","option_f":"","bonne_reponse":"a","explication":"Oui, en utilisant une fonction récursive ou en appelant plusieurs fois la fonction de calcul du PPCM pour deux nombres.","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":109985,"question":"Quel est le PPCM de 5 et 7 ?","option_a":"12","option_b":"25","option_c":"35","option_d":"42","option_e":"","option_f":"","bonne_reponse":"c","explication":"Le PPCM de 5 et 7 est 35, car ce sont des nombres premiers entre eux.","points":1,"type":"qcm","actif":1,"section_id":null,"ordre":0,"_debug_answer_data_type":"string","_debug_answer_data_preview":"{\"correct\": \"c\", \"options\": {\"a\": \"12\", \"b\": \"25\", \"c\": \"35\", \"d\": \"42\"}}","_debug_options_count":4},{"id":109986,"question":"La formule PPCM(a, b) = (a * b) \/ PGCD(a, b) est-elle toujours valable ?","option_a":"Vrai","option_b":"Faux","option_c":"","option_d":"","option_e":"","option_f":"","bonne_reponse":"a","explication":"Oui, cette formule est valable pour tous les entiers positifs a et b.","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":109987,"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 c'est le plus petit nombre divisible par les deux.","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":109988,"question":"Peut-on utiliser une boucle 'for' pour calculer le PPCM de deux nombres en Python ?","option_a":"Vrai","option_b":"Faux","option_c":"","option_d":"","option_e":"","option_f":"","bonne_reponse":"a","explication":"Oui, une boucle 'for' peut être utilisée pour tester les multiples successifs jusqu'à trouver le PPCM.","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":109989,"question":"Quel est le PPCM de 9 et 15 ?","option_a":"30","option_b":"45","option_c":"60","option_d":"75","option_e":"","option_f":"","bonne_reponse":"b","explication":"Le PPCM de 9 et 15 est 45, car c'est le plus petit nombre divisible par les deux.","points":1,"type":"qcm","actif":1,"section_id":null,"ordre":0,"_debug_answer_data_type":"string","_debug_answer_data_preview":"{\"correct\": \"b\", \"options\": {\"a\": \"30\", \"b\": \"45\", \"c\": \"60\", \"d\": \"75\"}}","_debug_options_count":4},{"id":109990,"question":"La fonction Python pour calculer le PPCM doit-elle toujours retourner un entier ?","option_a":"Vrai","option_b":"Faux","option_c":"","option_d":"","option_e":"","option_f":"","bonne_reponse":"a","explication":"Oui, le PPCM est toujours un entier positif.","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}]