in c# i need to compare 2 numbers one from a local file, and one another from a downloaded file like a Patcher.  if I use Streamreader c# sad to me that he can't convert string into INT.  are there a solution for this? file a contains the value "1" , the file b contains the value "2"  so if b>a then download the new files catch from another updater file.  thanks
Possible Duplicate:          How do you convert a C++ string to an int?  Assume you are expecting the string to have actual numbers in it ("1", "345", "38944", for example).  Also, let's assume you don't have boost, and you really want to do it the C++ way, not the crufty old C way.
Hardware issue on iMac, flashing question mark I have an iMac 2008/2009 issue and recently the computer would not boot and I would get a flashing question mark. Ran through all the usual steps, try boot in safe mode, flash RAM,  try single user for fdisk, put in OS disk and boot from CD, etc... No dice.   Replaced the hard drive and put the OS disc in the system, press and hold option. (holding C didn't work) I can see the OS disk but when I click on it the system will act like it is going to run and then freeze. The best I got was the OS X disc that changed the screen to dark grey and told be the system had to restart.  Purchased a usb mount for an external hard drive. Was able to mount the old hard drive to a laptop and run disk utility. Everything checked out.  At this point I am pretty sure it isn't the hard drive.   Any other hard ware items this can point too? My iMAC can also "see" the hard drive (and the recovery partition) when connected via the USB and I hold "option" on start up. But it crashes when trying to boot from either.  I am going to take out and re-install the RAM for giggles but I am not sure what else to do.   Ideas are welcome. How can I prove $n - 2\sqrt{n} = \Theta(n)$ Prove by induction. How do I prove $\sum\limits_{i=0}^n2^i=2^{n+1}-1$ with induction? $\displaystyle\sum_{i=0}^n2^i=2^{n+1}-1$.  I don't understand induction so I could use some help. Definite integral, quotient of logarithm and polynomial: $I(\lambda)=\int_0^{\infty}\frac{\ln ^2x}{x^2+\lambda x+\lambda ^2}\text{d}x$ Divergence of $\sum\limits_{n=1}^{\infty} \frac{\cos(\log(n))}{n}$ After upgrading my laptop from karmic to lucid, my fat32 partition won't mount automatically. I get the message:  The disk drive for /osshare is not ready yet or not present Continue to wait; or Press S to skip mounting or M for manual recovery   Funny thing is, if I skip, then /osshare/ is mounted once I log in.   I've a similar setup on my desktop, and it works fine. Fstab on desktop:  UUID=4663-6853  /osshare        vfat    utf8,umask=007,gid=46 0       1   /etc/fstab on laptop:  UUID=1234-5678 /osshare vfat utf8,auto,rw,user 0 0 How do I resolve "WILL_NOT_PERFORM" MS AD reply when trying to change password in scala w/ the unboundid LDAP SDK? Change multiple filenames by replacing a character Find a circle's radius with three known tangent lines I need to find the equation for a circle (mainly its radius) which is tangent to the following three lines:  $y = 0$  $y = \tan(70)x$  $y = -1.428148x + 0.790201$  For the last tangent line equation, I know that it is tangent at the point $(0.371272, 0.259968)$ However, for the other two I do not know the exact point of tangency, only that the circle is tangent to them. I have a table to store StudentID, SubjectID, ObtainedMarks. Now I have to create a pivot table to show studentID and obtainedMarks in different subject. Number of subject may differ. I could generate pivot table for fixed subjectID like    SELECT * FROM (SELECT StudentID, SubjectID, ObtainedMarks from [Exam].[ObtainedMarkEntry]) as InvoiceResult PIVOT (     sum(ObtainedMarks) for [SubjectID] in  ([1],[2],[3],[4]) )as finalResult   This works but problem is 1,2,3 is not static it should come from same table   So I did something like   declare @minvalue int, @maxvalue int declare @myArray varchar(max) set @MyArray=''  select RowID=IDENTITY(int, 1,1), SubjectID into #tempSubject from [Exam].[ObtainedMarkEntry] select * from #tempSubject set @minvalue = (select min(RowID) from #tempSubject) set @maxvalue = (select max(RowID) from #tempSubject) while (@minvalue&lt;=@maxvalue) begin     declare @sid nvarchar(10)     set @sid=(select SubjectID from #tempSubject where RowID=@minvalue)     set @myArray= @myArray + '[' + @sid + '], '      set @minvalue= @minvalue+1 end set @myArray= SUBSTRING(@myArray,0,len(@myArray)) drop table #tempSubject  declare @q as nvarchar(max) SELECT * FROM (SELECT StudentID, SubjectID, ObtainedMarks  from [Exam].[ObtainedMarkEntry]) as InvoiceResult PIVOT (     sum(ObtainedMarks) for [SubjectID] in  (@myArray) )as finalResult   Now I am getting error at in(@myArray) can't I assign variable in this section. What does "more buyers than sellers" in technical analysis of stocks actually mean? I often hear/read technical analysts looking at volume and price action on a chart and claiming that there are "more buyers than sellers" or vice versa.  Since every trade requires a buyer and a seller, how can volume/price signify more of one than the other?  What does that actually mean?  When I hear that there are "more buyers," I get the impression they actually mean more "professional" or "institutional" buyers, but I could just be imagining that meaning.  But wouldn't this "more buyers" situation actually represent a smaller number of large buyers placing multiple orders? (and those orders would be matched by a larger number of smaller investors on the other side of the trade?)  Maybe I have my assumptions backwards and "more buyers" is what they say when they actually mean "more retail buyers and less institutional buyers"?  Or maybe the expression has nothing to do with number of buyers/sellers at all and is just some arbitrary technical analysis situation?  What situation is it that they're trying to describe?  If the "smart money" traders had placed larger orders, then there would have to be equally large sellers on the other side of that large trade, right?  I know trades often get broken up, but if the trades had been broken up it would be equivalent to "large traders placing multiple orders" scenario described above.  If the trades were not broken up, then there would not be an imbalance in the "number" of "smart" vs. retail buyers/sellers, right?  UPDATE/EDIT: I usually see this stated in reference to technical indicators such as RSI.  I don't typically hear people saying "there are more buyers than sellers" in the situations you guys are describing with more unfilled orders on one side of the (potential) trade (though that would make more sense if that was what they were talking about).  See for example: The question is to show that for any $x,y \in\Re^n$  $||x+y||\cdot||x-y||\le||x||^2+||y||^2$  with equality if and only if $\langle x,y \rangle= 0.$  I have that $||x+y||^2=||x||^2+2 \langle x,y \rangle+||y||^2$ , which helps me prove equality but I'm lost on how to show this and show that the inequality part. Is the money you get from shorting a stock free to use for going long on other stocks? I have this struct:  struct Map {     public int Size;      public Map ( int size )     {         this.Size = size;     }      public override string ToString ( )     {         return String.Format ( "Size: {0}", this.Size );     } }   When using array, it works:  Map [ ] arr = new Map [ 4 ] {     new Map(10),     new Map(20),     new Map(30),     new Map(40)};  arr [ 2 ].Size = 0;   But when using List, it doesn't compile:  List&lt;Map&gt; list = new List&lt;Map&gt; ( ) {     new Map(10),     new Map(20),     new Map(30),     new Map(40)};  list [ 2 ].Size = 0;   Why? InDesign: How to restore text-frame position/size to be managed by the master page instead of the actual page? I have some designer that moved slightly a text-frame and in order to be managed again by the master page we need to remove the page and create a new one inserting the content in it.  Is there any different way to do it?  I would like to be able to restore the "power" of positioning/size to the master page because now we need to change the master-page to position the text-frame a little bit to the right and in the case above mentioned will not be updated.  Thanks please I tried to find counterexamples to see that $l^p$ is not norm with $p&lt;1$ in the triangle inequality but I have problems with convergence when I choose some successions. Thanks. If I open up many tabs in Chrome, the Tabs start to shrink. This is usually a normal behavior if the tabs would use the whole availible space, BUT in my case the tabs shrink too much. They don't use up the whole availible space anymore, but only go until somwhere at three quarters of the window. The more tabs I open, the larger the availible space gets until it reaches a maximum. This strikes me as somewhat not so normal.  Another funny thing is, if I use a second Monitor to extend my Desktop, Tabs will be smaller on the second Desktop and will only fill half the availible space from the beginning. For example right now I have 6 tabs open, which fill out approximately half the availible space. If I open more tabs, only the tab size reduces. This has not been like that when I first installed the browser.  This is what it looks like:    Is there any solution for this?   I hereby explicitly mean NO extensions. I found enough extensions to handle tabs. I just want them to behave normally without any of those tab-extensions. Re-Installing Chrome does NOT work, I tried that. Find the Galois group of $x^3-5$ over $\mathbb{Q}$. In this case, the roots of $x^3-5$ are $\{\sqrt[3]{5},\omega\sqrt[3]{5},\omega^2\sqrt[3]{5}\}.$ I think $\mathbb{Q}(\sqrt[3]{5},\omega\sqrt[3]{5})$ is the splitting field of $x^3-5.$ Then, $[\mathbb{Q}(\sqrt[3]{5},\omega\sqrt[3]{5}):\mathbb{Q}]=3,$ I think the automorphisms are: $$id$$ $$\sigma:\sigma(\sqrt[3]{5})=-\sqrt[3]{5}$$ $$\tau:\tau(\omega\sqrt[3]{5})=-\omega\sqrt[3]{5}$$ I'm not sure about what I have done. But how to determine the Galois group based on this? And how to determine the solvability of this polynomial? How to add new element to Varargs? What is Kirito's relationship with the girls of SAO?