<?xml version='1.0' encoding='UTF-8'?><rss xmlns:atom="http://www.w3.org/2005/Atom" xmlns:openSearch="http://a9.com/-/spec/opensearchrss/1.0/" xmlns:blogger="http://schemas.google.com/blogger/2008" xmlns:georss="http://www.georss.org/georss" xmlns:gd="http://schemas.google.com/g/2005" xmlns:thr="http://purl.org/syndication/thread/1.0" version="2.0"><channel><atom:id>tag:blogger.com,1999:blog-916785202343169452</atom:id><lastBuildDate>Tue, 07 Apr 2026 20:22:38 +0000</lastBuildDate><category>math</category><category>humor</category><category>computers</category><category>science</category><category>blog</category><category>physics</category><category>history</category><category>linux</category><category>universe</category><category>university</category><category>links</category><category>paradoxes</category><category>Einstein</category><category>number theory</category><category>religion</category><category>ads</category><category>site</category><category>time</category><category>articles</category><title>Math Pages Blog</title><description>God used beautiful mathematics in creating the world.</description><link>http://mathpages.blogspot.com/</link><managingEditor>noreply@blogger.com (Anatoly)</managingEditor><generator>Blogger</generator><openSearch:totalResults>210</openSearch:totalResults><openSearch:startIndex>1</openSearch:startIndex><openSearch:itemsPerPage>25</openSearch:itemsPerPage><item><guid isPermaLink="false">tag:blogger.com,1999:blog-916785202343169452.post-2060807250726322471</guid><pubDate>Fri, 25 Jun 2010 08:12:00 +0000</pubDate><atom:updated>2010-06-25T12:28:51.095+03:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">history</category><category domain="http://www.blogger.com/atom/ns#">math</category><category domain="http://www.blogger.com/atom/ns#">paradoxes</category><category domain="http://www.blogger.com/atom/ns#">physics</category><category domain="http://www.blogger.com/atom/ns#">science</category><category domain="http://www.blogger.com/atom/ns#">universe</category><title>Infinite processes in the real world</title><description>A long time ago, in ancient Greece, one of the philosophers asked a simple yet very important question - is matter infinitely divisible? He of course formulated the question in a much more intuitive way: what will happen if you take a stick and break it in half, than take one of the halves and break it in half again and so on. Thinking about this problem, he concluded that at some point we will not be able to continue breaking the stick. According to him, after a finite amount of time we will reach an indivisible component of matter. He named this indivisible component &quot;atom&quot;.&lt;br /&gt;As with any new idea, there were those who believed in it and those who concluded that this idea is wrong. Likely for both sides, there were no means to actually check it so they could argue as much as they wanted.&lt;br /&gt;&lt;br /&gt;Even though we are much more advanced today we still don&#39;t know the answer to this problem. Ironically we have discovered particles which we named atoms only to find out that they can be split apart as well only a few years later. Although, to be really precise, we need to remember that the problem can be formulated as the &quot;atom&quot; being the basic component of a specific type of mater. In other words, one possible understanding of the problem is that it asks to find a &quot;part&quot; that if divided further looses the recognizable properties of the object we started with. If we formulate the problem in this way, then there are indeed such &quot;atoms&quot; - molecules.&lt;br /&gt;&lt;br /&gt;At this point you are probably wondering what is this about and how is it connected to infinity. To understand this lets look on a somewhat famous paradox - the Thomson lamp. Consider a lamp with a toggle switch. Flicking the switch once turns the lamp on. Another flick will turn the lamp off. Now suppose a being able to perform the following task: starting a timer, he turns the lamp on. At the end of one minute, he turns it off. At the end of another half minute, he turns it on again. At the end of another quarter of a minute, he turns it off. At the next eighth of a minute, he turns it on again, and he continues thus, flicking the switch each time after waiting exactly one-half the time he waited before flicking it previously. The sum of all these progressively smaller times is exactly two minutes.&lt;br /&gt;So, in the end, is the lamp on or off?&lt;br /&gt;&lt;br /&gt;It turns out that there is no clear answer to this problem. While we know the state of the lamp at any time during the process, we cannot tell what is the state at the end. Now lets return to our original problem. Lets suppose for a second that &quot;atoms&quot; don&#39;t exist. With this in mind we can take the being from the lamp paradox and instead of it toggling the switch we will make it break sticks in half. Since there are no atoms, the process doesn&#39;t end before two minutes pass. But what do we have after two minutes?&lt;br /&gt;&lt;br /&gt;In this case it is rather simple to look on the problem mathematically. Lets substitute the stick for the line [0,1]. The whole process can be described then as just a limit of [0,2^(-n)] when n goes to infinity. The limit is a single point, so that would mean that we will get a &quot;particle&quot; with size and mass equaling zero. However, that would suggest that the matter is build from particles with zero mass, and this is a rather bizarre conclusion.&lt;br /&gt;The only possible result we can get from this line of thought is that if such a being actually exists then there are &quot;atoms&quot;. However, if there is no such being then we cannot say anything.&lt;br /&gt;&lt;br /&gt;While I would like to finish this post with at least a partial solution to the problems I presented, there is no solution as far as I know. There is, however, a funny &quot;solution&quot; to the Thomson lamp paradox. Lets assign numbers to the states of the lamp - 1 and 0. If we do this then the state of the lamp after n steps is: 1-1+1-1+...+(-1)^n.&lt;br /&gt;Therefore, if we take the limit when n goes to infinity, we will get the state of the lamp after two minutes. So lets see what the limit is.&lt;br /&gt;&lt;br /&gt;&lt;div style=&quot;text-align: center;&quot;&gt;A=1-1+1-1+1-....&lt;br /&gt;&lt;/div&gt;&lt;div style=&quot;text-align: center;&quot;&gt;1-A=1-1+1-1+1-....=A&lt;br /&gt;2A=1&lt;br /&gt;A=0.5&lt;br /&gt;&lt;br /&gt;&lt;div style=&quot;text-align: left;&quot;&gt;As you can see, after two minutes the lamp is half on. :)&lt;br /&gt;&lt;/div&gt;&lt;/div&gt;</description><link>http://mathpages.blogspot.com/2010/06/infinite-processes-in-real-world.html</link><author>noreply@blogger.com (Anatoly)</author><thr:total>1</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-916785202343169452.post-6401356682858260845</guid><pubDate>Thu, 17 Jun 2010 18:39:00 +0000</pubDate><atom:updated>2010-06-17T21:39:00.696+03:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">computers</category><category domain="http://www.blogger.com/atom/ns#">universe</category><title>End of the Semester</title><description>Today I went to the last lecture of this semester. As it is somewhat typical with last lectures, the professor talked about interesting problems that are somewhat above the scope of the course. If only those problems didn&#39;t tend to be more complex that what can be explained in a 45 minute lecture... Luckily, this is of little importance. While the problems discussed were interesting, I rather spend my time working on staff that is more relevant to me now. With the semester finally over, I now have tests to worry about, but I should also have plenty of time to write new posts. Actually, I have a few posts already in the making, I just need some time to actually finish writing them. With the semester over, I finally have time to do so.&lt;br /&gt;&lt;br /&gt;To be honest, this year was for some reason really difficult for me. I never was good with making timetables for myself, so I ended studying till I was too mentally tired to do anything else. While I am pretty sure that I managed to do well in all of my courses, I barely kept up with my activity on the net. Both this blog and my stumble upon blog were not active most of the year. Hopefully next year will go in a more normal fashion.&lt;br /&gt;&lt;br /&gt;In other news, I am considering to close my Windows Live account. It is not very useful to me, and I noticed that I am getting a lot of spam from it. Initially I opened it in order to have access to free online storage for my files. However, I cannot say that I am satisfied with the service, and therefore I will likely close this account. To be honest, I sometime think about closing my Facebook account as well, but it is slightly better than Windows live. And what is more important is that I can login to other sites using my Facebook account.&lt;br /&gt;&lt;br /&gt;I have also started a little project. About two weeks ago, I got an invite to &lt;a href=&quot;https://www.dropbox.com/referrals/NTc0MjY4ODg5&quot;&gt;Dropbox&lt;/a&gt;. Basically, it is a file sharing site, but it has two features that make it nearly perfect for my uses. Firstly, Dropbox integrates into the desktop. That is instead of having to upload your files to the site manually, all you need to do is to put the files in a specific folder on your computer and Dropbox will upload them to the web and then sync them with your other computers.&lt;br /&gt;Secondly, and much more importantly for me, Dropbox officially supports Linux and works well on it. I tried to find other similar services, but they all either don&#39;t support linux or they worked horrible. This even includes Ubuntu One (at least the version I tried about half a year ago).&lt;br /&gt;The only downside it has is that they only give 2GB to free users. However, it is possible to get more space by inviting others - go to the site if you are interested in details, I am pretty sure that this policy will not last for a long time so there is no point to write much about it.&lt;br /&gt;&lt;br /&gt;Right now I am using Dropbox to backup and share some video files (documentaries about dinosaurs and other scientific topics) that I have collected. I never cared much about video quality, so I encode the video files in low quality (all the important details are still there) add subtitles and then upload them. In one case, I managed to compress 3 hours into 300MB. As long as I watch them on the computer display, it is perfectly fine.</description><link>http://mathpages.blogspot.com/2010/06/end-of-semester.html</link><author>noreply@blogger.com (Anatoly)</author><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-916785202343169452.post-6190450617914283210</guid><pubDate>Fri, 21 May 2010 11:36:00 +0000</pubDate><atom:updated>2010-05-21T14:36:00.122+03:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">math</category><title>Sperner&#39;s lemma</title><description>If you take a glass of water and then shake it, it turns out that some point in the liquid will remain unmoved - this is known as a real world three dimensional example of the &lt;a href=&quot;http://en.wikipedia.org/wiki/Brouwer_fixed_point_theorem&quot;&gt;Brouwer fixed point theorem&lt;/a&gt;. However, as I once wrote in the past, this example works only if we assume that the matter is continues. If we start to think in terms of atoms, the theorem cannot be applied. While disappointing, it is not surprising. It is after all pretty obvious that a theorem that works with an infinite number of points will not work the same if we use instead a finite (but large) number. But what about the opposite? Can a theorem that is used to prove something about a finite number of objects be used to prove something about an infinite number of them?&lt;br /&gt;&lt;br /&gt;The Sperner lemma is an example of such a case. This lemma is sometimes called a combinatorial analog of the Brouwer fixed point theorem. It is called so because it is rather simple to get the fixed point theorem for any dimension from the Sperner lemma for the same dimension. The two dimensional case is:&lt;br /&gt;&lt;br /&gt;Given a triangle ABC, and a triangulation T of the triangle. The set S of vertices of T is colored with three colors in such a way that&lt;br /&gt;&lt;br /&gt;  1. A, B and C are colored 1, 2 and 3 respectively&lt;br /&gt;  2. Each vertex on an edge of ABC is to be colored only with one of the two colors of the ends of its edge. For example, each vertex on AC must have a color either 1 or 3.&lt;br /&gt;&lt;br /&gt;Then there exists a triangle from T, whose vertices are colored with the three different colors. More generally, there must be an odd number of such triangles.&lt;br /&gt;&lt;br /&gt;The general, n-th dimensional case, uses n-dimensional simplex instead of a triangle which is a 2D simplex.&lt;br /&gt;&lt;br /&gt;There are a number of different proofs of the lemma, I personally know 3 of them. The usual idea is to show that the lemma works for the 2D space and then use induction to show that it works for all dimensions. While not difficult, this method of proof requires some thought and careful work. Interestingly enough there is also a proof that is both very short and doesn&#39;t require induction. It allows to prove the lemma for any given dimension in just one step.  So for all those who prefer simple and easy proofs - read on:&lt;br /&gt;&lt;br /&gt;To prove the lemma for the n-th dimension all we need to do is:&lt;br /&gt;Let v be an inner vertice in T. Define a linear function of t that moves this vertice to the outer vertice of the same color when t goes from 0 to 1. The volume of any given simplex in T is the determinant of the vectors that correspond to the vertices of the simplex. Since all the vectors are linear functions of t, the volume is a polynomial of degree n. The sum of the volumes is thus also a polynomial of degree n. For t=0 the polynomial is obviously the volume of the outer simplex (for n=2 it is the volume of ABC). However if t is only slightly bigger then zero, we still have a triangulation so the sum of the volumes is the same and therefore the polynomial is a constant. For simplicity lets say that the volume is exactly 1. Now, when t=1 the volume of all the simplexes that are not colored in n colors becomes zero. On the other hand, the volumes of the other simplexes are either 1 or (-1) (depends on orientation). And with this we are done - if the sum of the volumes is 1 there are must be simplexes that have volume 1 but this is only possible if there is an odd number of simplexes with n colors.</description><link>http://mathpages.blogspot.com/2010/05/sperners-lemma.html</link><author>noreply@blogger.com (Anatoly)</author><thr:total>2</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-916785202343169452.post-9089249520668488652</guid><pubDate>Tue, 12 Jan 2010 11:42:00 +0000</pubDate><atom:updated>2010-01-12T17:52:46.125+02:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">math</category><category domain="http://www.blogger.com/atom/ns#">university</category><title>Taking Notes</title><description>In this post I want to share some ways of working with course notes that I am currently using. As you all know taking notes is one of the most basic parts of studying. While it is possible to do well without it, it usually only means that you are borrowing somebody else notes (or downloading them). However, taking notes and using them are two totally different things. Firstly, handwritten notes tend to differ greatly in quality due to people handwriting and the lecturer. In my case my notes are close to being unreadable for anyone except for me (for some reason I can read what I wrote easily enough, but I have problems reading other people notes). Also, if the lecturer speaks in a disorganized way the notes become difficult to read and understand.&lt;br /&gt;Obviously handwriting and organization of notes is not much of a problem - it is after all perfectly possible to take notes on a computer. Actually, if I were studying a subject that don&#39;t have formulas I would use a computer to take notes myself. Since I study math, I do not believe that I should try to take notes on a computer, although I know people who do just that.&lt;br /&gt;&lt;br /&gt;However, the really difficult part comes when you need to go over your notes. In the first and second year the lecturers tend to give you all the material in a very detailed way, but with time they stop doing this. Instead you are now supposed to figure all the extra stuff yourself. As a result, you basically need to add to your notes on your own. So how do you do this, while still keeping the notes organized and in a format that allows you go over them easily?&lt;br /&gt;&lt;br /&gt;At this point of time I cannot honestly say that I found a real solution to this question. But I managed to come to the conclusion that I need two things. The first thing is to make sure that I have the notes made in an organized way. To do this I make a second (also handwritten) copy of my course notes. In this copy I write all the definitions and theorems (with their proofs) with as much details as I need to understand them. This copy is later used when I need to prepare for the exams.&lt;br /&gt;The second thing is basically a reference list.  The idea is to make a list of all the definitions and theorems, as well as links to any useful source of extra information on the topic. It is obvious that such a list should be done on a computer. The end result is basically another version of your notes, but instead of being detailed and organized it is easily to search. This makes it easy to check any general fact you are unsure of. It is especially useful if you want to check some specific definition of the wording of a theorem. Obviously you can do the same thing just by searching on Wikipedia, but using such a reference list makes it much easier - you are able to see what you look for by just taking a glance on it, instead of searching a whole site. Also, making such a list on the computer allows (depending on what software you use) to add extra notes and to modify them easily. Since I do not want to type math formulas myself I ended using Google notebook to clip content (mainly from Wikipedia) and then edit and categorize it the way I want. Unfortunately, Google notebook is the only service I managed to find that had all the features that I wanted.&lt;br /&gt;&lt;br /&gt;If you follow all this you will end with three different sets of notes (plus, if available, a textbook). Obviously this is a lot of work, but I feel that this approach allows me to understand the material as well as I can.</description><link>http://mathpages.blogspot.com/2010/01/taking-notes.html</link><author>noreply@blogger.com (Anatoly)</author><thr:total>1</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-916785202343169452.post-6346043922699909023</guid><pubDate>Mon, 04 Jan 2010 11:00:00 +0000</pubDate><atom:updated>2010-01-04T20:55:14.550+02:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">math</category><title>Complex numbers and roots</title><description>Complex numbers appeared initially as a way to solve equations that don&#39;t have real solutions. However, what are we getting from this? We can write that i is the solution to x^2=-1, but what exactly is this result? It is an imaginary number, so it is not something that can represent for example area. The obvious result from this line of thinking is - are complex numbers really needed? What problems do they solve?&lt;br /&gt;&lt;br /&gt;Somewhat surprisingly complex numbers solve a lot of different problems or at least make them easier. In this post I want to introduce one particular problem that is solved by using complex numbers. The problem is to define a^b for all values of b and for all values of a except zero. We can partially solve this problem without complex numbers. For example, we can agree that the functions log and exp are defined as usual and then:&lt;br /&gt;&lt;br /&gt;&lt;div style=&quot;text-align: center;&quot;&gt;a^b=exp(b*Log(a))&lt;br /&gt;&lt;br /&gt;&lt;div style=&quot;text-align: left;&quot;&gt;This will work for all values of b but only as long as a&gt;0. This is as far as we can get without using complex numbers. It is important to note, that any solution of this problem must agree with the partial solution that we have here. In other words, in order to solve this problem we must basically extend the functions exp and log in such a way that log will be defined for negative values and exp will be defined for all values of log.&lt;br /&gt;&lt;br /&gt;As a start, lets try to define exp(z) and log(z):&lt;br /&gt;&lt;br /&gt;&lt;div style=&quot;text-align: center;&quot;&gt;exp(z)=exp(x+iy)=exp(x)exp(iy)&lt;br /&gt;exp(iy)=cos(y)+isin(y)&lt;br /&gt;&lt;br /&gt;&lt;div style=&quot;text-align: left;&quot;&gt;We now need to check what we got from this definition. Firstly, if y=0 then exp(z)=exp(x) as we wanted. Secondly:&lt;br /&gt;&lt;br /&gt;&lt;div style=&quot;text-align: center;&quot;&gt;exp(z+w)=exp(x+iy+a+ib)=exp(x+a)exp(iy+ib)&lt;br /&gt;exp(x+a)exp(iy+ib)=exp(x)exp(a)[cos(y+b)+isin(y+b)]&lt;br /&gt;cos(y+b)+isin(y+b)=cos(y)cos(b)-sin(y)sin(b)+isin(y)cos(b)+icos(y)sin(b)&lt;br /&gt;cos(y+b)+isin(y+b)=[cos(y)+isin(y)][cos(b)+isin(b)]&lt;br /&gt;exp(z+w)=exp(x)exp(a)exp(iy)exp(ib)&lt;br /&gt;exp(z+w)=exp(x)exp(iy)exp(a)exp(ib)&lt;br /&gt;exp(z+w)=exp(x+iy)exp(a+ib)=exp(z)exp(w)&lt;br /&gt;&lt;br /&gt;&lt;div style=&quot;text-align: left;&quot;&gt;The last last thing we want to check is the derivative. This is done in a similar way, and is left as an exercise.&lt;br /&gt;As you can see it is rather easy to extend exp to the complex numbers. Extending log is more difficult. Lets start with what we want the function to do. We want that for any complex number z:&lt;br /&gt;&lt;br /&gt;&lt;div style=&quot;text-align: center;&quot;&gt;exp(log(z))=z&lt;br /&gt;&lt;br /&gt;&lt;div style=&quot;text-align: left;&quot;&gt;So, we want to say that if exp(w)=z then log(z)=w.&lt;br /&gt;&lt;/div&gt;&lt;div style=&quot;text-align: left;&quot;&gt;Unfortunately, we cannot use this as a definition for log. The problem is that there are many different complex numbers that satisfy this equation. According to the definition of exp:&lt;br /&gt;&lt;br /&gt;&lt;div style=&quot;text-align: center;&quot;&gt;exp(w+2(pi)i)=exp(w)exp(2(pi)i)=exp(w)[cos(2pi)+isin(2pi)]=exp(w)=z&lt;br /&gt;&lt;br /&gt;&lt;div style=&quot;text-align: left;&quot;&gt;This is obviously a problem. To solve this problem we must remove part of the complex numbers. There are many different ways to do this removal. In this post I decided to remove the numbers {z|z=ik, k=0 or k&gt;0}.&lt;br /&gt;Now that we do not have these numbers we can define log. We know that any complex number z can be written as z=r*exp(it), where t represents the angle between the line that connects zero and z. Obviously exp(it)=exp(it+2(pi)i). However, since we have some numbers removed we cannot go in a circle around zero. Therefore, for numbers that have a negative real or complex part we will take t to be 2pi minus the angle. This solves our little problem because we now have exactly one value of t assigned to every z. And now we can define log exactly as we tried to do before. Since the negative numbers were not removed we have log defined for negative numbers as well. For example: log(-1)=i*pi.&lt;br /&gt;&lt;br /&gt;Now that we have this we can indeed define that for all real a,b such that a is not zero:&lt;br /&gt;&lt;br /&gt;&lt;/div&gt;&lt;/div&gt;&lt;div style=&quot;text-align: center;&quot;&gt;a^b=exp(b*Log(a))&lt;br /&gt;&lt;br /&gt;&lt;div style=&quot;text-align: left;&quot;&gt;This is true for complex numbers as well, but this a different topic.&lt;br /&gt;&lt;/div&gt;&lt;/div&gt;&lt;/div&gt;&lt;/div&gt;&lt;/div&gt;&lt;/div&gt;&lt;/div&gt;&lt;/div&gt;&lt;/div&gt;&lt;/div&gt;</description><link>http://mathpages.blogspot.com/2010/01/complex-numbers-and-roots.html</link><author>noreply@blogger.com (Anatoly)</author><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-916785202343169452.post-3286637010391727242</guid><pubDate>Wed, 30 Dec 2009 11:00:00 +0000</pubDate><atom:updated>2009-12-30T17:46:18.298+02:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">history</category><category domain="http://www.blogger.com/atom/ns#">humor</category><category domain="http://www.blogger.com/atom/ns#">math</category><title>A common misunderstanding</title><description>A few days ago, one of the lectures in the university told us about a funny (but real) news report he once heard on TV. It was shortly after the discovery that 2^(42,643,801)-1 is a prime. (For more information about this go to Mersenne prime search &lt;a href=&quot;http://www.mersenne.org/&quot;&gt;website&lt;/a&gt;). On this TV program a reporter was interviewing a math professor. The conversation went like this: (R= reporter, P=professor)&lt;br /&gt;&lt;br /&gt;R: So what do you have to say about the discovery of the largest prime number 2^(42,643,801)?&lt;br /&gt;P: The number 2^(42,643,801) is not prime since it is an even number. You must have ment to say 2^(42,643,801)-1.&lt;br /&gt;R: Well, they are close enough. The important thing is that this is the largest prime number.&lt;br /&gt;P: It is not the largest. &lt;a href=&quot;http://en.wikipedia.org/wiki/Euclid&quot;&gt;Euclid&lt;/a&gt; proved that there is an infinite number of prime numbers so there is no such thing as the largest prime.&lt;br /&gt;R: Is it still correct today that there are infinity many prime numbers?&lt;br /&gt;&lt;br /&gt;I really find it hilarious how some people think that a mathematical proof is something that is subject to changes. Sure, sometimes we have errors or we find better proof, but the there is no change in the fact itself. I suppose it is somewhat understandable why people act like this - they are too used to seeing things change. But it is still hilarious to watch, as long as you not part of the discussion.</description><link>http://mathpages.blogspot.com/2009/12/common-misunderstanding.html</link><author>noreply@blogger.com (Anatoly)</author><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-916785202343169452.post-9134968404616427795</guid><pubDate>Sat, 26 Dec 2009 11:00:00 +0000</pubDate><atom:updated>2009-12-26T13:00:04.050+02:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">blog</category><category domain="http://www.blogger.com/atom/ns#">computers</category><title>Social Accounts</title><description>We all have our own way of using the net and the services available on it. In this post I want to present my own current method of organizing my online activity. This doesn&#39;t mean that this post is about promoting yourself on the net. I do not have any problem with those who try to promote their content by networking with similar people and influencing the social networks, but the result that these methods give are the opposite of what I want.  I suppose it is a bit surprising for you that I am writing about this practice from a negative point of view. After all, I have my own blog, accounts on some social sites as well as accounts on Digg and StumbleUpon. However, I decided long ago that I have no reason to try and promote my blog or any account I have. The reason for this is rather simple. I just don&#39;t have the time to do this or to manage a popular blog. Being in the spotlight is great and all, but it also requires time and concentration. I feel that I rather have a not really popular blog, but I will write about what I find interesting and I will spend only as much time working on my blog as I want to. Because of this I don&#39;t ask people to promote my posts, even if they offer it. With this cleared, lets move on to the actual post.&lt;br /&gt;&lt;br /&gt;As you all know, there are lots of different sites and services available on the net that require opening an account to use (or at least have extra features for those who opened an account). As a result one can find himself with lots of accounts. Some of them are not even used anymore - but they are still there. Some accounts are even forgotten by those that open them. A few days ago I happened upon someones Google profile. It had links to his other accounts. The problem is that there were so many accounts that I didn&#39;t even bother to try and take a look on them. The question is, how many of those accounts are actually being used? Or an even better question - How many accounts can one person make use of?&lt;br /&gt;&lt;br /&gt;Having accounts that are not used or used really rare is in no way a problem. I myself have accounts that I no longer use. I think I have about 10-20 such accounts. While I try to keep tabs on them, they tend to multiply almost on their own :). Actually, a few years ago I was rather surprised to find out that I somehow got an Yahoo email account when I am completely sure that I never opened one. It turned out that I got it automatically because of my flickr account.&lt;br /&gt;However, if something is not being used it practically doesn&#39;t exist and as such is not a problem. But, unfortunately, some people believe that it is fine to use many low quality accounts in order to get the result that they want. In other words, they open lots of accounts on different social networks and then try to keep all of them active and use them mostly to promote their own content. This obviously end up with duplicated content and overall low quality account on all of the social networks. But, if such a user is active enough he may manage to attract people. Especially others like him. Since I own a blog, I am approached from time to time by such people. They usually ask me to review their posts or to digg them, and offer to do the same in return. As long as the amount of requests is small enough, I do not see this as a problem. While I do not ask people to promote my blog, I do not mind helping them - as long as I have nothing against their content. For example, there is absolutely no way that I will help promote anything about music or poetry. I hate music (I cannot really say why, this is just how it is) and lately I am starting to feel the same about poetry (don&#39;t ask why).&lt;br /&gt;&lt;br /&gt;What follows is a story of how I came to use the current accounts that I have and what I am using them for. It is in a somewhat chronological order, but I naturally don&#39;t remember when I started to use what account. The accounts listed are not all of my accounts, but all the main accounts I have on social networks are mentioned.&lt;br /&gt;&lt;br /&gt;&lt;span style=&quot;font-weight: bold;&quot;&gt;StumbleUpon&lt;/span&gt;&lt;br /&gt;Perhaps somewhat surprisingly it all started with StumbleUpon. I installed the toolbar when I was looking for interesting extensions to add to Firefox. It proved to be interesting enough, so I started to use if a bit - at first I only used it to stumble on sites. After some time (about a year maybe) I decided to start adding some simple content to my SU blog. As a result people started subscribing to it. When I saw that what I did was interesting to other people I started to increase the amount of staff I posted. I also started to write reviews of other people and at some point even wrote some bits of advice about using StumbleUpon. I cannot say that I made any friends on SU, but it was and is a rather nice experience. Currently I use SU as a photoblog. I post photos that I find on the Internet with a short comment. At first I tried to post other staff as well, but as time went by I decided that what I want is to post photos only. After some time I decided that trying to post 4 good photos per day works best for me.&lt;br /&gt;&lt;br /&gt;&lt;span style=&quot;font-weight: bold;&quot;&gt;Photobucket&lt;/span&gt;&lt;br /&gt;I got the account after reading posts about how great photobucket is. I wanted to take a look on it, so I got an account. Months later, I noticed that some photos on my SU blog were gone and others were loading slowly. So I decided to start uploading all the photos I post to photobucket and then link them from there. The free account is probably too small for some people, but I usually post only 4 photos per day and they are rather small. Who knows, maybe Photobucket will upgrade the amount of space it gives before I ran out. If not, I will just start storing photos on another site, probably Flickr.&lt;br /&gt;&lt;br /&gt;&lt;span style=&quot;font-weight: bold;&quot;&gt;Picasa&lt;/span&gt;&lt;br /&gt;Originally I started using it because of its ability to find all the photos you have on your computer and then present them and organize them rather well. Later I started to use Web Albums to keep an online backup of my photos. The only problem I have is the storage limit. Picasa cannot be used to store all of your photos online, but it gives me the ability to keep backups of photos I found on the net. While some of these photos I also have on my SU blog and therefore on Photobucket, Picasa allows me to keep an organized collection of photos I found on my computer so I use web albums to backup these collections. Eventually, when I will run out of space to use, I will start uploading photos to Flickr, or maybe some other site. It obviously depends on my activity on the net, but I think that I will run out of space next year.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style=&quot;font-weight: bold;&quot;&gt;Facebook&lt;/span&gt;&lt;br /&gt;If I remember correctly I got the account because I was bored. Even now I admit that I do not see what is so great about it. The only really good thing is the way it is connected to other sites. For me it means that I for example can post an YouTube video on Facebook with just one click on YouTube. Frankly this is also the only real use I have for this account. I have been trying to think ways to use Facebook to do something that I do not already do using some other site, but the only thing I came up with is to use it to post some random interesting staff I found on the net. However, it appears that Google reader shared staff is doing it better. While it makes some sense to have similar content in Google reader shared items and my Facebook account, I am not really sure if this is what I want. I hope that I will find some permanent use for this account eventually. Maybe I will use it to store photos, they seem to have some fair support for this.&lt;br /&gt;&lt;br /&gt;&lt;span style=&quot;font-weight: bold;&quot;&gt;Digg&lt;/span&gt;&lt;br /&gt;I don&#39;t really remember why I opened this account. I think it was because I hoped that having it will help me to stay on top of the current news. If so I probably forgot that since I am not really interested in news I will not use this account unless I have some sort of motivation to go to it. As a result this account was left alone for some time. Eventually I found the correct motivation - all those nice people who ask me to help them promote their sites on Digg. By doing so I visit the main site and as a result I see other popular posts.&lt;br /&gt;&lt;br /&gt;&lt;span style=&quot;font-weight: bold;&quot;&gt;Google Reader and FriendFeed&lt;/span&gt;&lt;br /&gt;These two sites as well as Facebook can be considered an activity feed. Their main purpose is to show my activity collected from different sites. In other words, it is a mix of updates. These sites work with different services and differ in quality. Somewhat surprisingly, the best one by far is Google Reader. But all three of them have their uses. FriendFeed is totally overloaded because of my StumbleUpon activity and I noticed that it misses some entires I have made on other sites. However it provides the most information out of all three services. Facebook provides an option to put FriendFeed into a tab in your account. This means that all of your activity can be seen from your Facebook. In addition to this it also allows to post links to different pages on the web, somewhat similar to SU. However, the format in which it is done is more fitting for a status update than a blog.&lt;br /&gt;Google Reader is much more like a blog any of the other two. While it allows to post status updates, the format it uses is more suited for longer posts. It also deals well with showing videos that I added to favorites on YouTube. Basically it is an activity feed that doubles as a blog. As I already said it is the best one of the three. However, it lacks visual polish and unlike the other two there is no obvious community around the service.&lt;br /&gt;I really don&#39;t know what will happen with activity feeds in the future. It is obvious that they are here to stay, but it seems to me that it is rather possible that I will find it reasonable to have more than one activity feed for a long time.&lt;br /&gt;&lt;br /&gt;&lt;span style=&quot;font-weight: bold;&quot;&gt;YouTube&lt;/span&gt;&lt;br /&gt;This account is currently in the making. I have some plans for it, but it is probable that they will change as time goes by. Right now I am considering making it into a collection of math\science related videos. I am not really planning to upload anything at this time (although it is possible), but from what I have seen there is more than enough content on YouTube already - it just waits to be found.&lt;br /&gt;&lt;br /&gt;&lt;span style=&quot;font-weight: bold;&quot;&gt;Wikipedia&lt;/span&gt;&lt;br /&gt;This account I opened so that my really rare edits to Wikipedia will be attributed to me. I doubt that I will ever use it for anything more than this, but time will tell. Right now it is just an about me page with some links to my other profiles.&lt;br /&gt;&lt;br /&gt;&lt;span style=&quot;font-weight: bold;&quot;&gt;Google profile&lt;/span&gt;&lt;br /&gt;This particular profile is a good example of the recent attempts to provide centralized account and identity on the net. Google is not the only one who is trying to do so, but it will come as no surprise if they will be the ones to actually make it happen. While the profile is rather simple, this is actually a good thing, because it doesn&#39;t encourage users to overload it with information. Instead it allows one to focus on main function of this profile - provide a centralized gateway to all your other profiles.&lt;br /&gt;I am not really sure that it would be a good idea to have one profile for all sites, but as long as we can provide different information on any site in addition to what is written in our main profile, the idea itself is something I have been waiting for for a long time. Right now my Google profile is just a description of who I am and what I do with links to my profiles around the net.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style=&quot;font-weight: bold;&quot;&gt;Conclusion&lt;/span&gt;&lt;br /&gt;As you can see from this list I have a rather small number of accounts. My activity is divided between two blogs - SU and Math Pages. In addition to this I also keep two activity feeds updated - Facebook and Google Reader shared items. All the rest of my accounts are either updated as part of my activity on the mentioned sites or are rarely used, if at all. However, as you probably noticed, sometimes I don&#39;t update my blogs and activity feeds for relatively long periods of time. Maybe if I had less of them it would be easier, but I doubt it. Right now my activity is divided rather well between my interests, so if I fail to update it just means that I am to busy or have some other reason that prevents me from updating.</description><link>http://mathpages.blogspot.com/2009/12/social-accounts.html</link><author>noreply@blogger.com (Anatoly)</author><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-916785202343169452.post-6974528590496054425</guid><pubDate>Tue, 22 Dec 2009 11:00:00 +0000</pubDate><atom:updated>2009-12-23T07:23:44.533+02:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">math</category><title>Analysis and Combinatorics</title><description>We often hear about how all mathematics is interconnected, but rarely see clear and simple examples of such connections. In this post I want to show one example in which theorems developed in Calculus are used to solve a range of combinatoric problems.&lt;br /&gt;&lt;br /&gt;To begin lets consider the following problem. For any natural number K what is the number of ways it can be written as a sum of powers of two, if we allow each of them to be used only ones? Lets suppose that the number of ways is a(k). It is obvious that a(1)=1, a(2)=1. Lets define a function:&lt;br /&gt;&lt;br /&gt;&lt;div style=&quot;text-align: center;&quot;&gt;f(x)=a(0)+a(1)x+a(2)x^2+....&lt;br /&gt;a(0)=1&lt;br /&gt;&lt;br /&gt;&lt;div style=&quot;text-align: left;&quot;&gt;It is easy to see that if a(k) is defined this way then it is also true that:&lt;br /&gt;&lt;br /&gt;&lt;div style=&quot;text-align: center;&quot;&gt;f(x)=(1+x)(1+x^2)(1+x^4)(1+x^8)......&lt;br /&gt;&lt;br /&gt;&lt;div style=&quot;text-align: left;&quot;&gt;This is true because if we open the brackets we will get that x^k appears exactly a(k) times. Now lets multiply f(x) by (1-x). It is easy to show that:&lt;br /&gt;&lt;br /&gt;&lt;div style=&quot;text-align: center;&quot;&gt;(1-x)f(x)=1&lt;br /&gt;&lt;br /&gt;&lt;div style=&quot;text-align: left;&quot;&gt;You show this by looking on a finite multiplication and then taking limit. However, now we got that:&lt;br /&gt;&lt;br /&gt;&lt;div style=&quot;text-align: center;&quot;&gt;f(x)=1/(1-x)=1+x+x^2+x^3+x^4+.....&lt;br /&gt;&lt;br /&gt;&lt;div style=&quot;text-align: left;&quot;&gt;This is true because this is the formula for the sum of the geometric series for any 0&lt;x&gt;&lt;1. style=&quot;text-align: center;&quot;&gt;F(n)=F(n-1)+F(n-2)  ,  F(0)=0, F(1)=1&lt;br /&gt;f(x)=F(0)+F(1)x+F(2)x^2+....&lt;br /&gt;&lt;br /&gt;&lt;div style=&quot;text-align: left;&quot;&gt;Lets look on the following multiplications xf(x), x^2f(x). Because of the recursive formula we get:&lt;br /&gt;&lt;br /&gt;&lt;div style=&quot;text-align: center;&quot;&gt;f(x)(1-x-x^2)=F(0)+(F(1)-F(0))=1&lt;br /&gt;&lt;/div&gt;&lt;div style=&quot;text-align: center;&quot;&gt;f(x)=1/(1-x-x^2)&lt;br /&gt;&lt;br /&gt;&lt;div style=&quot;text-align: left;&quot;&gt;The only thing left to do is to calculate the series and we are done. This part is left as an exercise for the bored reader. The important thing is that the same idea works for any different series - this is not something that is true only in a specific case. As such this is indeed an example of how mathematics is interconnected and how calculus that is the study of infinite can be used to solve finite combinatoric problems.&lt;br /&gt;&lt;/div&gt;&lt;/div&gt;&lt;/div&gt;&lt;div style=&quot;text-align: left;&quot;&gt;&lt;br /&gt;&lt;/div&gt;&lt;/x&gt;&lt;/div&gt;&lt;/div&gt;&lt;/div&gt;&lt;/div&gt;&lt;/div&gt;&lt;/div&gt;&lt;/div&gt;&lt;/div&gt;</description><link>http://mathpages.blogspot.com/2009/12/analysis-and-combinatorics.html</link><author>noreply@blogger.com (Anatoly)</author><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-916785202343169452.post-465531177212491147</guid><pubDate>Sun, 20 Dec 2009 16:13:00 +0000</pubDate><atom:updated>2009-12-20T18:13:00.341+02:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">math</category><category domain="http://www.blogger.com/atom/ns#">paradoxes</category><title>Gabriel&#39;s Horn</title><description>I didn&#39;t write anything about paradoxes for a long time, so here is a little something. Lets look on the volume we get by rotating the graph of the function y=1/x, for x&gt;1. The object we get is called Gabriel&#39;s Horn. It is easy enough to show that its volume is finite and in is equal to pi. If we cut the horn in any finite point a we will get that the volume is exactly:&lt;a onblur=&quot;try {parent.deselectBloggerImageGracefully();} catch(e) {}&quot; href=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgl416i15ZVDmAKkIjasA4kfhyphenhyphenuDmwFYYeNs4Y2FZBUQ3wlA_8f2pTIz-DqNqZnwc6eO8k4HwKDSZqN9d3gAfIrm7aCK4J6q3e9v8h7NUty2WMkbgq1h2m8CKNJjn4-2NbHsXmz6BvWnyw/s1600-h/volumeg.png&quot;&gt;&lt;img style=&quot;margin: 0px auto 10px; display: block; text-align: center; cursor: pointer; width: 257px; height: 50px;&quot; src=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgl416i15ZVDmAKkIjasA4kfhyphenhyphenuDmwFYYeNs4Y2FZBUQ3wlA_8f2pTIz-DqNqZnwc6eO8k4HwKDSZqN9d3gAfIrm7aCK4J6q3e9v8h7NUty2WMkbgq1h2m8CKNJjn4-2NbHsXmz6BvWnyw/s320/volumeg.png&quot; alt=&quot;&quot; id=&quot;BLOGGER_PHOTO_ID_5417204570109504658&quot; border=&quot;0&quot; /&gt;&lt;/a&gt;If we now take the limit when a goes to infinity we will get that the volume is indeed pi. However the surface area is infinite. For any finite a we will get that it is exactly:&lt;br /&gt;&lt;br /&gt;&lt;a onblur=&quot;try {parent.deselectBloggerImageGracefully();} catch(e) {}&quot; href=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEiaiutynxR8en1iF2vYRQkblXioDFjADG78jvY9_1XudQtj3rZljNQPJfZYpPYiNcyLQNw6u0reONDDxT-JItRmPXMDkRWJlpjFs4eTKZykV3Csp2bdzGtYWKF3mn89TdH-H9K8buSRcV8/s1600-h/areag.png&quot;&gt;&lt;img style=&quot;margin: 0px auto 10px; display: block; text-align: center; cursor: pointer; width: 320px; height: 47px;&quot; src=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEiaiutynxR8en1iF2vYRQkblXioDFjADG78jvY9_1XudQtj3rZljNQPJfZYpPYiNcyLQNw6u0reONDDxT-JItRmPXMDkRWJlpjFs4eTKZykV3Csp2bdzGtYWKF3mn89TdH-H9K8buSRcV8/s320/areag.png&quot; alt=&quot;&quot; id=&quot;BLOGGER_PHOTO_ID_5417204565717044466&quot; border=&quot;0&quot; /&gt;&lt;/a&gt;&lt;br /&gt;But the limit of this expression is infinity. Now that we know this , we can go on to the description of the paradox. Suppose that you want to paint the Horn with finite amount of paint. Obviously, it is not possible because the surface area is infinite. But you can fill it with a finite amount of paint. Lets now suppose that Horn is made from a transparent plastic. In this case, filling it with paint is the same thing as painting it.&lt;br /&gt;&lt;br /&gt;As a result we get that it is both impossible and possible to paint the Horn with finite amount of paint. So which one is true? The solution is in fact rather simple. Firstly lets look on the graph of y=1/2x. Obviously this is again Gabriel&#39;s horn, but in a scaled down version. Lets put it inside the original while it is still filled with paint. In this way we painted it from the outside. How did we do it? The answer to this is in the distribution of paint. The thickness of paint is given by g=1/x-1/2x=1/2x. And this is the whole trick. We can paint even an infinite surface, the only thing we need to worry about is allowing the thickness of paint to approach zero in a way similar to this example (we need the integral of the paint distribution to be finite).</description><link>http://mathpages.blogspot.com/2009/12/gabriels-horn.html</link><author>noreply@blogger.com (Anatoly)</author><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgl416i15ZVDmAKkIjasA4kfhyphenhyphenuDmwFYYeNs4Y2FZBUQ3wlA_8f2pTIz-DqNqZnwc6eO8k4HwKDSZqN9d3gAfIrm7aCK4J6q3e9v8h7NUty2WMkbgq1h2m8CKNJjn4-2NbHsXmz6BvWnyw/s72-c/volumeg.png" height="72" width="72"/><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-916785202343169452.post-6607225571957488563</guid><pubDate>Fri, 18 Dec 2009 10:23:00 +0000</pubDate><atom:updated>2009-12-19T09:27:56.967+02:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">math</category><title>Collecting and storing books</title><description>For a long time buying books was considered at the very least practical. As long as it was economically sound, having a nice small library at home was without doubt a useful thing. However is this still true now? Naturally, I am not talking about buying fiction (this is after all a math blog).&lt;br /&gt;&lt;br /&gt;To better illustrate the question, lets consider the following example. About a year ago some friends of my grandfather gave me a good multi volume encyclopedia. Obviously it is not something that is expected to be used everyday, but I didn&#39;t open it even once in all this time. The reason for this is simple - if I want information about some specific subject, it is easier for me to search in the Internet. It is almost certain that there will be an article on this subject on Wikipedia, or some other place.&lt;br /&gt;To a certain degree the same is true even for my math textbooks\notes. Frequently enough I prefer to search on the Internet for a specific definition or proof of a certain theorem. Unfortunately, this is often less successful than searching for staff one can find in an encyclopedia.&lt;br /&gt;&lt;br /&gt;As a result we get the following situation - while we have lots of available books it doesn&#39;t seem practical to invest money in buying them. This is especially true about buying new editions of books we already have, or books that cover the same topic but use different approaches. This is especially true considering how overpriced some books are.&lt;br /&gt;A possible solution to this is downloading books (for free). While not all books can be downloaded for free from the net, it is possible to find good books on any given topic. For example there is currently a collection of over 600 math books available on &lt;a href=&quot;http://isohunt.com/torrent_details/49466955/mathematics?tab=summary&quot;&gt;bittorent&lt;/a&gt;. There is also a nice collection of calculus books on the same &lt;a href=&quot;http://isohunt.com/torrent_details/137898665/mathematics?tab=summary&quot;&gt;site&lt;/a&gt;. The only problem with those collections is that they will not remain available forever. In other words, it is a good idea to download it even if you don&#39;t need it right now.&lt;br /&gt;&lt;br /&gt;This however brings us to a second problem. While it is possible to download lots of books from the net, we also need some way to organize them so that it will be possible to use them. Another problem is keeping an up to date backup (you wouldn&#39;t want to lose 10GB of books suddenly would you?).&lt;br /&gt;I must admit that I don&#39;t feel that I managed to make any serious progress in solving either of these two problems. For backup, I long ago decided that burning my files to CD or DVD is not a good idea. It becomes difficult to keep track of the backups, and also the discs tend to be damaged so it is not very safe. Another option, is to keep a copy of your files on the web. I personally use Google Docs. It can only be used for pdf files up to 10mb, so some books I cannot upload, but it is really reliable and the way it is build makes organizing books relatively easy. Some times ago I tried to use Scribd for storing some of the large books I have. Unfortunately, it didn&#39;t work. They check the files that you upload, and if they notice that you have books that are copyrighted they will delete them. I also tried to use DivShare, but it is rather unreliable and overall not something I would recommend.&lt;br /&gt;&lt;br /&gt;In the end the decision whether to have a digital book library or not is a personal one. In my case I decided to do it out of pure love for books. I just cannot say no to an opportunity to have a library. I do hope however that I will manage to make use of all those books I collected...</description><link>http://mathpages.blogspot.com/2009/12/collecting-and-storing-books.html</link><author>noreply@blogger.com (Anatoly)</author><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-916785202343169452.post-430030568541088118</guid><pubDate>Tue, 22 Sep 2009 07:19:00 +0000</pubDate><atom:updated>2009-12-19T09:41:46.694+02:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">links</category><category domain="http://www.blogger.com/atom/ns#">math</category><title>My library</title><description>Over the years I made a little online collection of math and other books. In order to organize and manage this collection better, as well as to share it with other people,  I decided to post links to all these books here, on my blog. I hope that you will find this collection of links useful. As of now it is rather small, but I plan to add more books. There is a surprising number of such books available online for free - but it takes time to find them. Some If you have a problem with your book linked from here, please let me know and I will remove the link immediately.&lt;br /&gt;Since most of these books are available for free on the author page, I just linked those pages. In some case, the book is on a site that has no connection with the author. In such a case it is possible that it is an illegal copy - use it on your own risk. I provide the links for educational use only.&lt;br /&gt;&lt;br /&gt;If you want to recommend a link for addition, you can leave a comment. In order to keep this post as tidy as possible I will not publish the comment, but I will consider adding the book(s). In order for a book to &quot;qualify&quot; it must be about math, physics or programing and it must be large enough (that is, not an article but an actual book). If a link a broken please leave a comment about it, I will try to fix it if possible.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style=&quot;font-weight: bold;&quot;&gt;Math:&lt;/span&gt;&lt;br /&gt;1. Elements of Abstract and Linear Algebra - E. H.Connell (&lt;a href=&quot;http://www.math.miami.edu/%7Eec/book/&quot;&gt;author page&lt;/a&gt;)&lt;br /&gt;2. Foundations of Combinatorics with Applications - Edward A. Bender, S. Gill Williamson  (&lt;a href=&quot;http://math.ucsd.edu/%7Eebender/CombText/&quot;&gt;author page&lt;/a&gt;)&lt;br /&gt;3. Graph Theory 3rd Edition - Springer-Verlag Heilderberg  (&lt;a href=&quot;http://diestel-graph-theory.com/index.html&quot;&gt;order&lt;/a&gt; / author page)&lt;br /&gt;4. Algebraic Topology - Allen Hatcher  (&lt;a href=&quot;http://www.math.cornell.edu/%7Ehatcher/AT/ATpage.html&quot;&gt;author page&lt;/a&gt;)&lt;br /&gt;5. A Problem Course in Mathematical Logic - Stefan Balaniuk (&lt;a href=&quot;http://euclid.trentu.ca/math/sb/pcml/&quot;&gt;author page&lt;/a&gt;)&lt;br /&gt;6. Multivariable Calculus - George Cain and James Herod  (&lt;a href=&quot;http://people.math.gatech.edu/%7Ecain/notes/calculus.html&quot;&gt;author page&lt;/a&gt;)&lt;br /&gt;7. Calculus - Gilbert Strang (&lt;a href=&quot;http://ocw.mit.edu/ans7870/resources/Strang/strangtext.htm&quot;&gt;author page&lt;/a&gt; )&lt;br /&gt;8. Linear Methods of Applied Mathematics - Evans M. Harrell II and James V. Herod (&lt;a href=&quot;http://www.mathphysics.com/pde/&quot;&gt;author page&lt;/a&gt; - this book has a rather nasty license)&lt;br /&gt;9. Complex Analysis - George Cain  (&lt;a href=&quot;http://people.math.gatech.edu/%7Ecain/winter99/complex.html&quot;&gt;author page&lt;/a&gt;)&lt;br /&gt;10. Linear Algebra, Infinite Dimensional Spaces, and MAPLE - James Herod (&lt;a href=&quot;http://people.math.gatech.edu/%7Eherod/Hspace/Hspace.html&quot;&gt;author page&lt;/a&gt;)&lt;br /&gt;11. Linear Algebra - Jim Hefferon (&lt;a href=&quot;http://joshua.smcvt.edu/linalg.html/&quot;&gt;author page&lt;/a&gt; ) This book has complete solutions of exercises.&lt;br /&gt;12. The Geometry and Topology of Three-Manifolds - William P. Thurston (&lt;a href=&quot;http://msri.org/publications/books/gt3m/&quot;&gt;author page&lt;/a&gt;)&lt;br /&gt;13. Introduction to Probability - Charles M.Grinstead (&lt;a href=&quot;http://www.dartmouth.edu/%7Echance/teaching_aids/books_articles/probability_book/book.html&quot;&gt;author page&lt;/a&gt;)&lt;br /&gt;14. Elementary Linear Algebra - Keith Matthews  (&lt;a href=&quot;http://www.numbertheory.org/book/&quot;&gt;author page&lt;/a&gt;) This book has complete solutions of exercises.&lt;br /&gt;15. Understanding Calculus (&lt;a href=&quot;http://www.understandingcalculus.com/index.php&quot;&gt;author page&lt;/a&gt; - this is an online book, you can download it for 5$)&lt;br /&gt;16. Elementary Calculus: An Infinitesimal Approach - H. Jerome Keisler (&lt;a href=&quot;http://www.math.wisc.edu/%7Ekeisler/calc.html&quot;&gt;author page&lt;/a&gt;)&lt;br /&gt;17. Combinatorics - Russell Merris (&lt;a href=&quot;http://www.scribd.com/doc/7248879/Combinatorics-2nd-Ed-R&quot;&gt;link&lt;/a&gt;)&lt;br /&gt;18. Real Analysis - Royden (&lt;a href=&quot;http://www.scribd.com/doc/7485454/Royden-Real-Analysis&quot;&gt;link&lt;/a&gt;)&lt;br /&gt;&lt;br /&gt;&lt;span style=&quot;font-weight: bold;&quot;&gt;Programing:&lt;/span&gt;&lt;br /&gt;1. Dive into Greasemonkey (&lt;a href=&quot;http://diveintogreasemonkey.org/&quot;&gt;author page&lt;/a&gt;)&lt;br /&gt;2. SQL server 2008 (&lt;a href=&quot;http://www.scribd.com/doc/12902398/SQL-Server-2008&quot;&gt;link&lt;/a&gt;)&lt;br /&gt;&lt;br /&gt;&lt;span style=&quot;font-weight: bold;&quot;&gt;General:&lt;/span&gt;&lt;br /&gt;1. Flatland: A Romance of Many Dimensions - Edwin A. Abbott (&lt;a href=&quot;http://www.worldwideschool.org/library/books/sci/math/Flatland/toc.html&quot;&gt;link&lt;/a&gt; - there are lots of other books on this site)&lt;br /&gt;&lt;br /&gt;&lt;span style=&quot;font-weight: bold;&quot;&gt;Bittorent links:&lt;/span&gt;&lt;br /&gt;1. &lt;a href=&quot;http://isohunt.com/torrent_details/49466955/mathematics?tab=summary&quot;&gt;Mathematics&lt;/a&gt; - a collection of over 600 math books on different subjects.&lt;br /&gt;2. &lt;span id=&quot;HotLinkbody&quot;&gt;&lt;a href=&quot;http://isohunt.com/torrent_details/137898665/mathematics?tab=summary&quot;&gt;Calculus Book Folder&lt;/a&gt; - a small collection of calculus books. Alternative &lt;a href=&quot;http://isohunt.com/torrent_details/125190373/mathematics?tab=summary&quot;&gt;link&lt;/a&gt;.&lt;br /&gt;3. 100 Great Problems of Elementary Mathematics - &lt;a href=&quot;http://isohunt.com/torrent_details/138681933/mathematics?tab=summary&quot;&gt;link&lt;/a&gt;.&lt;br /&gt;4. Mathematics As a Science of Patterns - &lt;a href=&quot;http://isohunt.com/torrent_details/140191965/mathematics?tab=summary&quot;&gt;link&lt;/a&gt;.&lt;br /&gt;&lt;/span&gt;</description><link>http://mathpages.blogspot.com/2009/09/my-library.html</link><author>noreply@blogger.com (Anatoly)</author><thr:total>1</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-916785202343169452.post-6613964591683623675</guid><pubDate>Sun, 20 Sep 2009 15:28:00 +0000</pubDate><atom:updated>2009-09-20T19:57:49.150+03:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">computers</category><category domain="http://www.blogger.com/atom/ns#">links</category><title>Storing files on the Internet</title><description>This post is a response to a comment that was left on my post &lt;a href=&quot;http://mathpages.blogspot.com/2009/09/google-os-is-already-here.html&quot;&gt;Google OS is already here&lt;/a&gt;. I don&#39;t usually post responses to comments in such a way, but the answer to this comment ended up being rather long (I though initially that I can split it into two comments, but in the end it is almost as large as two regular posts) . Also, while the initial comment was about Glide, in order to properly answer the points raises I needed to give a little summary of the ways I use to share and store files on the web. This post can be thought of as a list of services that provide the functionality that is provided by Glide, but are not &quot;packed&quot; in an online OS. (This obviously brings us to the following question - Why use many services if there is one that provides all that functionality? The answer to this will be given in the end of the post).&lt;br /&gt;&lt;br /&gt;Firstly, concerning the main point of the comment, I agree that Glide has features that a remote desktop doesn&#39;t have. I didn&#39;t say it clear enough in the previous post so I will say it in this one - the part that Glide cloned from Windows is the visual aspect. The functionality that it has is close to what one would expect from an online OS, but the problem is the &quot;frame&quot;. As I see it, Glide attempts to easy the transition from other operating system to itself, but by doing so it is bound to compromise on the visual aspect and thus on the user experience. With this in mind lets look on the features Glide provides that were mentioned in the comment and what alternatives to them are available (if any).&lt;br /&gt;&lt;br /&gt;The first point to consider is compatibility.  I must say that I have been using Linux for about 3 years and I never had a problem opening any file I got my hands on. I did have some problem with a .gbi file a few weeks ago, but in the end I found a way to open it is well. In the latest Linux distributions there is more then enough support for main file formats, and unless you happen to live in a country with draconian copyright laws, there is no problem to install support for many other file types. In Ubuntu, there is an official package that installs all the needed programs.  Besides, there are sites (like Google Docs and &lt;a href=&quot;http://www.divshare.com/&quot;&gt;DivShare&lt;/a&gt;) that automatically convert files to a format that most devices don&#39;t have a problem with. If your files are on the web anyway, it doesn&#39;t mater what site they are on exactly. All you need to do is to send a link.&lt;br /&gt;&lt;br /&gt;The second point is synchronization.  I never had real need for synchronizing files between many computers. However, I am aware of some programs that allow easy synchronization as long as the operating system is the same. For Ubuntu you have a nice program called &lt;a href=&quot;https://one.ubuntu.com/&quot;&gt;Ubuntu One&lt;/a&gt;. It offers a free 2GB online storage that is automatically synchronized across all of your computers (right now it is in beta, but I doubt it will stay like this for a long time). I don&#39;t think that it is a good idea to use it for large files, but as long as the files are small enough (lets say under 5mb) it is a perfect solution. For Windows,  &lt;a href=&quot;http://www.diino.com/&quot;&gt;Diino&lt;/a&gt; offers similar functionality. They provide much more space (100GB and more), but it is a paid service.&lt;br /&gt;It is also worth mentioning that Picasa allows to sync albums. The free account is rather small, only 1GB, but as you are probably aware it is possible to buy more storage space. I personally prefer not to sync files across computers, but to store them on the web and if I need them to access them on the web. In this way, my files are scattered around my computers, but they are all available on the web. Although, even there they may be on different sites. For example right now my files are distributed in the following way:&lt;br /&gt;1. Google Docs - for small documents. Most of my documents are well within the size limit.&lt;br /&gt;2. DivShare - for large Documents and Video/Audio. This site provides 5GB of free storage (you can buy more). It works well for storing large (but not huge) files.&lt;br /&gt;3. Picasa and flickr-  for photos. They both don&#39;t reduce the photo quality and allow an easy enough privacy management.&lt;br /&gt;4. Photobucket - for photos that I use on my SU blog. Photobucket is excellent for monitoring bandwidth use, so since the photos I post on SU are usually small, it is a perfect solution for me.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;The third point is accessibility. As you all know it is possible to use Glide from any device that has an Internet connection and a browser. Thus, all your files are always accessible from any computer with an Internet connection. But using an online OS is not the only way to get this. This is another thing that I apparently didn&#39;t say clearly enough in my previous post - my example with a phone. It is well known that it is possible to store files on a mobile phone. But you can do more than this. It is possible to install an operating system on it. A modern mobile phone can act as an USB drive. And it is possible to boot a computer from such a disc and thus it is possible to install a full operating system on the phone. Then, for example, if you installed Ubuntu like this, you can add it to your Ubuntu one account and all your files will be synchronized. In addition to this, you don&#39;t need an Internet connection to use the OS. This means that all the programs you have on your computer are always with you. The only downside to this is that you need to connect the phone to another computer to use the OS, while Glide is possible to use from the phone itself.&lt;br /&gt;&lt;br /&gt;I was asked in the comment: &quot;How would you share a 1GB video with someone in a distant location when you were traveling with your mobile phone away from all of your computers?&quot; - The answer to this depends on the location of the file. If it is on my phone, I would probably use &lt;a href=&quot;http://www.filemail.com/&quot;&gt;Filemail&lt;/a&gt;. It allows sending files up to 2GB for free. If I have the file somewhere on the net, I would just send a download link. Obviously, if the file is only on my computer I would have no way of sending it, but I try to have an online copy of all the important files I have on my computer. The fact that my files a scattered around the web makes it a little disorganized, but I don&#39;t think that this is a bad thing. Moreover, did you hear about a site named eggdisk? They offered a really nice online storage service and delivered it for sometime. But then one day (without any warning), they stop providing the service, turned the site into ads and didn&#39;t even allowed the people to get their files. Because of this case I prefer to keep my files scattered like this around the web.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;The forth and last point is integration of services. About this I agree completely. Right now the level of integration between Google services is rather lacking. However, it is probably worth mentioning that too much of integration will effectively force the user to use only the services provided by Google. But this is just a remark, I most certainly hope that the level of integration will increase. This point is, I think, an important one for those who want a system &quot;that just works&quot;. Because of this, Glide is better for those who need to use an online OS for work.&lt;br /&gt;&lt;br /&gt;To wrap it up, for different people and situations different solutions are needed. For me Glide fails to be anything else but a remote desktop. Since I don&#39;t want my staff to be in only one location on the net, I cannot use Glide in a way other people do effectively. Also, because of this I prefer to use all the services I mentioned in this post, and I am always looking for new sites that provide functionality useful to me.  However, since this leads to a loss of time, there are people who prefer their files to be centralized and they want to have one simple way to access them all. For such people an online OS like Glide is clearly the perfect solution. Even the fact that it clones Windows appearance is only a bonus to them.</description><link>http://mathpages.blogspot.com/2009/09/storing-files-on-internet.html</link><author>noreply@blogger.com (Anatoly)</author><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-916785202343169452.post-7858139473900753869</guid><pubDate>Fri, 18 Sep 2009 12:11:00 +0000</pubDate><atom:updated>2009-09-18T21:23:25.161+03:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">math</category><category domain="http://www.blogger.com/atom/ns#">paradoxes</category><title>Indescribable numbers</title><description>This post is an attempt to explain what the term indescribable number means. Unfortunately, while this is a relatively well know term I frequently see it being misused. To understand it, we must firstly look on the proof that such numbers exist. It is a rather basic proof from set theory. What we need to do is to define two sets:&lt;br /&gt;&lt;br /&gt;A={all the mathematical symbols and all the letters}&lt;br /&gt;B={finite words in A}&lt;br /&gt;&lt;br /&gt;Now, it is obvious that A is finite. B is not finite but it is only countably infinite (this is the smallest infinity). Therefore, B is smaller than the set of all numbers - R. Since all the possible descriptions are in B we conclude that there are numbers in R that cannot be described at all. Moreover, if you take away all the numbers that can be described the size of R will not change (this is a basic theorem in set theory). From this we can conclude that in fact most numbers are indescribable. This is a perfectly valid example of &lt;a href=&quot;http://mathpages.blogspot.com/2008/08/nonconstructive-proofs.html&quot;&gt;nonconstructive proof&lt;/a&gt;.&lt;br /&gt;&lt;br /&gt;Unfortunately, this simple and short proof (I didn&#39;t proof all I said, but it is all just basic theorems of set theory) does little to explain what an indescribable number is. Lets consider some examples. For the first example, look on the following set:&lt;br /&gt;&lt;br /&gt;C={words in A shorter than one hundred letters}&lt;br /&gt;&lt;br /&gt;It is obvious that C is finite. Therefore there is a maximum number described by C. The next integer number (lets call it Y)  is thus &quot;the first integer number that cannot be described in 100 letters&quot;. But this description is less then 70 letters long. And this means that this number should be in C. Obviously this is a paradox. We got a number that is both in C and not in C.&lt;br /&gt;&lt;br /&gt;Here is another example of a similar problem. It is possible to proof that if you randomly choose a real number the probability of it being an indescribable number is 1. So lets randomly choose a number (since we are choosing only one number we don&#39;t need the choice axiom). Naturally we get an indescribable number. Well, lets call this number &quot;indescribable number 1&quot;. In the case you didn&#39;t notice I just gave a description to an indescribable number.&lt;br /&gt;&lt;br /&gt;What really is going on is just an indexing problem. It is important to understand that both B and C are just sets of index numbers. If we have such a set we can use it to index another (in our case the set R). Mathematically, description as it was used in those examples is just a function from B to R (or from C to R). But the way we apply the indexing is arbitrary - we can choose any function we want. Lets first look on the 100 letters case. When we defined the set C what we really defined is the pair (C, f). In this pair f is a description function that for any x in C returns a specific number in R (I suppose that all the words in C describe some number, but you can do without it). Since we cannot define Y without firstly defining (C,f) the word  &quot;&quot;the first integer number that cannot be described in 100 letters&quot; is assigned by f to some random number. Then when we got a description for Y, we basically created a new pair (C, g). In this pair g is a new function that agrees with f on all C except for one word - &quot;&quot;the first integer number that cannot be described in 100 letters&quot;. To this word it assigns Y. For us this may seem illogical, because we think about meaning of words. But in this proof meaning is not important - the words are just a way to index.&lt;br /&gt;&lt;br /&gt;With this in mind, lets consider the second example. In this case the number we choose belongs to a set R\f(B). When we gave it a description all we did was to change f in such a way that now this number belongs to f(B). It is obviously not a problem to do such a change (if we wanted to change the function for an infinite amount of values it might have been a problem, but for one index it is always easy to do).&lt;br /&gt;&lt;br /&gt;So, what is an indescribable number? After all, we just saw that it is possible to describe any random number. The answer to this is actually simple. Mathematically it is a number that was not indexed by the function f. In normal language it means that it is a number that &lt;span style=&quot;font-weight: bold;&quot;&gt;wasn&#39;t&lt;/span&gt; described. Form a normal person point of view this is a weird definition, but mathematically it actually makes a lot of sense. The basic idea is that while we have the option to choose any function f, we can only choose one and we cannot change our choice to another function latter on (this is because we need our language to be consistent). Under this conditions it becomes obvious that both examples are just a misunderstanding of what an indescribable number is. You cannot take a number that is not described and give it a description, because the description is already in use and you can have only one number for one description .&lt;br /&gt;But then, what is the point in saying that such numbers exit? It is after all obvious that there are numbers that are not described as of now. Unfortunately this is not what the theorem is about. The point of this theorem is not to say that there are numbers that we didn&#39;t describe. This theorem says that no matter what function f we use there are always numbers that are not in f(B). In other words, there are always will be numbers that we didn&#39;t describe even if we used all of B for the purpose of such description.</description><link>http://mathpages.blogspot.com/2009/09/indescribable-numbers.html</link><author>noreply@blogger.com (Anatoly)</author><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-916785202343169452.post-6236240157410873486</guid><pubDate>Wed, 16 Sep 2009 14:32:00 +0000</pubDate><atom:updated>2009-09-20T20:00:25.910+03:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">computers</category><title>Google OS is already here</title><description>As you all probably know Google recently &lt;a href=&quot;http://googleblog.blogspot.com/2009/07/introducing-google-chrome-os.html&quot;&gt;announced&lt;/a&gt; that they are going to build a natural extension to Chrome. Obviously, a natural extension to a web browser is an OS (and no this is not a joke). Well, I wonder when I will get to use this.... I just hope I will manage to restrain myself from installing the first beta version available to the public.... Sometimes I feel that I love installing software a bit too much. But anyway, lately I feel that the final release of Google OS will be more of a formal step than anything else. The reason for this is that the services provided be Google are already close to being a real on-line OS. Before explaining what that means, lets look on a typical online OS. For example, &lt;a href=&quot;http://www.google.com/bookmarks/url?url=http://www.glidedigital.com/&amp;amp;ei=Tv6oSu7fJ5D2oQO9iMWtDA&amp;amp;sig2=vaHTCqkEWdVuaOVs6_RVUw&amp;amp;ct=b&quot;&gt;Glide&lt;/a&gt;. If you look on it (&lt;a href=&quot;http://www.youtube.com/watch?v=HbmX3o42RtI&quot;&gt;here&lt;/a&gt; is a little video), you will see that it is basically an attempt to clone a regular OS on the web. The reason I am saying this is simple - just look on the way it looks. It is just like Windows. Obviously some details are different, but the overall idea didn&#39;t change. And this is a problem. There is no reason for an online OS to look like a regular OS - the whole point in the transition to online OS is to find a new concept, a new look for the OS. Moreover, the system offered by Glide is nothing more than an remote desktop. The only advantage it has over a normal system is the fact that it is available from any computer with Internet. But this is not enough for a system to be an online OS. Actually, if you want you files to always be available, you can install an operating system on you mobile phone, and then you will be able to use it on any computer with an USB port- even an Internet connection is not needed. Obviously this is better than what such an &quot;online&quot; OS offers.&lt;br /&gt;&lt;br /&gt;Google on the other hand is close to making a real online OS. Even now their web services cover most of the things we expect from an OS. To better understand this point lets look on what we expect to get with an install of Windows and attempt to find the corresponding functionality in what Google currently offers. Naturally we will be only looking from the end user point of view.&lt;br /&gt;&lt;br /&gt;The most obvious thing we get when installing Windows is &quot;My Documents&quot; folder. In the two latests releases there are attempts to further divide this folder into pictures, documents music and videos. Google provides us with Google Docs, YouTube, Google Video and Picasa Web Albums. Each one of them is meant for only one type of content and they are much better for managing your files that what you get with a default installation of Windows. (I don&#39;t know any good place to store music online, but I am sure that there are ways to do this as well, although it is not provided be Google). It is important to remember that while right now Google doesn&#39;t do mass file storage, there are sites on the Internet that do just that, and there are rumors flying around the Internet for years about Google storing 100% of our files. Besides, any really large files (like video longer that what you can put on YouTube) you probably don&#39;t want to store on the net because getting it from there takes a bit too much time with current Internet connection speeds.&lt;br /&gt;&lt;br /&gt;The second thing we get is Office (and notepad, for those who use it). It is not provided be default but it is a basic enough product. Google gives us Google Docs which are for most users a good enough replacement for Microsoft office. Also if you don&#39;t like Google Docs you can use other products like &lt;a href=&quot;http://www.zoho.com/&quot;&gt;Zoho&lt;/a&gt; for example. On this note, it is also possible to do light photo editing on the web. While I don&#39;t know about sites good enough for professional graphic design, I do know about a nice site for simple graphic editing - &lt;a href=&quot;http://fotoflexer.com/&quot;&gt;FotoFlexer&lt;/a&gt;.&lt;br /&gt;&lt;br /&gt;The third and final step is communication. This is not something provided be Windows, but the reason we buy computers is to be able to communicate with other people. Since we are talking about an online OS, things like communication become something that is only natural for an OS to provide. And Google does just that. We get Gmail, Blogger, YouTube, Google Video, Google Docs and etc.. All of these products are either build for communication or have the option for collaboration like Google Docs. Right now we view them as services but for an online OS, those are major components.&lt;br /&gt;&lt;br /&gt;The only thing Google is missing right now is a &quot;frame&quot;. In order for all those services to become an OS we need something that will put them together and offer them to the public as an OS. The building of this frame is being done in three stages. The first stage is the links to other Google products that appear on the Google main page. Those links make all those services connected and easy to reach from each other. The second stage is the browser. The browser has a lot of importance. The way it works and looks is extremely important for an online OS (the reasons should be obvious). For this we now have Google Chrome. Did you notice that by default it has only two lines of menus compared to Firefox five lines? It is obvious that the developers attempt to make it even look like a frame, like the status bar in Windows.&lt;br /&gt;The third and final stage is the Kernel. It is rather pointless to have two OS on one computer in the same time. If we are too use Google OS from Windows (or a Linux distro) we are basically using one OS to connect to another. This is something that needs fixing and Google is now doing just that - they are making a desktop component for the online OS, a component that will remove the need to use two OS in the same time. The only thing that this component needs to do is to boot up, start Google chrome and connect to the Internet. This simplicity is also the reason why they say that the OS is a natural extension of the browser. All it has to do is to make the browser start without anything else on the computer. Obviously, this also means that all the configurations that are needed to be done for the computer to work will be done from inside the browser (at least I think so). Doing this will require a lot of work on Google Chrome, but with Google resources and the help from the Linux community this project will almost surely receive, doing this all in a reasonable time is perfectly possible.&lt;br /&gt;&lt;br /&gt;&lt;span style=&quot;font-weight: bold;&quot;&gt;Update:&lt;/span&gt;&lt;br /&gt;There was an interesting comment on this post that caused me to write another post about Glide and the functions it provides. The post is titled &lt;a href=&quot;http://mathpages.blogspot.com/2009/09/storing-files-on-internet.html&quot;&gt;Storing files on the Internet&lt;/a&gt;.</description><link>http://mathpages.blogspot.com/2009/09/google-os-is-already-here.html</link><author>noreply@blogger.com (Anatoly)</author><thr:total>4</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-916785202343169452.post-4403905646437947870</guid><pubDate>Mon, 14 Sep 2009 16:49:00 +0000</pubDate><atom:updated>2009-09-14T19:49:00.132+03:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">computers</category><category domain="http://www.blogger.com/atom/ns#">linux</category><title>New software wave</title><description>This post is basically a collection of reviews of different programs (not related to math) and my opinion about their uses. It also includes my opinion (and hopes) for some upcoming products.&lt;br /&gt;&lt;br /&gt;&lt;span style=&quot;font-weight: bold;&quot;&gt;Windows 7&lt;/span&gt;&lt;br /&gt;Yesterday I finally got my hands on Windows 7. Since I am using Linux I obviously tend to think that Windows is inferior to Linux, but I believe that it is important to at least keep an eye on other operating systems. Also, from what I found about it on the net this particular release of Windows is worth looking into. In this short review I am going to only talk about installation and the overall feel of the system. The rest I&#39;d rather leave to more competent people.&lt;br /&gt;I used qemu to install it on a virtual machine, so I didn&#39;t test all the features (especially not all the graphic features) but I did get a general feel of the system. Somewhat surprisingly I will that I neither like nor dislike it - in another words it failed to make any impression. The install process went without any trouble and I think that it was faster than that of Win Xp (it is hard to tell when using qemu). It also looked much better in terms of graphic (although compared to linux it is ages behind, live CD is much better for installing an OS).&lt;br /&gt;The desktop itself looks rather impressive. It is also good that you have a sticky note program as part of the OS already installed. I personally prefer to use a Google to-do list gadget, but for others notes might work better. The start menu is also rather nice, although I think I would like it to consist only of its left side - there is no need for the right side of the start menu to appear all the time, most users don&#39;t even use the options you have there (except for the shut down button). I also think that the way it slides instead of opening new menus is definitely an improvement. A similar menu is available for Ubuntu, you can get the deb file &lt;a href=&quot;http://www.gnome-look.org/content/show.php/Vista+Start+Menu+for+Gnome+Panel?content=71425&quot;&gt;here&lt;/a&gt;.&lt;br /&gt;Virtual folders are another wonderful idea. I would really like to test them using a few thousands photos. Hope they will appear in linux soon enough.&lt;br /&gt;If you want a more in-depth review of Windows 7, I suggest these two posts: &lt;a href=&quot;http://www.facebook.com/ext/share.php?sid=126195164245&amp;amp;h=uUW5C&amp;amp;u=qSlco&amp;amp;ref=nf&quot;&gt;Windows 7 End user experience&lt;/a&gt; and &lt;a href=&quot;http://www.facebook.com/ext/share.php?sid=132287158814&amp;amp;h=cJqgB&amp;amp;u=iFVeY&amp;amp;ref=nf&quot;&gt;Windows 7 Performance&lt;/a&gt;.&lt;br /&gt;&lt;br /&gt;However, despite all those improvements Windows 7 is still well behind Linux. It requires a lot of space to install, it is less safe and it is still behind in usability. The graphics is clearly improving but there are less useful effects than I have in Linux (frankly there is no way that I will use an OS that doesn&#39;t support multiply desktops). I hope that in the future Microsoft will adapt more fearutres from linux, especially the desktop cube. There are other areas in which it is lacking but they didn&#39;t changed from XP so I m not going to repeat them here.&lt;br /&gt;&lt;br /&gt;Overall, this is a very nice version of Windows. I am definitely going to recommend it to those who still insist on using Windows. The only thing to be careful about is RAM. You need at least 2GB of it so if you are upgrading from XP you must make sure that you have enough RAM. In my simulation I was running it on a 3GH single core virtual processor, so you don&#39;t need to think much about processors. Any computer bought in the last 3-4 years should be capable to run it just fine.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style=&quot;font-weight: bold;&quot;&gt;Google Chrome&lt;/span&gt;&lt;br /&gt;Since I don&#39;t like downloading software that is not available for Ubuntu from a repository, I installed Chrome only recently. I was quite impressed with it. It is a very well build browser. It is fast and has a nice collection of features. Its main shortcoming is the lack of extensions. While some extensions are available, they are just too few. Actually I considered switching to it from Firefox, but decided not to. If there were more extensions I would switch in a second.&lt;br /&gt;Since it is going to be an important part of the future Google OS it is quite encouraging to see it doing so well even now. It is also interesting to note that it looks like a frame. The developers clearly put a lot of effort in thinking ways to maximize the part of the browser that actually displays the web page. Frankly it looks like they are already thinking about how Chrome will be part of their OS.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;span style=&quot;font-weight: bold;&quot;&gt;Google Wave&lt;/span&gt;&lt;br /&gt;I obviously didn&#39;t try this one myself - it will be available to the public only at the end of the month. But there is already &lt;a href=&quot;http://googlesystem.blogspot.com/2009/05/google-wave.html&quot;&gt;enough&lt;/a&gt; &lt;a href=&quot;http://mashable.com/2009/05/28/google-wave-guide/&quot;&gt;information&lt;/a&gt; about it to make an opinion. Overall it looks like a very nice example of software evolution. It is definitely a great concept, especially for those who communicate with lots of friends using the Internet. Since I don&#39;t communicate with many people, I don&#39;t know how much I will be effected by this product but some of the ways it can be used are clearly interesting to me as well. For example there is an idea to use it for managing comments on blogs. In this way commenting will be done in real time. Also, it will probably be possible to comment on a blog post &quot;inline&quot;. Such an option would allow one to talk with the author about the post in a wave. A typical case can be asking for futher information or explanation from the author or other readers (a bit like Wikipedia edit page) and then the author will be able to automatically update the actual post with the explanation. Obviously a feature like this is rather interesting for those who have blogs.&lt;br /&gt;The only thing that seems to be missing (for now) is the ability to make a video call from inside a wave. However, this is a simple enough matter of integrating Google talk into it, so it will be probably done soon enough (if not by Google than by someone else). Despite the fact that all the information I have about it comes from a few videos, it appears that Google wave is a perfect candidate for a communication center of the upcoming Google OS.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;span&gt;In the next post I plan to write a bit about Google Chrome OS&lt;/span&gt; and what is an online OS.</description><link>http://mathpages.blogspot.com/2009/09/new-software-wave.html</link><author>noreply@blogger.com (Anatoly)</author><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-916785202343169452.post-2534294274535074398</guid><pubDate>Sat, 12 Sep 2009 15:32:00 +0000</pubDate><atom:updated>2009-09-12T18:32:00.210+03:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">blog</category><title>Math Pages is two years old today</title><description>I wonder if I should write that time went by slowly or should I instead say that it went by without me noticing? I suppose both will be correct. Anyway, I am rather happy to celebrate the second anniversary of Math Pages blog. I once read that most blogs only survive for about 6 month, after this period the person who made the blog leaves it for one reason or another. On the other hand, the blogs that manage to survive after six month usually stay around for a long time. Well, I certainly intend to continue posting, at least untill I am no longer a student.&lt;br /&gt;Unfortunately, I must admit that my posting is really irregular. Originally I was aiming for one post per two days, but it didn&#39;t work out on the long term. Occasionally I do manage to post this many posts (and even more on some weeks) but there are periods when I don&#39;t post anything for more than a week. Right now the ratio of posts to days is one post per 4 days. As you can see that is far from what I want it to be... Well, since this is an anniversary post I suppose it would be logical to resolve to be more committed to posting, but I seriously doubt that that will really help.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;a onblur=&quot;try {parent.deselectBloggerImageGracefully();} catch(e) {}&quot; href=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgfypCry0XRZY3jxQO6bzub8ElCAaeR1xE5oC8rk020TKIc9TY4Uf7cEwmDNqp_3UiNd0L-NnTRxqHlLBM1bY4tOb1sucQNOyylVNfLYgQQFF1DGCG1t_kXw4qn9oK-_f3PS_ZZs0tb94k/s1600-h/penguincake.png&quot;&gt;&lt;img style=&quot;margin: 0px auto 10px; display: block; text-align: center; cursor: pointer; width: 319px; height: 320px;&quot; src=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgfypCry0XRZY3jxQO6bzub8ElCAaeR1xE5oC8rk020TKIc9TY4Uf7cEwmDNqp_3UiNd0L-NnTRxqHlLBM1bY4tOb1sucQNOyylVNfLYgQQFF1DGCG1t_kXw4qn9oK-_f3PS_ZZs0tb94k/s320/penguincake.png&quot; alt=&quot;&quot; id=&quot;BLOGGER_PHOTO_ID_5380514416243382514&quot; border=&quot;0&quot; /&gt;&lt;/a&gt;&lt;br /&gt;It also worth to mention that while originally I intended for this blog to be about math with mentions of physics, that didn&#39;t work out. Instead I found out that I don&#39;t like to be restricted or even directed in my writing. I prefer to simply wright about what seems to be interesting to me at this particular moment. This is probably one of the main reasons why I couldn&#39;t put to use the &lt;a href=&quot;http://mathpages.blogspot.com/2009/02/changes.html&quot;&gt;skribit&lt;/a&gt; suggestion widget... But anyway, this blog ended up being mainly about math but I also occasionally write about computers (most linux). In the beginning I wrote a bit about physics, but with time it seems that my interests shifted away from it.&lt;br /&gt;&lt;br /&gt;This post is probably a good opportunity to announce a little project that I am trying to start. Over the years I managed to collect a small library of math books in pdf format. Right now it is rather small, but it is easy enough to expand. There are after all lots of free math books available (legally) on the net. What I want to do is to create a post with links to all these books I collected and plan to collect (currently stored on my Google docs account).  Having such an index will clearly make it easier for me to use my library, and will also make it easier for you to find those books if you need them. I already started to work on this idea, it will probably appear here in about two days (maybe more if I run in some kind of problem). Meanwhile if you have math (programing and physics will do as well) books in pdf format that you don&#39;t mind sharing with others, or you know about a site where such books can be found please contact me. While I am not going to promise to use what you sent, I will definitely consider it.</description><link>http://mathpages.blogspot.com/2009/09/math-pages-is-two-years-old-today.html</link><author>noreply@blogger.com (Anatoly)</author><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgfypCry0XRZY3jxQO6bzub8ElCAaeR1xE5oC8rk020TKIc9TY4Uf7cEwmDNqp_3UiNd0L-NnTRxqHlLBM1bY4tOb1sucQNOyylVNfLYgQQFF1DGCG1t_kXw4qn9oK-_f3PS_ZZs0tb94k/s72-c/penguincake.png" height="72" width="72"/><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-916785202343169452.post-1219597753513842855</guid><pubDate>Wed, 09 Sep 2009 16:34:00 +0000</pubDate><atom:updated>2009-09-09T19:34:00.059+03:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">computers</category><category domain="http://www.blogger.com/atom/ns#">math</category><title>Fractals</title><description>A few days ago I stumbled on an excellent collection of &lt;a href=&quot;http://home.comcast.net/%7Efractalsbykeith/&quot;&gt;fractals&lt;/a&gt;. According to the site the collection is no longer updated, but nevertheless the images there are among the best fractal images I ever saw. There is also more fractals by the same author available &lt;a href=&quot;http://www.idreamincolor.com/keith/index.htm&quot;&gt;here&lt;/a&gt;. I am somewhat worried about the site disappearing so I am going to download all the images on it to my computer and then upload them to a private Picasa album. This way I am not breaching the copyright on the images and if the page indeed closed down, please leave a comment on this post and I will link my Picasa album to this post.&lt;br /&gt;&lt;br /&gt;In the case that you want even more fractal images, here is another site with hundreds of excellent fractals - &lt;a href=&quot;http://www.enchgallery.com/&quot;&gt;Fractal world gallery&lt;/a&gt;.&lt;br /&gt;&lt;br /&gt;Also, I noticed that a lot of visitors to my blog are actually after mathematical wallpapers. Form my own attempts to find such wallpapers I know that they are somewhat of a rarity (at least good ones). I currently have 14 math wallpapers in my &lt;a href=&quot;http://picasaweb.google.com/andron1956/MathWallpapers?feat=directlink&quot;&gt;Picasa albums&lt;/a&gt;, but this is obviously too little (and unfortunately not all of them are good enough to put on a screen). Since there seems to be a demand for such wallpapers I am going to try and get more maybe I will even attempt to draw some myself.</description><link>http://mathpages.blogspot.com/2009/09/fractals.html</link><author>noreply@blogger.com (Anatoly)</author><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-916785202343169452.post-6077176630154823467</guid><pubDate>Mon, 07 Sep 2009 13:22:00 +0000</pubDate><atom:updated>2009-09-07T19:52:58.750+03:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">math</category><category domain="http://www.blogger.com/atom/ns#">physics</category><category domain="http://www.blogger.com/atom/ns#">universe</category><title>Correct math wrong results</title><description>In the previous post I mentioned that in some situations even the math we used is correct, the result we arrive at might not be correct or it might not apply in the real world. In this post I intend to discuss three such examples.&lt;br /&gt;&lt;br /&gt;The first example is known as the Tompson lamp problem. Imagine the following situation: You switch a lamp on, than after one minute you switch it off. After 30 seconds you switch it on again, and then after 15 seconds you turn it off. We continue like this for two minutes. Now, is the lamp on or off? There is no real mathematical solution to this problem. One proposed solution is to say that the state of the lamp after two minutes is independent of its state before. So for all we know, after two minutes the lamp could have mutated into a pumpkin. Seriously.&lt;br /&gt;Another solution originates from noticing that the behavior of the lamp can be though of as the infinite sum: 1-1+1-1+1-1+.... So if we find the sum we will get the solution. Consider the following:&lt;br /&gt;&lt;br /&gt;&lt;div style=&quot;text-align: center;&quot;&gt;S=1-1+1-1+1-1+...&lt;br /&gt;1-S=1-(1-1+1-1+1-1+...)=1-1+1-1+1-1+...=S&lt;br /&gt;1-S=S&lt;br /&gt;1=2S&lt;br /&gt;S=0.5&lt;br /&gt;&lt;/div&gt;&lt;br /&gt;And thus we found the sum. The result is usually interrupted as the lamp being half on. I don&#39;t know about you but I never saw a lamp being in that state.&lt;br /&gt;What would happen if we are to do this switching in reality? Thats simple - the switch will break.&lt;br /&gt;As you can see in this case modeling the situation mathematically fails completely.&lt;br /&gt;&lt;br /&gt;The second example is an implementation of a theorem to a situation it cannot be applied in. The theorem I am talking about is the Brouwer&#39;s fixed point theorem. It is one of many fixed point theorems, which state that for any continuous function f with certain properties there is a point x0 such that f(x0) = x0. Sometime ago I read a statement that according to this theorem, if you take a glass of water and then mix it in anyway, there always will be a small part of the water that didn&#39;t change its position. If you are not careful this may seem reasonable. After all, mixing the water is a continues process. Unfortunately, this is simply wrong. The theorem itself is of course correct, but it cannot be used to discribe water in a glass. For this theorem to be used the body it is used on must be continues, but the water is discrete - it is composed from atoms. Because of this the theorem cannot be applied to such a situation, and the result we get by applying it forcefully is wrong.&lt;br /&gt;&lt;br /&gt;The third example is known as the Banach–Tarski paradox. It is a theorem in set theoretic geometry which states that a solid ball in 3-dimensional space can be split into a finite number of non-overlapping pieces, which can then be put back together in a different way to yield two identical copies of the original ball. The reassembly process involves only moving the pieces around and rotating them, without changing their shape. Obviously this is not something that is possible to do in reality.&lt;br /&gt;Again, the theorem is perfectly fine. The problem is that it cannot be applied to actual balls. During the proof of the theorem (at least the proof I am familiar with) we get a countable infinity of finite degree polynomials of the form p(sinx)=q. We need to choose x in such a way that for all the polynomials q is not 0. Since any polynomial have a finite number of roots, there is at most a countable infinity of values for x that doesn&#39;t give us what we want. Therefore we can always choose a value that will work.&lt;br /&gt;Unfortunately x is the angel of rotation of the ball. If we want to choose a specific x we need firstly to make sure that we can rotate the ball by such an angel. Surprisingly this is not always possible. The reason for this is physical and not mathematical, so I am not going to explain it in detail, but the main idea is that we cannot make &quot;moves too small&quot; in the real world.&lt;br /&gt;&lt;br /&gt;Mathematics is often said to be describing the real world. Personally I don&#39;t think so. Those and other similar examples have one common trait - correct math that cannot be applied in our world (at least not the way we want it to). But it can be used to describe a world of math.</description><link>http://mathpages.blogspot.com/2009/09/correct-math-wrong-results.html</link><author>noreply@blogger.com (Anatoly)</author><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-916785202343169452.post-752712784405836202</guid><pubDate>Sat, 05 Sep 2009 05:10:00 +0000</pubDate><atom:updated>2009-09-05T12:50:11.440+03:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">math</category><title>Painting the roads</title><description>Consider the following problem - given a road system is it possible to have a set of instruction which if followed will cause you to end in one specific point regardless of were you started? Obviously this depends on the road system. It is very easy to give examples of road systems for both cases. It turns out however that there are really simple conditions that guarantee the existence of such an instruction set.&lt;br /&gt;In order to discuss this mathematically we will need to define a few things. Firstly we are not going to talk about roads but about finite directional graphs. Secondly for every vortex on the graph we will allow exactly d (d is the same for all vortexes) edges to come out from it and an unspecified number of edges to go to it. In such  situation talking about &quot;turning right&quot; is meaningless so we will instead use colors. Thus every &quot;color&quot; is a function that for a given vortex tells us were to go. Naturally there is d colors. In this blog post I will denote colors with letters - for example (a), (b). Only one color means doing only one &quot;step&quot;, so for longer steps we need &quot;words&quot; instead of letters. For example (abdc) means to execute (c) then (d) then (b) and finally (a).  In this notation we are looking for a word that when executed will result in us landing on a vortex V regardless of our starting point. We will call such a word a sync word.&lt;br /&gt;&lt;br /&gt;&lt;span style=&quot;font-weight: bold;&quot;&gt;Required conditions&lt;/span&gt;&lt;br /&gt;Firstly, lets see what obvious conditions are required. Basically we want a graph that is possible to color in such a way that there will be a sync word. So lets demand the following conditions:&lt;br /&gt;1. The graph is strongly connected - there is a path between any two different vortexes.&lt;br /&gt;2. The graph is not cyclic. To be more precise what we want is:&lt;br /&gt;a. The greatest common divisor of the lengths of all the closed paths in the graph is 1.&lt;br /&gt;b. It is not possible to divide the graph to a finite number of sets S1,....Sk such that for all i the edges go from Si to Si+1.&lt;br /&gt;&lt;br /&gt;&lt;span style=&quot;font-weight: bold;&quot;&gt;Theorem&lt;/span&gt;&lt;br /&gt;The conditions listed above are enough.&lt;br /&gt;&lt;br /&gt;&lt;span style=&quot;font-weight: bold;&quot;&gt;Prove history&lt;/span&gt;&lt;br /&gt;I am not going to prove this theorem here. It is possible, but it requires a bit too much explanations and the explanations are hard to understand without drawings. Because of this I am not going to prove the theorem, but I will shortly discuss the history behind the prove and some important points behind the proof. If you want to read the actual prove it should be available online (somewhere).&lt;br /&gt;&lt;br /&gt;There were three main stages in the attempt to prove the theorem. The first stage was done by Friedman. He defined a weight function of the graph, and showed that if the weigh of the graph is a prime number than there is a way to get a sync word unless the maximum weight (the maximum weight is the weight of the largest (by weight) subset of the graph that can be synced) is 1. As you can see this result is very far from proving the theorem, but it turned out to be an important step - the weight function he defined turned out to be useful in future attempts to prove the theorem.&lt;br /&gt;The second stage was done by Kari. He proved that if the graph also has a fixed number of edges entering each vortex and this number is also d, then there is a way to get the sync word. While this is not what is needed this is a much better result than the previous one. It is also interesting to note that he managed to use induction in his prove, by finding a way to reduce the problem of finding a sync word for a large graph to finding such a word in a smaller graph.&lt;br /&gt;The third and last stage was done by Abraham Tracman. This was done only in 2007. As I already said his prove requires complex explanations so I am not going to say much about it. The only thing that is important to say is that in the prove we look closely on the results of continuously using the same function on the graph. By analyzing the result we find out that in all the cases we can get two vortexes that satisfy a condition needed for Kari proof to work. Basically he showed that it is not needed to ask for a fixed number of edges entering the vortex, and by this completed the proof. In a way this is an interesting example of how people build on other people work.&lt;br /&gt;&lt;br /&gt;&lt;span style=&quot;font-weight: bold;&quot;&gt;Conclusion&lt;/span&gt;&lt;br /&gt;I hope that by now it is clear that the problem has absolutely nothing to do with roads. Well, except for the name. Originally this problem originated from symbolic dynamics. However the name road coloring sound much better and it is possible to use the result in road building, although it is rather pointless to do so. All we managed to do is to show that there is a way to color the graph, so if we color the roads in the appropriate way we will be able to get the needed instruction set but it will require a more complex road system that what we have now.&lt;br /&gt;&lt;br /&gt;In this particular case mathematical analysis of a problem gave a solution that is accurate and possible to use in the real world - but is this always correct?  In the next post I will discuss some rather famous cases where correct math leads to solutions that are impossible in the real world.</description><link>http://mathpages.blogspot.com/2009/09/painting-roads.html</link><author>noreply@blogger.com (Anatoly)</author><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-916785202343169452.post-4607673563510719414</guid><pubDate>Thu, 03 Sep 2009 08:25:00 +0000</pubDate><atom:updated>2009-09-03T12:30:45.542+03:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">computers</category><category domain="http://www.blogger.com/atom/ns#">linux</category><category domain="http://www.blogger.com/atom/ns#">universe</category><title>Windows XP on Ubuntu with qemu</title><description>If you were reading this blog for a long time you already know that I ditched Windows and moved to linux years ago. I have been using Linux for about 3 years now and I never regretted moving to it. However, annoyingly enough, there is one tiny thing that I cannot do on linux but I can do on Windows. In the Hebrew University, in order to get the exercises you need to download them from the university site. Most of the site works just fine in Firefox, but for some reason it is impossible to download the exercise with it. It is only possible to do so in IE.&lt;br /&gt;&lt;br /&gt;The students have been asking the university to fix the site for the last two years, but without much success. It is of course possible to go to an university computer and to download everything there, but it is inconvenient. I tried installing IE using wine, but it didn&#39;t work. So in the end the only option I could think about was to install Windows using qemu. This post is a short how-to that shows how to install and then configure windows under qemu for it to work without doing problems.&lt;br /&gt;&lt;br /&gt;The first step is obviously to obtain a windows cd or an iso file. The next is to install all the required packages:&lt;br /&gt;&lt;br /&gt;sudo aptitude install qemu kqemu-common kqemu-source samba smbfs&lt;br /&gt;&lt;br /&gt;This will install qemu and also samba for sharing files between Windows and Ubuntu. Next is to configure kqemu - it is an accelerator used by qemu:&lt;br /&gt;&lt;br /&gt;sudo module-assistant prepare&lt;br /&gt;sudo module-assistant auto-install kqemu&lt;br /&gt;sudo addgroup --system kqemu&lt;br /&gt;sudo adduser $USER kqemu&lt;br /&gt;sudo modprobe kqemu&lt;br /&gt;&lt;br /&gt;Now you need to log out for the changes to take effect. After logging in, the next step is to create a  disk image. The minimum size is 4GB (because of the SP3 and other updates), but I used 10GB because I want to be able to install programs latter on without worrying about free space. The image will change it size dynamically, so don&#39;t worry about throwing away too much space. To create the image type:&lt;br /&gt;&lt;br /&gt;qemu-img create -f qcow windows.img 10G&lt;br /&gt;&lt;br /&gt;Now we can start the install process. If you have a CD insert it and type:&lt;br /&gt;&lt;br /&gt;qemu -localtime -cdrom /dev/cdrom -m 512 -boot d windows.img&lt;br /&gt;&lt;br /&gt;I set memory to 512MB but you can enter something else, preferably at least 384. If you want to install from an iso, put the iso in your home directory and type:&lt;br /&gt;&lt;br /&gt;qemu -localtime -cdrom cdimagefile.iso -m 512 -boot d windows.img&lt;br /&gt;&lt;br /&gt;After doing this, the install process will start. It worth to note that it will go on for longer than a regular install, so you will have to be patient. Once the install is done, you can start using  Windows.  To run windows you type:&lt;br /&gt;&lt;br /&gt;qemu windows.img -localtime -m 512&lt;br /&gt;&lt;br /&gt;Optionally you can create a launcher on the panel or the desktop. For this you will need an appropriate icon. I used this one:&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;a onblur=&quot;try {parent.deselectBloggerImageGracefully();} catch(e) {}&quot; href=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEg3zQXR_jrLN4wBAYxIvIsH3CzHjv7xa5gFYB3wdaFhDS-iPjBlt8a8wwyQajtaT3CBnKQccbJcBOKmPKAOxikQLImLgp3WPh_UC6JQHPMAgNSE-9h1veZWWh0r25Z561NuHEBd7NPq_Zc/s1600-h/xpicon.png&quot;&gt;&lt;img style=&quot;margin: 0px auto 10px; display: block; text-align: center; cursor: pointer; width: 74px; height: 70px;&quot; src=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEg3zQXR_jrLN4wBAYxIvIsH3CzHjv7xa5gFYB3wdaFhDS-iPjBlt8a8wwyQajtaT3CBnKQccbJcBOKmPKAOxikQLImLgp3WPh_UC6JQHPMAgNSE-9h1veZWWh0r25Z561NuHEBd7NPq_Zc/s320/xpicon.png&quot; alt=&quot;&quot; id=&quot;BLOGGER_PHOTO_ID_5377163739191857058&quot; border=&quot;0&quot; /&gt;&lt;/a&gt;&lt;br /&gt;As we all know, windows is much less safe than Linux. Luckily qemu has some options that allow us to protect the installation. The first such option is to create an overlay. This will allow you to use windows while saving all the changes in the overlay file and not in the original img file. If you do this and at some point at time Windows becomes corrupt you can just delete the overlay and create a new one without installing Windows from the beginning. To create an overlay type:&lt;br /&gt;&lt;br /&gt;qemu-img create -b windows.img -f qcow windows.ovl&lt;br /&gt;&lt;br /&gt;To use the overlay you will need to type:&lt;br /&gt;&lt;br /&gt;qemu windows.ovl -localtime -m 512&lt;br /&gt;&lt;br /&gt;For increased safety you can also use the snapshot mode. In this mode all the changes you make are written to a temporally file which is removed when you close qemu. To use this just add &quot;-snapshot&quot; to the end of the command.&lt;br /&gt;The final step is to make it possible to share files between Windows and Ubuntu. To do this we can use samba. The first step is to create a shared folder. In my case I created a folder named AnatolySharedFiles in my home directory. Now we can setup samba to share this folder:&lt;br /&gt;&lt;br /&gt;sudo addgroup samba&lt;br /&gt;sudo adduser $USER samba&lt;br /&gt;sudo aptitude install system-config-samba&lt;br /&gt;&lt;br /&gt;Now you can go to System-&gt;Administration-&gt;Samba, and use it to add the folder you want to share and to add a user password for yourself. Now all that remains is to configure Windows. The first step is to go to My Computer-&gt;Properties-&gt;Computer name and enter the correct data. Then go to Network places to create the network. The next step is to mount the shared folder as a network drive (this seems to be the best option to me,buy you can access it from network places as well), this is done by clicking on My Computer-&gt;Map network drive.&lt;br /&gt;&lt;br /&gt;After doing all this you hopefully have a working Windows and I have an easy way to get my math homework...</description><link>http://mathpages.blogspot.com/2009/09/windows-xp-on-ubuntu-with-qemu.html</link><author>noreply@blogger.com (Anatoly)</author><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEg3zQXR_jrLN4wBAYxIvIsH3CzHjv7xa5gFYB3wdaFhDS-iPjBlt8a8wwyQajtaT3CBnKQccbJcBOKmPKAOxikQLImLgp3WPh_UC6JQHPMAgNSE-9h1veZWWh0r25Z561NuHEBd7NPq_Zc/s72-c/xpicon.png" height="72" width="72"/><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-916785202343169452.post-4268060693325252580</guid><pubDate>Wed, 10 Jun 2009 12:36:00 +0000</pubDate><atom:updated>2009-06-10T21:56:32.560+03:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">links</category><title>Math and Firefox wallpapers</title><description>I added new wallpapers to my collections of &lt;a href=&quot;http://picasaweb.google.com/andron1956/FirefoxWallpapers?feat=directlink&quot;&gt;Firefox&lt;/a&gt; and &lt;a href=&quot;http://picasaweb.google.com/andron1956/MathWallpapers?feat=directlink&quot;&gt;math&lt;/a&gt; wallpapers, follow the links to download.&lt;br /&gt;&lt;br /&gt;&lt;table style=&quot;width: auto;&quot;&gt;&lt;tbody&gt;&lt;tr&gt;&lt;td&gt;&lt;a href=&quot;http://picasaweb.google.com/lh/photo/5lI-Nvy2DT0wkPGKrvFRtw?feat=embedwebsite&quot;&gt;&lt;img src=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEifbcHYb_NHb0m0nOky1tOyiOyl3GcGUBAu1ZFM5Uze_lg0F4X6xzf5uo_6h6TZKHIaKG4eGWcJf7qFc6qx9q_E6HR99usoqMn2mN056ENv6wNCMzjt7GMcUrM5tpYl1wq5HPSpWVPtu7A/s288/The_Firefox_by_djog.jpg&quot; /&gt;&lt;/a&gt;&lt;/td&gt;&lt;/tr&gt;&lt;tr&gt;&lt;td style=&quot;font-family: arial,sans-serif; font-size: 11px; text-align: right;&quot;&gt;From &lt;a href=&quot;http://picasaweb.google.com/andron1956/FirefoxWallpapers?feat=embedwebsite&quot;&gt;Firefox Wallpapers&lt;/a&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/tbody&gt;&lt;/table&gt;</description><link>http://mathpages.blogspot.com/2009/06/math-and-firefox-wallpapers.html</link><author>noreply@blogger.com (Anatoly)</author><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEifbcHYb_NHb0m0nOky1tOyiOyl3GcGUBAu1ZFM5Uze_lg0F4X6xzf5uo_6h6TZKHIaKG4eGWcJf7qFc6qx9q_E6HR99usoqMn2mN056ENv6wNCMzjt7GMcUrM5tpYl1wq5HPSpWVPtu7A/s72-c/The_Firefox_by_djog.jpg" height="72" width="72"/><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-916785202343169452.post-5930374461695330312</guid><pubDate>Sun, 07 Jun 2009 10:25:00 +0000</pubDate><atom:updated>2009-06-07T20:00:24.837+03:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">math</category><category domain="http://www.blogger.com/atom/ns#">number theory</category><category domain="http://www.blogger.com/atom/ns#">science</category><title>Ordinals</title><description>I once read about a theory that said that numbers can be described as a common property of two groups that have nothing in common excluding their size. For example the number three is a common property of the following groups - three deers, three stones and three trees.&lt;br /&gt;In modern mathematics we have a sort of an extension to this idea - ordinals. An ordinal is a well ordered set such that if A is an ordinal and x is in A and y is in x then y is in A. The first ordinals are phi (=empty set), {phi}, {phi,{phi}},  {phi,{phi}, {phi,{phi}}}. Those ordinals correspond to 0,1,2,3.&lt;br /&gt;As you probably noticed there is a very simple rule that produces the next ordinal - if A is an ordinal than A(union){A} is the next ordinal. From this we can conclude that: The set of all ordinals is a well ordered set and the union of any number of ordinals is an ordinal.&lt;br /&gt;&lt;br /&gt;What makes the ordinals truly interesting for me is the fact that in for them &quot;infinity plus one&quot; is not equal to infinity. This is very simple to see, infinity is the so called least infinite ordinal - w. It can be defined as the union of all finite ordinals. The next ordinal is w+1=w(union){w}. It is rather obvious that the two sets are not equal and therefore w+1 is not equal to w.&lt;br /&gt;Ordinals are not the only example of infinity not being equal to infinity and one, but in my opinion they are extremely intuitive in this regard. After all, all we basically do with ordinals is to constantly &quot;add one&quot;. This is the same thing we did with natural numbers long ago, but it appears that the natural numbers don&#39;t follow our basic intuition that says that &quot;it is always possible to add one&quot;&lt;br /&gt;&lt;br /&gt;In the beginning of the post I told that numbers can be described as a common natural property. This however brings an interesting philosophical question - if our intuition is a product of our world than why do natural numbers that come from it don&#39;t follow our intuition after a specific point? A possible answer is that &quot;infinity is not natural&quot; and therefore there is no reason for it to follow our intuition in any way. However, infinity appeared as a concept a lot of time ago. At first it appeared as &quot;many&quot; which basically told that there was no known number large enough.When a new number (or even a number system) where invented the &quot;many&quot; was replaced by an appropriate number. And this brings us to the following thought: Is it possible that we are in the same condition again? That is, should we use ordinals instead of natural numbers? After all, they are pretty much an extension of the natural numbers.</description><link>http://mathpages.blogspot.com/2009/06/ordinals.html</link><author>noreply@blogger.com (Anatoly)</author><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-916785202343169452.post-7618360995202579792</guid><pubDate>Mon, 01 Jun 2009 05:00:00 +0000</pubDate><atom:updated>2009-06-01T08:04:53.636+03:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">humor</category><title>Unique captchas</title><description>Apparently some sites use captchas to assure the intelligence level of their users:&lt;br /&gt;&lt;br /&gt;&lt;a onblur=&quot;try {parent.deselectBloggerImageGracefully();} catch(e) {}&quot; href=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjrnaGU6JwPTY1Vs_CuO6sB-YKuPS_Eqyqizo80opMB04qz41EhlEK_QbIcGV9bNN7rDCm0RgVkjxtdDCX4I9hPTCpiEaLV5cCDIoAw2GU9wwnRq69oo1erxzlK8kJntaNcSFNBV23T9AA/s1600-h/captcha.jpg&quot;&gt;&lt;img style=&quot;margin: 0px auto 10px; display: block; text-align: center; cursor: pointer; width: 320px; height: 168px;&quot; src=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjrnaGU6JwPTY1Vs_CuO6sB-YKuPS_Eqyqizo80opMB04qz41EhlEK_QbIcGV9bNN7rDCm0RgVkjxtdDCX4I9hPTCpiEaLV5cCDIoAw2GU9wwnRq69oo1erxzlK8kJntaNcSFNBV23T9AA/s320/captcha.jpg&quot; alt=&quot;&quot; id=&quot;BLOGGER_PHOTO_ID_5342220091912137794&quot; border=&quot;0&quot; /&gt;&lt;/a&gt;&lt;a onblur=&quot;try {parent.deselectBloggerImageGracefully();} catch(e) {}&quot; href=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgh-S6Wkx12FcbeCkW_XhuWTWJgwF26rwb97KeTho5gVgeugjEG23ks6JZ4vjTs8BaPbtfpEKlQ8FwCCKLn39S1fUeJToZy3-8ZWiLGZ-H4gC7Ay-LPfEn0KkOgwXie4hkO6dLwkMMdHBs/s1600-h/captcha2.jpg&quot;&gt;&lt;img style=&quot;margin: 0px auto 10px; display: block; text-align: center; cursor: pointer; width: 450px; height: 486px;&quot; src=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgh-S6Wkx12FcbeCkW_XhuWTWJgwF26rwb97KeTho5gVgeugjEG23ks6JZ4vjTs8BaPbtfpEKlQ8FwCCKLn39S1fUeJToZy3-8ZWiLGZ-H4gC7Ay-LPfEn0KkOgwXie4hkO6dLwkMMdHBs/s320/captcha2.jpg&quot; alt=&quot;&quot; id=&quot;BLOGGER_PHOTO_ID_5342220096567210338&quot; border=&quot;0&quot; /&gt;&lt;/a&gt;</description><link>http://mathpages.blogspot.com/2009/06/unique-captchas.html</link><author>noreply@blogger.com (Anatoly)</author><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjrnaGU6JwPTY1Vs_CuO6sB-YKuPS_Eqyqizo80opMB04qz41EhlEK_QbIcGV9bNN7rDCm0RgVkjxtdDCX4I9hPTCpiEaLV5cCDIoAw2GU9wwnRq69oo1erxzlK8kJntaNcSFNBV23T9AA/s72-c/captcha.jpg" height="72" width="72"/><thr:total>1</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-916785202343169452.post-5578353539624638967</guid><pubDate>Sat, 11 Apr 2009 17:08:00 +0000</pubDate><atom:updated>2009-04-12T12:45:34.480+03:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">links</category><category domain="http://www.blogger.com/atom/ns#">math</category><title>Project Euler</title><description>I recently found an interesting site called &lt;a href=&quot;http://projecteuler.net/&quot;&gt;Project Euler&lt;/a&gt;. This site attempts to provide a platform for the inquiring mind to delve into unfamiliar areas and learn new concepts in a fun and recreational context. This is being done by publishing different mathematical problems of varying difficulty.&lt;br /&gt;I liked the concept so I thought about joining the site, but after taking a closer look on the problems I lost my motivation - most of the problems are meant to be solved using a computer. I just can&#39;t feel motivated to write a program in order to sum all the primes less than 2 million (this is problem number 10). However, if you like this type of problems this is clearly an excellent site. They have lots of problems of varying difficulty and new problems are constantly added.&lt;br /&gt;&lt;br /&gt;For those who like my don&#39;t like using computer to solve problems there are problems that don&#39;t require a computer to solve - for example the first problem: &quot;Add all the natural numbers below one thousand that are multiples of 3 or 5.&quot;  This one is a very simple problem, so I guess it will be fine to post a hint to a solution. All you need to do is to sum the arithmetic progressions 3,6,9,..... and 5,10,15..... If you add the sums you will get the result, but the numbers that are multiples of both 3 and 5 will be counted twice.&lt;br /&gt;I also really liked problem number &lt;a href=&quot;http://projecteuler.net/index.php?section=problems&amp;amp;id=205&quot;&gt;205&lt;/a&gt;. It is pretty easy to solve, but it requires some thinking and there is no need for a computer.</description><link>http://mathpages.blogspot.com/2009/04/project-euler.html</link><author>noreply@blogger.com (Anatoly)</author><thr:total>0</thr:total></item><item><guid isPermaLink="false">tag:blogger.com,1999:blog-916785202343169452.post-8212437290335677189</guid><pubDate>Wed, 18 Mar 2009 17:29:00 +0000</pubDate><atom:updated>2009-03-18T21:27:22.473+02:00</atom:updated><category domain="http://www.blogger.com/atom/ns#">math</category><title>Infinitesimals</title><description>In the previous post, I wrote about division by zero. In this post I want to talk about one particular case when such division, and its definition are important. As you probably guessed from the title, this post is about calculus. (In this post I am talking only about one variable calculus).&lt;br /&gt;&lt;br /&gt;One of the most basic questions in calculus is finding slopes of functions. The simplest example of such a problem is to find the slope of a linear function, f(x)=mx+b.&lt;br /&gt;In this case we get a straight line, so the slope is uniform. To find is we need to calculate the difference in y divided by the difference in x:&lt;br /&gt;&lt;br /&gt;&lt;div style=&quot;text-align: center;&quot;&gt;(f(x+h)-f(x))/h=(m(x+h)+b-mx-b)/h=m(h)/h=m&lt;br /&gt;&lt;br /&gt;&lt;div style=&quot;text-align: left;&quot;&gt;For a less friendlier functions, we cannot talk about globe slope, but only about slope of a certain part of the function, or even only in one single point. And this is were the problem appeared. We want to know the slope in every point, but how can we calculate it? Firstly we need to define what such a slope is. For example lets look on the function f(x)=x^2 and on the point x=3. Lets look on the points f(3.5) and f(3). If we connect those two points by a straight line, we can calculate the slope of that line. If we draw this on a paper, you will see that the function and the line are really close to each other on a small area around 3. Therefore we can thing about the slope of this line as an approximation to the slope of the function. But, obviously if instead of 3.5 we will take 3.1, we will get a better approximation. In the end we can think about the slope as:&lt;br /&gt;&lt;br /&gt;&lt;div style=&quot;text-align: center;&quot;&gt;slope=(f(3+h)-f(3))/h , h=0&lt;br /&gt;&lt;br /&gt;&lt;div style=&quot;text-align: left;&quot;&gt;And here we have it - devision by zero. It is obvious that there is no way around it. If h is not zero we get only an approximation and one which can be improved easily enough. The solution to this problem was found by Newton and Leibniz. Their idea was to define a non negative &quot;number&quot; that is smaller that any positive number. Such a number is called infinitesimal. The only real infinitesimal is zero, but if we agree to imagine that there is another such number, they we get many such numbers. This is because if dx is an infinitisimal that 0.5dx is also an infinitisimal. Since dx is not zero, we can divide by it. And becasue it is smaller than any positive number we can disregard it as if it was zero. It is simple to find the slope of x^2 usinig dx:&lt;br /&gt;&lt;br /&gt;&lt;div style=&quot;text-align: center;&quot;&gt;slope=(f(3+dx)-f(3))/dx=(9+6dx+dx^2-9)/dx=(6dx+dx^2)/dx=6+dx=6&lt;br /&gt;&lt;br /&gt;&lt;div style=&quot;text-align: left;&quot;&gt;Although the result is correct, we no longer use infinitesimals, but use limits instead. The  reason for this is that infinitesimals are problematic. The problem lies in the very definition - it is not clear what do we mean by a number that is smaller than any positive number, but not negative or zero. We also treat it as both zero and as not zero. However, they are still in use in physics. The reasons for this is that while they are not rigorous enough for mathematicians to use, they give good intuition and they appear rather naturally in physical problems.&lt;br /&gt;&lt;/div&gt;&lt;/div&gt;&lt;/div&gt;&lt;/div&gt;&lt;/div&gt;&lt;/div&gt;</description><link>http://mathpages.blogspot.com/2009/03/infinitesimals.html</link><author>noreply@blogger.com (Anatoly)</author><thr:total>2</thr:total></item></channel></rss>