@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:-VVFSH11T-P
  skos:prefLabel "sieve theory"@en, "théorie des cribles"@fr ;
  a skos:Concept ;
  skos:narrower psr:-P2FRTF8H-T .

psr: a skos:ConceptScheme .
psr:-P2FRTF8H-T
  skos:exactMatch <https://en.wikipedia.org/wiki/Legendre_sieve> ;
  a skos:Concept ;
  skos:prefLabel "Legendre sieve"@en, "crible de Legendre"@fr ;
  skos:inScheme psr: ;
  skos:definition """In mathematics, the Legendre sieve, named after Adrien-Marie Legendre, is the simplest method in modern sieve theory. It applies the concept of the Sieve of Eratosthenes to find upper or lower bounds on the number of primes within a given set of integers. Because it is a simple extension of Eratosthenes' idea, it is sometimes called the Legendre–Eratosthenes sieve. 
<br/>(Wikipedia, The Free Encyclopedia, <a href="https://en.wikipedia.org/wiki/Legendre_sieve">https://en.wikipedia.org/wiki/Legendre_sieve</a>)"""@en ;
  dc:modified "2024-10-18"^^xsd:date ;
  dc:created "2023-08-18"^^xsd:date ;
  skos:related psr:-T0WTK17L-B ;
  skos:broader psr:-VVFSH11T-P .

psr:-T0WTK17L-B
  skos:prefLabel "nombre premier"@fr, "prime number"@en ;
  a skos:Concept ;
  skos:related psr:-P2FRTF8H-T .