@prefix psr: <http://data.loterre.fr/ark:/67375/PSR> .
@prefix skos: <http://www.w3.org/2004/02/skos/core#> .
@prefix dc: <http://purl.org/dc/terms/> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .

psr: a skos:ConceptScheme .
psr:-PTHTKNB0-C
  a skos:Concept ;
  skos:broader psr:-FM1M1PDT-5, psr:-CVDPQB0Q-M ;
  skos:exactMatch <https://en.wikipedia.org/wiki/Quasiperfect_number>, <https://fr.wikipedia.org/wiki/Nombre_quasi_parfait> ;
  dc:modified "2024-10-18"^^xsd:date ;
  skos:definition """In mathematics, a quasiperfect number is a natural number n for which the sum of all its divisors (the divisor function σ(n)) is equal to 2n + 1. Equivalently, n is the sum of its non-trivial divisors (that is, its divisors excluding 1 and n). No quasiperfect numbers have been found so far. The quasiperfect numbers are the abundant numbers of minimal abundance (which is 1). 
<br/>(Wikipedia, The Free Encyclopedia, <a href="https://en.wikipedia.org/wiki/Quasiperfect_number">https://en.wikipedia.org/wiki/Quasiperfect_number</a>)"""@en, """En mathématiques, un <b>nombre quasi parfait</b> est un entier <i>n</i> tel que <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 \\\\sigma (n)=2n+1\\\\,}">   <semantics>     <mrow class="MJX-TeXAtom-ORD">       <mstyle displaystyle="true" scriptlevel="0">         <mi>σ<!-- σ --></mi>         <mo stretchy="false">(</mo>         <mi>n</mi>         <mo stretchy="false">)</mo>         <mo>=</mo>         <mn>2</mn>         <mi>n</mi>         <mo>+</mo>         <mn>1</mn>         <mspace width="thinmathspace"></mspace>       </mstyle>     </mrow>     <annotation encoding="application/x-tex">{\\\\displaystyle \\\\sigma (n)=2n+1\\\\,}</annotation>   </semantics> </math></span><img src="https://wikimedia.org/api/rest_v1/media/math/render/svg/6a630690841e839c18ba4864d4c2abbc5b634af7" class="mwe-math-fallback-image-inline mw-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:14.579ex; height:2.843ex;" alt="\\\\sigma (n)=2n+1\\\\,"></span>, où <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 \\\\sigma \\\\,}">   <semantics>     <mrow class="MJX-TeXAtom-ORD">       <mstyle displaystyle="true" scriptlevel="0">         <mi>σ<!-- σ --></mi>         <mspace width="thinmathspace"></mspace>       </mstyle>     </mrow>     <annotation encoding="application/x-tex">{\\\\displaystyle \\\\sigma \\\\,}</annotation>   </semantics> </math></span><img src="https://wikimedia.org/api/rest_v1/media/math/render/svg/df7f4b8e7c7fc824dd8c82008b7cceac27f60bcb" class="mwe-math-fallback-image-inline mw-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:1.717ex; height:1.676ex;" alt="\\\\sigma \\\\,"></span> est la fonction donnant la somme des diviseurs entiers positifs de <i>n</i>, incluant <i>n</i>. Aucun nombre quasi parfait n'a été trouvé jusqu'à aujourd'hui, mais il a été démontré que, si un nombre quasi parfait existe, alors il est supérieur à 10<sup>35</sup> et il a au moins sept diviseurs premiers distincts. 
<br/>(Wikipedia, L'Encylopédie Libre, <a href="https://fr.wikipedia.org/wiki/Nombre_quasi_parfait">https://fr.wikipedia.org/wiki/Nombre_quasi_parfait</a>)"""@fr ;
  skos:prefLabel "nombre quasi parfait"@fr, "quasiperfect number"@en ;
  skos:inScheme psr: ;
  dc:created "2023-07-26"^^xsd:date .

psr:-CVDPQB0Q-M
  skos:prefLabel "natural numbers"@en, "entier naturel"@fr ;
  a skos:Concept ;
  skos:narrower psr:-PTHTKNB0-C .

psr:-FM1M1PDT-5
  skos:prefLabel "suite d'entiers"@fr, "integer sequence"@en ;
  a skos:Concept ;
  skos:narrower psr:-PTHTKNB0-C .