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

psr:-P93ST75Z-8
  skos:prefLabel "théorie des nombres"@fr, "number theory"@en ;
  a skos:Concept ;
  skos:narrower psr:-P6H0CS8T-R .

psr: a skos:ConceptScheme .
psr:-P6H0CS8T-R
  skos:definition """In number theory, Dirichlet's theorem, also called the Dirichlet prime number theorem, states that for any two positive coprime integers <i>a</i> and <i>d</i>, there are infinitely many primes of the form <i>a</i> + <i>nd</i>, where <i>n</i> is also a positive integer. In other words, there are infinitely many primes that are congruent to <i>a</i> modulo <i>d</i>. The numbers of the form <i>a</i> + <i>nd</i> form an arithmetic progression <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,\\\\ a+d,\\\\ a+2d,\\\\ a+3d,\\\\ \\\\dots ,\\\\ }">
         <semantics>
         <mrow class="MJX-TeXAtom-ORD">
         <mstyle displaystyle="true" scriptlevel="0">
         <mi>a</mi>
         <mo>,</mo>
         <mtext> </mtext>
         <mi>a</mi>
         <mo>+</mo>
         <mi>d</mi>
         <mo>,</mo>
         <mtext> </mtext>
         <mi>a</mi>
         <mo>+</mo>
         <mn>2</mn>
         <mi>d</mi>
         <mo>,</mo>
         <mtext> </mtext>
         <mi>a</mi>
         <mo>+</mo>
         <mn>3</mn>
         <mi>d</mi>
         <mo>,</mo>
         <mtext> </mtext>
         <mo>…<!-- … --></mo>
         <mo>,</mo>
         <mtext> </mtext>
         </mstyle>
         </mrow>
         <annotation encoding="application/x-tex">{\\\\displaystyle a,\\\\ a+d,\\\\ a+2d,\\\\ a+3d,\\\\ \\\\dots ,\\\\ }</annotation>
         </semantics>
         </math></span><img src="https://wikimedia.org/api/rest_v1/media/math/render/svg/7b0dfeef2ac486920103ea18e9743ab9e08a7019" class="mwe-math-fallback-image-inline mw-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:30.983ex; height:2.509ex;" alt="a,\\\\ a+d,\\\\ a+2d,\\\\ a+3d,\\\\ \\\\dots ,\\\\ "></span></dd></dl>
         and Dirichlet's theorem states that this sequence contains infinitely many prime numbers. The theorem, named after Peter Gustav Lejeune Dirichlet, extends Euclid's theorem that there are infinitely many prime numbers. Stronger forms of Dirichlet's theorem state that for any such arithmetic progression, the sum of the reciprocals of the prime numbers in the progression diverges and that different such arithmetic progressions with the same modulus have approximately the same proportions of primes. Equivalently, the primes are evenly distributed (asymptotically) among the congruence classes modulo <i>d</i> containing <i>a</i>'s coprime to <i>d</i>. 
<br/>(Wikipedia, The Free Encyclopedia, <a href="https://en.wikipedia.org/wiki/Dirichlet%27s_theorem_on_arithmetic_progressions">https://en.wikipedia.org/wiki/Dirichlet%27s_theorem_on_arithmetic_progressions</a>)"""@en, """En mathématiques, et plus précisément en théorie des nombres, le théorème de la progression arithmétique, s'énonce de la façon suivante : pour tout entier <i>n</i> non nul et tout entier <i>m</i> premier avec <i>n</i>, il existe une infinité de nombres premiers congrus à <i>m</i> modulo <i>n</i> (c'est-à-dire de la forme <i>m</i> + <i>an</i> avec <i>a</i> entier). Ce théorème est une généralisation du théorème d'Euclide sur les nombres premiers. Sa première démonstration, due au mathématicien allemand Gustav Lejeune Dirichlet en 1838, fait appel aux résultats de l'arithmétique modulaire et à ceux de la théorie analytique des nombres. La première démonstration « élémentaire » est due à Atle Selberg en 1949. 
<br/>(Wikipedia, L'Encylopédie Libre, <a href="https://fr.wikipedia.org/wiki/Th%C3%A9or%C3%A8me_de_la_progression_arithm%C3%A9tique">https://fr.wikipedia.org/wiki/Th%C3%A9or%C3%A8me_de_la_progression_arithm%C3%A9tique</a>)"""@fr ;
  skos:prefLabel "Dirichlet's theorem on arithmetic progressions"@en, "théorème de la progression arithmétique"@fr ;
  skos:exactMatch <https://en.wikipedia.org/wiki/Dirichlet%27s_theorem_on_arithmetic_progressions>, <https://fr.wikipedia.org/wiki/Th%C3%A9or%C3%A8me_de_la_progression_arithm%C3%A9tique> ;
  skos:altLabel "Dirichlet's theorem"@en, "Dirichlet prime number theorem"@en ;
  skos:broader psr:-P93ST75Z-8 ;
  skos:inScheme psr: ;
  a skos:Concept .

