<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	
	>
<channel>
	<title>Comments on: Computer Algorithms: Karatsuba Fast Multiplication</title>
	<atom:link href="/2012/05/15/computer-algorithms-karatsuba-fast-multiplication/feed/" rel="self" type="application/rss+xml" />
	<link>/2012/05/15/computer-algorithms-karatsuba-fast-multiplication/</link>
	<description>on web development</description>
	<lastBuildDate>Fri, 26 Oct 2018 21:40:18 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>https://wordpress.org/?v=5.0.3</generator>
	<item>
		<title>By: Abelardo</title>
		<link>/2012/05/15/computer-algorithms-karatsuba-fast-multiplication/comment-page-1/#comment-465854</link>
		<dc:creator><![CDATA[Abelardo]]></dc:creator>
		<pubDate>Mon, 18 Sep 2017 11:18:35 +0000</pubDate>
		<guid isPermaLink="false">/?p=3121#comment-465854</guid>
		<description><![CDATA[Hello world,

Interesting article!

You mentioned:
&quot;Finally xy will become:

xy = a * B^2m + b * B^m + c&quot;

so,  B² is a another way to multiply terms =&#062; B * B  (yes, of course: B*B can be replaced by &#039;B + B ...&#039; &#039;B&#039; times). Then, he didn&#039;t get to avoid the 4th multiplication!!!???

By other hand, you can replace &#039;m ^ n&#039; in a function which implements a sum:
1st step) It represents like a multiplication: m * m * m.... (n times) 
and finally
2nd step) ...like a sum (m * m) = m + m + ... (several times).

Example:
2³ =&#062; 2 * 2 * 2 = (2 *2) * 2 = (4) * 2 = (2 + 2) + (2 + 2) = 8
3² =&#062; 3 * 3 = (3 + 3) + 3 = (6) + 3 = 9
4⁴ =&#062; 4 * 4 * 4 *4 = (4 + 4) + (4 + 4) + (4 + 4) + (4 + 4) + (4 + 4)  ...32 times!

Should many sum operations cause a problem to the cpu???

Nice blog!!!!

Best regards,
Abelardo]]></description>
		<content:encoded><![CDATA[<p>Hello world,</p>
<p>Interesting article!</p>
<p>You mentioned:<br />
&#8220;Finally xy will become:</p>
<p>xy = a * B^2m + b * B^m + c&#8221;</p>
<p>so,  B² is a another way to multiply terms =&gt; B * B  (yes, of course: B*B can be replaced by &#8216;B + B &#8230;&#8217; &#8216;B&#8217; times). Then, he didn&#8217;t get to avoid the 4th multiplication!!!???</p>
<p>By other hand, you can replace &#8216;m ^ n&#8217; in a function which implements a sum:<br />
1st step) It represents like a multiplication: m * m * m&#8230;. (n times)<br />
and finally<br />
2nd step) &#8230;like a sum (m * m) = m + m + &#8230; (several times).</p>
<p>Example:<br />
2³ =&gt; 2 * 2 * 2 = (2 *2) * 2 = (4) * 2 = (2 + 2) + (2 + 2) = 8<br />
3² =&gt; 3 * 3 = (3 + 3) + 3 = (6) + 3 = 9<br />
4⁴ =&gt; 4 * 4 * 4 *4 = (4 + 4) + (4 + 4) + (4 + 4) + (4 + 4) + (4 + 4)  &#8230;32 times!</p>
<p>Should many sum operations cause a problem to the cpu???</p>
<p>Nice blog!!!!</p>
<p>Best regards,<br />
Abelardo</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Shaikhul</title>
		<link>/2012/05/15/computer-algorithms-karatsuba-fast-multiplication/comment-page-1/#comment-448943</link>
		<dc:creator><![CDATA[Shaikhul]]></dc:creator>
		<pubDate>Tue, 11 Apr 2017 04:14:43 +0000</pubDate>
		<guid isPermaLink="false">/?p=3121#comment-448943</guid>
		<description><![CDATA[Hi Thanks for the nice explanation, it works for equal size of X and Y but doesn&#039;t for different size of X and Y, it would be great if you could update the example with different size of X and Y.]]></description>
		<content:encoded><![CDATA[<p>Hi Thanks for the nice explanation, it works for equal size of X and Y but doesn&#8217;t for different size of X and Y, it would be great if you could update the example with different size of X and Y.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Foysal Mamun</title>
		<link>/2012/05/15/computer-algorithms-karatsuba-fast-multiplication/comment-page-1/#comment-442434</link>
		<dc:creator><![CDATA[Foysal Mamun]]></dc:creator>
		<pubDate>Sat, 18 Feb 2017 20:37:31 +0000</pubDate>
		<guid isPermaLink="false">/?p=3121#comment-442434</guid>
		<description><![CDATA[Great help for me. Clean explanation.
Thanks.]]></description>
		<content:encoded><![CDATA[<p>Great help for me. Clean explanation.<br />
Thanks.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: samreen</title>
		<link>/2012/05/15/computer-algorithms-karatsuba-fast-multiplication/comment-page-1/#comment-402491</link>
		<dc:creator><![CDATA[samreen]]></dc:creator>
		<pubDate>Mon, 28 Mar 2016 16:35:05 +0000</pubDate>
		<guid isPermaLink="false">/?p=3121#comment-402491</guid>
		<description><![CDATA[thanks for good work]]></description>
		<content:encoded><![CDATA[<p>thanks for good work</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Himanshu</title>
		<link>/2012/05/15/computer-algorithms-karatsuba-fast-multiplication/comment-page-1/#comment-148303</link>
		<dc:creator><![CDATA[Himanshu]]></dc:creator>
		<pubDate>Fri, 31 Oct 2014 08:02:27 +0000</pubDate>
		<guid isPermaLink="false">/?p=3121#comment-148303</guid>
		<description><![CDATA[Hi,

Thanks for the article, it is really well explained with great examples.
But I tried implementing in java based on your code for PHP but you are considering different length for X and Y variable while dividing into two parts.
It was not working for me with different size(xlen/2, ylen/2) of X and Y so I tried with the min value of (xlen/2, ylen/2), and then its working fine.
Could you please tell me why this is not working in case of your logic.

Thanks for the great article]]></description>
		<content:encoded><![CDATA[<p>Hi,</p>
<p>Thanks for the article, it is really well explained with great examples.<br />
But I tried implementing in java based on your code for PHP but you are considering different length for X and Y variable while dividing into two parts.<br />
It was not working for me with different size(xlen/2, ylen/2) of X and Y so I tried with the min value of (xlen/2, ylen/2), and then its working fine.<br />
Could you please tell me why this is not working in case of your logic.</p>
<p>Thanks for the great article</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Dakota</title>
		<link>/2012/05/15/computer-algorithms-karatsuba-fast-multiplication/comment-page-1/#comment-21956</link>
		<dc:creator><![CDATA[Dakota]]></dc:creator>
		<pubDate>Sat, 05 Apr 2014 20:30:21 +0000</pubDate>
		<guid isPermaLink="false">/?p=3121#comment-21956</guid>
		<description><![CDATA[What will be the no of single digits multiplications to compute the product of two 6 digits numbers?]]></description>
		<content:encoded><![CDATA[<p>What will be the no of single digits multiplications to compute the product of two 6 digits numbers?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Nezza</title>
		<link>/2012/05/15/computer-algorithms-karatsuba-fast-multiplication/comment-page-1/#comment-20715</link>
		<dc:creator><![CDATA[Nezza]]></dc:creator>
		<pubDate>Mon, 10 Feb 2014 23:39:25 +0000</pubDate>
		<guid isPermaLink="false">/?p=3121#comment-20715</guid>
		<description><![CDATA[Hi there, this is very simple and easy to understand, thank you and you have done a grate job.]]></description>
		<content:encoded><![CDATA[<p>Hi there, this is very simple and easy to understand, thank you and you have done a grate job.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Niko</title>
		<link>/2012/05/15/computer-algorithms-karatsuba-fast-multiplication/comment-page-1/#comment-18698</link>
		<dc:creator><![CDATA[Niko]]></dc:creator>
		<pubDate>Fri, 24 May 2013 10:12:07 +0000</pubDate>
		<guid isPermaLink="false">/?p=3121#comment-18698</guid>
		<description><![CDATA[Hey that&#039;s a very good article which you wrote there.
Thanks a lot.
I habe only a question, to say it better, a problem executing your code on PHP.
I dont&#039;t get the correct result and i can not figure it out why. First of i got a fatal error because the function &quot;sum()&quot; does not exists. I implemented it but i dont know how exactly, becuase the parameters which are loaded in the sum() function are arrays.
If i got this right, we have to sum alla array-values and the the 2 sums again, and return it.
I hope this is still reading someone and could help me.

Thank you.]]></description>
		<content:encoded><![CDATA[<p>Hey that&#8217;s a very good article which you wrote there.<br />
Thanks a lot.<br />
I habe only a question, to say it better, a problem executing your code on PHP.<br />
I dont&#8217;t get the correct result and i can not figure it out why. First of i got a fatal error because the function &#8220;sum()&#8221; does not exists. I implemented it but i dont know how exactly, becuase the parameters which are loaded in the sum() function are arrays.<br />
If i got this right, we have to sum alla array-values and the the 2 sums again, and return it.<br />
I hope this is still reading someone and could help me.</p>
<p>Thank you.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Priyanka Kumari</title>
		<link>/2012/05/15/computer-algorithms-karatsuba-fast-multiplication/comment-page-1/#comment-18666</link>
		<dc:creator><![CDATA[Priyanka Kumari]]></dc:creator>
		<pubDate>Thu, 09 May 2013 07:10:29 +0000</pubDate>
		<guid isPermaLink="false">/?p=3121#comment-18666</guid>
		<description><![CDATA[very neatly made us understand the algorithm.... gud wrk really helpful!!!]]></description>
		<content:encoded><![CDATA[<p>very neatly made us understand the algorithm&#8230;. gud wrk really helpful!!!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Stoimen</title>
		<link>/2012/05/15/computer-algorithms-karatsuba-fast-multiplication/comment-page-1/#comment-18508</link>
		<dc:creator><![CDATA[Stoimen]]></dc:creator>
		<pubDate>Mon, 11 Feb 2013 09:08:56 +0000</pubDate>
		<guid isPermaLink="false">/?p=3121#comment-18508</guid>
		<description><![CDATA[Of course, you can use the associative rule.]]></description>
		<content:encoded><![CDATA[<p>Of course, you can use the associative rule.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
