<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0" xmlns:cc="http://cyber.law.harvard.edu/rss/creativeCommonsRssModule.html">
    <channel>
        <title><![CDATA[Stories by Prathmesh haridas on Medium]]></title>
        <description><![CDATA[Stories by Prathmesh haridas on Medium]]></description>
        <link>https://medium.com/@PrathmeshHaridas?source=rss-3c08abe9d444------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/fit/c/150/150/0*hixic-8FsWAXzqoK</url>
            <title>Stories by Prathmesh haridas on Medium</title>
            <link>https://medium.com/@PrathmeshHaridas?source=rss-3c08abe9d444------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Sun, 22 Nov 2026 23:32:40 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@PrathmeshHaridas/feed" rel="self" type="application/rss+xml"/>
        <webMaster><![CDATA[yourfriends@medium.com]]></webMaster>
        <atom:link href="http://medium.superfeedr.com/" rel="hub"/>
        <item>
            <title><![CDATA[Euclid’s algorithm is still in use today]]></title>
            <link>https://medium.com/@PrathmeshHaridas/euclids-algorithm-is-still-in-use-today-a773c5f251ad?source=rss-3c08abe9d444------2</link>
            <guid isPermaLink="false">https://medium.com/p/a773c5f251ad</guid>
            <dc:creator><![CDATA[Prathmesh haridas]]></dc:creator>
            <pubDate>Thu, 25 Apr 2024 07:38:17 GMT</pubDate>
            <atom:updated>2024-04-25T07:38:17.392Z</atom:updated>
            <content:encoded><![CDATA[<h3>Problem Statement</h3><p>Euclid’s algorithm, an ancient mathematical method, remains relevant today due to its efficiency in finding the greatest common divisor (GCD) of two integers. Our goal is to understand how this algorithm impacts real-world scenarios.</p><h3>Aim</h3><p>The aim of this case study is to demonstrate the practical applications of Euclid’s algorithm and its significance in various fields.</p><h3>Objective</h3><p>Our objective is to explore the algorithm’s robustness, efficiency, and versatility, along with its impact on modern computing and mathematics.</p><h3>Introduction</h3><p>Euclid’s algorithm, attributed to the Greek mathematician Euclid around 300 BCE, provides a straightforward way to find the GCD of two numbers. Despite its ancient origins, it continues to play a crucial role in various domains.</p><h3>Findings</h3><p>1. <strong>Efficiency and Optimization</strong>:</p><p>○ Euclid’s algorithm outperforms brute-force methods for GCD calculation.</p><p>○ It reduces the number of required operations by avoiding unnecessary divisions.</p><p>○ In practical terms, this efficiency matters when dealing with large numbers or frequent GCD computations.</p><p>2. <strong>Robustness and Versatility</strong>:</p><p>○ The algorithm works for both positive and negative integers.</p><p>○ It handles non-integer inputs (such as floating-point numbers) by considering their absolute values.</p><p>○ This versatility makes it useful in diverse applications.</p><p>3. <strong>Recursive Nature and Programming Paradigms</strong>:</p><p>○ Euclid’s algorithm relies on recursive division.</p><p>○ Modern programming languages embrace recursion, making it a natural fit for implementation.</p><h3>Algorithm Used</h3><p>4. Given two positive integers, (a) and (b):</p><p>5. Compute the remainder (r) when dividing (a) by (b).</p><p>6. Replace (a) with (b) and (b) with (r).</p><p>7. Repeat steps 2 and 3 until (r) becomes zero.</p><p>8. The final non-zero value of (b) is the GCD of (a) and (b).</p><h3>Example</h3><p>Let’s find the GCD of 48 and 18 using Euclid’s algorithm:</p><p>9. (48 = 18 \cdot 2 + 12)</p><p>10. (18 = 12 \cdot 1 + 6)</p><p>11. (12 = 6 \cdot 2 + 0)</p><p>12. The GCD is 6.</p><h3>Pseudocode</h3><p>def euclid_gcd(a, b):</p><p>while b != 0:</p><p>a, b = b, a % b</p><p>return a</p><h3>Analysis</h3><p>● Euclid’s algorithm has a time complexity of (O(\log(\min(a, b)))), making it efficient.</p><p>● It avoids unnecessary divisions, which is crucial for performance.</p><h3>Applications</h3><p>13. <strong>Cryptography</strong>:</p><p>○ Euclid’s algorithm plays a vital role in RSA encryption.</p><p>○ It helps generate public and private keys.</p><p>14. <strong>Computer Graphics</strong>:</p><p>○ Aspect ratios, common dimensions, and scaling factors often involve GCD calculations.</p><p>○ For example, determining the optimal resolution for displaying images or videos.</p><p>15. <strong>Network Routing</strong>:</p><p>○ GCD-based techniques optimize routing algorithms.</p><p>○ Efficient data packet distribution relies on GCD computations.</p><p>16. <strong>Error Detection and Correction</strong>:</p><p>○ Error-correcting codes use GCD properties.</p><p>○ Detecting and correcting transmission errors in data communication.</p><h3>Current Trends</h3><p>● <strong>Quantum Computing</strong>:</p><p>○ As quantum computing advances, Euclid’s algorithm remains relevant for classical computing systems.</p><p>○ Quantum algorithms may also leverage GCD calculations.</p><h3>Summary</h3><p>Euclid’s algorithm, though ancient, continues to be a powerful tool. Its simplicity, efficiency, and widespread applications make it indispensable in the digital age.</p><h3>Conclusion</h3><p>Euclid’s legacy endures, reminding us that timeless mathematical discoveries shape our modern world. Let’s continue to appreciate and apply this elegant algorithm.</p><h3>Recommendations</h3><p>17. <strong>Education and Awareness</strong>:</p><p>○ Educate students and professionals about Euclid’s algorithm.</p><p>○ Highlight its practical relevance beyond theoretical mathematics.</p><p>18. <strong>Further Research</strong>:</p><p>○ Explore optimizations, variations, and adaptations of the algorithm.</p><p>○ Investigate its role in emerging technologies.</p><h3>Reference</h3><p>19. Euclid’s Elements, Book VII, Proposition 2.</p><p>20. Knuth, D. E. (1997). <em>The Art of Computer Programming, Volume 1: Fundamental Algorithms</em>.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=a773c5f251ad" width="1" height="1" alt="">]]></content:encoded>
        </item>
    </channel>
</rss>