"To ask" or "for asking"
How does one know when to use a gerund or an infinitive?
It is a question of Nautilus file manager of Ubuntu 18.04. Is there a simple way to create a Folder when file list is full of items? I had two drives partitioned the same and running two RAID partitions on each.  One died and I replaced it under warranty for the same model.  While trying to partition it, the first partition can only start on sector 2048, instead of 63 that was before. Drive have different geometry as previous and remaining ones. (Fewer heads/more cylinders)  Old drive:  $ sudo fdisk -c -u -l /dev/sdb   Disk /dev/sdb: 2000.4 GB, 2000398934016 bytes 255 heads, 63 sectors/track, 243201 cylinders, total 3907029168 sectors Units = sectors of 1 * 512 = 512 bytes Sector size (logical/physical): 512 bytes / 512 bytes I/O size (minimum/optimal): 512 bytes / 512 bytes Disk identifier: 0x000aa189     Device Boot      Start         End      Blocks   Id  System /dev/sdb1   *          63   174080339    87040138+  83  Linux /dev/sdb2       174080340   182482334     4200997+  82  Linux swap / Solaris /dev/sdb3       182482335  3907024064  1862270865   fd  Linux raid autodetect   Remanufactured drive received from warranty:  $ sudo fdisk -c -u -l /dev/sda  Disk /dev/sda: 2000.4 GB, 2000398934016 bytes 81 heads, 63 sectors/track, 765633 cylinders, total 3907029168 sectors Units = sectors of 1 * 512 = 512 bytes Sector size (logical/physical): 512 bytes / 512 bytes I/O size (minimum/optimal): 512 bytes / 512 bytes Disk identifier: 0x000d0b5d     Device Boot      Start         End      Blocks   Id  System /dev/sda1            2048  ...   Why is that? Support for OpenID ended on July 25, 2018 How to use maths symbols in text mode? I try to add a center dot with \circ but it fails to compile. How to use maths symbol in text mode? The error message is   ovak, slovenian, spanish, swedish, turkish, turkmen, ukrainian, uppersorbian,  welsh, loaded. (/usr/local/texlive/2012/texmf-dist/tex/latex/base/article.cls Document Class: article 2007/10/19 v1.4h Standard LaTeX document class (/usr/local/texlive/2012/texmf-dist/tex/latex/base/size10.clo)) (./untitled-1.aux) ! Missing $ inserted. &lt;inserted text&gt;              $ Find all the numbers $n$ such that $\frac{4n-5}{60-12n}$ can't be reduced. Implementing the decorator pattern in Python Stuck in a loop at login prompt after changing shell to zsh A (not necessarily unitary) $R$ module $M$ splits into $B\oplus C$ where $B$ is unitary and $RC=\{0\}$. I have a long-running Python server and would like to be able to upgrade a service without restarting the server. What's the best way do do this?  if foo.py has changed:     unimport foo  &lt;-- How do I do this?     import foo     myfoo = foo.Foo() Word order: "10 minutes more" or "10 more minutes"? How to detect using c# if a pendrive is plugged into a USB port? Is there a way to find out when in a LAN anyone plugs in a pendrive to the USB port?  Programatically (in C# preferably) or through some tool. Basically I'd imagine a client application sits on each terminal and monitors the USB ports and sends the information to the server.   a.) Can I get the details of the file(s) being copied? b.) Is there a way to do this without a client application?   EDIT  I dont want to disable the USB port entirely. its to be on a need to have basis. Basically just want the users on the LAN to share data responsibly and know that whatever data is tranfered is monitored and logged and can be questioned later. If $X^n$ is a diagonal matrix with distinct eigenvalues, then is $X$ also a diagonal matrix with distinct eigenvalues? Can an irrational number raised to an irrational power be rational? How to twist radial vector to make spirals? Quotient group $G/H$ is abelian iff $[G,G] \subseteq H$ I've been a Stack Exchange contributor for a couple of years now, currently most active on . One thing that keeps coming up is questions that would appeal to audiences on two different Stack Exchange sites but there are almost no features taking advantage of these questions. On travel.SE we have crossover questions most often with  and possibly next most often with  - but it can happen with almost any SE site. Today alone we had  with  and  had . I am absolutely sure that this must happen all the time between arbitrary pairs of Stack Exchange sites but the only feature that takes advantage of it is the possibility of migrating off-topic questions which leaves the original question acting as a redirect across the two sites. I think there is a missed opportunity to build the network between sites where users of one site don't realize they could make valuable contributions to a sister site they have had so far little to do with. At the very least there could be a way to &quot;advertise&quot; a question on a second site that could be interested in it. Probably by listing it in the sidebar where there are also links to meta questions, linked questions, related questions, new blog posts, and But there could also be some kind of features that make some sort of acceptable crossposting. There could be gamification/badges added around building cross-site questions or whatever else you can think up. I think this is a great way for people to spread their expertise from their main site onto other sites, to make the network stronger and more cohesive, to bring more attention to questions that would have a divided audience between two sites. I can think only of positives and no negatives. Does anyone else have some ideas to add or think this is a bad idea for any reason?  Example crossover questions: Here are some links to some crossover questions I've been finding in the Stack Exchange network here. (This was previously posted as an answer, but more people wanted it to be part of the question.)   ▶  :   ▶  :   ▶  :   ▶  :   ▶  :   ▶  :   ▶  :   ▶  :   ▶  :   ▶  :   ▶  :   ▶  :   ▶  : How can I calculate what the effect of an extension tube will be? The  (ESC), states that for every natural number $n \geq 2$, there exists a set of natural numbers $a, b, c$ , such that the following equation is satisfied:  $$\frac{4}{n}=\frac{1}{a}+\frac{1}{b}+\frac{1}{c}\tag{1}$$  The basic approach to solving this problem outlined by Mordell [Ref1] is described below  By defining $t$ and $m$ as positive integers greater than zero and $q$ a positive integer greater than one we can observe that  a) There is always a solution for even $n$, since if $n=2^qt$ we have the trivial solution $$\frac{4}{4t}=\frac{1}{t}$$  In the remaining case $n=2(2t+1)$, a solution in the form of two Egyptian fractions can always be found  e.g. $$\frac{4}{2(2t+1)}=\frac{2}{2t+1}=\frac{1}{t+1}+\frac{1}{(t+1)(2t+1)}$$  b) If $(1)$ is a solution for some particular prime $n$ then all composite numbers $mn$ divisible by $n$ are also solutions, thus  $$\frac{4}{mn}=\frac{1}{ma}+\frac{1}{mb}+\frac{1}{mc}$$  will also be a solution. This means that we can simplify the analysis to the cases where $n$ is a prime greater than 2.  Using Mordell's approach we have just shown that we only need to consider the cases where $n$ is prime and where $n \equiv 1 \pmod{2} \;\;[meaning \;\;n=2t+1]$  The argument continues...  Mordell goes on to show in turn that the search can be reduced further to the cases when $$n \equiv 1 \pmod{4} \;\;[meaning \;numbers \;\;n=4t+1]$$ $$n \equiv 1 \pmod{8} \;\;[meaning \;numbers \;\;n=8t+1]$$ $$n \equiv 1 \pmod{3} \;\;[meaning \;numbers \;\;n=3t+1]$$ $$n \equiv 1,2,4 \pmod{7} \;\;[meaning \;numbers \;\;n=7t+1,n=7t+2 \;or\;n=7t+4 ]$$ $$n \equiv 1,4 \pmod{5}  \;\;[meaning \;numbers \;\; n=5t+1 \;or\;n=5t+4]$$  Assembling these results together, Mordell showed that the conjecture can be proved in this context except for the cases when $$n \equiv 1,11^2,13^2,17^2,19^2,23^2 \pmod{840}$$  Mordell stated that since the first prime meeting this condition is 1009, this is proof that the conjecture holds for $n&lt;1009$.  This basic approach can be pursued further. Other workers have shown that the conjecture holds for much higher values of $n$ using similar methods as can be seen on the above Wikipedia page.   Note that other intermediate results can be constructed from the above congruence's, e.g. $n \equiv 1 \pmod{24}$.  The question is:  Are there any other elementary approaches to solving this problem than the one outlined by Mordell (and described above)?  [Ref1] Louis J. Mordell (1969) Diophantine Equations, Academic Press, London, pp. 287-290. Display Blank when Referencing Blank Cell in Excel 2010 Standard concise way to copy a file in Java?