"an hour" vs "for an hour"
"wait more than" vs. "wait FOR more than"
How can I add a new user as sudoer using the command line? Is GTA Online cross-platform? Variation on Vandermonde's identity How can you show that $$ \binom{2n}{n}^2 = \sum_{m=0}^{n} \binom{2n}{2m} \binom{2m}m \binom{2n-2m}{n-m} $$?  I was fooling around with random walks, and apparently both expressions are supposed to be the number of unweighted random walks on a 2D square lattice of $2n$ steps that ends at the origin.  Whole thing reminds me of Vandermonde's identity but I can't it. Any hints? would this be considered a 'methodology' or a 'method'? Say I developed something called "Methodology for Establishing Remaining Life of Components". Basically, at work, we have components (or equipment). I wanted to develop a way to identify how much longer the components / equipment can last before they ware out and cannot be used.  It takes into account "the degree of damage currently in the component, the rate of future damage accumulation based on realistic operating scenarios, and the degree of damage required to cause failure." Taking these three into account, the remaining life of a component can be assessed. This is what I call "Methodology for Establishing Remaining Life of Components".   My question is, would this be considered a 'methodology for establishing remaining life of components' or just a 'method for establishing remaining life of components'? Or do you need more information to figure out if it is a method or methodology?   I cannot provide all the information for business purposes, but if additional  information is required to figure out if it is a method or methodology, I will provide it. Are there any Combinatoric proofs of Bertrand's postulate? I feel like there must exist a combinatoric proof of a theorem like: There is a prime between $n$ and $2n$, or $p$ and $p^2$ or anything similar to this stronger than there is a prime between $p$ and $(\prod_p p) + 1$ (Euclid's theorem).  I was trying to prove one by the Sieve on this grid      1     2     3     4 ... p   p+1   p+2   p+3   p+4 ... 2p  2p+1  2p+2  2p+3  2p+4 ... 3p ........................... ........................... ........................... p^2 p^2+1 p^2+2 p^2+3 p^2+4 ...   but it did not work.  Do any good arguments like this exist? I don't expect anything as strong as Prime Number Theorem or even Bertrand, but surely a direct combination proof can prove that there are lots of primes? I have recently installed lubuntu 11.10 on my old laptop (acer aspire 5315 celeron) and observed that fan is not working properly on lubuntu side.I find it strange that it is working perfectly under window vista.   How could I solve this problem? Show that $\left|\frac{\alpha - \beta}{1-\bar{\alpha}\beta}\right| < 1$ when $|\alpha|,|\beta| < 1$ How to strike through obliquely, e.g. to indicate cancellation? What is the correct permission in /etc/fstab to mount NTFS? I have Windows and Arch Linux in dual with UEFI. I want to mount my another NTFS partition in Arch. I mounted the partition with mount /dev/sda5  /mnt/Apps command. Then added the output of genfstab -U /mnt/Apps in /etc/fstab file. The output is as follows:  UUID=01D158CC7C2A61A0 /mnt/Apps ntfs rw,nosuid,nodev,user_id=0,group_id=0,allow_other 0 0   But when I unmount and remount that partition all files and folders shows with root uid and gid and 0777 permission. I also tried with changing uid and gid to 1000 but same result. So, my question, what is the correct way to add NTFS partitions in fstab so that I can read &amp; write all file and folder both with normal user (1000:1000) and root (0:0)? How to work with "FIFO" in C# .NET? Real valued analytic function defined on a connected set is constant Let $G$ be a connected set and $f : G \rightarrow \mathbb{C}$ a real valued analytic function. Prove that $f$ is constant.    My idea to prove the result is to prove a subset $A \neq \varnothing$ of the connected set $G$ is both open and closed. So $G=A$ Take $f(w) = a$ $$A = \{z\colon z \in G, f(z) = a\}$$ Now I want to show that $A$ is infinite. How to do it? After that it is easy to prove $A=G$. How to verify iOS app integrity? If I write an app for iOS and it's accepted by the AppStore, how do I know if the app is actually the app I compiled and has not being substituted/altered by, say, a "Man in the middle" style interception/attack? Is there a way to do a checksum either after the fact or from inside the app itself? Pointwise limit of continuous functions not Riemann integrable How do I remove a configuration object from the active configuration? I'm writing a custom module for Drupal 8. It defines a field storage configuration object, in a file called modules/mymod/config/install/field.storage.bloom_stem.bs_twitter_ac.yml.  The problem is that this is not removed when I uninstall the module; it is apparently left behind because, when I re-install the module, I get a crash.   drush -y pm-uninstall mymod drush cr drush -y en mymod      exception 'Drupal\Core\Config\PreExistingConfigException' with message 'Configuration objects (field.storage.bloom_stem.bs_twitter_ac) provided by mymod already exist in active configuration'   So it seems I need to some how manually remove this configuration object. Do I need to provide some more code that deletes it when the module is uninstalled? How does the "tail" command's "-f" parameter work? $ tail -f testfile   the command is supposed to show the latest entries in the specified file, in real-time right? But that's not happening. Please correct me, if what I intend it to do is wrong...  I created a new file "aaa" and added a line of text and closed it. then issued this command (first line):  $ tail -f aaa xxx xxa axx   the last three lines are the contents of the file aaa. Now that the command is still running (since I used -f), I opened the file aaa via the GUI and started adding a few more lines manually. But the terminal doesn't show the new lines added in the file.  What's wrong here? The tail -f command only shows new entries if they are written by system only? (like log files etc) Is there a possibility of using REST Assured library for testing SOAP webservices? I have a bunch of Test Suites in SOAP UI and I need to check if there is possibility of using REST Assured. Can anyone suggest if this is possible? Many thanks for any comments. I have a time series that shows a nonstationary seasonal autoregressive component as well as known heteroshedasticity. In order to model the series, I have fit a seasonal ARIMA model for the mean with the auto.arima model in the forecast package in R and a GARCH model on the residuals of the ARIMA model.   Is the procedure of sequentially estimating ARIMA and GARCH model correct or would it have been better to jointly model the mean and the variance of the series? If this were correct, is there a (possibly R) function to do it? What is the difference between test set and validation set? I found this confusing when I use the neural network toolbox in Matlab. It divided the raw data set into three parts:   training set validation set test set   I notice in many training or learning algorithm, the data is often divided into 2 parts, the training set and the test set.  My questions are:   what is the difference between validation set and test set?  Is the validation set really specific to neural network? Or it is optional. To go further, is there a difference between validation and testing in context of machine learning? How to disable touchscreen permanently on ubuntu 18.04 How can I disable the Windows key from opening the Activities overview? How can I disable the Windows key (or Super) from showing the GNOME Shell Activities overlay?