<?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: A brief history of problems that ruined my world</title>
	<atom:link href="http://lbrandy.com/blog/2009/07/a-brief-history-of-problems-that-ruined-my-world/feed/" rel="self" type="application/rss+xml" />
	<link>http://lbrandy.com/blog/2009/07/a-brief-history-of-problems-that-ruined-my-world/</link>
	<description>{ on programming and the internets, every monday }</description>
	<lastBuildDate>Fri, 03 Feb 2012 14:14:15 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0.1</generator>
	<item>
		<title>By: tomas</title>
		<link>http://lbrandy.com/blog/2009/07/a-brief-history-of-problems-that-ruined-my-world/comment-page-4/#comment-28295</link>
		<dc:creator>tomas</dc:creator>
		<pubDate>Fri, 17 Jun 2011 23:05:32 +0000</pubDate>
		<guid isPermaLink="false">http://lbrandy.com/blog/?p=923#comment-28295</guid>
		<description>and about the 0.9999...
You can define real numbers as infinite sum
for example

0.124 = 1*10^-1 + 2*10^-2 + 4+10^4

but for simplicity we just write 0.124.

more general a is from 0 to 1

a = a1*10^-1 + a2*10^-2 + ...

where a1,a2.. are numbers 0..9 and we simply write 0,a1a2a3...
So if you write 0.999.. You should understand it as 9*10^-1 + 9*10^-2 + ... and this sum converges to one.

as you probably know infinite sum

1/2 + 1/4 + 1/8 + ... + 1/2^n + ... = 1

if you write 1/2, 1/4, 1/8 in binary you get 0.1, 0.01, 0.001 etc.

so 0.11111.. = 1 in binary</description>
		<content:encoded><![CDATA[<p>and about the 0.9999&#8230;<br />
You can define real numbers as infinite sum<br />
for example</p>
<p>0.124 = 1*10^-1 + 2*10^-2 + 4+10^4</p>
<p>but for simplicity we just write 0.124.</p>
<p>more general a is from 0 to 1</p>
<p>a = a1*10^-1 + a2*10^-2 + &#8230;</p>
<p>where a1,a2.. are numbers 0..9 and we simply write 0,a1a2a3&#8230;<br />
So if you write 0.999.. You should understand it as 9*10^-1 + 9*10^-2 + &#8230; and this sum converges to one.</p>
<p>as you probably know infinite sum</p>
<p>1/2 + 1/4 + 1/8 + &#8230; + 1/2^n + &#8230; = 1</p>
<p>if you write 1/2, 1/4, 1/8 in binary you get 0.1, 0.01, 0.001 etc.</p>
<p>so 0.11111.. = 1 in binary</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: tomas</title>
		<link>http://lbrandy.com/blog/2009/07/a-brief-history-of-problems-that-ruined-my-world/comment-page-4/#comment-28294</link>
		<dc:creator>tomas</dc:creator>
		<pubDate>Fri, 17 Jun 2011 22:52:35 +0000</pubDate>
		<guid isPermaLink="false">http://lbrandy.com/blog/?p=923#comment-28294</guid>
		<description>The envelope problem... I have a little problem with uniform distribution of natural numbers. But I have a similar problem. Unfortunately you have to know a little bit about set theory and what continuum hypothesis is.

Ok. lets suppose a game. There are two players and target( a square [0,1]x[0,1]) they are shooting at.
Lets suppose continuum hypothesis and map the target(a continuum) to the alef one(the first uncountable ordinal,a set of all countable ordinals). And and who hits the higher ordinal wins. So...
Lets the first player begin. He hits a point it the target which corresponds to some ordinal, a countable ordinal!!!. So there are only countable many ordinals smaller than that ordinal the first player hit. Countable set has measure zero. So the probability that second player hits smaller ordinal than the first player is zero.
So the probability that the second player wins is ONE!!! Isn&#039;t it weird that the second player always wins??
Now lets make it even weirder. Lets players one and two shoot at the same time. And figure out who has higher probability of winning?</description>
		<content:encoded><![CDATA[<p>The envelope problem&#8230; I have a little problem with uniform distribution of natural numbers. But I have a similar problem. Unfortunately you have to know a little bit about set theory and what continuum hypothesis is.</p>
<p>Ok. lets suppose a game. There are two players and target( a square [0,1]x[0,1]) they are shooting at.<br />
Lets suppose continuum hypothesis and map the target(a continuum) to the alef one(the first uncountable ordinal,a set of all countable ordinals). And and who hits the higher ordinal wins. So&#8230;<br />
Lets the first player begin. He hits a point it the target which corresponds to some ordinal, a countable ordinal!!!. So there are only countable many ordinals smaller than that ordinal the first player hit. Countable set has measure zero. So the probability that second player hits smaller ordinal than the first player is zero.<br />
So the probability that the second player wins is ONE!!! Isn&#8217;t it weird that the second player always wins??<br />
Now lets make it even weirder. Lets players one and two shoot at the same time. And figure out who has higher probability of winning?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: JUAN PADAN</title>
		<link>http://lbrandy.com/blog/2009/07/a-brief-history-of-problems-that-ruined-my-world/comment-page-4/#comment-28292</link>
		<dc:creator>JUAN PADAN</dc:creator>
		<pubDate>Fri, 27 May 2011 16:55:23 +0000</pubDate>
		<guid isPermaLink="false">http://lbrandy.com/blog/?p=923#comment-28292</guid>
		<description>I don&#039;t understand why thy are so difficult for you but it&#039;s intresting</description>
		<content:encoded><![CDATA[<p>I don&#8217;t understand why thy are so difficult for you but it&#8217;s intresting</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Anthony</title>
		<link>http://lbrandy.com/blog/2009/07/a-brief-history-of-problems-that-ruined-my-world/comment-page-4/#comment-28291</link>
		<dc:creator>Anthony</dc:creator>
		<pubDate>Wed, 25 May 2011 01:32:43 +0000</pubDate>
		<guid isPermaLink="false">http://lbrandy.com/blog/?p=923#comment-28291</guid>
		<description>Airplane problem: meet Mythbusters. 

Game over.</description>
		<content:encoded><![CDATA[<p>Airplane problem: meet Mythbusters. </p>
<p>Game over.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: David Jameson</title>
		<link>http://lbrandy.com/blog/2009/07/a-brief-history-of-problems-that-ruined-my-world/comment-page-4/#comment-28289</link>
		<dc:creator>David Jameson</dc:creator>
		<pubDate>Mon, 23 May 2011 13:22:24 +0000</pubDate>
		<guid isPermaLink="false">http://lbrandy.com/blog/?p=923#comment-28289</guid>
		<description>Regarding the plane problem --- stop with the &quot;engines pushing on the air&quot; thinking. The engines are emitting &quot;mass&quot; (the compressed jet) and as a result the airplane has a force pushing it in the opposite direction.

As long as the wheels are allowed to spin, there is nothing to stop that force from moving the plane.</description>
		<content:encoded><![CDATA[<p>Regarding the plane problem &#8212; stop with the &#8220;engines pushing on the air&#8221; thinking. The engines are emitting &#8220;mass&#8221; (the compressed jet) and as a result the airplane has a force pushing it in the opposite direction.</p>
<p>As long as the wheels are allowed to spin, there is nothing to stop that force from moving the plane.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Anonymous</title>
		<link>http://lbrandy.com/blog/2009/07/a-brief-history-of-problems-that-ruined-my-world/comment-page-4/#comment-28283</link>
		<dc:creator>Anonymous</dc:creator>
		<pubDate>Tue, 17 May 2011 16:34:25 +0000</pubDate>
		<guid isPermaLink="false">http://lbrandy.com/blog/?p=923#comment-28283</guid>
		<description>The envelope problem is simple when you approach it from a 100% rational standpoint. True, once you claim an envelope, the other envelope&#039;s expected value goes up. However, we know for a fact that this is solely the *expected* value. As we know from statistics, on a distribution of infinitely many values (due to infinitely many distinct numbers, which is shown here with the existence of an unknown variable of any potential value) any given value has a infinitely *small* probability of occurring. The envelope chosen could hold anything from $.02 to an infinitely high amount of money ($.02 is used in this case to allow for the other envelope to hold only half the amount of money of the envelope chosen.) Knowing that any specific value is almost infinitely unlikely to occur, we cannot assume any specific value of an increase in the expected value of the other envelope, forcing us to believe that (when the chosen envelope&#039;s expected value is A and the other envelopes expected value is B) B = 1.25A. True, envelope B has a higher expected value than envelope A, switching to envelope B will NOT change the TRUE value of envelope A, only the expected value. Rather than repeatedly swapping between envelopes indefinitely to raise the expected value of the other envelope (which in itself is irrational believing that the true value of an envelope would change along with the expected value), one should simply take only one envelope and accept the money, and not reason that swapping envelopes will affect the amount of money an envelope holds in any way. 

In short, Swapping envelopes does not increase the money held in the envelope, only the expected amount of money in the other envelope. Statistically speaking, the odds of the expected value occurring is 1/infinitely many values which in its essence, is 0.

Pattern of envelopes when swapping   (A, B, A, B...
Pattern of expected envelope&#039;s value (A, 1.25A, 1.563A, 1.953A...
Pattern of actual envelope&#039;s value   (A, 2A/.5A, A, 2A/.5A...

While the expected value DOES increase, the actual value remains more or less constant.</description>
		<content:encoded><![CDATA[<p>The envelope problem is simple when you approach it from a 100% rational standpoint. True, once you claim an envelope, the other envelope&#8217;s expected value goes up. However, we know for a fact that this is solely the *expected* value. As we know from statistics, on a distribution of infinitely many values (due to infinitely many distinct numbers, which is shown here with the existence of an unknown variable of any potential value) any given value has a infinitely *small* probability of occurring. The envelope chosen could hold anything from $.02 to an infinitely high amount of money ($.02 is used in this case to allow for the other envelope to hold only half the amount of money of the envelope chosen.) Knowing that any specific value is almost infinitely unlikely to occur, we cannot assume any specific value of an increase in the expected value of the other envelope, forcing us to believe that (when the chosen envelope&#8217;s expected value is A and the other envelopes expected value is B) B = 1.25A. True, envelope B has a higher expected value than envelope A, switching to envelope B will NOT change the TRUE value of envelope A, only the expected value. Rather than repeatedly swapping between envelopes indefinitely to raise the expected value of the other envelope (which in itself is irrational believing that the true value of an envelope would change along with the expected value), one should simply take only one envelope and accept the money, and not reason that swapping envelopes will affect the amount of money an envelope holds in any way. </p>
<p>In short, Swapping envelopes does not increase the money held in the envelope, only the expected amount of money in the other envelope. Statistically speaking, the odds of the expected value occurring is 1/infinitely many values which in its essence, is 0.</p>
<p>Pattern of envelopes when swapping   (A, B, A, B&#8230;<br />
Pattern of expected envelope&#8217;s value (A, 1.25A, 1.563A, 1.953A&#8230;<br />
Pattern of actual envelope&#8217;s value   (A, 2A/.5A, A, 2A/.5A&#8230;</p>
<p>While the expected value DOES increase, the actual value remains more or less constant.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Matt</title>
		<link>http://lbrandy.com/blog/2009/07/a-brief-history-of-problems-that-ruined-my-world/comment-page-3/#comment-28282</link>
		<dc:creator>Matt</dc:creator>
		<pubDate>Tue, 17 May 2011 01:48:37 +0000</pubDate>
		<guid isPermaLink="false">http://lbrandy.com/blog/?p=923#comment-28282</guid>
		<description>Umm, The airplane would definitely not take off, the force that is used to get the plane in the air is provided by the shape of the wing. It is designed in such a way that the air that goes over the top of the wing has to travel a farther distance to get around the wing and consequently, has to travel faster. When air is traveling fast, it has less pressure than slower air around it. Considering how air moves from areas of high pressure to low pressure (AKA wind), The air that is under the wing moves up to compensate for the lower pressure above the wing. That is what gives the plane its lift. The engine has nothing to do with it at all, the only thing the engine does is move the plane forward to provide the air traveling across the wing, and of course so that it can go! :P</description>
		<content:encoded><![CDATA[<p>Umm, The airplane would definitely not take off, the force that is used to get the plane in the air is provided by the shape of the wing. It is designed in such a way that the air that goes over the top of the wing has to travel a farther distance to get around the wing and consequently, has to travel faster. When air is traveling fast, it has less pressure than slower air around it. Considering how air moves from areas of high pressure to low pressure (AKA wind), The air that is under the wing moves up to compensate for the lower pressure above the wing. That is what gives the plane its lift. The engine has nothing to do with it at all, the only thing the engine does is move the plane forward to provide the air traveling across the wing, and of course so that it can go! <img src='http://lbrandy.com/blog/wp-includes/images/smilies/icon_razz.gif' alt=':P' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
</channel>
</rss>

