<?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: Simple tricks for doing arithmetic in your head</title> <atom:link href="http://www.geeksaresexy.net/2008/02/19/simple-tricks-for-doing-arithmetic-in-your-head/feed/" rel="self" type="application/rss+xml" /><link>http://www.geeksaresexy.net/2008/02/19/simple-tricks-for-doing-arithmetic-in-your-head/</link> <description>tech, science, news and social issues for geeks</description> <lastBuildDate>Tue, 14 Feb 2012 07:53:04 +0000</lastBuildDate> <sy:updatePeriod>hourly</sy:updatePeriod> <sy:updateFrequency>1</sy:updateFrequency> <generator>http://wordpress.org/?v=</generator> <item><title>By: Naren</title><link>http://www.geeksaresexy.net/2008/02/19/simple-tricks-for-doing-arithmetic-in-your-head/#comment-306021</link> <dc:creator>Naren</dc:creator> <pubDate>Fri, 22 Jul 2011 03:44:34 +0000</pubDate> <guid isPermaLink="false">http://www.geeksaresexy.net/2008/02/19/simple-tricks-for-doing-arithmetic-in-your-head/#comment-306021</guid> <description>Anu Are you the same anu who did a course in AMES training centre back in 2000 in Auckland?.IF you are then reply back - naren_2010@hotmail.com </description> <content:encoded><![CDATA[<p>Anu</p><p>Are you the same anu who did a course in AMES training centre back in 2000 in Auckland?.IF you are then reply back &#8211; <a href="mailto:naren_2010@hotmail.com">naren_2010@hotmail.com</a></p> ]]></content:encoded> </item> <item><title>By: Sterling Camden</title><link>http://www.geeksaresexy.net/2008/02/19/simple-tricks-for-doing-arithmetic-in-your-head/#comment-256983</link> <dc:creator>Sterling Camden</dc:creator> <pubDate>Sun, 11 Jul 2010 17:53:00 +0000</pubDate> <guid isPermaLink="false">http://www.geeksaresexy.net/2008/02/19/simple-tricks-for-doing-arithmetic-in-your-head/#comment-256983</guid> <description>That&#039;s fascinating, Ari. </description> <content:encoded><![CDATA[<p>That&#039;s fascinating, Ari.</p> ]]></content:encoded> </item> <item><title>By: Sterling Camden</title><link>http://www.geeksaresexy.net/2008/02/19/simple-tricks-for-doing-arithmetic-in-your-head/#comment-276240</link> <dc:creator>Sterling Camden</dc:creator> <pubDate>Sun, 11 Jul 2010 17:53:00 +0000</pubDate> <guid isPermaLink="false">http://www.geeksaresexy.net/2008/02/19/simple-tricks-for-doing-arithmetic-in-your-head/#comment-276240</guid> <description>That&#039;s fascinating, Ari.</description> <content:encoded><![CDATA[<p>That&#8217;s fascinating, Ari.</p> ]]></content:encoded> </item> <item><title>By: Ari D Jordon</title><link>http://www.geeksaresexy.net/2008/02/19/simple-tricks-for-doing-arithmetic-in-your-head/#comment-256977</link> <dc:creator>Ari D Jordon</dc:creator> <pubDate>Sun, 11 Jul 2010 17:20:00 +0000</pubDate> <guid isPermaLink="false">http://www.geeksaresexy.net/2008/02/19/simple-tricks-for-doing-arithmetic-in-your-head/#comment-256977</guid> <description>Actually, there really are only three divisibility tricks.  Interestingly, they work in any base, not just base 10. For a given base B: 1) n B - 1: Take the last digit, multiply by n, and add it to remaining digits.  Repeat until you can tell whether the number is divisible by n B - 1 2) B^n: If the last n digits are divisible by B^n, so is the number 3) n B + 1: Take the last digit, multiply by n, and subtract it from the remaining digits.  Repeat until you can tell In each case, if the relevant number isn&#039;t prime, the rule also applies to all of its factors.  For base 10: 2, 4, 5, 8 are all cases of rule 2.  n=1 for 2 and 5, 2 for 4, 3 for 8 3 and 9 are cases of rule 1 with n=1 7 and 11 (and 3) are cases of rule 3.  For 11, n=1.  For 7, n=2 (2 * 10 + 1 = 21, factors are 3 and 7) </description> <content:encoded><![CDATA[<p>Actually, there really are only three divisibility tricks.  Interestingly, they work in any base, not just base 10.</p><p>For a given base B:</p><p>1) n B &#8211; 1: Take the last digit, multiply by n, and add it to remaining digits.  Repeat until you can tell whether the number is divisible by n B &#8211; 1</p><p>2) B^n: If the last n digits are divisible by B^n, so is the number</p><p>3) n B + 1: Take the last digit, multiply by n, and subtract it from the remaining digits.  Repeat until you can tell</p><p>In each case, if the relevant number isn&#039;t prime, the rule also applies to all of its factors.  For base 10:</p><p>2, 4, 5, 8 are all cases of rule 2.  n=1 for 2 and 5, 2 for 4, 3 for 8</p><p>3 and 9 are cases of rule 1 with n=1</p><p>7 and 11 (and 3) are cases of rule 3.  For 11, n=1.  For 7, n=2 (2 * 10 + 1 = 21, factors are 3 and 7)</p> ]]></content:encoded> </item> <item><title>By: Ari D Jordon</title><link>http://www.geeksaresexy.net/2008/02/19/simple-tricks-for-doing-arithmetic-in-your-head/#comment-276239</link> <dc:creator>Ari D Jordon</dc:creator> <pubDate>Sun, 11 Jul 2010 17:20:00 +0000</pubDate> <guid isPermaLink="false">http://www.geeksaresexy.net/2008/02/19/simple-tricks-for-doing-arithmetic-in-your-head/#comment-276239</guid> <description>Actually, there really are only three divisibility tricks.  Interestingly, they work in any base, not just base 10.For a given base B:1) n B - 1: Take the last digit, multiply by n, and add it to remaining digits.  Repeat until you can tell whether the number is divisible by n B - 1 2) B^n: If the last n digits are divisible by B^n, so is the number 3) n B + 1: Take the last digit, multiply by n, and subtract it from the remaining digits.  Repeat until you can tellIn each case, if the relevant number isn&#039;t prime, the rule also applies to all of its factors.  For base 10:2, 4, 5, 8 are all cases of rule 2.  n=1 for 2 and 5, 2 for 4, 3 for 8 3 and 9 are cases of rule 1 with n=1 7 and 11 (and 3) are cases of rule 3.  For 11, n=1.  For 7, n=2 (2 * 10 + 1 = 21, factors are 3 and 7)</description> <content:encoded><![CDATA[<p>Actually, there really are only three divisibility tricks.  Interestingly, they work in any base, not just base 10.</p><p>For a given base B:</p><p>1) n B &#8211; 1: Take the last digit, multiply by n, and add it to remaining digits.  Repeat until you can tell whether the number is divisible by n B &#8211; 1<br /> 2) B^n: If the last n digits are divisible by B^n, so is the number<br /> 3) n B + 1: Take the last digit, multiply by n, and subtract it from the remaining digits.  Repeat until you can tell</p><p>In each case, if the relevant number isn&#8217;t prime, the rule also applies to all of its factors.  For base 10:</p><p>2, 4, 5, 8 are all cases of rule 2.  n=1 for 2 and 5, 2 for 4, 3 for 8<br /> 3 and 9 are cases of rule 1 with n=1<br /> 7 and 11 (and 3) are cases of rule 3.  For 11, n=1.  For 7, n=2 (2 * 10 + 1 = 21, factors are 3 and 7)</p> ]]></content:encoded> </item> <item><title>By: Sean Crosser</title><link>http://www.geeksaresexy.net/2008/02/19/simple-tricks-for-doing-arithmetic-in-your-head/#comment-256971</link> <dc:creator>Sean Crosser</dc:creator> <pubDate>Sun, 11 Jul 2010 16:21:00 +0000</pubDate> <guid isPermaLink="false">http://www.geeksaresexy.net/2008/02/19/simple-tricks-for-doing-arithmetic-in-your-head/#comment-256971</guid> <description>Sorry, it turned out different than I typed in. It uses a variant of the first one, but it&#039;s actually able to do it with more that just x11. 35 x 7 = 245, and 35 x 60 = 2100, and 2100 + 245 = 2345. Mayb a big number isn&#039;t practical for an example, but 25 x 15, or smaller number with lower digits. </description> <content:encoded><![CDATA[<p>Sorry, it turned out different than I typed in. It uses a variant of the first one, but it&#039;s actually able to do it with more that just x11.</p><p>35 x 7 = 245, and 35 x 60 = 2100, and 2100 + 245 = 2345. Mayb a big number isn&#039;t practical for an example, but 25 x 15, or smaller number with lower digits.</p> ]]></content:encoded> </item> <item><title>By: Sean Crosser</title><link>http://www.geeksaresexy.net/2008/02/19/simple-tricks-for-doing-arithmetic-in-your-head/#comment-276238</link> <dc:creator>Sean Crosser</dc:creator> <pubDate>Sun, 11 Jul 2010 16:21:00 +0000</pubDate> <guid isPermaLink="false">http://www.geeksaresexy.net/2008/02/19/simple-tricks-for-doing-arithmetic-in-your-head/#comment-276238</guid> <description>Sorry, it turned out different than I typed in. It uses a variant of the first one, but it&#039;s actually able to do it with more that just x11.35 x 7 = 245, and 35 x 60 = 2100, and 2100 + 245 = 2345. Mayb a big number isn&#039;t practical for an example, but 25 x 15, or smaller number with lower digits.</description> <content:encoded><![CDATA[<p>Sorry, it turned out different than I typed in. It uses a variant of the first one, but it&#8217;s actually able to do it with more that just x11.</p><p>35 x 7 = 245, and 35 x 60 = 2100, and 2100 + 245 = 2345. Mayb a big number isn&#8217;t practical for an example, but 25 x 15, or smaller number with lower digits.</p> ]]></content:encoded> </item> <item><title>By: Sean Crosser</title><link>http://www.geeksaresexy.net/2008/02/19/simple-tricks-for-doing-arithmetic-in-your-head/#comment-256970</link> <dc:creator>Sean Crosser</dc:creator> <pubDate>Sun, 11 Jul 2010 16:15:00 +0000</pubDate> <guid isPermaLink="false">http://www.geeksaresexy.net/2008/02/19/simple-tricks-for-doing-arithmetic-in-your-head/#comment-256970</guid> <description>35 x 67 245 210 2345 </description> <content:encoded><![CDATA[<p>35</p><p>x 67</p><p> 245</p><p>210</p><p>2345</p> ]]></content:encoded> </item> <item><title>By: Sean Crosser</title><link>http://www.geeksaresexy.net/2008/02/19/simple-tricks-for-doing-arithmetic-in-your-head/#comment-276237</link> <dc:creator>Sean Crosser</dc:creator> <pubDate>Sun, 11 Jul 2010 16:15:00 +0000</pubDate> <guid isPermaLink="false">http://www.geeksaresexy.net/2008/02/19/simple-tricks-for-doing-arithmetic-in-your-head/#comment-276237</guid> <description>35 x 67 245 210 2345</description> <content:encoded><![CDATA[<p>35<br /> x 67<br /> 245<br /> 210<br /> 2345</p> ]]></content:encoded> </item> <item><title>By: Anu haridas</title><link>http://www.geeksaresexy.net/2008/02/19/simple-tricks-for-doing-arithmetic-in-your-head/#comment-252291</link> <dc:creator>Anu haridas</dc:creator> <pubDate>Mon, 10 May 2010 05:45:00 +0000</pubDate> <guid isPermaLink="false">http://www.geeksaresexy.net/2008/02/19/simple-tricks-for-doing-arithmetic-in-your-head/#comment-252291</guid> <description>Most of them know it b4:)try t includ someth new..thankyou </description> <content:encoded><![CDATA[<p>Most of them know it b4:)try t includ someth new..thankyou</p> ]]></content:encoded> </item> <item><title>By: Anu haridas</title><link>http://www.geeksaresexy.net/2008/02/19/simple-tricks-for-doing-arithmetic-in-your-head/#comment-276236</link> <dc:creator>Anu haridas</dc:creator> <pubDate>Mon, 10 May 2010 05:45:00 +0000</pubDate> <guid isPermaLink="false">http://www.geeksaresexy.net/2008/02/19/simple-tricks-for-doing-arithmetic-in-your-head/#comment-276236</guid> <description>Most of them know it b4:)try t includ someth new..thankyou</description> <content:encoded><![CDATA[<p>Most of them know it b4:)try t includ someth new..thankyou</p> ]]></content:encoded> </item> <item><title>By: Whimsy Girl &#187; Blog Archive &#187; find if a number is a multiple of (insert#)</title><link>http://www.geeksaresexy.net/2008/02/19/simple-tricks-for-doing-arithmetic-in-your-head/#comment-132680</link> <dc:creator>Whimsy Girl &#187; Blog Archive &#187; find if a number is a multiple of (insert#)</dc:creator> <pubDate>Sat, 31 Jan 2009 19:46:35 +0000</pubDate> <guid isPermaLink="false">http://www.geeksaresexy.net/2008/02/19/simple-tricks-for-doing-arithmetic-in-your-head/#comment-132680</guid> <description>[...] Credit goes to GEEKSARESEXY [...]</description> <content:encoded><![CDATA[<p>[...] Credit goes to GEEKSARESEXY [...]</p> ]]></content:encoded> </item> </channel> </rss>
<!-- Performance optimized by W3 Total Cache. Learn more: http://www.w3-edge.com/wordpress-plugins/

Minified using disk: basic
Page Caching using disk: basic (User agent is rejected)
Database Caching 9/14 queries in 0.007 seconds using disk: basic
Content Delivery Network via blog.geeksaresexytech.netdna-cdn.com

Served from: www.geeksaresexy.net @ 2012-02-14 05:24:22 -->
