<?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"><channel><title><![CDATA[RSS Feed]]></title><description><![CDATA[RSS Feed]]></description><link>http://direct.ecency.com</link><image><url>http://direct.ecency.com/logo512.png</url><title>RSS Feed</title><link>http://direct.ecency.com</link></image><generator>RSS for Node</generator><lastBuildDate>Mon, 13 Apr 2026 16:11:24 GMT</lastBuildDate><atom:link href="http://direct.ecency.com/created/gcd/rss.xml" rel="self" type="application/rss+xml"/><item><title><![CDATA[Mathematics - Number Theory - Diophantine Equations]]></title><description><![CDATA[Introduction Hey it's a me again @drifter1! First of all, I'm very sorry for the loooong break. I had to do a lot in my Master' thesis and was also promoted at the job I'm doing in parallel with my studies.]]></description><link>http://direct.ecency.com/hive-163521/@drifter1/mathematics-number-theory-diophantine-equations</link><guid isPermaLink="true">http://direct.ecency.com/hive-163521/@drifter1/mathematics-number-theory-diophantine-equations</guid><category><![CDATA[hive-163521]]></category><dc:creator><![CDATA[drifter1]]></dc:creator><pubDate>Wed, 27 Sep 2023 12:30:54 GMT</pubDate><enclosure url="https://images.ecency.com/p/GTCx6Xsvc3wXZhyNxEJ5WDGgLNXxZ75RgdFDMMRVYyDupeMUhjdg?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Mathematics - Number Theory - GCD and LCM]]></title><description><![CDATA[Introduction Hey it's a me again @drifter1! Today we continue with Mathematics, and more specifically the "Number Theory" series, in order to get into GCD and LCM. The Greatest Common Divisor]]></description><link>http://direct.ecency.com/hive-163521/@drifter1/mathematics-number-theory-gcd-and-lcm</link><guid isPermaLink="true">http://direct.ecency.com/hive-163521/@drifter1/mathematics-number-theory-gcd-and-lcm</guid><category><![CDATA[hive-163521]]></category><dc:creator><![CDATA[drifter1]]></dc:creator><pubDate>Mon, 03 Oct 2022 09:08:18 GMT</pubDate><enclosure url="https://images.ecency.com/p/82kPqomaPXmNsjpE7hf2aYgaUbPjnEC2cqvEymMK81av?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Image Protocol test]]></title><description><![CDATA[​]]></description><link>http://direct.ecency.com/hive-191050/@kwij.xyz/image-protocol-test</link><guid isPermaLink="true">http://direct.ecency.com/hive-191050/@kwij.xyz/image-protocol-test</guid><category><![CDATA[hive-191050]]></category><dc:creator><![CDATA[kwij.xyz]]></dc:creator><pubDate>Wed, 05 Jan 2022 17:25:30 GMT</pubDate><enclosure url="https://images.ecency.com/p/JvFFVmatwWHT5Fvr9KYC2gxEN3P7oD11Skv4rcAgekC5EES9qjUgPssWUZtRuaKEE3MWGWq4NHK6TDWVWWp4aeB6S3QbAWYQzqAGQSbrBhzPEvcqPmhEkZdWcarK68wBJ9Q6acg3R7?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Finding The Highest Common Factor(HCF) Of Two Numbers In Python]]></title><description><![CDATA[Image Source In mathematics, the terms- Highest Common Factor(HCF) and Greatest Common Divisor(GCD) mean the same thing. HCF of a two or more number is a single highest number that perfectly divides all]]></description><link>http://direct.ecency.com/hive-163521/@leoumesh/finding-the-highest-common-factor</link><guid isPermaLink="true">http://direct.ecency.com/hive-163521/@leoumesh/finding-the-highest-common-factor</guid><category><![CDATA[hive-163521]]></category><dc:creator><![CDATA[leoumesh]]></dc:creator><pubDate>Wed, 08 Dec 2021 03:42:24 GMT</pubDate><enclosure url="https://images.ecency.com/p/PB8ro82ZpZP35bVGjGoE93K3E4U5KX8KtMBJ2rgRJT2wZQ6r24N9xEsFrUdNNpo47Z1F9PJdJnjpg16TxL4rVXgcyekX58mZQtDa4GAvLVVsaPmG?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[11-11-11 11:10]]></title><description><![CDATA[-1]]></description><link>http://direct.ecency.com/log/@xaviorfx/11-11-11-11-10</link><guid isPermaLink="true">http://direct.ecency.com/log/@xaviorfx/11-11-11-11-10</guid><category><![CDATA[log]]></category><dc:creator><![CDATA[xaviorfx]]></dc:creator><pubDate>Mon, 12 Nov 2018 05:10:42 GMT</pubDate></item><item><title><![CDATA[IOS swift 병렬 프로그래밍(Concurrency Programming)]]></title><description><![CDATA[개발도구 : xcode 9.4 언어 및 버전 : swift 4.1 swift 병렬 프로그래밍(Concurrency Programming) Thread operationQueue GCD(Grand Centeral Dispatch) 1. Thread 쓰레드 선언은 다음과 같다. let thread_one = Thread(target: self, selector:]]></description><link>http://direct.ecency.com/ios/@xmasdolf/ios-swift-concurrency-programming</link><guid isPermaLink="true">http://direct.ecency.com/ios/@xmasdolf/ios-swift-concurrency-programming</guid><category><![CDATA[ios]]></category><dc:creator><![CDATA[xmasdolf]]></dc:creator><pubDate>Mon, 11 Jun 2018 04:56:21 GMT</pubDate></item><item><title><![CDATA[Highest Common Factor (HCF) via LCM Method]]></title><description><![CDATA[<html> <p><iframe width="560" height="315" src=" frameborder="0" allow="autoplay; encrypted-media" allowfullscreen></iframe></p> </html> ]]></description><link>http://direct.ecency.com/mathematics/@si118yt118si/highest-common-factor-hcf-via-lcm-method</link><guid isPermaLink="true">http://direct.ecency.com/mathematics/@si118yt118si/highest-common-factor-hcf-via-lcm-method</guid><category><![CDATA[mathematics]]></category><dc:creator><![CDATA[si118yt118si]]></dc:creator><pubDate>Sun, 11 Feb 2018 13:09:30 GMT</pubDate><enclosure url="https://images.ecency.com/p/x7L2VSNEiyA8Ez5qcckihcYsuqj7dUBcr6bWXERFoiZCTvyBwdShu8iTe6bxWxvDmsEvsRk6PCnEBUi?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Implementation of Euclid's algorithm in Python]]></title><description><![CDATA[First of all let's have a quick look at the definition of the Euclidean algorithm from Wikipedia: In mathematics, the Euclidean algorithm, or Euclid's algorithm, is an efficient method for computing the]]></description><link>http://direct.ecency.com/python/@luj1/implement-euclid-s-algorithm-in-python</link><guid isPermaLink="true">http://direct.ecency.com/python/@luj1/implement-euclid-s-algorithm-in-python</guid><category><![CDATA[python]]></category><dc:creator><![CDATA[luj1]]></dc:creator><pubDate>Sat, 20 Jan 2018 13:30:12 GMT</pubDate><enclosure url="https://images.ecency.com/p/8SzwQc8j2KJb4ARrxQxCjX4jizub4U5CAK3WwB89psayRSLyBX9MswDeE6qYHKnryMnBVhkP3GeT46VZm4SsrULUB1j36EC3bi2yUBvA29qs9sHa1m8?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[FINDING GREATEST COMMON FACTOR - GCD]]></title><description><![CDATA[Yesterday I did a post on times tables which are the key to multiply or divide the numbers. Today there is another application of times tables and which is the Greatest Common Factor also known as gcf.]]></description><link>http://direct.ecency.com/math/@mathworksheets/finding-greatest-common-factor-gcd</link><guid isPermaLink="true">http://direct.ecency.com/math/@mathworksheets/finding-greatest-common-factor-gcd</guid><category><![CDATA[math]]></category><dc:creator><![CDATA[mathworksheets]]></dc:creator><pubDate>Fri, 17 Feb 2017 19:08:45 GMT</pubDate><enclosure url="https://images.ecency.com/p/MvwLKy3SfvJwXFKCRMDAFrt961K4AWxqXBvnhhd6N?format=match&amp;mode=fit" length="0" type="false"/></item></channel></rss>