<?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://www.khanacademy.org/math/6th-grade-math-eureka-squared-aligned/x0c458179b2148480:operations-with-fractions-and-multi-digit-numbers/x0c458179b2148480:the-euclidean-algorithm-optional/v/euclidean-algorithm-to-find-gcf</loc>
        
        <xhtml:link rel="alternate" hreflang="en"
                    href="https://www.khanacademy.org/math/6th-grade-math-eureka-squared-aligned/x0c458179b2148480:operations-with-fractions-and-multi-digit-numbers/x0c458179b2148480:the-euclidean-algorithm-optional/v/euclidean-algorithm-to-find-gcf" />
        
        <lastmod>2025-10-09T15:00:47.997273576Z</lastmod>
        
        <PageMap xmlns="http://www.google.com/schemas/sitemap-pagemap/1.0">
            <DataObject type="document" id="euclidean-algorithm-to-find-gcf">
            <Attribute name="title">Euclidean algorithm to find GCF</Attribute>
            <Attribute name="description">Learn the subtraction Euclidean Algorithm for finding the GCF: keep subtracting the smaller number from the bigger one. When the two numbers match, that number is the GCF.</Attribute>
            <Attribute name="author">Sal Khan</Attribute>
            <Attribute name="type">video</Attribute>
            
            </DataObject>
        </PageMap>
        
        <video:video>
            <video:thumbnail_loc>https://cdn.kastatic.org/ka_thumbnails_cache/8d2bfb70-3b9a-44ca-8c39-c66c90d72f3a_1280_720_base.png</video:thumbnail_loc>
            <video:title>Euclidean algorithm to find GCF</video:title>
            <video:description>Learn the subtraction Euclidean Algorithm for finding the GCF: keep subtracting the smaller number from the bigger one. When the two numbers match, that number is the GCF.</video:description>
            <video:player_loc>https://cdn.kastatic.org/ka-youtube-converted/OwND6sh6FdU.mp4/OwND6sh6FdU.mp4</video:player_loc>
            <video:duration>197</video:duration>
            <video:category>Solving Linear Diophantine Equation using Euclidean Algorithm</video:category>
        </video:video>
        
    </url>
    
    <url>
        <loc>https://www.khanacademy.org/computing/computer-science/cryptography/modarithmetic/a/the-euclidean-algorithm</loc>
        
        <xhtml:link rel="alternate" hreflang="bg"
                    href="https://bg.khanacademy.org/computing/computer-science/cryptography/modarithmetic/a/the-euclidean-algorithm" />
        
        <xhtml:link rel="alternate" hreflang="bn"
                    href="https://bn.khanacademy.org/computing/computer-science/cryptography/modarithmetic/a/the-euclidean-algorithm" />
        
        <xhtml:link rel="alternate" hreflang="cs"
                    href="https://cs.khanacademy.org/computing/computer-science/cryptography/modarithmetic/a/the-euclidean-algorithm" />
        
        <xhtml:link rel="alternate" hreflang="de"
                    href="https://de.khanacademy.org/computing/computer-science/cryptography/modarithmetic/a/the-euclidean-algorithm" />
        
        <xhtml:link rel="alternate" hreflang="en"
                    href="https://www.khanacademy.org/computing/computer-science/cryptography/modarithmetic/a/the-euclidean-algorithm" />
        
        <xhtml:link rel="alternate" hreflang="es"
                    href="https://es.khanacademy.org/computing/computer-science/cryptography/modarithmetic/a/the-euclidean-algorithm" />
        
        <xhtml:link rel="alternate" hreflang="hu"
                    href="https://hu.khanacademy.org/computing/computer-science/cryptography/modarithmetic/a/the-euclidean-algorithm" />
        
        <xhtml:link rel="alternate" hreflang="ko"
                    href="https://ko.khanacademy.org/computing/computer-science/cryptography/modarithmetic/a/the-euclidean-algorithm" />
        
        <xhtml:link rel="alternate" hreflang="nl"
                    href="https://nl.khanacademy.org/math/1e-jaar-aso-wiskunde-a-stroom-be/x00089ac6acc20e34:delers-en-factoren/x00089ac6acc20e34:algoritme-van-euclides/a/the-euclidean-algorithm" />
        
        <xhtml:link rel="alternate" hreflang="pl"
                    href="https://pl.khanacademy.org/computing/computer-science/cryptography/modarithmetic/a/the-euclidean-algorithm" />
        
        <xhtml:link rel="alternate" hreflang="pt"
                    href="https://pt.khanacademy.org/computing/computer-science/cryptography/modarithmetic/a/the-euclidean-algorithm" />
        
        <xhtml:link rel="alternate" hreflang="ro"
                    href="https://ro.khanacademy.org/computing/mate-pentru-info/x80202a0f7ec77923:divizibilitate/x80202a0f7ec77923:cel-mai-mare-divizor-comun/a/the-euclidean-algorithm" />
        
        <xhtml:link rel="alternate" hreflang="ru"
                    href="https://ru.khanacademy.org/computing/computer-science/cryptography/modarithmetic/a/the-euclidean-algorithm" />
        
        <xhtml:link rel="alternate" hreflang="tr"
                    href="https://tr.khanacademy.org/computing/computer-science/cryptography/modarithmetic/a/the-euclidean-algorithm" />
        
        <xhtml:link rel="alternate" hreflang="zh-hans"
                    href="https://zh.khanacademy.org/computing/computer-science/cryptography/modarithmetic/a/the-euclidean-algorithm" />
        
        <lastmod>2025-07-16T20:19:55.489365237Z</lastmod>
        
        <PageMap xmlns="http://www.google.com/schemas/sitemap-pagemap/1.0">
            <DataObject type="document" id="the-euclidean-algorithm">
            <Attribute name="title">The Euclidean Algorithm</Attribute>
            
            
            <Attribute name="type">article</Attribute>
            
            </DataObject>
        </PageMap>
        
    </url>
    
</urlset>
