<?xml version="1.0" encoding="UTF-8"?>
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9"
        xmlns:xhtml="http://www.w3.org/1999/xhtml"
        xmlns:video="http://www.google.com/schemas/sitemap-video/1.1"
        xmlns:image="http://www.google.com/schemas/sitemap-image/1.1">
    
    <url>
        <loc>https://ro.khanacademy.org/computing/mate-pentru-info/x80202a0f7ec77923:divizibilitate/x80202a0f7ec77923:descompunerea-in-factori-primi/a/comp-number-theory-introduction</loc>
        
        <xhtml:link rel="alternate" hreflang="bg"
                    href="https://bg.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/a/comp-number-theory-introduction" />
        
        <xhtml:link rel="alternate" hreflang="bn"
                    href="https://bn.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/a/comp-number-theory-introduction" />
        
        <xhtml:link rel="alternate" hreflang="cs"
                    href="https://cs.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/a/comp-number-theory-introduction" />
        
        <xhtml:link rel="alternate" hreflang="da"
                    href="https://da.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/a/comp-number-theory-introduction" />
        
        <xhtml:link rel="alternate" hreflang="de"
                    href="https://de.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/a/comp-number-theory-introduction" />
        
        <xhtml:link rel="alternate" hreflang="en"
                    href="https://www.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/a/comp-number-theory-introduction" />
        
        <xhtml:link rel="alternate" hreflang="es"
                    href="https://es.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/a/comp-number-theory-introduction" />
        
        <xhtml:link rel="alternate" hreflang="hu"
                    href="https://hu.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/a/comp-number-theory-introduction" />
        
        <xhtml:link rel="alternate" hreflang="hy"
                    href="https://hy.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/a/comp-number-theory-introduction" />
        
        <xhtml:link rel="alternate" hreflang="ka"
                    href="https://ka.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/a/comp-number-theory-introduction" />
        
        <xhtml:link rel="alternate" hreflang="ko"
                    href="https://ko.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/a/comp-number-theory-introduction" />
        
        <xhtml:link rel="alternate" hreflang="pl"
                    href="https://pl.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/a/comp-number-theory-introduction" />
        
        <xhtml:link rel="alternate" hreflang="pt"
                    href="https://pt.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/a/comp-number-theory-introduction" />
        
        <xhtml:link rel="alternate" hreflang="ro"
                    href="https://ro.khanacademy.org/computing/mate-pentru-info/x80202a0f7ec77923:divizibilitate/x80202a0f7ec77923:descompunerea-in-factori-primi/a/comp-number-theory-introduction" />
        
        <xhtml:link rel="alternate" hreflang="ru"
                    href="https://ru.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/a/comp-number-theory-introduction" />
        
        <xhtml:link rel="alternate" hreflang="tr"
                    href="https://tr.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/a/comp-number-theory-introduction" />
        
        <xhtml:link rel="alternate" hreflang="zh-hans"
                    href="https://zh.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/a/comp-number-theory-introduction" />
        
        <lastmod>2021-04-30T02:30:53Z</lastmod>
        
        <PageMap xmlns="http://www.google.com/schemas/sitemap-pagemap/1.0">
            <DataObject type="document" id="comp-number-theory-introduction">
            <Attribute name="title">Introducere</Attribute>
            
            
            <Attribute name="type">article</Attribute>
            
            </DataObject>
        </PageMap>
        
    </url>
    
    <url>
        <loc>https://ro.khanacademy.org/computing/mate-pentru-info/x80202a0f7ec77923:divizibilitate/x80202a0f7ec77923:numere-prime/v/primality-test-challenge</loc>
        
        <xhtml:link rel="alternate" hreflang="bg"
                    href="https://bg.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/primality-test-challenge" />
        
        <xhtml:link rel="alternate" hreflang="bn"
                    href="https://bn.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/primality-test-challenge" />
        
        <xhtml:link rel="alternate" hreflang="cs"
                    href="https://cs.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/primality-test-challenge" />
        
        <xhtml:link rel="alternate" hreflang="de"
                    href="https://de.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/primality-test-challenge" />
        
        <xhtml:link rel="alternate" hreflang="en"
                    href="https://www.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/primality-test-challenge" />
        
        <xhtml:link rel="alternate" hreflang="hu"
                    href="https://hu.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/primality-test-challenge" />
        
        <xhtml:link rel="alternate" hreflang="hy"
                    href="https://hy.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/primality-test-challenge" />
        
        <xhtml:link rel="alternate" hreflang="ka"
                    href="https://ka.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/primality-test-challenge" />
        
        <xhtml:link rel="alternate" hreflang="ko"
                    href="https://ko.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/primality-test-challenge" />
        
        <xhtml:link rel="alternate" hreflang="pl"
                    href="https://pl.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/primality-test-challenge" />
        
        <xhtml:link rel="alternate" hreflang="pt"
                    href="https://pt.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/primality-test-challenge" />
        
        <xhtml:link rel="alternate" hreflang="ro"
                    href="https://ro.khanacademy.org/computing/mate-pentru-info/x80202a0f7ec77923:divizibilitate/x80202a0f7ec77923:numere-prime/v/primality-test-challenge" />
        
        <xhtml:link rel="alternate" hreflang="ru"
                    href="https://ru.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/primality-test-challenge" />
        
        <xhtml:link rel="alternate" hreflang="tr"
                    href="https://tr.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/primality-test-challenge" />
        
        <lastmod>2021-07-08T22:12:59Z</lastmod>
        
        <PageMap xmlns="http://www.google.com/schemas/sitemap-pagemap/1.0">
            <DataObject type="document" id="primality-test-challenge">
            <Attribute name="title">Provocarea test de primalitate</Attribute>
            <Attribute name="description">Cum ne poate spune o mașină dacă un număr este prim?</Attribute>
            <Attribute name="author">Brit Cruise</Attribute>
            <Attribute name="type">video</Attribute>
            
            </DataObject>
        </PageMap>
        
        <video:video>
            <video:thumbnail_loc>https://cdn.kastatic.org/googleusercontent/EZ6-gq24eeyVhozMARycezaABUcrspbtPxZl7HDNVCMAD8Ew_mFOzICjELd5LSzZkQi6FqIuW0Dt-mh5r_hRynyV1Q</video:thumbnail_loc>
            <video:title>Provocarea test de primalitate</video:title>
            <video:description>Cum ne poate spune o mașină dacă un număr este prim?</video:description>
            <video:player_loc>https://cdn.kastatic.org/ka-youtube-converted/HIu1S2Wsso8.mp4/HIu1S2Wsso8.mp4</video:player_loc>
            <video:duration>65</video:duration>
            <video:category>Numere prime</video:category>
        </video:video>
        
    </url>
    
    <url>
        <loc>https://ro.khanacademy.org/computing/mate-pentru-info/x80202a0f7ec77923:divizibilitate/x80202a0f7ec77923:numere-prime/a/trial-division</loc>
        
        <xhtml:link rel="alternate" hreflang="bg"
                    href="https://bg.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/a/trial-division" />
        
        <xhtml:link rel="alternate" hreflang="bn"
                    href="https://bn.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/a/trial-division" />
        
        <xhtml:link rel="alternate" hreflang="cs"
                    href="https://cs.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/a/trial-division" />
        
        <xhtml:link rel="alternate" hreflang="de"
                    href="https://de.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/a/trial-division" />
        
        <xhtml:link rel="alternate" hreflang="en"
                    href="https://www.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/a/trial-division" />
        
        <xhtml:link rel="alternate" hreflang="es"
                    href="https://es.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/a/trial-division" />
        
        <xhtml:link rel="alternate" hreflang="hu"
                    href="https://hu.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/a/trial-division" />
        
        <xhtml:link rel="alternate" hreflang="hy"
                    href="https://hy.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/a/trial-division" />
        
        <xhtml:link rel="alternate" hreflang="ka"
                    href="https://ka.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/a/trial-division" />
        
        <xhtml:link rel="alternate" hreflang="ko"
                    href="https://ko.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/a/trial-division" />
        
        <xhtml:link rel="alternate" hreflang="pl"
                    href="https://pl.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/a/trial-division" />
        
        <xhtml:link rel="alternate" hreflang="pt"
                    href="https://pt.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/a/trial-division" />
        
        <xhtml:link rel="alternate" hreflang="ro"
                    href="https://ro.khanacademy.org/computing/mate-pentru-info/x80202a0f7ec77923:divizibilitate/x80202a0f7ec77923:numere-prime/a/trial-division" />
        
        <xhtml:link rel="alternate" hreflang="ru"
                    href="https://ru.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/a/trial-division" />
        
        <xhtml:link rel="alternate" hreflang="zh-hans"
                    href="https://zh.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/a/trial-division" />
        
        <lastmod>2021-04-30T02:35:51Z</lastmod>
        
        <PageMap xmlns="http://www.google.com/schemas/sitemap-pagemap/1.0">
            <DataObject type="document" id="trial-division">
            <Attribute name="title">Algoritmul de încercarea prin împărțire</Attribute>
            
            
            <Attribute name="type">article</Attribute>
            
            </DataObject>
        </PageMap>
        
    </url>
    
    <url>
        <loc>https://ro.khanacademy.org/computing/informatica-teoretica/xa031e01fa0fa957e:aritmetica-modulara-in-algoritmi/xa031e01fa0fa957e:numere-prime/v/what-is-computer-memory-prime-adventure-part-7</loc>
        
        <xhtml:link rel="alternate" hreflang="bg"
                    href="https://bg.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/what-is-computer-memory-prime-adventure-part-7" />
        
        <xhtml:link rel="alternate" hreflang="bn"
                    href="https://bn.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/what-is-computer-memory-prime-adventure-part-7" />
        
        <xhtml:link rel="alternate" hreflang="cs"
                    href="https://cs.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/what-is-computer-memory-prime-adventure-part-7" />
        
        <xhtml:link rel="alternate" hreflang="de"
                    href="https://de.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/what-is-computer-memory-prime-adventure-part-7" />
        
        <xhtml:link rel="alternate" hreflang="en"
                    href="https://www.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/what-is-computer-memory-prime-adventure-part-7" />
        
        <xhtml:link rel="alternate" hreflang="hu"
                    href="https://hu.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/what-is-computer-memory-prime-adventure-part-7" />
        
        <xhtml:link rel="alternate" hreflang="hy"
                    href="https://hy.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/what-is-computer-memory-prime-adventure-part-7" />
        
        <xhtml:link rel="alternate" hreflang="ka"
                    href="https://ka.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/what-is-computer-memory-prime-adventure-part-7" />
        
        <xhtml:link rel="alternate" hreflang="ko"
                    href="https://ko.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/what-is-computer-memory-prime-adventure-part-7" />
        
        <xhtml:link rel="alternate" hreflang="pl"
                    href="https://pl.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/what-is-computer-memory-prime-adventure-part-7" />
        
        <xhtml:link rel="alternate" hreflang="pt"
                    href="https://pt.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/what-is-computer-memory-prime-adventure-part-7" />
        
        <xhtml:link rel="alternate" hreflang="ro"
                    href="https://ro.khanacademy.org/computing/informatica-teoretica/xa031e01fa0fa957e:aritmetica-modulara-in-algoritmi/xa031e01fa0fa957e:numere-prime/v/what-is-computer-memory-prime-adventure-part-7" />
        
        <xhtml:link rel="alternate" hreflang="ru"
                    href="https://ru.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/what-is-computer-memory-prime-adventure-part-7" />
        
        <xhtml:link rel="alternate" hreflang="tr"
                    href="https://tr.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/what-is-computer-memory-prime-adventure-part-7" />
        
        <lastmod>2021-03-23T16:08:41Z</lastmod>
        
        <PageMap xmlns="http://www.google.com/schemas/sitemap-pagemap/1.0">
            <DataObject type="document" id="what-is-computer-memory-prime-adventure-part-7">
            <Attribute name="title">Ce este memoria calculatorului?</Attribute>
            <Attribute name="description">Care este limita memoriei unui calculator?</Attribute>
            <Attribute name="author">Brit Cruise</Attribute>
            <Attribute name="type">video</Attribute>
            
            </DataObject>
        </PageMap>
        
        <video:video>
            <video:thumbnail_loc>https://cdn.kastatic.org/googleusercontent/DVB6iaCFLzvKveBUnXYkXps8gBbftQLnjOUQ8-0SPbiiTNGc0ld8kOqXjhMCkennf-dnsWssKdcW1bHTPotBAO9H</video:thumbnail_loc>
            <video:title>Ce este memoria calculatorului?</video:title>
            <video:description>Care este limita memoriei unui calculator?</video:description>
            <video:player_loc>https://cdn.kastatic.org/ka-youtube-converted/h6YWCuuJVj4.mp4/h6YWCuuJVj4.mp4</video:player_loc>
            <video:duration>324</video:duration>
            <video:category>Numere prime</video:category>
        </video:video>
        
    </url>
    
    <url>
        <loc>https://ro.khanacademy.org/computing/informatica-teoretica/xa031e01fa0fa957e:aritmetica-modulara-in-algoritmi/xa031e01fa0fa957e:numere-prime/v/algorithmic-efficiency</loc>
        
        <xhtml:link rel="alternate" hreflang="bg"
                    href="https://bg.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/algorithmic-efficiency" />
        
        <xhtml:link rel="alternate" hreflang="bn"
                    href="https://bn.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/algorithmic-efficiency" />
        
        <xhtml:link rel="alternate" hreflang="cs"
                    href="https://cs.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/algorithmic-efficiency" />
        
        <xhtml:link rel="alternate" hreflang="de"
                    href="https://de.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/algorithmic-efficiency" />
        
        <xhtml:link rel="alternate" hreflang="en"
                    href="https://www.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/algorithmic-efficiency" />
        
        <xhtml:link rel="alternate" hreflang="hu"
                    href="https://hu.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/algorithmic-efficiency" />
        
        <xhtml:link rel="alternate" hreflang="hy"
                    href="https://hy.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/algorithmic-efficiency" />
        
        <xhtml:link rel="alternate" hreflang="ka"
                    href="https://ka.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/algorithmic-efficiency" />
        
        <xhtml:link rel="alternate" hreflang="ko"
                    href="https://ko.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/algorithmic-efficiency" />
        
        <xhtml:link rel="alternate" hreflang="pl"
                    href="https://pl.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/algorithmic-efficiency" />
        
        <xhtml:link rel="alternate" hreflang="pt"
                    href="https://pt.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/algorithmic-efficiency" />
        
        <xhtml:link rel="alternate" hreflang="ro"
                    href="https://ro.khanacademy.org/computing/informatica-teoretica/xa031e01fa0fa957e:aritmetica-modulara-in-algoritmi/xa031e01fa0fa957e:numere-prime/v/algorithmic-efficiency" />
        
        <xhtml:link rel="alternate" hreflang="ru"
                    href="https://ru.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/algorithmic-efficiency" />
        
        <lastmod>2021-03-23T16:08:41Z</lastmod>
        
        <PageMap xmlns="http://www.google.com/schemas/sitemap-pagemap/1.0">
            <DataObject type="document" id="algorithmic-efficiency">
            <Attribute name="title">Eficiența algoritmică</Attribute>
            <Attribute name="description">Cum putem îmbunătăţi viteza unui test de primalitate (deterministic)?</Attribute>
            <Attribute name="author">Brit Cruise</Attribute>
            <Attribute name="type">video</Attribute>
            
            </DataObject>
        </PageMap>
        
        <video:video>
            <video:thumbnail_loc>https://cdn.kastatic.org/googleusercontent/S8Udc8995Agl6wimGV2hlXUZn9mfGcHXswcXJWhi-Jfa3nw4b5tSEd0K-ZrivoFu6dxR2rATWq_S7iuo9_CHU1XL</video:thumbnail_loc>
            <video:title>Eficiența algoritmică</video:title>
            <video:description>Cum putem îmbunătăţi viteza unui test de primalitate (deterministic)?</video:description>
            <video:player_loc>https://cdn.kastatic.org/ka-youtube-converted/oYUzKAfrx0w.mp4/oYUzKAfrx0w.mp4</video:player_loc>
            <video:duration>522</video:duration>
            <video:category>Numere prime</video:category>
        </video:video>
        
    </url>
    
    <url>
        <loc>https://ro.khanacademy.org/computing/mate-pentru-info/x80202a0f7ec77923:divizibilitate/x80202a0f7ec77923:numere-prime/v/sieve-of-eratosthenes-prime-adventure-part-4</loc>
        
        <xhtml:link rel="alternate" hreflang="bg"
                    href="https://bg.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/sieve-of-eratosthenes-prime-adventure-part-4" />
        
        <xhtml:link rel="alternate" hreflang="bn"
                    href="https://bn.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/sieve-of-eratosthenes-prime-adventure-part-4" />
        
        <xhtml:link rel="alternate" hreflang="cs"
                    href="https://cs.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/sieve-of-eratosthenes-prime-adventure-part-4" />
        
        <xhtml:link rel="alternate" hreflang="de"
                    href="https://de.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/sieve-of-eratosthenes-prime-adventure-part-4" />
        
        <xhtml:link rel="alternate" hreflang="en"
                    href="https://www.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/sieve-of-eratosthenes-prime-adventure-part-4" />
        
        <xhtml:link rel="alternate" hreflang="hu"
                    href="https://hu.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/sieve-of-eratosthenes-prime-adventure-part-4" />
        
        <xhtml:link rel="alternate" hreflang="hy"
                    href="https://hy.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/sieve-of-eratosthenes-prime-adventure-part-4" />
        
        <xhtml:link rel="alternate" hreflang="ka"
                    href="https://ka.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/sieve-of-eratosthenes-prime-adventure-part-4" />
        
        <xhtml:link rel="alternate" hreflang="ko"
                    href="https://ko.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/sieve-of-eratosthenes-prime-adventure-part-4" />
        
        <xhtml:link rel="alternate" hreflang="pl"
                    href="https://pl.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/sieve-of-eratosthenes-prime-adventure-part-4" />
        
        <xhtml:link rel="alternate" hreflang="pt"
                    href="https://pt.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/sieve-of-eratosthenes-prime-adventure-part-4" />
        
        <xhtml:link rel="alternate" hreflang="ro"
                    href="https://ro.khanacademy.org/computing/mate-pentru-info/x80202a0f7ec77923:divizibilitate/x80202a0f7ec77923:numere-prime/v/sieve-of-eratosthenes-prime-adventure-part-4" />
        
        <xhtml:link rel="alternate" hreflang="ru"
                    href="https://ru.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/sieve-of-eratosthenes-prime-adventure-part-4" />
        
        <xhtml:link rel="alternate" hreflang="tr"
                    href="https://tr.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/sieve-of-eratosthenes-prime-adventure-part-4" />
        
        <lastmod>2021-03-23T16:08:41Z</lastmod>
        
        <PageMap xmlns="http://www.google.com/schemas/sitemap-pagemap/1.0">
            <DataObject type="document" id="sieve-of-eratosthenes-prime-adventure-part-4">
            <Attribute name="title">Ciurul lui Eratostene</Attribute>
            <Attribute name="description">Ciurul lui Eratostene ne permite să generăm o listă de numere prime.</Attribute>
            <Attribute name="author">Brit Cruise</Attribute>
            <Attribute name="type">video</Attribute>
            
            </DataObject>
        </PageMap>
        
        <video:video>
            <video:thumbnail_loc>https://cdn.kastatic.org/googleusercontent/S6tGRWO5Tc0yke5VtRK3miqRpHGQwjQC32jx-yI4CAnvdJeNbYLH3t94BC-LdrAmLGhQ_Gq1LIX4rfMDEkDAOKU</video:thumbnail_loc>
            <video:title>Ciurul lui Eratostene</video:title>
            <video:description>Ciurul lui Eratostene ne permite să generăm o listă de numere prime.</video:description>
            <video:player_loc>https://cdn.kastatic.org/ka-youtube-converted/klcIklsWzrY.mp4/klcIklsWzrY.mp4</video:player_loc>
            <video:duration>252</video:duration>
            <video:category>Numere prime</video:category>
        </video:video>
        
    </url>
    
    <url>
        <loc>https://ro.khanacademy.org/computing/mate-pentru-info/x80202a0f7ec77923:divizibilitate/x80202a0f7ec77923:numere-prime/v/trial-division-primality-test-using-a-sieve-prime-adventure-part-5</loc>
        
        <xhtml:link rel="alternate" hreflang="bg"
                    href="https://bg.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/trial-division-primality-test-using-a-sieve-prime-adventure-part-5" />
        
        <xhtml:link rel="alternate" hreflang="bn"
                    href="https://bn.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/trial-division-primality-test-using-a-sieve-prime-adventure-part-5" />
        
        <xhtml:link rel="alternate" hreflang="cs"
                    href="https://cs.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/trial-division-primality-test-using-a-sieve-prime-adventure-part-5" />
        
        <xhtml:link rel="alternate" hreflang="de"
                    href="https://de.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/trial-division-primality-test-using-a-sieve-prime-adventure-part-5" />
        
        <xhtml:link rel="alternate" hreflang="en"
                    href="https://www.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/trial-division-primality-test-using-a-sieve-prime-adventure-part-5" />
        
        <xhtml:link rel="alternate" hreflang="hu"
                    href="https://hu.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/trial-division-primality-test-using-a-sieve-prime-adventure-part-5" />
        
        <xhtml:link rel="alternate" hreflang="hy"
                    href="https://hy.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/trial-division-primality-test-using-a-sieve-prime-adventure-part-5" />
        
        <xhtml:link rel="alternate" hreflang="ka"
                    href="https://ka.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/trial-division-primality-test-using-a-sieve-prime-adventure-part-5" />
        
        <xhtml:link rel="alternate" hreflang="ko"
                    href="https://ko.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/trial-division-primality-test-using-a-sieve-prime-adventure-part-5" />
        
        <xhtml:link rel="alternate" hreflang="pl"
                    href="https://pl.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/trial-division-primality-test-using-a-sieve-prime-adventure-part-5" />
        
        <xhtml:link rel="alternate" hreflang="pt"
                    href="https://pt.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/trial-division-primality-test-using-a-sieve-prime-adventure-part-5" />
        
        <xhtml:link rel="alternate" hreflang="ro"
                    href="https://ro.khanacademy.org/computing/mate-pentru-info/x80202a0f7ec77923:divizibilitate/x80202a0f7ec77923:numere-prime/v/trial-division-primality-test-using-a-sieve-prime-adventure-part-5" />
        
        <xhtml:link rel="alternate" hreflang="ru"
                    href="https://ru.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/trial-division-primality-test-using-a-sieve-prime-adventure-part-5" />
        
        <xhtml:link rel="alternate" hreflang="tr"
                    href="https://tr.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/trial-division-primality-test-using-a-sieve-prime-adventure-part-5" />
        
        <lastmod>2021-03-23T16:08:41Z</lastmod>
        
        <PageMap xmlns="http://www.google.com/schemas/sitemap-pagemap/1.0">
            <DataObject type="document" id="trial-division-primality-test-using-a-sieve-prime-adventure-part-5">
            <Attribute name="title">Test de primalitate cu ciur</Attribute>
            <Attribute name="description">O încercare de creare a unui test optim de primalitate prin proba împărțirii, folosind Ciurul lui Eratostene.</Attribute>
            <Attribute name="author">Brit Cruise</Attribute>
            <Attribute name="type">video</Attribute>
            
            </DataObject>
        </PageMap>
        
        <video:video>
            <video:thumbnail_loc>https://cdn.kastatic.org/googleusercontent/xI0PAXRvnOVq8J4x8_rieKJkR2CR54zQL1Kj66AXIOAbrrOIcHW6ihMuj7Ke0a1bydYBJkG8veYKL0YJYGTCvXnL</video:thumbnail_loc>
            <video:title>Test de primalitate cu ciur</video:title>
            <video:description>O încercare de creare a unui test optim de primalitate prin proba împărțirii, folosind Ciurul lui Eratostene.</video:description>
            <video:player_loc>https://cdn.kastatic.org/ka-youtube-converted/XspzfNSSqyk.mp4/XspzfNSSqyk.mp4</video:player_loc>
            <video:duration>322</video:duration>
            <video:category>Numere prime</video:category>
        </video:video>
        
    </url>
    
    <url>
        <loc>https://ro.khanacademy.org/computing/informatica-teoretica/xa031e01fa0fa957e:aritmetica-modulara-in-algoritmi/xa031e01fa0fa957e:numere-prime/v/prime-number-theorem-the-density-of-primes</loc>
        
        <xhtml:link rel="alternate" hreflang="bg"
                    href="https://bg.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/prime-number-theorem-the-density-of-primes" />
        
        <xhtml:link rel="alternate" hreflang="bn"
                    href="https://bn.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/prime-number-theorem-the-density-of-primes" />
        
        <xhtml:link rel="alternate" hreflang="cs"
                    href="https://cs.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/prime-number-theorem-the-density-of-primes" />
        
        <xhtml:link rel="alternate" hreflang="de"
                    href="https://de.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/prime-number-theorem-the-density-of-primes" />
        
        <xhtml:link rel="alternate" hreflang="en"
                    href="https://www.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/prime-number-theorem-the-density-of-primes" />
        
        <xhtml:link rel="alternate" hreflang="hu"
                    href="https://hu.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/prime-number-theorem-the-density-of-primes" />
        
        <xhtml:link rel="alternate" hreflang="hy"
                    href="https://hy.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/prime-number-theorem-the-density-of-primes" />
        
        <xhtml:link rel="alternate" hreflang="ka"
                    href="https://ka.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/prime-number-theorem-the-density-of-primes" />
        
        <xhtml:link rel="alternate" hreflang="ko"
                    href="https://ko.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/prime-number-theorem-the-density-of-primes" />
        
        <xhtml:link rel="alternate" hreflang="pl"
                    href="https://pl.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/prime-number-theorem-the-density-of-primes" />
        
        <xhtml:link rel="alternate" hreflang="pt"
                    href="https://pt.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/prime-number-theorem-the-density-of-primes" />
        
        <xhtml:link rel="alternate" hreflang="ro"
                    href="https://ro.khanacademy.org/computing/informatica-teoretica/xa031e01fa0fa957e:aritmetica-modulara-in-algoritmi/xa031e01fa0fa957e:numere-prime/v/prime-number-theorem-the-density-of-primes" />
        
        <xhtml:link rel="alternate" hreflang="ru"
                    href="https://ru.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/prime-number-theorem-the-density-of-primes" />
        
        <xhtml:link rel="alternate" hreflang="tr"
                    href="https://tr.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/prime-number-theorem-the-density-of-primes" />
        
        <lastmod>2021-03-23T16:08:41Z</lastmod>
        
        <PageMap xmlns="http://www.google.com/schemas/sitemap-pagemap/1.0">
            <DataObject type="document" id="prime-number-theorem-the-density-of-primes">
            <Attribute name="title">Teorema numerelor prime</Attribute>
            <Attribute name="description">Cum putem estima câte numere prime sunt până la x?</Attribute>
            <Attribute name="author">Brit Cruise</Attribute>
            <Attribute name="type">video</Attribute>
            
            </DataObject>
        </PageMap>
        
        <video:video>
            <video:thumbnail_loc>https://cdn.kastatic.org/googleusercontent/LHyF0InoUFBKW0eXqU_QnbEcbuBbSE5EUFf7fQtZCYtZp3MxjK7xRFnL7x-8yJfniA32gVAUW8BKfPBoMpau7tzV</video:thumbnail_loc>
            <video:title>Teorema numerelor prime</video:title>
            <video:description>Cum putem estima câte numere prime sunt până la x?</video:description>
            <video:player_loc>https://cdn.kastatic.org/ka-youtube-converted/7jzCJJIc59E.mp4/7jzCJJIc59E.mp4</video:player_loc>
            <video:duration>406</video:duration>
            <video:category>Numere prime</video:category>
        </video:video>
        
    </url>
    
    <url>
        <loc>https://ro.khanacademy.org/computing/informatica-teoretica/xa031e01fa0fa957e:aritmetica-modulara-in-algoritmi/xa031e01fa0fa957e:numere-prime/v/time-space-tradeoff</loc>
        
        <xhtml:link rel="alternate" hreflang="bg"
                    href="https://bg.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/time-space-tradeoff" />
        
        <xhtml:link rel="alternate" hreflang="bn"
                    href="https://bn.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/time-space-tradeoff" />
        
        <xhtml:link rel="alternate" hreflang="cs"
                    href="https://cs.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/time-space-tradeoff" />
        
        <xhtml:link rel="alternate" hreflang="de"
                    href="https://de.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/time-space-tradeoff" />
        
        <xhtml:link rel="alternate" hreflang="en"
                    href="https://www.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/time-space-tradeoff" />
        
        <xhtml:link rel="alternate" hreflang="hu"
                    href="https://hu.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/time-space-tradeoff" />
        
        <xhtml:link rel="alternate" hreflang="hy"
                    href="https://hy.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/time-space-tradeoff" />
        
        <xhtml:link rel="alternate" hreflang="ka"
                    href="https://ka.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/time-space-tradeoff" />
        
        <xhtml:link rel="alternate" hreflang="ko"
                    href="https://ko.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/time-space-tradeoff" />
        
        <xhtml:link rel="alternate" hreflang="pl"
                    href="https://pl.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/time-space-tradeoff" />
        
        <xhtml:link rel="alternate" hreflang="pt"
                    href="https://pt.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/time-space-tradeoff" />
        
        <xhtml:link rel="alternate" hreflang="ro"
                    href="https://ro.khanacademy.org/computing/informatica-teoretica/xa031e01fa0fa957e:aritmetica-modulara-in-algoritmi/xa031e01fa0fa957e:numere-prime/v/time-space-tradeoff" />
        
        <xhtml:link rel="alternate" hreflang="ru"
                    href="https://ru.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/time-space-tradeoff" />
        
        <xhtml:link rel="alternate" hreflang="tr"
                    href="https://tr.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/time-space-tradeoff" />
        
        <lastmod>2021-03-23T16:08:40Z</lastmod>
        
        <PageMap xmlns="http://www.google.com/schemas/sitemap-pagemap/1.0">
            <DataObject type="document" id="time-space-tradeoff">
            <Attribute name="title">Compromis între timp și memorie</Attribute>
            <Attribute name="description">Care este limita memoriei? Cum se poate economisi timp în detrimentul spațiului?</Attribute>
            <Attribute name="author">Brit Cruise</Attribute>
            <Attribute name="type">video</Attribute>
            
            </DataObject>
        </PageMap>
        
        <video:video>
            <video:thumbnail_loc>https://cdn.kastatic.org/googleusercontent/9Sy91r3qs20_yu3i_k2nHm135ySfyODGYBet8aMJfQMZidp2baV6s_j7OWmjDdk8AdW21x41Z6at3Nlq8FHynp_0FQ</video:thumbnail_loc>
            <video:title>Compromis între timp și memorie</video:title>
            <video:description>Care este limita memoriei? Cum se poate economisi timp în detrimentul spațiului?</video:description>
            <video:player_loc>https://cdn.kastatic.org/ka-youtube-converted/9YRw0Yk7N8c.mp4/9YRw0Yk7N8c.mp4</video:player_loc>
            <video:duration>413</video:duration>
            <video:category>Numere prime</video:category>
        </video:video>
        
    </url>
    
    <url>
        <loc>https://ro.khanacademy.org/computing/informatica-teoretica/xa031e01fa0fa957e:aritmetica-modulara-in-algoritmi/xa031e01fa0fa957e:numere-prime/v/rsa-encryption-checkpoint</loc>
        
        <xhtml:link rel="alternate" hreflang="bg"
                    href="https://bg.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/rsa-encryption-checkpoint" />
        
        <xhtml:link rel="alternate" hreflang="bn"
                    href="https://bn.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/rsa-encryption-checkpoint" />
        
        <xhtml:link rel="alternate" hreflang="cs"
                    href="https://cs.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/rsa-encryption-checkpoint" />
        
        <xhtml:link rel="alternate" hreflang="de"
                    href="https://de.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/rsa-encryption-checkpoint" />
        
        <xhtml:link rel="alternate" hreflang="en"
                    href="https://www.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/rsa-encryption-checkpoint" />
        
        <xhtml:link rel="alternate" hreflang="hu"
                    href="https://hu.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/rsa-encryption-checkpoint" />
        
        <xhtml:link rel="alternate" hreflang="hy"
                    href="https://hy.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/rsa-encryption-checkpoint" />
        
        <xhtml:link rel="alternate" hreflang="ka"
                    href="https://ka.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/rsa-encryption-checkpoint" />
        
        <xhtml:link rel="alternate" hreflang="ko"
                    href="https://ko.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/rsa-encryption-checkpoint" />
        
        <xhtml:link rel="alternate" hreflang="pl"
                    href="https://pl.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/rsa-encryption-checkpoint" />
        
        <xhtml:link rel="alternate" hreflang="pt"
                    href="https://pt.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/rsa-encryption-checkpoint" />
        
        <xhtml:link rel="alternate" hreflang="ro"
                    href="https://ro.khanacademy.org/computing/informatica-teoretica/xa031e01fa0fa957e:aritmetica-modulara-in-algoritmi/xa031e01fa0fa957e:numere-prime/v/rsa-encryption-checkpoint" />
        
        <xhtml:link rel="alternate" hreflang="ru"
                    href="https://ru.khanacademy.org/computing/computer-science/cryptography/comp-number-theory/v/rsa-encryption-checkpoint" />
        
        <lastmod>2021-03-23T16:08:41Z</lastmod>
        
        <PageMap xmlns="http://www.google.com/schemas/sitemap-pagemap/1.0">
            <DataObject type="document" id="rsa-encryption-checkpoint">
            <Attribute name="title">Rezumat (ce urmează?)</Attribute>
            <Attribute name="description">De ce este grea descompunerea în factori primi, dar generarea numerelor prime este uşoară? Unde putem ajunge de aici?</Attribute>
            <Attribute name="author">Brit Cruise</Attribute>
            <Attribute name="type">video</Attribute>
            
            </DataObject>
        </PageMap>
        
        <video:video>
            <video:thumbnail_loc>https://cdn.kastatic.org/googleusercontent/u2yZz4O0TOEV5rP9S_VBEPiK_L8RUITbAtNtRmyayE8jn0yy5VZT70S638euImVPhogPrvfsLEKPbuFa5F1BBJE</video:thumbnail_loc>
            <video:title>Rezumat (ce urmează?)</video:title>
            <video:description>De ce este grea descompunerea în factori primi, dar generarea numerelor prime este uşoară? Unde putem ajunge de aici?</video:description>
            <video:player_loc>https://cdn.kastatic.org/ka-youtube-converted/kFkUSizmR3k.mp4/kFkUSizmR3k.mp4</video:player_loc>
            <video:duration>424</video:duration>
            <video:category>Numere prime</video:category>
        </video:video>
        
    </url>
    
</urlset>
