<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href="http://www.blogger.com/styles/atom.css" type="text/css"?><feed xmlns='http://www.w3.org/2005/Atom' xmlns:openSearch='http://a9.com/-/spec/opensearchrss/1.0/' xmlns:georss='http://www.georss.org/georss' xmlns:gd='http://schemas.google.com/g/2005' xmlns:thr='http://purl.org/syndication/thread/1.0'><id>tag:blogger.com,1999:blog-15734381</id><updated>2011-12-14T21:51:17.594-05:00</updated><title type='text'>Walter Bowman's Mathematics Site</title><subtitle type='html'>Fun Facts About Mathematics, Help With Math Problems and Some Puzzles</subtitle><link rel='http://schemas.google.com/g/2005#feed' type='application/atom+xml' href='http://wlbmath.blogspot.com/feeds/posts/default'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/15734381/posts/default?max-results=100'/><link rel='alternate' type='text/html' href='http://wlbmath.blogspot.com/'/><link rel='hub' href='http://pubsubhubbub.appspot.com/'/><author><name>Walter Bowman</name><uri>http://www.blogger.com/profile/06797866186454948579</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='20' height='32' src='http://photos1.blogger.com/blogger/6465/1274/1600/wlb.jpg'/></author><generator version='7.00' uri='http://www.blogger.com'>Blogger</generator><openSearch:totalResults>3</openSearch:totalResults><openSearch:startIndex>1</openSearch:startIndex><openSearch:itemsPerPage>100</openSearch:itemsPerPage><entry><id>tag:blogger.com,1999:blog-15734381.post-112830237317772676</id><published>2005-09-14T19:51:00.000-04:00</published><updated>2005-10-02T21:19:33.213-04:00</updated><title type='text'>Number Divisibility Tests -- Simplifying Division</title><content type='html'>While division by small numbers is not very difficult, dividing into large numbers can take time that, for instance, could waste time on a timed test. A good example is reducing fractions to lowest terms. &lt;br /&gt;&lt;br /&gt;For example, let's reduce 72/504. &lt;br /&gt;&lt;br /&gt;The first thing you should notice is that both terms are even.  That means each term is divisible by 2. So, divide each term by 2 to get 36/252.  Again, they are even. Divide by 2 again and get 18/126. Even again! Divide by 2 to get 9/63. Now you can try to divide 63 by 9 and get 7. So the answer is 1/7.  &lt;br /&gt;&lt;br /&gt;If you're real good at long division, you may have just divided 504 by 72 to begin with. Remember, this is an example. &lt;br /&gt;&lt;br /&gt;I might have tried to divide 504 by 12, which is 42, giving 6/42 and then 1/7.  But, since I know some of these divisibility tests, I would have noticed that 7+2=9 which is divisible by 3 and 5+0+4=9 also. I would have divided by 3 first giving 24/168. 2+4=6 and 1+6+8=15 both divisible by 3 and reduced the fraction to 8/56 and then 1/7. Even faster, since 72/504 is divisible by 3 and by 2, it must be divisible by 6, which gives 12/84 right away.  From your 12 times table, you know 84 = 12 X 7 and gives you 1/7 quickly. Notice that 1+2=3 and 8+4=12, both divisible by 3 giving 4/28. Again, this is an example to make you think. Whatever is easiest for you is the way to go but always be open to new ideas and think outside the box.&lt;br /&gt;&lt;br /&gt;Using some of the following divisibility tests may simplify the process.&lt;br /&gt;&lt;br /&gt;An integer is divisible by:&lt;br /&gt;&lt;br /&gt;2 if and only if the last digit of the number is divisible by 2.&lt;br /&gt;&lt;br /&gt;3 if and only if the sum of its digits is divisible by 3.&lt;br /&gt;&lt;br /&gt;4 if and only if the number formed by its last two digits is divisible by 4.&lt;br /&gt;&lt;br /&gt;5 if and only if the last digit of the number is 0 or 5.&lt;br /&gt;&lt;br /&gt;6 if and only if the number is divisible by 2 and by 3.&lt;br /&gt;&lt;br /&gt;7 if and only if a new number formed by cycling the pattern {1, 3, 2, -1, -3, -2}multiplied by the digits in reverse order is divisible by 7. WHEW! Forget this one. It's easier to just divide by 7. An example is 175 is divisible by 7 since: Make a new number 571 (the reverse) and apply the pattern so that 1X&lt;strong&gt;5&lt;/strong&gt; + 3X&lt;strong&gt;7&lt;/strong&gt; + 2X&lt;strong&gt;1&lt;/strong&gt; = 5 + 21 + 2 = 28, which is divisible by 7.&lt;br /&gt;&lt;br /&gt;8 if and only if the number formed by its last three digits is divisible by 8. Note that 24 is divisible by 8 since 024 is divisible by 8.&lt;br /&gt;&lt;br /&gt;9 if and only if the sum of its digits is divisible by 9.&lt;br /&gt;&lt;br /&gt;10 if and only if the last digit of the number is 0.&lt;br /&gt;&lt;br /&gt;11 if and only if the sum of the digits in the odd-numbered places diminished by the sum of the digits in the even-numbered places is divisible by 11. Example, 121 is divisible by 11 since 1 + 1 - 2 = 0 is divisible by 11.&lt;br /&gt;&lt;br /&gt;12 if and only if the number is divisible by 3 and by 4.&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/15734381-112830237317772676?l=wlbmath.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://wlbmath.blogspot.com/feeds/112830237317772676/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=15734381&amp;postID=112830237317772676' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/15734381/posts/default/112830237317772676'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/15734381/posts/default/112830237317772676'/><link rel='alternate' type='text/html' href='http://wlbmath.blogspot.com/2005/09/number-divisibility-tests-simplifying.html' title='Number Divisibility Tests -- Simplifying Division'/><author><name>Walter Bowman</name><uri>http://www.blogger.com/profile/06797866186454948579</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='20' height='32' src='http://photos1.blogger.com/blogger/6465/1274/1600/wlb.jpg'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-15734381.post-112829506542149877</id><published>2005-09-05T17:55:00.000-04:00</published><updated>2005-10-02T19:46:39.063-04:00</updated><title type='text'>Methods of Proof</title><content type='html'>&lt;u&gt;&lt;b&gt;DIRECT PROOF:&lt;/b&gt;&lt;/u&gt;&lt;br /&gt;&lt;br /&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;At any stage of a proof, an implication may be replaced by its contrapositive {e.g., p = ~(~p)}. At any stage of a proof, any true expression may be replaced by another true expression {e.g., if the term sin²x is in an expression, (1 - cos²x) can be substituted}.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;u&gt;&lt;b&gt;INDIRECT PROOF:&lt;/b&gt;&lt;/u&gt;&lt;br /&gt;&lt;br /&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;If ~p is false, then p is true. Therefore, to prove p is true, assume ~p is true and show that a direct proof with this assumption leads to a contradiction.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;u&gt;&lt;b&gt;PROOF BY COINCIDENCE:&lt;/b&gt;&lt;/u&gt;&lt;br /&gt;&lt;br /&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;Assume two points or lines are different. Show that a direct proof with this assumption leads to a contradiction.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;u&gt;&lt;b&gt;MATHEMATICAL INDUCTION:&lt;/b&gt;&lt;/u&gt;&lt;br /&gt;&lt;br /&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;If a set A contains all integers n≥a and for all n in A a proposition p&lt;sub&gt;n&lt;/sub&gt; is to be proved, this can be done as follows:&lt;br /&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;(1) prove p&lt;sub&gt;a&lt;/sub&gt; is true (the initial case);&lt;br /&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;(2) assume then that p&lt;sub&gt;k&lt;/sub&gt; is true and prove p&lt;sub&gt;k&lt;/sub&gt;---&gt;p&lt;sub&gt;k+1&lt;/sub&gt; is true.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;u&gt;&lt;b&gt;REVERSING STEPS:&lt;/b&gt;&lt;/u&gt;&lt;br /&gt;&lt;br /&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;Assume what is to be proved is already true.  Perform valid operations until a result is obtained which is &lt;u&gt;known&lt;/u&gt; to be true.  Then reverse the steps (if this is possible) and the proof follows!&lt;br /&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/15734381-112829506542149877?l=wlbmath.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://wlbmath.blogspot.com/feeds/112829506542149877/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=15734381&amp;postID=112829506542149877' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/15734381/posts/default/112829506542149877'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/15734381/posts/default/112829506542149877'/><link rel='alternate' type='text/html' href='http://wlbmath.blogspot.com/2005/09/methods-of-proof.html' title='Methods of Proof'/><author><name>Walter Bowman</name><uri>http://www.blogger.com/profile/06797866186454948579</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='20' height='32' src='http://photos1.blogger.com/blogger/6465/1274/1600/wlb.jpg'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-15734381.post-112529252450107651</id><published>2005-08-29T01:05:00.000-04:00</published><updated>2005-09-07T00:27:12.810-04:00</updated><title type='text'>Tricky Questions</title><content type='html'>&lt;span style="font-family:times new roman;font-size:130%;"&gt;Are you ready to answer some tricky, but common sense type questions? Some of these were on apptitude tests for government civil service exams. Some have been around forever. Some I made up. Have fun!&lt;/span&gt;&lt;br /&gt;&lt;span style="font-family:Times New Roman;font-size:130%;"&gt;&lt;/span&gt;&lt;br /&gt;&lt;span style="font-family:Times New Roman;font-size:130%;"&gt;&lt;br /&gt;&lt;a href="http://wlbq.blogspot.com/2005_08_29_wlbq_archive.html"&gt;&lt;br /&gt;Questions 1 thru 10&lt;/a&gt;&lt;br /&gt;&lt;a href="http://wlbq.blogspot.com/2005_08_30_wlbq_archive.html"&gt;&lt;br /&gt;Questions 11 thru 20&lt;/a&gt;&lt;br /&gt;&lt;a href="http://wlbq.blogspot.com/2005_08_31_wlbq_archive.html"&gt;&lt;br /&gt;Questions 21 thru 30&lt;/a&gt;&lt;br /&gt;&lt;a href="http://wlbq.blogspot.com/2005_09_01_wlbq_archive.html"&gt;&lt;br /&gt;Questions 31 thru 40&lt;/a&gt;&lt;br /&gt;&lt;a href="http://wlbq.blogspot.com/2005_09_02_wlbq_archive.html"&gt;&lt;br /&gt;Questions 41 thru 50&lt;/a&gt;&lt;br /&gt;&lt;a href="http://wlbq.blogspot.com/2005_09_06_wlbq_archive.html"&gt;&lt;br /&gt;Questions 51 thru 60&lt;/a&gt;&lt;br /&gt;&lt;/span&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/15734381-112529252450107651?l=wlbmath.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://wlbmath.blogspot.com/feeds/112529252450107651/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=15734381&amp;postID=112529252450107651' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/15734381/posts/default/112529252450107651'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/15734381/posts/default/112529252450107651'/><link rel='alternate' type='text/html' href='http://wlbmath.blogspot.com/2005/08/tricky-questions.html' title='Tricky Questions'/><author><name>Walter Bowman</name><uri>http://www.blogger.com/profile/06797866186454948579</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='20' height='32' src='http://photos1.blogger.com/blogger/6465/1274/1600/wlb.jpg'/></author><thr:total>0</thr:total></entry></feed>
