@prefix psr: <http://data.loterre.fr/ark:/67375/PSR> .
@prefix skos: <http://www.w3.org/2004/02/skos/core#> .

psr: a skos:ConceptScheme .
psr:-F7SFNL4R-1
  skos:prefLabel "algebraic number theory"@en, "théorie algébrique des nombres"@fr ;
  a skos:Concept ;
  skos:narrower psr:-XKLXMBVT-H .

psr:-XKLXMBVT-H
  skos:definition """En mathématiques, le <b>petit théorème de Fermat</b> est un résultat de l'arithmétique modulaire, qui peut aussi se démontrer avec les outils de l'arithmétique élémentaire.
         <br/>Il s'énonce comme suit&nbsp;: «&nbsp;si <span class="texhtml mvar" style="font-style:italic;">p</span> est un nombre premier et si <span class="texhtml mvar" style="font-style:italic;">a</span> est un entier <i>non divisible par <span class="texhtml mvar" style="font-style:italic;">p</span></i>, alors <span class="texhtml"><i>a</i><sup><i>p</i>–1</sup>&nbsp;–&nbsp;1</span> est un multiple de <span class="texhtml mvar" style="font-style:italic;">p</span>&nbsp;», autrement dit (sous les mêmes conditions sur <span class="texhtml mvar" style="font-style:italic;">a</span> et <span class="texhtml mvar" style="font-style:italic;">p</span>), <span class="texhtml"><i>a</i><sup><i>p</i>–1</sup></span> est congru à 1 modulo <span class="texhtml mvar" style="font-style:italic;">p</span>&nbsp;:
<br/>
<br/><center><span class="mwe-math-element"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\\\\displaystyle a^{p-1}\\\\equiv 1{\\mod {p}}}">
<br/>  <semantics>
<br/>    <mrow class="MJX-TeXAtom-ORD">
<br/>      <mstyle displaystyle="true" scriptlevel="0">
<br/>        <msup>
<br/>          <mi>a</mi>
<br/>          <mrow class="MJX-TeXAtom-ORD">
<br/>            <mi>p</mi>
<br/>            <mo>−<!-- − --></mo>
<br/>            <mn>1</mn>
<br/>          </mrow>
<br/>        </msup>
<br/>        <mo>≡<!-- ≡ --></mo>
<br/>        <mn>1</mn>
<br/>        <mrow class="MJX-TeXAtom-ORD">
<br/>          <mo lspace="thickmathspace" rspace="thickmathspace">mod</mo>
<br/>          <mrow class="MJX-TeXAtom-ORD">
<br/>            <mi>p</mi>
<br/>          </mrow>
<br/>        </mrow>
<br/>      </mstyle>
<br/>    </mrow>
<br/>    <annotation encoding="application/x-tex">{\\\\displaystyle a^{p-1}\\\\equiv 1{\\mod {p}}}</annotation>
<br/>  </semantics>
<br/></math></span><img src="https://wikimedia.org/api/rest_v1/media/math/render/svg/112bd3e75db3f8d394dc3b430bcf7cc32aa64e95" class="mwe-math-fallback-image-inline" aria-hidden="true" style="vertical-align: -0.671ex; width:15.501ex; height:3.009ex;" alt="{\\\\displaystyle a^{p-1}\\\\equiv 1{\\mod {p}}}"></span>.</center>
<br/>Un énoncé équivalent est&nbsp;: «&nbsp;si <span class="texhtml mvar" style="font-style:italic;">p</span> est un nombre premier et si <span class="texhtml mvar" style="font-style:italic;">a</span> est un entier <i>quelconque</i>, alors <span class="texhtml mvar" style="font-style:italic;">a<sup>p</sup>&nbsp;–&nbsp;a</span> est un multiple de <span class="texhtml mvar" style="font-style:italic;">p</span>&nbsp;»&nbsp;:
<br/>
<br/><center><span class="mwe-math-element"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\\\\displaystyle a^{p}\\\\equiv a{\\mod {p}}}">
<br/>  <semantics>
<br/>    <mrow class="MJX-TeXAtom-ORD">
<br/>      <mstyle displaystyle="true" scriptlevel="0">
<br/>        <msup>
<br/>          <mi>a</mi>
<br/>          <mrow class="MJX-TeXAtom-ORD">
<br/>            <mi>p</mi>
<br/>          </mrow>
<br/>        </msup>
<br/>        <mo>≡<!-- ≡ --></mo>
<br/>        <mi>a</mi>
<br/>        <mrow class="MJX-TeXAtom-ORD">
<br/>          <mo lspace="thickmathspace" rspace="thickmathspace">mod</mo>
<br/>          <mrow class="MJX-TeXAtom-ORD">
<br/>            <mi>p</mi>
<br/>          </mrow>
<br/>        </mrow>
<br/>      </mstyle>
<br/>    </mrow>
<br/>    <annotation encoding="application/x-tex">{\\\\displaystyle a^{p}\\\\equiv a{\\mod {p}}}</annotation>
<br/>  </semantics>
<br/></math></span><img src="https://wikimedia.org/api/rest_v1/media/math/render/svg/f778ab66d9ff1e3609ac03c6bc89ce48f6947fe1" class="mwe-math-fallback-image-inline" aria-hidden="true" style="vertical-align: -0.671ex; width:13.468ex; height:2.676ex;" alt="{\\\\displaystyle a^{p}\\\\equiv a{\\mod {p}}}"></span>.</center>
<br/>Il doit son nom à Pierre de Fermat, qui l'énonce pour la première fois en <time>1640</time>. 
<br/>(Wikipedia, L'Encylopédie Libre, <a href="https://fr.wikipedia.org/wiki/Petit_th%C3%A9or%C3%A8me_de_Fermat">https://fr.wikipedia.org/wiki/Petit_th%C3%A9or%C3%A8me_de_Fermat</a>)"""@fr, """<b>Fermat's little theorem</b> states that if <span class="texhtml mvar" style="font-style:italic;">p</span> is a prime number, then for any integer <span class="texhtml mvar" style="font-style:italic;">a</span>, the number <span class="texhtml"><i>a</i><sup><i>p</i></sup> − <i>a</i></span> is an integer multiple of <span class="texhtml mvar" style="font-style:italic;">p</span>. In the notation of modular arithmetic, this is expressed as
<br/>
<br/><dl><dd><span class="mwe-math-element"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\\\\displaystyle a^{p}\\\\equiv a{\\\\pmod {p}}.}">
<br/>  <semantics>
<br/>    <mrow class="MJX-TeXAtom-ORD">
<br/>      <mstyle displaystyle="true" scriptlevel="0">
<br/>        <msup>
<br/>          <mi>a</mi>
<br/>          <mrow class="MJX-TeXAtom-ORD">
<br/>            <mi>p</mi>
<br/>          </mrow>
<br/>        </msup>
<br/>        <mo>≡<!-- ≡ --></mo>
<br/>        <mi>a</mi>
<br/>        <mrow class="MJX-TeXAtom-ORD">
<br/>          <mspace width="1em"></mspace>
<br/>          <mo stretchy="false">(</mo>
<br/>          <mi>mod</mi>
<br/>          <mspace width="0.333em"></mspace>
<br/>          <mi>p</mi>
<br/>          <mo stretchy="false">)</mo>
<br/>        </mrow>
<br/>        <mo>.</mo>
<br/>      </mstyle>
<br/>    </mrow>
<br/>    <annotation encoding="application/x-tex">{\\\\displaystyle a^{p}\\\\equiv a{\\\\pmod {p}}.}</annotation>
<br/>  </semantics>
<br/></math></span><img src="https://wikimedia.org/api/rest_v1/media/math/render/svg/76fcf163a7523f30b84bf09165eba0092b0ee32e" class="mwe-math-fallback-image-inline" aria-hidden="true" style="vertical-align: -0.838ex; width:18.118ex; height:2.843ex;" alt="a^p \\\\equiv a \\\\pmod p."></span></dd></dl>
<br/>For example, if <span class="texhtml"><i>a</i> = 2</span> and <span class="texhtml"><i>p</i> = 7</span>, then <span class="texhtml">2<sup>7</sup> = 128</span>, and <span class="texhtml">128 − 2 = 126 = 7 × 18</span> is an integer multiple of <span class="texhtml">7</span>.
<br/>If <span class="texhtml mvar" style="font-style:italic;">a</span> is not divisible by <span class="texhtml mvar" style="font-style:italic;">p</span>; that is, if <span class="texhtml mvar" style="font-style:italic;">a</span> is coprime to <span class="texhtml mvar" style="font-style:italic;">p</span>, Fermat's little theorem is equivalent to the statement that <span class="texhtml"><i>a</i><sup><i>p</i> − 1</sup> − 1</span> is an integer multiple of <span class="texhtml mvar" style="font-style:italic;">p</span>, or in symbols:
<br/>
<br/><dl><dd><span class="mwe-math-element"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\\\\displaystyle a^{p-1}\\\\equiv 1{\\\\pmod {p}}.}">
<br/>  <semantics>
<br/>    <mrow class="MJX-TeXAtom-ORD">
<br/>      <mstyle displaystyle="true" scriptlevel="0">
<br/>        <msup>
<br/>          <mi>a</mi>
<br/>          <mrow class="MJX-TeXAtom-ORD">
<br/>            <mi>p</mi>
<br/>            <mo>−<!-- − --></mo>
<br/>            <mn>1</mn>
<br/>          </mrow>
<br/>        </msup>
<br/>        <mo>≡<!-- ≡ --></mo>
<br/>        <mn>1</mn>
<br/>        <mrow class="MJX-TeXAtom-ORD">
<br/>          <mspace width="1em"></mspace>
<br/>          <mo stretchy="false">(</mo>
<br/>          <mi>mod</mi>
<br/>          <mspace width="0.333em"></mspace>
<br/>          <mi>p</mi>
<br/>          <mo stretchy="false">)</mo>
<br/>        </mrow>
<br/>        <mo>.</mo>
<br/>      </mstyle>
<br/>    </mrow>
<br/>    <annotation encoding="application/x-tex">{\\\\displaystyle a^{p-1}\\\\equiv 1{\\\\pmod {p}}.}</annotation>
<br/>  </semantics>
<br/></math></span><img src="https://wikimedia.org/api/rest_v1/media/math/render/svg/58a9e1a77254c598a3bbd20ee75962c540381c54" class="mwe-math-fallback-image-inline" aria-hidden="true" style="vertical-align: -0.838ex; width:20.151ex; height:3.176ex;" alt="a^{p-1} \\\\equiv 1 \\\\pmod p."></span></dd></dl>
<br/>For example, if <span class="texhtml"><i>a</i> = 2</span> and <span class="texhtml"><i>p</i> = 7</span>, then <span class="texhtml">2<sup>6</sup> = 64</span>, and <span class="texhtml">64 − 1 = 63 = 7 × 9</span> is thus a multiple of <span class="texhtml">7</span>.
<br/>Fermat's little theorem is the basis for the Fermat primality test and is one of the fundamental results of elementary number theory. The theorem is named after Pierre de Fermat, who stated it in 1640. It is called the "little theorem" to distinguish it from Fermat's Last Theorem.
<br/> 
<br/>(Wikipedia, The Free Encyclopedia, <a href="https://en.wikipedia.org/wiki/Fermat%27s_little_theorem">https://en.wikipedia.org/wiki/Fermat%27s_little_theorem</a>)"""@en ;
  a skos:Concept ;
  skos:inScheme psr: ;
  skos:broader psr:-F7SFNL4R-1 ;
  skos:prefLabel "Fermat's little theorem"@en, "petit théorème de Fermat"@fr ;
  skos:exactMatch <https://fr.wikipedia.org/wiki/Petit_th%C3%A9or%C3%A8me_de_Fermat>, <https://en.wikipedia.org/wiki/Fermat%27s_little_theorem> .

