{"id":2072,"date":"2026-04-06T11:32:00","date_gmt":"2026-04-06T09:32:00","guid":{"rendered":"https:\/\/labodemaths.fr\/WordPress3\/?p=2072"},"modified":"2026-04-07T07:36:20","modified_gmt":"2026-04-07T05:36:20","slug":"python-2nde-algorithmes","status":"publish","type":"post","link":"https:\/\/labodemaths.fr\/WordPress3\/python-2nde-algorithmes\/","title":{"rendered":"Python, SNT, ALgorithmes"},"content":{"rendered":"\n<p>En informatique, un algorithme est un \u00ab\u00a0<em>ensemble de r\u00e8gles op\u00e9ratoires dont l&rsquo;application permet de r\u00e9soudre un probl\u00e8me \u00e9nonc\u00e9 au moyen d&rsquo;un nombre fini d&rsquo;op\u00e9rations. Un algorithme peut \u00eatre traduit, gr\u00e2ce \u00e0 un langage de programmation, en un programme ex\u00e9cutable par un ordinateur.<\/em>\u00a0\u00bb d&rsquo;apr\u00e8s la d\u00e9finition du Larousse.<\/p>\n\n\n\n<h3>Algorithme 1 : D\u00e9terminer si un nombre entier est premier.<\/h3>\n\n\n\n<p>On peut pr\u00e9senter un algorithme sous la forme d&rsquo;un sch\u00e9ma :<\/p>\n\n\n\n<figure class=\"wp-block-image size-large\"><a href=\"https:\/\/labodemaths.fr\/WordPress3\/wp-content\/uploads\/2022\/12\/Algorithme_est_il_premier-1.png\"><img loading=\"lazy\" width=\"724\" height=\"1024\" src=\"https:\/\/labodemaths.fr\/WordPress3\/wp-content\/uploads\/2022\/12\/Algorithme_est_il_premier-1-724x1024.png\" alt=\"\" class=\"wp-image-2073\" srcset=\"https:\/\/labodemaths.fr\/WordPress3\/wp-content\/uploads\/2022\/12\/Algorithme_est_il_premier-1-724x1024.png 724w, https:\/\/labodemaths.fr\/WordPress3\/wp-content\/uploads\/2022\/12\/Algorithme_est_il_premier-1-212x300.png 212w, https:\/\/labodemaths.fr\/WordPress3\/wp-content\/uploads\/2022\/12\/Algorithme_est_il_premier-1-768x1086.png 768w, https:\/\/labodemaths.fr\/WordPress3\/wp-content\/uploads\/2022\/12\/Algorithme_est_il_premier-1-1086x1536.png 1086w, https:\/\/labodemaths.fr\/WordPress3\/wp-content\/uploads\/2022\/12\/Algorithme_est_il_premier-1-1448x2048.png 1448w, https:\/\/labodemaths.fr\/WordPress3\/wp-content\/uploads\/2022\/12\/Algorithme_est_il_premier-1.png 1654w\" sizes=\"(max-width: 724px) 100vw, 724px\" \/><\/a><\/figure>\n\n\n\n<p>Ou sous la forme d&rsquo;une phrase :<br>\u00ab\u00a0Pour savoir si un nombre entier n diff\u00e9rent de 1 est premier, on teste tous les diviseurs entiers compris entre 2 et n-1. Si on trouve un diviseur, le nombre n&rsquo;est pas premier sinon il l&rsquo;est\u00a0\u00bb<\/p>\n\n\n\n<p>On d\u00e9sire cr\u00e9er un programme Python permettant de d\u00e9terminer si un nombre est premier.<\/p>\n\n\n\n<p>On peut proposer en premi\u00e8re approche :<\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>def est_premier(nombre):\n   <\/code><\/pre>\n\n\n\n<h3>Application 1:<\/h3>\n\n\n\n<p>Un&nbsp;<strong>nombre de Fermat<\/strong>&nbsp;est un&nbsp;<a href=\"https:\/\/fr.wikipedia.org\/wiki\/Nombre\">nombre<\/a>&nbsp;qui peut s&rsquo;\u00e9crire sous la forme 2<sup>2<em>n<\/em><\/sup>&nbsp;+ 1, avec&nbsp;<em>n<\/em>&nbsp;<a href=\"https:\/\/fr.wikipedia.org\/wiki\/Entier_naturel\">entier naturel<\/a>. Le&nbsp;<em>n<\/em>-i\u00e8me nombre de Fermat, 2<sup>2<em>n<\/em><\/sup>&nbsp;+ 1, est not\u00e9&nbsp;<em>F<sub>n<\/sub><\/em>.<\/p>\n\n\n\n<p>Ces nombres doivent leur nom \u00e0&nbsp;<a href=\"https:\/\/fr.wikipedia.org\/wiki\/Pierre_de_Fermat\">Pierre de Fermat<\/a>, qui \u00e9mit la&nbsp;<a href=\"https:\/\/fr.wikipedia.org\/wiki\/Conjecture\">conjecture<\/a>&nbsp;que tous ces nombres \u00e9taient&nbsp;<a href=\"https:\/\/fr.wikipedia.org\/wiki\/Nombre_premier\">premiers<\/a>.&nbsp;<\/p>\n\n\n\n<p>Les nombres <meta charset=\"utf-8\"><em>F<\/em>5, <meta charset=\"utf-8\"><em>F<\/em>6 et <meta charset=\"utf-8\"><em>F<\/em>7 sont-ils premiers ?<br>Peut-on am\u00e9liorer son programme pour le rendre plus rapide ?<\/p>\n\n\n\n<p><\/p>\n\n\n\n<p><\/p>\n","protected":false},"excerpt":{"rendered":"<p>En informatique, un algorithme est un \u00ab\u00a0ensemble de r\u00e8gles op\u00e9ratoires dont l&rsquo;application permet de r\u00e9soudre&#8230;<\/p>\n<div class=\"more-link-wrapper\"><a class=\"more-link\" href=\"https:\/\/labodemaths.fr\/WordPress3\/python-2nde-algorithmes\/\">Read the post<span class=\"screen-reader-text\">Python, SNT, ALgorithmes<\/span><\/a><\/div>\n","protected":false},"author":2,"featured_media":2073,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[56],"tags":[],"_links":{"self":[{"href":"https:\/\/labodemaths.fr\/WordPress3\/wp-json\/wp\/v2\/posts\/2072"}],"collection":[{"href":"https:\/\/labodemaths.fr\/WordPress3\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/labodemaths.fr\/WordPress3\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/labodemaths.fr\/WordPress3\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/labodemaths.fr\/WordPress3\/wp-json\/wp\/v2\/comments?post=2072"}],"version-history":[{"count":4,"href":"https:\/\/labodemaths.fr\/WordPress3\/wp-json\/wp\/v2\/posts\/2072\/revisions"}],"predecessor-version":[{"id":3127,"href":"https:\/\/labodemaths.fr\/WordPress3\/wp-json\/wp\/v2\/posts\/2072\/revisions\/3127"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/labodemaths.fr\/WordPress3\/wp-json\/wp\/v2\/media\/2073"}],"wp:attachment":[{"href":"https:\/\/labodemaths.fr\/WordPress3\/wp-json\/wp\/v2\/media?parent=2072"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/labodemaths.fr\/WordPress3\/wp-json\/wp\/v2\/categories?post=2072"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/labodemaths.fr\/WordPress3\/wp-json\/wp\/v2\/tags?post=2072"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}