Why can't I add something to PATH permanently?
How do I set a user environment variable? (permanently, not session)
Is some of my internal memory missing? Methods to compute $\sum_{k=1}^nk^p$ without Faulhaber's formula How can I separate multiple quote blocks? I have a series of quotes which I want to display in two separate quote blocks.  &gt; Are questions about Microsoft Word Online on-topic here? I don't &gt; really see any posted here, but perhaps I am not searching correctly. &gt; - mweiss &gt;  &gt; Yes, they are. We even have a specific tag: [tag:word-online]. -ale &gt;  &gt; Thanks! I'm sorry I missed that tag. -mweiss   When I try to add these to my post, they display as a single combined quote.     Are questions about Microsoft Word Online on-topic here? I don't   really see any posted here, but perhaps I am not searching correctly.   - mweiss      Yes, they are. We even have a specific tag: . -ale      Thanks! I'm sorry I missed that tag. -mweiss   How can I separate quotes so that they aren't combined into a single quote block? I recently upgraded my CPU from an Athlon II X2 250 to the Athlon II X4 610E(45W 4 cores -- can't beat the efficiency).  Is an ubuntu reinstall required? Regularization using methods such as Ridge, Lasso, ElasticNet is quite common for linear regression. I wanted to know the following: Are these methods applicable for logistic regression? If so, are there any differences in the way they need to be used for logistic regression? If these methods are not applicable, how does one regularize a logistic regression? How can I download free apps without registering an Apple ID? Let $x_{1},x_{2},\cdots,x_{n}$ be real numbers. Show that     $$\sum_{i,j=1}^{n}|x_{i}+x_{j}|\ge n\sum_{i=1}^{n}|x_{i}|.$$   I think this problem may be solved using nice methods, but I can't find them yet; I know this may be of use: $$|a|+|b|\ge |a+b|.$$ But I can't make it work. Thank you everyone. What is the Hausdorff dimension of the set of irrationals on $\mathbb R^1$ I am sorry if this is a dump question but I can't find any reference for this. What is the Hausdorff dimension of the set of irrationals on $\mathbb R^1$? I speculate this is $1$ but don't know how to prove it rigorously. Why don't Stack Exchange sites use a rich text editor? Why does the Stack Exchange network of sites use Markdown instead of some other rich text editor like FCKEditor or TinyMCE? Theorem. If the identity is written as the product of $r$ transpositions, $id=τ_1τ_2\dots τ_r$, then $r$ is an even number. Proof. We will employ induction on $r$. A transposition cannot be the identity; hence, $r &gt; 1$. If $r = 2$, then we are done. Suppose that $r &gt; 2$. In this case the product of the last two transpositions, $τ_{r−1}τ_r$, must be one of the following cases: $(ab)(ab) = id\\ (bc)(ab) = (ac)(bc)\\ (cd)(ab) = (ab)(cd)\\ (ac)(ab) = (ab)(bc),$ where $a$, $b$, $c$, and $d$ are distinct. The first equation simply says that a transposition is its own inverse. If this case occurs, delete $τ_{r−1} τ_r$ from the product to obtain $id=τ_1τ_2···τ_{r−3}τ_{r−2}$. By induction $r − 2$ is even; hence, $r$ must be even. In each of the other three cases, we can replace $τ_{r−1} τ_r$ with the right-hand side of the corresponding equation to obtain a new product of $r$ transpositions for the identity. In this new product the last occurrence of $a$ will be in the next-to-the-last transposition. We can continue this process with $τ_{r−2} τ_{r−1}$ to obtain either a product of $r − 2$ transpositions or a new product of $r$ transpositions where the last occurrence of $a$ is in $τ_{r−2}$. If the identity is the product of $r − 2$ transpositions, then again we are done, by our induction hypothesis; otherwise, we will repeat the procedure with $τ_{r−3}τ_{r−2}$. At some point either we will have two adjacent, identical transpositions canceling each other out or $a$ will be shuffled so that it will appear only in the first transposition. However, the latter case cannot occur, because the identity would not fix $a$ in this instance. Therefore, the identity permutation must be the product of $r − 2$ transpositions and, again by our induction hypothesis, we are done. Question: That is the proof written in the book, but unfortunately after more than $10$ times reading I don't understand the last two paragraph (i.e., from &quot;In each of the other three cases&quot;). Is there another simpler proof or could someone please clarify what is going on? Thank you. I'm trying to make a material node setup to set final render colors, regardless of lighting conditions. Is such a setup possible? Rendering of Favorite/Ignored Tags in Firefox Why do I get "Permission denied (publickey)" when trying to SSH from local Ubuntu to a Amazon EC2 server? How to add keyboard shortcuts? I want Ctrl+Alt+B bring up a browser.  Ctrl+Alt+Delete is handy.  Can I set up Ctrl+Alt+B to bring up a browser (either default or specific)? The classical book on commutative algebra Introduction to Commutative Algebra, by Atiyah and Macdonald, has the following as exercise I.11.       A ring is Boolean if $x^2=x$ for any $x$ of $A$. In a Boolean ring $A$, show that     i) $2x=0$ for all $x\in A$;    ii) Every prime ideal of $A$ is maximal, and its residue field consists of two elements;   iii) Every finitely generated ideal of $A$ is principal.     I can but solve the first two of them; for the last one, I cannot even perceive the situation here, for it will not, generally speaking, be a Dedekind domain, whereof my knowledge is somewhat more. I have hitherto tried to find one element for each ideal of two generators which can stand the stead of them, and then proceed by induction. But even the first step fails to produce any result. Thanks for any hints and inspirations in advance. Log of products to sum of logs Finding the remainder of $\overbrace{11\ldots1}^{123 \text{ times}}$ divided by $271$ A hidden process, what it is? [root@datacenteronline ~]# ssh root@192.168.1.172 Last login: Wed Apr 17 09:55:45 2013 from 192.168.1.187 [root@localhost ~]# ls /proc/ | grep 2266 [root@localhost ~]# cd /proc/2266 [root@localhost 2266]# ls attr             cpuset   limits      net            root       statm autogroup        cwd      loginuid    numa_maps      sched      status auxv             environ  maps        oom_adj        schedstat  syscall cgroup           exe      mem         oom_score      sessionid  task clear_refs       fd       mountinfo   oom_score_adj  smaps      wchan cmdline          fdinfo   mounts      pagemap        stack coredump_filter  io       mountstats  personality    stat [root@localhost 2266]# ls -al /proc/2266 total 0 dr-xr-xr-x   7 apache apache 0 Apr 17 09:45 . dr-xr-xr-x 266 root   root   0 Apr 17 09:11 .. dr-xr-xr-x   2 apache apache 0 Apr 17 09:45 attr -rw-r--r--   1 root   root   0 Apr 17 09:45 autogroup -r--------   1 root   root   0 Apr 17 09:45 auxv -r--r--r--   1 root   root   0 Apr 17 09:45 cgroup --w-------   1 root   root   0 Apr 17 09:45 clear_refs -r--r--r--   1 root   root   0 Apr 17 09:45 cmdline -rw-r--r--   1 root   root   0 Apr 17 09:45 coredump_filter -r--r--r--   1 root   root   0 Apr 17 09:45 cpuset lrwxrwxrwx   1 root   root   0 Apr 17 09:45 cwd -&gt; / -r--------   1 root   root   0 Apr 17 09:45 environ lrwxrwxrwx   1 root   root   0 Apr 17 09:45 exe -&gt; /usr/local/apache2/bin/httpd dr-x------   2 root   root   0 Apr 17 09:45 fd dr-x------   2 root   root   0 Apr 17 09:45 fdinfo -r--------   1 root   root   0 Apr 17 09:45 io -rw-------   1 root   root   0 Apr 17 09:45 limits -rw-r--r--   1 root   root   0 Apr 17 09:45 loginuid -r--r--r--   1 root   root   0 Apr 17 09:45 maps -rw-------   1 root   root   0 Apr 17 09:45 mem -r--r--r--   1 root   root   0 Apr 17 09:45 mountinfo -r--r--r--   1 root   root   0 Apr 17 09:45 mounts -r--------   1 root   root   0 Apr 17 09:45 mountstats dr-xr-xr-x   6 apache apache 0 Apr 17 09:45 net -r--r--r--   1 root   root   0 Apr 17 09:45 numa_maps -rw-r--r--   1 root   root   0 Apr 17 09:45 oom_adj -r--r--r--   1 root   root   0 Apr 17 09:45 oom_score -rw-r--r--   1 root   root   0 Apr 17 09:45 oom_score_adj -r--r--r--   1 root   root   0 Apr 17 09:45 pagemap -r--r--r--   1 root   root   0 Apr 17 09:45 personality lrwxrwxrwx   1 root   root   0 Apr 17 09:45 root -&gt; / -rw-r--r--   1 root   root   0 Apr 17 09:45 sched -r--r--r--   1 root   root   0 Apr 17 09:45 schedstat -r--r--r--   1 root   root   0 Apr 17 09:45 sessionid -r--r--r--   1 root   root   0 Apr 17 09:45 smaps -r--r--r--   1 root   root   0 Apr 17 09:45 stack -r--r--r--   1 root   root   0 Apr 17 09:45 stat -r--r--r--   1 root   root   0 Apr 17 09:45 statm -r--r--r--   1 root   root   0 Apr 17 09:45 status -r--r--r--   1 root   root   0 Apr 17 09:45 syscall dr-xr-xr-x  29 apache apache 0 Apr 17 09:45 task -r--r--r--   1 root   root   0 Apr 17 09:45 wchan   Cound anyone tell me what it is? I have a sheet in which I first apply a filter to a certain column to show "Unique records only". Now I have a column which contains, for e.g., values like:  Applepie Applesauce Crabapple Banana Mango   What I need is the count of all visible cells containing the word "Apple". Note that this should exclude the hidden (filtered out) cells. Now I have found out a formula:  `=SUMPRODUCT(SUBTOTAL(3,OFFSET(Sheet1!A:A,ROW(Sheet1!A:A)-MIN(ROW(Sheet1!A:A)),,1))*(Sheet1!A:A="&lt;Text to search&gt;"))`   However the problem with this one is this formula searches for the entire text. NOT just a part of it. How do I modify this formula to return count of cells containing "Apple" i.e. for this example it should return 3 as the result. How a Gmail username can be taken but not recognised simultaneously? Being at  I enter a desired username (without @gmail.com which is supposed), and I get error:     "That username is taken. Try another."   But when I try to login into Google with that xxx@gmail.com at  it fails with:     "Sorry, Google doesn't recognise that email."   How that can be?  P.S.: I want that username still.