<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://mathpuzzlewiki.com/index.php?action=history&amp;feed=atom&amp;title=Sum_ratio</id>
	<title>Sum ratio - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://mathpuzzlewiki.com/index.php?action=history&amp;feed=atom&amp;title=Sum_ratio"/>
	<link rel="alternate" type="text/html" href="http://mathpuzzlewiki.com/index.php?title=Sum_ratio&amp;action=history"/>
	<updated>2026-04-03T22:31:37Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.44.0</generator>
	<entry>
		<id>http://mathpuzzlewiki.com/index.php?title=Sum_ratio&amp;diff=1042&amp;oldid=prev</id>
		<title>Oscarlevin: Created page with &quot;Here is a puzzle magic trick to amaze your friends  ==Puzzle==  The magician asks a volunteer to secretly pick any two 2-digit numbers and add them together.  The the magician...&quot;</title>
		<link rel="alternate" type="text/html" href="http://mathpuzzlewiki.com/index.php?title=Sum_ratio&amp;diff=1042&amp;oldid=prev"/>
		<updated>2012-11-25T23:20:46Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;Here is a puzzle magic trick to amaze your friends  ==Puzzle==  The magician asks a volunteer to secretly pick any two 2-digit numbers and add them together.  The the magician...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;Here is a puzzle magic trick to amaze your friends&lt;br /&gt;
&lt;br /&gt;
==Puzzle==&lt;br /&gt;
&lt;br /&gt;
The magician asks a volunteer to secretly pick any two 2-digit numbers and add them together.  The the magician instructs the volunteer to take the largest two numbers from the three numbers (the original 2 and the sum) and add them together.  Again, the volunteer is to take the largest two numbers (of the four now) and add them.  The volunteer keeps doing this as often as they want, always adding the largest two numbers.  When the volunteer is satisfied, there is one more task.  They must take the largest number and &amp;#039;&amp;#039;divide&amp;#039;&amp;#039; it by the second largest.  The magician, without ever looking at any of the numbers, correctly identifies the ration as approximately 1.61803398...&lt;br /&gt;
&lt;br /&gt;
How?&lt;br /&gt;
&lt;br /&gt;
[[Category: Discrete math]]&lt;br /&gt;
[[Category: New]]&lt;/div&gt;</summary>
		<author><name>Oscarlevin</name></author>
	</entry>
</feed>