<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
    <channel>
        <title>Euclid's Algorithm | The World of Algorithms | Grade 9 | Math | NCERT | Khan Academy</title>
        <link>https://diler.tube/videos/watch/15ceba05-9867-4c16-8709-d5f6a0e7c42d</link>
        <description>In this video, you’ll learn how Euclid’s Subtraction Algorithm finds the GCD by repeatedly reducing a pair of numbers. We’ll understand why the GCD stays unchanged, work through examples like 375 and 825, and see why repeated subtraction can be inefficient. Finally, we’ll improve the method using division and remainders.</description>
        <lastBuildDate>Fri, 20 Nov 2026 05:28:34 GMT</lastBuildDate>
        <docs>https://validator.w3.org/feed/docs/rss2.html</docs>
        <generator>PeerTube - https://diler.tube</generator>
        <image>
            <title>Euclid's Algorithm | The World of Algorithms | Grade 9 | Math | NCERT | Khan Academy</title>
            <url>https://diler.tube/lazy-static/avatars/f58b270a-6076-478a-ad43-3888a532ecb4.png</url>
            <link>https://diler.tube/videos/watch/15ceba05-9867-4c16-8709-d5f6a0e7c42d</link>
        </image>
        <copyright>All rights reserved, unless otherwise specified in the terms specified at https://diler.tube/about and potential licenses granted by each content's rightholder.</copyright>
        <atom:link href="https://diler.tube/feeds/video-comments.xml?videoId=15ceba05-9867-4c16-8709-d5f6a0e7c42d" rel="self" type="application/rss+xml"/>
    </channel>
</rss>