How many string objects will be created in memory?
How many objects are being created?
How do you Xforward windows using ssh? How can I change the default program installation directory in Windows 7? Windows 7 is installed on my C drive, which is quite small.  I am very tired of instructing new programs to put their files on my larger D drive during installation; I would like to change the default drive.   says that you can use a registry hack, but I am giving Microsoft the benefit of the doubt and naively assuming that a configuration option exists somewhere.  It's 2010... do I really have to hack my registry to make a simple tweak like this?  Also, there's a  that explains how to move the "Users" directory and create a symlink, which could also work.  However, at the moment I have some apps in C:\Program Files, some apps in C:\Program Files (x86), and some apps in the corresponding folders on D:\, so it would be a hassle.  Also, my small OS boot drive is a 10k RPM WD Raptor, and I feel like that probably gives a speed boost to apps installed on it that need to read &amp; write to their directories a bunch.  I wonder if it actually matters. What are the minimum requirements to run Windows 10? Why shouldn't root be allowed to login via ssh? why should root access be disabled for ssh? I always hear that's for security reasons. But I don't get it. What's different to login as non-root and then sudo su -? What's the preferred way to handle tasks that need privileged permissions?  Thanks  Thomas Showing that the roots of a polynomial with descending positive coefficients lie in the unit disc. Let $P(z)=a_0+a_1z+\cdots+a_nz^n$ be a polynomial whose coefficients satisfy $$0&lt;a_0&lt;a_1&lt;\cdots&lt;a_n.$$  I want to show that the roots of $P$ live in unit disc. The obvious idea is to use Rouche's theorem, but that doesn't quite work here, at least with the choice $f(z)=a_nz^n, g(z)=$ (the rest).  Any ideas? Radical of $\mathfrak{gl}_n$ I find it intuitive enough that the radical of $\mathfrak{gl}_n\mathbb F$ is the scalar matrices, but I have trouble finding an easy, but complete proof:  Proof. Let $\mathfrak s$ denote the scalar matrices. Clearly $\mathfrak s\subset\mathrm{rad}(\mathfrak{gl}_n\mathbb F)$. Suppose that $\mathrm{rad}(\mathfrak{gl}_n\mathbb F)$ is generated by more than one element, so that $X\in\mathrm{rad}(\mathfrak{gl}_n\mathbb F)$, but $X\notin\mathfrak s$. We can change basis such that $\mathrm{rad}(\mathfrak{gl}_n\mathbb F)$ is upper-triangular. (The change of basis leaves the scalar matrices invariant.) Then $X$ is upper-triangular.  I want to conclude that there exists a $Y\in\mathfrak{gl}_n\mathbb F$ s.t. $[X,Y]$ is not upper-triangular. How can I see that $Y$ always exists, except by waving hands? How do I increase the render distance? How to render a background image in 2.8? Stop Excel from automatically converting certain text values to dates Does anyone happen to know if there is a token I can add to my csv for a certain field so Excel doesn't try to convert it to a date?  I'm trying to write a .csv file from my application and one of the values happens to look enough like a date that Excel is automatically converting it from text to a date.  I've tried putting all of my text fields (including the one that looks like a date) within double quotes, but that has no effect. Non-pejorative synonym of "notoriety" I'm trying to say:       He probably gained some __________ [good notoriety] from this picture.   I was thinking publicity, but that connotes some kind of negative to me as well (like the stuff you see in gossip magazines at the checkout line).  I want a word as powerfully positive as notoriety is powerfully negative. This may be a silly question, but I ask it still. If I have declared a shebang  #!/bin/bash    in the beginning of my_shell_script.sh, so do I always have to invoke this script using bash  [my@comp]$bash my_shell_script.sh   or can I use e.g.  [my@comp]$sh my_shell_script.sh   and my script determines the running shell using the shebang? Is it the same happening with ksh shell? I'm using AIX. Finding an example of a discrete-time strict local martingale. What is the longest word you can come up with that the letters are all in alphabetical order? It's Friday again, how about some fun to get us into the weekend?  What is the longest word you can come up with for which all the letters in that word are in alphabetical order?   Rules:   English words only    Can't be a name of a place, person or other proper noun.   if it contains the same letter twice in a row, that does not disqualify it.   No fair looking it up on Google!   Update: One more rule to help you guys out.   The word can be in either ascending or descending alphabetical order. Are there recommendations or pitfalls for playing an archer cleric? In my 4E game, a player is going to try an elven cleric with a longbow (and a mace, just in case). She chose mostly ranged powers. Are there any caveats to playing such a character, or any builds that I could recommend for her? Infinite Geometric Series Formula Derivation What does 's=.*/==' do in sed? I saw sed 's=.*/==' in context of sh script and I'm puzzled. I could not find in sed manual or web search (for sed s=) how s is used, not s///. Apart from s I see only one potential command here = (Print the current input line number), but in such case what the rest is doing...   Running the command in shell produces same output as input for e.g echo 'jkfdsa=335r34',  whereas echo 'jkfdsa=335r34' | sed 's/=.*/==/' does replacement as per manual. Also slightly modifying command to e.g. echo 'jkfdsa=3' | sed 's798=.*/==/' gives sed: -e expression #1, char 11: unterminated 's' command, so original should have some correct meaning. What is it? Assume I wield a Whip in one hand and a dagger in the other.  If a creature moves from 5ft to 10ft it has technically moved out of my reach (dagger), but at the same time it is still inside my reach (whip). When does it provoke opportunity attacks from me?  I am fully aware that this would not enable me to make off-hand attacks since the whip is not a light weapon, just to cut that issue out of the question. Some text lines are italicized with no spaces between words Should a toggle button show its current state or the state to which it will change? Identity for convolution of central binomial coefficients: $\sum\limits_{k=0}^n \binom{2k}{k}\binom{2(n-k)}{n-k}=2^{2n}$ It's not difficult to show that  $$(1-z^2)^{-1/2}=\sum_{n=0}^\infty \binom{2n}{n}2^{-2n}z^{2n}$$  On the other hand, we have $(1-z^2)^{-1}=\sum z^{2n}$.  Squaring the first power series and comparing terms gives us  $$\sum_{k=0}^n \binom{2k}{k}\binom{2(n-k)}{n-k}2^{-2n}=1$$  that is,  $$\sum_{k=0}^n \binom{2k}{k}\binom{2(n-k)}{n-k}=2^{2n}$$  My question: is there a more direct, combinatorial proof of this identity?  I've been racking my brains trying to come up with one but I'm not having much success.