Headings bunched together with \textsc
Inconsistent line spacing
Why does Property Set throw StackOverflow exception? I know java and would normally put in getter/setter methods. I am interested in doing it in C# with the following code, but it throws a StackOverflow exception. What am I doing wrong?  Calling Code  c.firstName = "a";   Property Code    public String firstName; {     get     {         return firstName;     }     set     {         firstName = value;     } } Prove QM-AM inequality $$\dfrac{x_1^2+ x_2^2 + \cdots + x_n^2}n \geq \left(\dfrac{x_1+x_2+\cdots+x_n}n\right)^2$$   I don't think AM, GM can be used here. And simple expansion doesn't help too. What should I do? How do I get the local machine name? How can I explain to a non-native why the plural of a noun isn't used adjectivally? How can I explain to a non-native speaker that while this is correct:     The felling of trees.    And this is also correct:     tree felling   This is not:     *trees felling   To a non-native it seems very reasonable that since many trees are being felled and given that the felling of trees uses the plural, the inverse form would also use the plural and become trees felling.  To a native speaker such as myself, the latter is very obviously wrong, but I couldn't figure out how to formalize this into a rule that a non-native can understand. In D&amp;D 5, the saving throws for spells has the following formula:  The DC is set to 8 + prof bonus + magical stat bonus.  The target then makes a saving throw, adding their stat bonus and hoping to get above that DC.  Instead of having the defender roll the saving throw, we would like the attacker to roll the attack against the "defense" of the monster. (Mainly to make play by post run smoother)  Would this mean that the attacker just rolls d20+prof + magic stat bonus, and they try to get a number which is higher than 8+ monster def stat bonus, or is there a different formula which better maintains the math? (This math sounds wrong to me, so I assume there is a better formula) Using pre-compiled headers with CMake finding rational roots of polynomials Why does HMAC use two different keys? Suppose $H$ is a hash function; why is $$H(k\mathbin\|H(k\mathbin\|m))$$ not secure?  See this . In there, indeed two keys are used and the mac algorithm is $$H(k_1\mathbin\|H(k_2\mathbin\|m)).$$ Why don't we use $$H(k\mathbin\|H(k\mathbin\|m)),$$ which has only one key? I've been using SSH Tunnel manager to easily set up and stop port tunneling over SSH to various servers at my company. That saved me the pain of opening up a new terminal window which will hang out there just for the sake of having a tunnel open.  This worked great (well , sort of) but SSH Tunnel Manager is a PowerPC application. With Lion, it is not supported any more.  What is a good replacement? Is it true that the order of $ab$ is always equal to the order of $ba$? I have written a small script to count number of occurrences of logs in a particular file. The following is my code:   #!/bin/sh count=1 while read line do     found=$( grep M $line )     OCCURENCE=$( grep M /log.txt)     if [ "$OCCURENCE" ]; then         echo $count")" $line &gt;&gt; filesave.txt     fi     count=$((count+1)) done &lt; log1.txt   but I am getting this error:  ./count.sh ./count.sh: syntax error at line 10: `found=$' unexpected Data Recovery - How to Restore Deleted / Formatted Files on HD Micro SD Card Background:    I put in a friend's SD Card to format it because it was having problems. Then I put mine back in and I think my phone formatted my SD Card. I had a ton of pictures on there that are now gone! I put the card into the computer and there's only 2mb of cache files on there and none of the original directories.   I already tried the following freeware recovery applications:         Neither of them were able to retrieve any files. Undelete took 1minute to scan for files and came up with 0 files.  Recuva took 10 minutes for their "deep scan" which doesn't seem thorough enough at all for this 8GB SD Card. I need something that's a lot more heavy duty.  I don't mind paying for an application to get the data back if necessary...   Questions:     Which application can I use to recover my deleted picture files from my 8GB HD Micro SD Card?   Why did Anroid format my SD card?   How can I tell if it's a phone problem, data problem, or SD Card problem? join comma delimited data column How do I add a DNS server via resolv.conf? Is /etc/resolv.conf useless in  (Precise Pangolin)?  I see that the DNS server information is stored in  now. The nmcli command line tool can list that for you.  If I want to add one more  server, will adding it to /etc/resolv.conf by using the resolvconf package help? Product of Consecutive Integers is Not a Power "...would have trouble imagining...": Is this present participle or gerund? Difficulty in creating macro '\newcommand' for the beginning and end of frames in Beamer Prove that the power set of an $n$-element set contains $2^n$ elements Theorem. Let $X$ denote an arbitrary set such that $|X|=n$. Then $|\mathcal P(X)|=2^n$.      Proof. The proof is by induction on the numbers of elements of $X$.      For the base case, suppose $|X|=0$. Clearly, $X=\emptyset$. But the empty set is the only subset of itself, so $|\mathcal P(X)|=1=2^0$.      Now the induction step. Suppose $|X|=n$; by the induction hypotesis, we know that $|\mathcal P(X)|=2^n$. Let $Y$ be a set with $n+1$ elements, namely $Y=X\cup\{a\}$. There are two kinds of subsets of $Y$: those that include $a$ and those that don't. The first are exactly the subsets of $X$, and there are $2^n$ of them. The latter are sets of the form $Z\cup\{a\}$, where $Z\in\mathcal P(X)$; since there are $2^n$ possible choices for $Z$, there must be exactly $2^n$ subsets of $Y$ of which $a$ is an element. Therefore $|\mathcal P(Y)|=2^n+2^n=2^{n+1}$. $\square$      From the above explanation, I don't understand why the set that contains $\{a\}$ will contain $2^{|n|}$ elements when it should clearly be $2^{|1|}$.  The construction of a new set $S$ is the union of the old set with cardinality $n$ and an new element $\{a\}$, therefore the set that do not contain $\{a\}$ still has cardinality $n$ and the set that contains $\{a\}$ is just $\{a\}$, one element...  Can someone please elucidate? I would like to create an alias to rm command in order to have a confirmation message after executing this command. So I am creating an alias like this alias rm='rm -i'. But as far as I know this is a temporary alias and it lives until you close the terminal.  As it is explained  to save alias permanently I need to execute ~/.bash_aliases or ~/.bashrc commands in terminal and add my alias there. But when I execute ~/.bashrc I get following error message :  bash: /home/bakhtiyor/.bashrc: Permission denied   When I run ~/.bash_aliases I get another error message like this:  bash: /home/bakhtiyor/.bash_aliases: File or directory doesn't exist.   What is the actual problem and how can I solve it? What is the US Visa Waiver Program and what is an ESTA?