<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	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/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>PREPARE FOR MBA &#187; Divisibility</title>
	<atom:link href="http://www.mbatutes.com/tag/divisibility/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.mbatutes.com</link>
	<description>Become a Manager</description>
	<lastBuildDate>Sun, 09 Oct 2011 14:22:14 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.1</generator>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
			<item>
		<title>Divisible by 7, 11 and 13</title>
		<link>http://www.mbatutes.com/divisible-by-7-11-and-13/</link>
		<comments>http://www.mbatutes.com/divisible-by-7-11-and-13/#comments</comments>
		<pubDate>Sun, 24 Aug 2008 17:45:46 +0000</pubDate>
		<dc:creator>Gaurav</dc:creator>
				<category><![CDATA[Quant]]></category>
		<category><![CDATA[Divisibility]]></category>

		<guid isPermaLink="false">http://www.mbatutes.com/?p=60</guid>
		<description><![CDATA[
A number is divisible by &#8230;&#8230;..By 7, 11, and 13 if it consists of but four places, the first and fourth being occupied by the same
significant figures, and the second and third by ciphers.”
(A cipher is a 0.) It continues:
“Thus, 2002, 3003, and 5005 are divisible by 7, 11, and 13.”
Proof:  7&#215;11x13 = 1001Similar Posts:

Divisibility
DIVISIBILITY [...]]]></description>
			<content:encoded><![CDATA[<p class="first-child "><a href="http://www.mbatutes.com/Images/Divisible by 7,11,13.jpg"><img class="alignnone" title="Divisible by 7,11,13" src="http://www.mbatutes.com/Images/Divisible by 7,11,13.jpg" alt="" width="303" height="405" /></a></p>
<p><span title="A" class="cap"><span>A</span></span> number is divisible by &#8230;&#8230;..By 7, 11, and 13 if it consists of but four places, the first and fourth being occupied by the same<br />
significant figures, and the second and third by ciphers.”<br />
(<strong>A cipher is a 0</strong>.) It continues:<br />
“Thus, 2002, 3003, and 5005 are divisible by 7, 11, and 13.”</p>
<p><strong>Proof</strong>:  7&#215;11x13 = 1001<strong>Similar Posts:</strong>
<ul class="similar-posts">
<li><a href="http://www.mbatutes.com/divisibility/" rel="bookmark" title="July 2, 2008">Divisibility</a></li>
<li><a href="http://www.mbatutes.com/divisibility-rule-for-7/" rel="bookmark" title="August 12, 2008">DIVISIBILITY RULE FOR 7</a></li>
<li><a href="http://www.mbatutes.com/use-negative-remainders/" rel="bookmark" title="July 19, 2008">Use Negative Remainders</a></li>
</ul>
<p><!-- Similar Posts took 2.141 ms --></p>
]]></content:encoded>
			<wfw:commentRss>http://www.mbatutes.com/divisible-by-7-11-and-13/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>DIVISIBILITY RULE FOR 7</title>
		<link>http://www.mbatutes.com/divisibility-rule-for-7/</link>
		<comments>http://www.mbatutes.com/divisibility-rule-for-7/#comments</comments>
		<pubDate>Tue, 12 Aug 2008 17:25:21 +0000</pubDate>
		<dc:creator>Gaurav</dc:creator>
				<category><![CDATA[Quant]]></category>
		<category><![CDATA[Divisibility]]></category>

		<guid isPermaLink="false">http://www.mbatutes.com/?p=41</guid>
		<description><![CDATA[A whole number, N, is a multiple of 7 if the following procedure leads to
another multiple of 7*:
(1) Subtract the ones digit from N,
(2) Dividing the result by 10, and
(3) Subtract—from that result—twice the original ones digit.
*the multiple of 7 may be 0 or negative.
This is best explained in an example. Consider 7 x 39 [...]]]></description>
			<content:encoded><![CDATA[<p class="first-child "><span title="A" class="cap"><span>A</span></span> whole number, N, is a multiple of 7 if the following procedure leads to<br />
another multiple of 7*:<img class="alignright" style="float: right;" src="http://www.mbatutes.com/Images/Divisibility.gif" alt="Divisibility rule for 7" width="452" height="296" /><br />
(1) <strong>Subtract the ones digit from N,</strong><br />
(2) <strong>Dividing the result by 10, and</strong><br />
(3) <strong>Subtract—from that result—twice the original ones digit.</strong><br />
*the multiple of 7 may be 0 or negative.<br />
This is best explained in an example. Consider 7 x 39 = 273, so 273 is a multiple of 7. Applying the<br />
Divisibility Rule for 7 to 273 yields the following:</p>
<p>(1) Subtract the ones digit from N: Subtract 3 from 273: 273<br />
– 3<br />
270<br />
(2) Dividing the result by 10: Divide 270 by 10: 270 ÷ 10 = 27<br />
(3) Subtract—from that result—twice<br />
the original ones digit: Subtract, from 27, twice 3:</p>
<p>27</p>
<p>– 6</p>
<p>21:  a multiple of 7<br />
Since this procedure leads to a multiple of 7, it must be that the original number, 273, is a<br />
multiple of 7, as shown in this long division:<br />
A much quicker way to use the procedure is shown here<br />
2 7 3<br />
– 6<br />
2 1<br />
x 2<br />
Since 21 is a multiple of 7, it must<br />
be that 273 is a multiple of 7.</p>
<p>Let’s apply this more direct procedure to a larger multiple of 7: 7 x 568 = 3,976:<br />
3 9 7 6<br />
– 1 2<br />
3 8 5<br />
x 2<br />
We don’t know if 385 is a multiple of 7<br />
or not, so we continue the procedure.<br />
3 8 5<br />
– 1 0<br />
2 8</p>
<p>Since 28 is a multiple of 7, it must be that<br />
both 385 and 3,976 are multiples of 7.<br />
What is the proof behind this procedure?<br />
Consider, without loss of generality, a three digit number, N = 100a + 10b + c, where a, b, and c are<br />
single digits, a ≠ 0.<br />
Applying the Divisibility Rule for 7 to 100a + 10b + c, we get:<br />
(1) Subtract c: 100a + 10b<br />
(2) Divide by 10: 10a + b<br />
(3) Subtract twice c: 10a + b – 2c<br />
Claim: 100a + 10b + c is a multiple of 7 if and only if 10a + b – 2c is a multiple of 7<br />
P<strong>Similar Posts:</strong>
<ul class="similar-posts">
<li><a href="http://www.mbatutes.com/divisibility/" rel="bookmark" title="July 2, 2008">Divisibility</a></li>
<li><a href="http://www.mbatutes.com/use-negative-remainders/" rel="bookmark" title="July 19, 2008">Use Negative Remainders</a></li>
<li><a href="http://www.mbatutes.com/divisible-by-7-11-and-13/" rel="bookmark" title="August 24, 2008">Divisible by 7, 11 and 13</a></li>
</ul>
<p><!-- Similar Posts took 2.206 ms --></p>
]]></content:encoded>
			<wfw:commentRss>http://www.mbatutes.com/divisibility-rule-for-7/feed/</wfw:commentRss>
		<slash:comments>7</slash:comments>
		</item>
		<item>
		<title>Use Negative Remainders</title>
		<link>http://www.mbatutes.com/use-negative-remainders/</link>
		<comments>http://www.mbatutes.com/use-negative-remainders/#comments</comments>
		<pubDate>Sat, 19 Jul 2008 16:18:31 +0000</pubDate>
		<dc:creator>Gaurav</dc:creator>
				<category><![CDATA[Quant]]></category>
		<category><![CDATA[Divisibility]]></category>
		<category><![CDATA[tips]]></category>

		<guid isPermaLink="false">http://www.mbatutes.com/?p=27</guid>
		<description><![CDATA[Though Remainders are never negative but somtime some questions of finding the remainder become easy by using Negative Remainders. 
First of all, What is Negative Remainder:
eg. When 14 is divided by 8
Then, 14= 8&#215;1+6
or
14=8&#215;2-2
Therefore, We have two remainder and they are +6 and -2 where (-2) is the Negative Remainder. I hope I am able [...]]]></description>
			<content:encoded><![CDATA[<p class="first-child "><span title="T" class="cap"><span>T</span></span>hough Remainders are never negative but somtime some questions of finding the remainder become easy by using <strong>Negative Remainders</strong>. <img style="float: right;" src="http://www.mbatutes.com/Images/remainder.gif" alt="Remainder" width="389" height="292" /></p>
<p>First of all, What is <strong>Negative Remainder</strong>:</p>
<p>eg. When 14 is divided by 8</p>
<p>Then, 14= 8&#215;1+6</p>
<p>or</p>
<p>14=8&#215;2-2</p>
<p><strong>Therefore, We have two remainder and they are +6 and -2 where (-2) is the Negative Remainder. I hope I am able to make it clear</strong>.</p>
<p>Now, I make a small assumption that you know the remainder theorum and you make use of it while calculating the remainder. Ok, Now lets take an example</p>
<p><strong>Q. </strong>Find the remainder when 14&#215;15 is divided by 8</p>
<p><strong>Ans</strong>. Traditional method: Find remainder after dividing 14 and 15 by 8, multiply them and find the final answer i.e</p>
<p>a)14/8= 8&#215;1+6</p>
<p>b)15/8=8&#215;1+7</p>
<p>c)find remainder after dividing 6&#215;7 by 8 = 42/8=8&#215;5+2</p>
<p>Therefore, Remainder is 2</p>
<p><strong>New method,</strong></p>
<p>a)14=8&#215;2-2 (<strong>minus 2 is the negative remainder</strong>)</p>
<p>b)15=8&#215;2-1 ( <strong>minus 1 is the negative remainder</strong>)</p>
<p>Final Remainder is =<strong> (-2)x(-1)</strong> divided by 8 =2</p>
<p>Therefore Remainder is 2.</p>
<p>Though both the method looks same in calculation level but when you some difficult problem then this negative remainder method will help a lot and will save some time.s</p>
<p>Remember: If at the end remainder is negative then substract that number from the divisor for eg. If the answer was (-3) then remainder would be = 8-3=5.<strong>Similar Posts:</strong>
<ul class="similar-posts">
<li><a href="http://www.mbatutes.com/calender/" rel="bookmark" title="August 14, 2008">CALENDER</a></li>
<li><a href="http://www.mbatutes.com/square-of-a-two-digit-number/" rel="bookmark" title="July 29, 2008">Square of a two digit number</a></li>
<li><a href="http://www.mbatutes.com/divisibility-rule-for-7/" rel="bookmark" title="August 12, 2008">DIVISIBILITY RULE FOR 7</a></li>
<li><a href="http://www.mbatutes.com/easy-way-to-multiply-two-numbers/" rel="bookmark" title="August 31, 2008">Easy Way to Multiply two numbers</a></li>
<li><a href="http://www.mbatutes.com/divisibility/" rel="bookmark" title="July 2, 2008">Divisibility</a></li>
</ul>
<p><!-- Similar Posts took 3.471 ms --></p>
]]></content:encoded>
			<wfw:commentRss>http://www.mbatutes.com/use-negative-remainders/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Divisibility</title>
		<link>http://www.mbatutes.com/divisibility/</link>
		<comments>http://www.mbatutes.com/divisibility/#comments</comments>
		<pubDate>Wed, 02 Jul 2008 18:47:00 +0000</pubDate>
		<dc:creator>Gaurav</dc:creator>
				<category><![CDATA[Quant]]></category>
		<category><![CDATA[Divisibility]]></category>

		<guid isPermaLink="false">http://www.mbatutes.com/?p=9</guid>
		<description><![CDATA[While checking the divisibilty test for number 7 I came across a new thing and i.e
Any six-digit, or twelve-digit, or eighteen-digit, or any such number with number of digits equal to multiple of 6, is divisible by EACH of 7, 11 and 13 if all of its digits are same . 
For example 666666, 888888888888 [...]]]></description>
			<content:encoded><![CDATA[<p class="first-child "><span title="W" class="cap"><span>W</span></span>hile checking the divisibilty test for number 7 I came across a new thing and i.e</p>
<p><strong>Any six-digit, or twelve-digit, or eighteen-digit, or any such number with number of digits equal to multiple of 6, is divisible by <strong><em>EACH </em></strong>of 7, 11 and 13 if all of its digits are <strong>same </strong>. </strong></p>
<p><strong>For example 666666, 888888888888 etc. are all divisible by 7, 11, and 13. </strong><strong>Similar Posts:</strong>
<ul class="similar-posts">
<li><a href="http://www.mbatutes.com/divisibility-rule-for-7/" rel="bookmark" title="August 12, 2008">DIVISIBILITY RULE FOR 7</a></li>
<li><a href="http://www.mbatutes.com/divisible-by-7-11-and-13/" rel="bookmark" title="August 24, 2008">Divisible by 7, 11 and 13</a></li>
<li><a href="http://www.mbatutes.com/use-negative-remainders/" rel="bookmark" title="July 19, 2008">Use Negative Remainders</a></li>
</ul>
<p><!-- Similar Posts took 2.164 ms --></p>
]]></content:encoded>
			<wfw:commentRss>http://www.mbatutes.com/divisibility/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

