@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:-WN2VCDX8-S .

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

psr:-WN2VCDX8-S
  skos:related psr:-T0WTK17L-B ;
  dc:modified "2024-10-18"^^xsd:date ;
  skos:prefLabel "sieve of Atkin"@en, "crible d'Atkin"@fr ;
  skos:exactMatch <https://en.wikipedia.org/wiki/Sieve_of_Atkin>, <https://fr.wikipedia.org/wiki/Crible_d%27Atkin> ;
  dc:created "2023-08-18"^^xsd:date ;
  skos:definition """Le crible d'Atkin est un procédé qui permet de trouver tous les nombres premiers inférieurs à un certain entier naturel donné N. C'est une version améliorée du crible d'Ératosthène, il fut créé en 1999 par A. O. L. Atkin et Daniel J. Bernstein. 
<br/>(Wikipedia, L'Encylopédie Libre, <a href="https://fr.wikipedia.org/wiki/Crible_d%27Atkin">https://fr.wikipedia.org/wiki/Crible_d%27Atkin</a>)"""@fr, """In mathematics, the sieve of Atkin is a modern algorithm for finding all prime numbers up to a specified integer. Compared with the ancient sieve of Eratosthenes, which marks off multiples of primes, the sieve of Atkin does some preliminary work and then marks off multiples of squares of primes, thus achieving a better theoretical asymptotic complexity. It was created in 2003 by A. O. L. Atkin and Daniel J. Bernstein. 
<br/>(Wikipedia, The Free Encyclopedia, <a href="https://en.wikipedia.org/wiki/Sieve_of_Atkin">https://en.wikipedia.org/wiki/Sieve_of_Atkin</a>)"""@en ;
  skos:broader psr:-VVFSH11T-P ;
  skos:inScheme psr: ;
  a skos:Concept .