<?xml version="1.0" encoding="UTF-8"?>
<!-- generator="wordpress/2.3.2" -->
<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/"
	>

<channel>
	<title>Ten Problems</title>
	<link>http://www.tenproblems.com</link>
	<description>Exploration, Calculation, Observation: Brain Teasers and Puzzles</description>
	<pubDate>Tue, 15 Jan 2008 17:05:34 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.3.2</generator>
	<language>en</language>
			<item>
		<title>The Pirate&#8217;s Treasures</title>
		<link>http://www.tenproblems.com/20080115/the-pirates-treasures/</link>
		<comments>http://www.tenproblems.com/20080115/the-pirates-treasures/#comments</comments>
		<pubDate>Tue, 15 Jan 2008 17:05:34 +0000</pubDate>
		<dc:creator>tony</dc:creator>
		
		<category><![CDATA[Classic]]></category>

		<category><![CDATA[Logical]]></category>

	<!-- AutoMeta Start -->
	<category>pirate</category>
	<category>pirates</category>
	<category>scheme</category>
	<category>majority</category>
	<category>divided</category>
	<category>plank</category>
	<category>presents</category>
	<category>coins</category>
	<category>Riddle</category>
	<category>about</category>
	<category>pirates</category>
	<category>sharing</category>
	<category>coins</category>
	<category>Game</category>
	<category>Theory</category>
	<category>Problem</category>
	<!-- AutoMeta End -->
	
		<guid isPermaLink="false">http://www.tenproblems.com/20080115/the-pirates-treasures/</guid>
		<description><![CDATA[Here&#8217;s a puzzle I heard from a friend yesterday. After a long drought devoid of any updates, I thought I&#8217;d post this one.
Five pirates have a chest of 100 gold coins to be divided amongst them. The pirates (A, B, C, D, E), are ranked by seniority, where A is the most senior pirate. The [...]]]></description>
			<content:encoded><![CDATA[<p>Here&#8217;s a puzzle I heard from a friend yesterday. After a long drought devoid of any updates, I thought I&#8217;d post this one.</p>
<p>Five pirates have a chest of 100 gold coins to be divided amongst them. The pirates (A, B, C, D, E), are ranked by seniority, where A is the most senior pirate. The rules are these:</p>
<p>1. Pirate A presents a scheme of dividing the coins to the other pirates, who then vote on this scheme. If there is a majority (Pirate A also participates in the vote), then the coins are divided. If no majority is reached, Pirate A walks the plank and we proceed to the next step.</p>
<p>2. Pirate B presents a scheme, and have the remaining pirates vote on it. If there is a majority, then the coins are divided. If there is a tie, Pirate B have the final say. If a majority votes against the scheme, Pirate B walks the plank and we proceed to Pirate C.</p>
<p>3. Same as Step 1, except with only 3 pirates left. If no consensus is reached, we continue until there is one pirate left.</p>
<p>The question is, how should Pirate A divide the coins such that he gets as many coins as possible, assuming all pirates are extremely smart and knows the optimal strategy?</p>
]]></content:encoded>
			<wfw:commentRss>http://www.tenproblems.com/20080115/the-pirates-treasures/feed/</wfw:commentRss>
		</item>
		<item>
		<title>The Golden Dilemma</title>
		<link>http://www.tenproblems.com/20070508/the-golden-dilemma/</link>
		<comments>http://www.tenproblems.com/20070508/the-golden-dilemma/#comments</comments>
		<pubDate>Wed, 09 May 2007 05:38:17 +0000</pubDate>
		<dc:creator>tony</dc:creator>
		
		<category><![CDATA[Classic]]></category>

		<category><![CDATA[Logical]]></category>

		<category><![CDATA[Mathematical]]></category>

	<!-- AutoMeta Start -->
	<category>piles</category>
	<category>counterfeit</category>
	<category>subpiles</category>
	<category>heavier</category>
	<category>coins</category>
	<category>gold</category>
	<category>lighter</category>
	<category>coin</category>
	<!-- AutoMeta End -->
	
		<guid isPermaLink="false">http://www.tenproblems.com/20070508/the-golden-dilemma/</guid>
		<description><![CDATA[I have 61 identical looking coins in my pocket. Two of the coins are counterfeit, and the other 59 are solid gold. The only difference between the counterfeit and the gold coins is their weight, but we don&#8217;t know which one is heavier. How can I use a balance to find out whether a counterfeit [...]]]></description>
			<content:encoded><![CDATA[<p>I have 61 identical looking coins in my pocket. Two of the coins are counterfeit, and the other 59 are solid gold. The only difference between the counterfeit and the gold coins is their weight, but we don&#8217;t know which one is heavier. How can I use a balance to find out whether a counterfeit coins or a gold coin is heavier?</p>
<p>Solution:</p>
<p><a href='javascript:void(null);' onclick="s_toggleDisplay(document.getElementById('SID197506232'), this, 'Show &#9660;', 'Hide &#9650;');">Show &#9660;</a></p>
<div id='SID197506232' style='display:none;'>
<p>First put aside one of the coins, and divide the other 60 coins in three piles of twenty, A, B, and C. Two of the three piles must weigh the same (without loss of generally, we call these two piles A and B). We&#8217;ll also know whether piles C is heavier or lighter.  Using W(X) to denote the weight of pile X, we divide piles A into two subpiles of 10 coins each and analyze the situation</p>
<p>Case 1: Suppose the two subpiles of A weigh the same, then A must contain no counterfeit. If W(A) > W(C), then a counterfeit coin is lighter than a gold coin, and vice versa.</p>
<p>Case 2: Suppose the two subpiles of A weigh different, then A contains a counterfeit coin. If W(A) > W(C), then a counterfeit is heavier than a gold coin, and vice versa.</p>
</div>
<p>There are many more ways to solve this problem. Can you figure them out?</p>
<p>Generalizing the problem to a total of 6k+1 coins (k a positive integer) including two counterfeits, can you find a general method?</p>
]]></content:encoded>
			<wfw:commentRss>http://www.tenproblems.com/20070508/the-golden-dilemma/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Trading Tires</title>
		<link>http://www.tenproblems.com/20070126/trading-tires/</link>
		<comments>http://www.tenproblems.com/20070126/trading-tires/#comments</comments>
		<pubDate>Sat, 27 Jan 2007 01:24:35 +0000</pubDate>
		<dc:creator>tony</dc:creator>
		
		<category><![CDATA[Mathematical]]></category>

	<!-- AutoMeta Start -->
	<category>rubber</category>
	<category>tires</category>
	<category>units</category>
	<category>tire</category>
	<category>travelled</category>
	<category>37500</category>
	<category>distance</category>
	<category>front</category>
	<!-- AutoMeta End -->
	
		<guid isPermaLink="false">http://www.tenproblems.com/20070126/trading-tires/</guid>
		<description><![CDATA[Mathematics problem involving maximization.]]></description>
			<content:encoded><![CDATA[<p>A truck has two front tires that need to be changed every 15 000 km and four back tires that need to be changed every 25 000 km. (The difference is due to the imbalance of the load in the truck.) How can you switch the front and back tires to maximize the distance travelled without getting any new tires? What is that distance?</p>
<p>The Maximum distance is 20454+6/11 km.</p>
<p>Let us call the amount of &#8216;usable&#8217; rubber in each tire a &#8216;rubber unit&#8217;, so we have six rubber units in total. From the information we are given, for every 1 km travelled, each front tire uses up 1/15000 rubber units and each back tire uses up 1/25000 rubber units. So, for every 1 km travelled, 2/15000 + 4/25000 = 11/37500 rubber units are used. Let us assume that the truck travels <em>x</em> km, so 11<em>x</em>/37500 rubber units are used. Since the maximum number of rubber units we have is 6, therefore 11<em>x</em>/37500 is less than or equal to 6, and x is less than or equal to 20454+6/11 km.</p>
<p>While we are traversing through this distance, we stop every third of the way, and switch two of the back tire with the front. In this case, each of the six tires would be installed at the front for 1/3 of the way and at the back 2/3 of the way. This way, upon arrive at our destination, all six tires will be used up.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.tenproblems.com/20070126/trading-tires/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Problem Five: Dell?</title>
		<link>http://www.tenproblems.com/20061116/problem-five-dell/</link>
		<comments>http://www.tenproblems.com/20061116/problem-five-dell/#comments</comments>
		<pubDate>Fri, 17 Nov 2006 03:00:03 +0000</pubDate>
		<dc:creator>Allen</dc:creator>
		
		<category><![CDATA[Logical]]></category>

	<!-- AutoMeta Start -->
	<category>dell</category>
	<category>real</category>
	<category>time</category>
	<category>change</category>
	<category>words</category>
	<category>letter</category>
	<category>make</category>
	<!-- AutoMeta End -->
	
		<guid isPermaLink="false">http://www.tenproblems.com/20061116/problem-five-dell/</guid>
		<description><![CDATA[Change one letter at a time to make Time out of Dell, but they have to be real words.
Dell
Time
]]></description>
			<content:encoded><![CDATA[<p>Change one letter at a time to make Time out of Dell, but they have to be real words.</p>
<p>Dell</p>
<p>Time</p>
]]></content:encoded>
			<wfw:commentRss>http://www.tenproblems.com/20061116/problem-five-dell/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Problem Four: Road Trip</title>
		<link>http://www.tenproblems.com/20061116/problem-four-road-trip/</link>
		<comments>http://www.tenproblems.com/20061116/problem-four-road-trip/#comments</comments>
		<pubDate>Fri, 17 Nov 2006 02:58:56 +0000</pubDate>
		<dc:creator>Allen</dc:creator>
		
		<category><![CDATA[Logical]]></category>

	<!-- AutoMeta Start -->
	<category>donation</category>
	<category>australian</category>
	<category>funds</category>
	<category>sing</category>
	<category>charity</category>
	<category>detective</category>
	<category>000</category>
	<category>give</category>
	<!-- AutoMeta End -->
	
		<guid isPermaLink="false">http://www.tenproblems.com/20061116/problem-four-road-trip/</guid>
		<description><![CDATA[Melissa sat in the office of Detective Sing.
&#8220;I met a man yesterday,&#8221; she said. &#8220;He&#8217;s trying to raise funds for Kids with Cancer by driving non-stop around Australia. He says he did it last year; drove to all the Australian Capitals in two and a half weeks. He says that he wants to try and [...]]]></description>
			<content:encoded><![CDATA[<p>Melissa sat in the office of Detective Sing.<br />
&#8220;I met a man yesterday,&#8221; she said. &#8220;He&#8217;s trying to raise funds for Kids with Cancer by driving non-stop around Australia. He says he did it last year; drove to all the Australian Capitals in two and a half weeks. He says that he wants to try and break that record this year, and that if he does, the Australian Government will give a $10,000 donation to the charity. The only problem is that he needs funds to pay for the car, petrol and food. He&#8217;s asked me for an initial donation of $2,000. What should I do? Should I give it to him?&#8221;</p>
<p>Detective Sing paused for a moment. &#8220;You could give him the money,&#8221; he said. &#8220;But I don&#8217;t think it will help the charity.&#8221;</p>
<p>Why?</p>
]]></content:encoded>
			<wfw:commentRss>http://www.tenproblems.com/20061116/problem-four-road-trip/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Problem Three: Auction</title>
		<link>http://www.tenproblems.com/20061116/problem-three-auction/</link>
		<comments>http://www.tenproblems.com/20061116/problem-three-auction/#comments</comments>
		<pubDate>Fri, 17 Nov 2006 02:57:17 +0000</pubDate>
		<dc:creator>Allen</dc:creator>
		
		<category><![CDATA[Riddles]]></category>

	<!-- AutoMeta Start -->
	<category>auction</category>
	<category>immediately</category>
	<category>buy</category>
	<category>makes</category>
	<category>choose</category>
	<!-- AutoMeta End -->
	
		<guid isPermaLink="false">http://www.tenproblems.com/20061116/problem-three-auction/</guid>
		<description><![CDATA[I choose not to buy something.This makes it immediately go on to auction.
Why?
]]></description>
			<content:encoded><![CDATA[<p>I choose not to buy something.This makes it immediately go on to auction.</p>
<p>Why?</p>
]]></content:encoded>
			<wfw:commentRss>http://www.tenproblems.com/20061116/problem-three-auction/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Problem Two: Pyramids By The Block</title>
		<link>http://www.tenproblems.com/20061116/problem-two-pyramids-by-the-block/</link>
		<comments>http://www.tenproblems.com/20061116/problem-two-pyramids-by-the-block/#comments</comments>
		<pubDate>Fri, 17 Nov 2006 02:55:59 +0000</pubDate>
		<dc:creator>Allen</dc:creator>
		
		<category><![CDATA[Mathematical]]></category>

	<!-- AutoMeta Start -->
	<category>blocks</category>
	<category>pyramid</category>
	<category>tiers</category>
	<category>volume</category>
	<category>assembled</category>
	<category>catalog</category>
	<category>thick</category>
	<category>foot</category>
	<!-- AutoMeta End -->
	
		<guid isPermaLink="false">http://www.tenproblems.com/20061116/problem-two-pyramids-by-the-block/</guid>
		<description><![CDATA[In a catalog, you read about a set of blocks. There are 1029 blocks; all are identical in volume. They can be assembled into several tiers which are 1 foot thick and stack to form a pyramid. (The pyramid has a square base; its four sides are equivalent isosceles triangles.) How tall is this pyramid?
]]></description>
			<content:encoded><![CDATA[<p>In a catalog, you read about a set of blocks. There are 1029 blocks; all are identical in volume. They can be assembled into several tiers which are 1 foot thick and stack to form a pyramid. (The pyramid has a square base; its four sides are equivalent isosceles triangles.) How tall is this pyramid?</p>
]]></content:encoded>
			<wfw:commentRss>http://www.tenproblems.com/20061116/problem-two-pyramids-by-the-block/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Problem One: Aliens</title>
		<link>http://www.tenproblems.com/20061116/problem-one-aliens/</link>
		<comments>http://www.tenproblems.com/20061116/problem-one-aliens/#comments</comments>
		<pubDate>Fri, 17 Nov 2006 02:54:56 +0000</pubDate>
		<dc:creator>Allen</dc:creator>
		
		<category><![CDATA[Riddles]]></category>

	<!-- AutoMeta Start -->
	<category>aliens</category>
	<category>features</category>
	<category>arms</category>
	<category>heads</category>
	<category>eyes</category>
	<category>unusual</category>
	<category>intergalactic</category>
	<category>attended</category>
	<!-- AutoMeta End -->
	
		<guid isPermaLink="false">http://www.tenproblems.com/20061116/problem-one-aliens/</guid>
		<description><![CDATA[100 aliens attended an intergalactic meeting on earth.
73 had two heads,
28 had three eyes,
21 had four arms,
12 had two heads and three eyes,
9 had three eyes and four arms,
8 had two heads and four arms,
3 had all three unusual features.
How many aliens had none of these unusual features?
]]></description>
			<content:encoded><![CDATA[<p>100 aliens attended an intergalactic meeting on earth.</p>
<p>73 had two heads,<br />
28 had three eyes,<br />
21 had four arms,<br />
12 had two heads and three eyes,<br />
9 had three eyes and four arms,<br />
8 had two heads and four arms,<br />
3 had all three unusual features.</p>
<p>How many aliens had none of these unusual features?</p>
]]></content:encoded>
			<wfw:commentRss>http://www.tenproblems.com/20061116/problem-one-aliens/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Solutions to Problems on November 10</title>
		<link>http://www.tenproblems.com/20061116/solutions-to-problems-on-november-10/</link>
		<comments>http://www.tenproblems.com/20061116/solutions-to-problems-on-november-10/#comments</comments>
		<pubDate>Thu, 16 Nov 2006 20:03:35 +0000</pubDate>
		<dc:creator>Allen</dc:creator>
		
		<category><![CDATA[Solutions]]></category>

	<!-- AutoMeta Start -->
	<category>tank</category>
	<category>spells</category>
	<category>miles</category>
	<category>gallons</category>
	<category>sleep</category>
	<category>barrel</category>
	<category>refill</category>
	<category>stages</category>
	<!-- AutoMeta End -->
	
		<guid isPermaLink="false">http://www.tenproblems.com/20061116/solutions-to-problems-on-november-10/</guid>
		<description><![CDATA[Answer One: To Laugh or to Cry?
Show &#9660;

The Sky.

Answer Two: Deep Sleep
Show &#9660;

While there are five stages of sleep, including one known as deep sleep and one known as REM (rapid eye movement), none of these stages are known as being &#8220;gamma&#8221; sleep.
The four stages (other than REM) are: beta, alpha, theta, delta.

Answer Three: Food [...]]]></description>
			<content:encoded><![CDATA[<p><strong>Answer One:</strong> <a href="http://www.tenproblems.com/20061108/problem-one-to-laugh-or-to-cry/">To Laugh or to Cry?<br />
</a><a href='javascript:void(null);' onclick="s_toggleDisplay(document.getElementById('SID1299882838'), this, 'Show &#9660;', 'Hide &#9650;');">Show &#9660;</a></p>
<div id='SID1299882838' style='display:none;'>
<span class="textblock">The Sky.</span>
</div>
<p><strong>Answer Two:</strong> <a href="http://www.tenproblems.com/20061108/problem-two-deep-sleep/">Deep Sleep</a><br />
<a href='javascript:void(null);' onclick="s_toggleDisplay(document.getElementById('SID1962317676'), this, 'Show &#9660;', 'Hide &#9650;');">Show &#9660;</a></p>
<div id='SID1962317676' style='display:none;'>
<span class="textblock">While there are five stages of sleep, including one known as deep sleep and one known as REM (rapid eye movement), none of these stages are known as being &#8220;gamma&#8221; sleep.<br />
The four stages (other than REM) are: beta, alpha, theta, delta.</span>
</div>
<p><strong>Answer Three:</strong> <a href="http://www.tenproblems.com/20061108/problem-three-food-court/">Food Court<br />
</a><a href='javascript:void(null);' onclick="s_toggleDisplay(document.getElementById('SID1678057100'), this, 'Show &#9660;', 'Hide &#9650;');">Show &#9660;</a></p>
<div id='SID1678057100' style='display:none;'>
<span class="textblock">Deborah-Mexican-Fourth<br />
Samantha-Italian-First<br />
Eli-Chinese-Third<br />
Aaron-Southern-Second</span>
</div>
<p><strong>Answer Four:</strong> <a href="http://www.tenproblems.com/20061108/problem-four-phone-for-help/">Phone For Help</a><br />
<a href='javascript:void(null);' onclick="s_toggleDisplay(document.getElementById('SID569685390'), this, 'Show &#9660;', 'Hide &#9650;');">Show &#9660;</a></p>
<div id='SID569685390' style='display:none;'>
<span class="textblock">3483.</p>
<p>Using the dictionary function of your handphone, type in the numbers above. Alternatively, you can observe the letters on each of the following numbers. 663 spells ONE, 896 spells TWO, 84733 spells THREE, 3687 spells FOUR and thus the last member of the sequence is FIVE, which corresponds to 3483.</span>
</div>
<p><strong>Problem Five:</strong> <a href="http://www.tenproblems.com/20061108/problem-five-how-far-can-you-go/">How Far Can You Go?<br />
</a><a href='javascript:void(null);' onclick="s_toggleDisplay(document.getElementById('SID863304900'), this, 'Show &#9660;', 'Hide &#9650;');">Show &#9660;</a></p>
<div id='SID863304900' style='display:none;'>
<span class="textblock">You can travel 840 miles from the broken supply truck. Since your base camp is 800 miles away (half of 1600 miles), you can easily complete the delivery. Here&#8217;s how:</p>
<p>Although you can only carry one barrel at a time, you need to transport both of them until one barrel is empty. F is the barrel used first, and L is the barrel used last.</p>
<p>Use half of a tank (5 gallons) to carry L 5*12=60 miles, and then return for F (uses another 5 gallons). Refill the tank from F and carry it to where you left L (also uses 5 gallons). Refill the tank again from F and switch barrels. Now you are 60 miles from the broken truck, the tank and L are full, but F is down to 30 gallons (45-5-5-5=30). Repeat this procedure two times.</p>
<p>Now you are 60*3=180 miles from the broken truck. The tank and L are still full, but F is empty. Leave F behind and make a run for it, carrying L. Refill the tank from L as needed. There are 55 gallons of fuel left so you can travel an additional 55*12=660 miles, for a maximum of (180+660) 840 miles. Since you only have a total of 800 miles to go, you will make it to your base camp.</span>
</div>
]]></content:encoded>
			<wfw:commentRss>http://www.tenproblems.com/20061116/solutions-to-problems-on-november-10/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Problem Five: Optimist vs. Pessimist vs. Pragmatist</title>
		<link>http://www.tenproblems.com/20061115/problem-five-optimist-vs-pessimist-vs-pragmatist/</link>
		<comments>http://www.tenproblems.com/20061115/problem-five-optimist-vs-pessimist-vs-pragmatist/#comments</comments>
		<pubDate>Wed, 15 Nov 2006 07:29:57 +0000</pubDate>
		<dc:creator>Percy</dc:creator>
		
		<category><![CDATA[Logical]]></category>

	<!-- AutoMeta Start -->
	<category>pessimist</category>
	<category>pragmatist</category>
	<category>optimist</category>
	<category>wine</category>
	<category>half</category>
	<category>arguing</category>
	<category>measuring</category>
	<category>barrel</category>
	<!-- AutoMeta End -->
	
		<guid isPermaLink="false">http://www.tenproblems.com/20061115/problem-five-optimist-vs-pessimist-vs-pragmatist/</guid>
		<description><![CDATA[The Optimist and the Pessimist were arguing whether the wine barrel in front of them was half full or half empty. Then the Pragmatist came and showed them without measuring anything or removing any wine. How did he do it?
]]></description>
			<content:encoded><![CDATA[<p>The Optimist and the Pessimist were arguing whether the wine barrel in front of them was half full or half empty. Then the Pragmatist came and showed them without measuring anything or removing any wine. How did he do it?</p>
]]></content:encoded>
			<wfw:commentRss>http://www.tenproblems.com/20061115/problem-five-optimist-vs-pessimist-vs-pragmatist/feed/</wfw:commentRss>
		</item>
	</channel>
</rss>
