I just installed Cygwin, and it looks like the home directory in the bash prompt is on my Z: drive. That's not where I want it.  How can I change this?
I'm trying to safely update the home directory as specified in /etc/passwd, but the standard Linux utils - usermod and vipw - for doing so aren't provided by Cygwin.  Could anyone tell me how they changed this in Cygwin?
Suppose $X$ is a real-valued random variable and let $P_X$ denote the distribution of $X$. Then $$ E(|X-c|) = \int_\mathbb{R} |x-c| dP_X(x). $$  of $X$ are defined as any number $m \in \mathbb{R}$ such that $P(X \leq m) \geq \frac{1}{2}$ and $P(X \geq m) \geq \frac{1}{2}$.  Why do the medians solve $$ \min_{c \in \mathbb{R}} E(|X-c|) \, ? $$ Why does my shell script choke on whitespace or other special characters? Does $\pi$ contain all possible number combinations? rsync two existing directories copying everything I have two file servers in two locations. Currently both have the same data, which generally is unmodified (used for read only access).When the second server was set up (the one I'm sshing to) the data was copied over LAN and has since been moved geographically.  I'm trying to use rsync for the first time on the required directories. An example command;  sudo rsync -avz --ignore-existing -P --dry-run /media/Storage/OSs/ user@mydomain:/mnt/Storage/OSs/   I've tried using -c -t -u (Additionally went on the remote server and updated the timestamps to today) also but every time I execute a dry run it wants to copy everything!  Additionally the user is the same for both machines with the same UID.  *Edit  After playing around a bit more, I've found that rsync does not like the whitespace in the subdirectory names; For instance if I use ' to escape local shell &amp; \ to escape remote shell     sudo rsync -avz --ignore-existing -P '/media/Storage/OSs/Windows/Windows server 2011/' 'user@mydomain:/mnt/Storage/OSs/Windows/Windows\ server\ 2011/'   Then all is well, my theory is then that rsync does not like the subdirectories with whitespaces. I have thousands of subdirectories; the only solution I can think of is to write a small python/shell script to run each sub directory separately but is undesirable. I have two submit buttons in a form. How do I determine which one was hit serverside? I always know that the natural logarithm $\log_e$ is the inverse of the exponential function $e$, but to my surprise when reading elementary functions in complex analysis, I discover that that is not always true. $$\log(e^z)=z+2k\pi i$$  My question here is that, why is the above expression true? When IE10 is set as my default browser, double-clicking an internet shortcut (*.url file) opens it in a new tab of the existing IE window. However, when it is not the default, every way of opening a *.url that I've tried brings up a new IE window per file. Is it possible to keep opening files in new tabs of the same IE window when it's not set as the default browser, and how?  What I've tried and it didn't work:   "C:\Program Files (x86)\Internet Explorer\iexplore.exe" "C:\Dir1\file.url" (opens a new window every time) C:\Windows\System32\rundll32.exe "C:\Windows\System32\ieframe.dll",OpenURL C:\Dir1\file.url (opens the default browser) classexec "C:\Dir1\file.url" --class htmlFile (using  utility, opens a new window every time)   I use Windows 7 x64. Would depositing large cash amounts cause problems? I saw  recently where a man withdrew $600,000 USD in cash from his bank.  I'm sure many folks here would advise against this move for obvious (and perhaps not-so-obvious) reasons.   My question: suppose you did this and then, some months later, changed your mind and wanted to re-deposit with a bank.  I assume the gent cannot simply walk into a bank with $600,000 USD and deposit it, right?  Wouldn't money-laundering alarms be raised?  Wouldn't the IRS like to know where the money came from? If I simply wrap my query with:  BEGIN TRANSACTION    COMMIT TRANSACTION   If anything fails inside of that, will it automatically rollback?  From looking at other code, they seem to check for an error, if there is an error then they do a GOTO statement which then calls ROLLBACK TRANSACTION  But that seems like allot of work, to have to check for IF( @@ERROR &lt;> 0) after every insert/update. Positioning of decorations on parallel lines Let $a\in \mathbb{Z}$ be such that $a=b^2+c^2$ where, $b,c \in \mathbb{Z}-\{0\}$. Then $a$ cannot be written as    $pd^2$ where $d \in \mathbb{Z}$ and $p$ is prime with $p \equiv 1~(mod~4)$ $pd^2$ where $d \in \mathbb{Z}$ and $p$ is prime with $p \equiv 3~(mod~4)$ $pqd^2$ where $d \in \mathbb{Z}$ and $p,q$ are primes with $p \equiv 1~(mod~4)$ and $q \equiv 3~(mod~4)$ $pqd^2$ where $d \in \mathbb{Z}$ and $p,q$ are primes with $p,q \equiv 3~(mod~4)$   The similar question with some part missing is asked , but I want to discuss additional options too.  Here, I got 1) is false Since $13=3^2+2^2$ For other options What should I do Taking back turns, and forgotten privileges A generic question across most board games: once a player has taken their turn (taken their finger off the piece they are playing), should they be allowed to change their mind?  Similarly, if a player forgets to take a privilege, such as an occupied building in Puerto Rico giving an extra worker, or plantation, if they remember a few moves later, should they be allowed to take the privilege?  Very few rules explicitly express how these events should be dealt with, so they are generally left up to the group. However, my group's rules will change depending on the personality of the players playing (not all members are available each time we play). I would like to make this consistent, and would appreciate feedback on how others deal with this scenario. "(CRON) info (No MTA installed, discarding output)" error in the syslog If $a$ and $b$ are consecutive integers, prove that $a^2 + b^2 + a^2b^2$ is a perfect square. Problem is as stated in the title. Source is Larson's 'Problem Solving through Problems'. I've tried all kinds of factorizations with this trying to get it to the form $$k^2l^2$$ but nothing's clicking. I tried Bézout but the same expression can be written as $$a^2 + (a^2 + 1)(a+1)^2$$ which would imply that there is no real root.  Would really appreciate some help, thanks. I want to make someone a present by subscribing for him to a mathematical journal. (It should appear every month or every two months). The contents should be comprehensible to an undergraduate in mathematics, and be about a broad selection of topics (for example not only analysis).   I expect the content to be something like proposing interesting problems and then giving solutions with some references for further study. Are there some famous journals you could suggest me? I plugged in my external harddrive (which was formatted on my Mac into HFS+ journaled) to my Ubuntu desktop 9.04 64bit.  I am not able to get the drive to mount with write capability, how do I do that?  Right now all I'm getting is read access, I tried  sudo mount -t hfsplus /dev/sdf2 /media/"Portable HD"   but that still gave me only read access...  ideas?? Choice of $q$ in Baby Rudin's Example 1.1 First, my apologies if this has already been asked/answered.  I wasn't able to find this question via search.  My question comes from Rudin's "Principles of Mathematical Analysis," or "Baby Rudin," Ch 1, Example 1.1 on p. 2.  In the second version of the proof, showing that sets A and B do not have greatest or lowest elements respectively, he presents a seemingly arbitrary assignment of a number $q$ that satisfies equations (3) and (4), plus other conditions needed to show that $q$ is the right number for the proof.  As an exercise, I tried to derive his choice of $q$ so that I may learn more about the problem.  If we write equations (3) as $q = p - (p^2 - 2)x$, we can write (4) as   $$ q^2 - 2 = (p^2 - 2)[1 - 2px + (p^2 - 2)x^2]. $$  Here, we need a rational $x &gt; 0$, chosen such that the expression in $[...]$ is positive.  Using the quadratic formula and the sign of $(p^2 - 2)$, it can be shown that we need   $$ x \in \left(0, \frac{1}{p + \sqrt{2}}\right) \mbox{ for } p \in A, $$  or, for $p \in B$, $x &lt; 1/\left(p + \sqrt{2}\right)$ or $x &gt; 1/\left(p - \sqrt{2}\right)$.  Notice that there are MANY solutions to these equations! The easiest to see, perhaps, is letting $x = 1/(p + n)$ for $n \geq 2$.  Notice that Rudin chooses $n = 2$ for his answer, but it checks out easily for other $n$.  The Question:  Why does Rudin choose $x = 1/(p + 2)$ specifically?  Is it just to make the expressions work out clearly algebraically?  Why doesn't he comment on his particular choice or the nature of the set of solutions that will work for the proof?  Is there a simpler derivation for the number $q$ that I am missing? How can I generate and print a 32 bit sequence of 0s and 1s in Qiskit or IBM Q experience quantum lab using quantum random number generator implementation? Over the course of time here on TSE, I have observed individuals whose pattern of visa applications is best described as ''...     serial refusals - Two or more consecutive visa refusals issued by the same regime to the same person. Commonly for the same, or nearly the same, reasons. In some visa regimes Serial refusals can have a cumulative effect wherein the applicant's credibility is increasingly eroded, especially when the application pattern suggests a secondary agenda.   A common thread appears to be the need to visit the destination country (especially Schengen, the USA, or the UK) with a special sense of urgency. Also common in these cases are the following types of questions...   Should I just reapply once again? What are my chances? What can I do to improve my odds in the future? Can I somehow address the previous refusals to avoid them being a burden on all future applications? How can I break the pattern?      NB: This question is intended as a canonical about serial refusals. I have never been personally denied a visa. How to call the method correctly in Preference.OnPreferenceChangeListener()