Quiz — Arithmétique 2 BAC SMelhajjaji.pdf

Question 1 sur 10 20:00

[{"id":12918,"question":"Quel est le PGCD de 56 et 98 ?","option_a":"14","option_b":"28","option_c":"7","option_d":"42","option_e":"","option_f":"","bonne_reponse":"a","explication":"Le PGCD de 56 et 98 est 14, obtenu en appliquant l’algorithme d’Euclide : 98 = 56×1 + 42 ; 56 = 42×1 + 14 ; 42 = 14×3 + 0.","points":1,"type":"qcm","actif":1,"section_id":null,"ordre":0,"_debug_answer_data_type":"string","_debug_answer_data_preview":"{\"correct\": \"a\", \"options\": {\"a\": \"14\", \"b\": \"28\", \"c\": \"7\", \"d\": \"42\"}}","_debug_options_count":4},{"id":12919,"question":"Le théorème de Gauss 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 Gauss s’applique à tous les entiers non nuls, pas seulement aux nombres premiers. Il stipule que si a divise bc et que a est premier avec b, alors a divise c.","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":12920,"question":"Quelle est la solution générale de l’équation 3x ≡ 2 [5] ?","option_a":"x ≡ 4 [5]","option_b":"x ≡ 1 [5]","option_c":"x ≡ 3 [5]","option_d":"x ≡ 2 [5]","option_e":"","option_f":"","bonne_reponse":"a","explication":"L’équation 3x ≡ 2 [5] a pour solution x ≡ 4 [5], car 3×4 = 12 ≡ 2 [5]. On trouve x en multipliant les deux côtés par l’inverse de 3 modulo 5, qui est 2 (car 3×2=6≡1[5]).","points":1,"type":"qcm","actif":1,"section_id":null,"ordre":0,"_debug_answer_data_type":"string","_debug_answer_data_preview":"{\"correct\": \"a\", \"options\": {\"a\": \"x ≡ 4 [5]\", \"b\": \"x ≡ 1 [5]\", \"c\": \"x ≡ 3 [5]\", \"d\": \"x ≡","_debug_options_count":4},{"id":12921,"question":"Si a et b sont deux entiers tels que a = 15 et b = 25, alors PGCD(a, b) × PPCM(a, b) = ?","option_a":"375","option_b":"125","option_c":"250","option_d":"50","option_e":"","option_f":"","bonne_reponse":"a","explication":"Pour deux entiers a et b, on a toujours PGCD(a, b) × PPCM(a, b) = a × b. Ici, 15 × 25 = 375.","points":1,"type":"qcm","actif":1,"section_id":null,"ordre":0,"_debug_answer_data_type":"string","_debug_answer_data_preview":"{\"correct\": \"a\", \"options\": {\"a\": \"375\", \"b\": \"125\", \"c\": \"250\", \"d\": \"50\"}}","_debug_options_count":4},{"id":12922,"question":"L’équation 6x + 9y = 3 admet-elle des solutions entières ?","option_a":"Vrai","option_b":"Faux","option_c":"","option_d":"","option_e":"","option_f":"","bonne_reponse":"a","explication":"Oui, car le PGCD de 6 et 9 est 3, qui divise 3. Les solutions entières existent et peuvent être trouvées en utilisant le théorème de Bézout.","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":12923,"question":"Quel est l’inverse de 7 modulo 11 ?","option_a":"8","option_b":"3","option_c":"5","option_d":"9","option_e":"","option_f":"","bonne_reponse":"a","explication":"L’inverse de 7 modulo 11 est 8, car 7×8 = 56 ≡ 1 [11]. On peut le trouver en testant les valeurs ou en utilisant l’algorithme d’Euclide étendu.","points":1,"type":"qcm","actif":1,"section_id":null,"ordre":0,"_debug_answer_data_type":"string","_debug_answer_data_preview":"{\"correct\": \"a\", \"options\": {\"a\": \"8\", \"b\": \"3\", \"c\": \"5\", \"d\": \"9\"}}","_debug_options_count":4},{"id":12924,"question":"Si a ≡ 3 [7] et b ≡ 5 [7], alors a + b ≡ ? [7]","option_a":"1","option_b":"8","option_c":"1 mod 7","option_d":"2","option_e":"","option_f":"","bonne_reponse":"c","explication":"a + b ≡ 3 + 5 ≡ 8 ≡ 1 [7], car 8 - 7 = 1. Les congruences s’additionnent terme à terme.","points":1,"type":"qcm","actif":1,"section_id":null,"ordre":0,"_debug_answer_data_type":"string","_debug_answer_data_preview":"{\"correct\": \"c\", \"options\": {\"a\": \"1\", \"b\": \"8\", \"c\": \"1 mod 7\", \"d\": \"2\"}}","_debug_options_count":4},{"id":12925,"question":"Le nombre 123456789 est-il divisible par 9 ?","option_a":"Vrai","option_b":"Faux","option_c":"","option_d":"","option_e":"","option_f":"","bonne_reponse":"a","explication":"Vrai, car la somme des chiffres de 123456789 est 45, qui est divisible par 9 (4+5=9). Un nombre est divisible par 9 si la somme de ses chiffres l’est.","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":12926,"question":"Quelle est la solution générale de l’équation diophantienne 4x + 6y = 8 ?","option_a":"x = 2 - 3k, y = 0 + 2k","option_b":"x = 1 - 3k, y = 1 + 2k","option_c":"x = 2 + 3k, y = 0 - 2k","option_d":"x = 1 + 3k, y = 1 - 2k","option_e":"","option_f":"","bonne_reponse":"a","explication":"La solution générale est x = 2 - 3k et y = 0 + 2k, car on simplifie d’abord l’équation en divisant par 2 : 2x + 3y = 4. Une solution particulière est (2, 0), et on utilise le théorème de Bézout pour trouver la solution générale.","points":1,"type":"qcm","actif":1,"section_id":null,"ordre":0,"_debug_answer_data_type":"string","_debug_answer_data_preview":"{\"correct\": \"a\", \"options\": {\"a\": \"x = 2 - 3k, y = 0 + 2k\", \"b\": \"x = 1 - 3k, y = 1 + 2k\", \"c\": \"x =","_debug_options_count":4},{"id":12927,"question":"Si a ≡ 2 [5] et b ≡ 3 [5], alors ab ≡ ? [5]","option_a":"1","option_b":"6","option_c":"1 mod 5","option_d":"4","option_e":"","option_f":"","bonne_reponse":"d","explication":"ab ≡ 2×3 ≡ 6 ≡ 1 [5], car 6 - 5 = 1. Les congruences se multiplient terme à terme.","points":1,"type":"qcm","actif":1,"section_id":null,"ordre":0,"_debug_answer_data_type":"string","_debug_answer_data_preview":"{\"correct\": \"d\", \"options\": {\"a\": \"1\", \"b\": \"6\", \"c\": \"1 mod 5\", \"d\": \"4\"}}","_debug_options_count":4}]