Helicopters or dual/quadcopters stop rising after reaching some height from the ground. What causes that? And what one should do if he want to prevent this, if he want the helicopter to keep rising up?
Is there a reason why people can't just take the helicopter to mount Everest? Why is it that helicopters can't reach that high?
Is there a way to make bash more TAB friendly? I use bash on both my Mac and as my cygwin shell. Overall, I'm quite pleased with it.  My one complaint however is that its TAB completion isn't as good as Windows Command Line TAB completion.   For example, if there are two files with the same prefix, then bash just beeps at me when I try to TAB complete. If I keep nailing TAB, then it will eventually show me a list of potential files.  I definately prefer how Windows will cycle through potential files right on the command line.   Is there a way to get bash to operate similar to Windows Command Line in this regard?  If there isn't (I do not want to switch shells), am I missing something about TAB completion in bash? Is there a more efficient way to use it? Bibliographies from multiple .bib files I would like to use multiple .bib files for my article, such as file1.bib, file2.bib. However, I would like my references not to be separated (such as &quot;Primary sources&quot;, &quot;Secondary sources&quot;, etc.). These bibliographies just need to be merged into one. One way to do this is to copy-paste these .bib files into one .bib file, and this would solve the problem. However, I would like to keep it split into several .bib files, by topic (file1.bib contains articles on topic1, file2.bib contains articles on topic2, and so on). I tried to do \bibliographystyle{alpha}  \bibliography{file1} \bibliography{file2}  but this just gives me the same bibliography twice! Does a bad grade in one course (with otherwise OK record) affect graduate admissions? What are the applications of the ## preprocessor operator and gotchas to consider? As mentioned in many of my previous questions, I'm working through K&amp;R, and am currently into the preprocessor. One of the more interesting things &mdash; something I never knew before from any of my prior attempts to learn C &mdash; is the ## preprocessor operator. According to K&amp;R:     The preprocessor operator ##   provides a way to concatenate actual   arguments during macro expansion. If a   parameter in the replacement text is   adjacent to a ##, the parameter is   replaced by the actual argument, the   ## and surrounding white space are   removed, and the result is re-scanned.   For example, the macro paste   concatenates its two arguments:      #define  paste(front, back)  front ## back      so paste(name, 1) creates the token   name1.   How and why would someone use this in the real world? What are practical examples of its use, and are there gotchas to consider? How can I hide my code in visualforce page? Recursive glob? I'd like to write something like this:  $ ls **.py   in order to get all .py filenames, recursively walking a directory hierarchy.  Even if there are .py files to find, the shell (bash) gives this output:  ls: cannot access **.py: No such file or directory   Any way to do what I want?  EDIT: I'd like to specify that I'm not interested in the specific case of ls, but the question is about the glob syntax. Ubuntu installation is slow, why? I am currently installing Ubuntu 12.04.3. Everything was going fine until I came across this...     Installing System   It is sssooooooo close to being finished! Like 1/6 of the way there! I just wanted to know if this is normal or if something is wrong. I'm installing it through a flash drive if that helps   Also,what will happen if I press the skip button that pops up when I click Installing System? How big is my single pattern in Photoshop I pulled a repeating pattern from someone else's PSD. Is there a way to figure out the size of the original pattern? I need to create an image with only one tile. Is it ethical to use a textbook required for a class that was easily found online? Calculating the limit $\lim((n!)^{1/n})$ Find $\lim_{n\to\infty} ((n!)^{1/n})$. The question seemed rather simple at first, and then I realized I was not sure how to properly deal with this at all. My attempt: take the logarithm,  $$\lim_{n\to\infty} \ln((n!)^{1/n}) =  \lim_{n\to\infty} (1/n)\ln(n!) =  \lim_{n\to\infty} (\ln(n!)/n)$$ Applying L'hopital's rule:  $$\lim_{n\to\infty} [n! (-\gamma + \sum(1/k))]/n! = \lim_{n\to\infty} (-\gamma + \sum(1/k))=  \lim_{n\to\infty} (-(\lim(\sum(1/k) - \ln(n)) + \sum(1/k))  = \lim_{n\to\infty} (\ln(n) + \sum(1/k)-\sum(1/k)  = \lim_{n\to\infty} (\ln(n))$$ I proceeded to expand the $\ln(n)$ out into Maclaurin form $$\lim_{n\to\infty} (n + (n^2/2)+...) = \infty$$ Since I $\ln$'ed in the beginning, I proceeded to e the infinity  $$= e^\infty  = \infty$$  So am I write in how I approached this or am I just not on the right track? I know it diverges, I was just wanted to try my best to explicitly show it. creating a diagonal matrix with a variable amount of parameters the least possible value for :$ \lfloor \frac{a+b}{c}\rfloor +\lfloor \frac{b+c}{a} \rfloor+\lfloor \frac{c+a}{b} \rfloor $ If we know that for every $a,b,c&gt;0$ ,how we can find  the least possible value for :  $$ \lfloor \frac{a+b}{c}\rfloor +\lfloor \frac{b+c}{a} \rfloor+\lfloor \frac{c+a}{b} \rfloor $$ This inequality $a+b^2+c^3+d^4\ge \frac{1}{a}+\frac{1}{b^2}+\frac{1}{c^3}+\frac{1}{d^4}$ let $0&lt;a\le b\le c\le d$, and such $abcd=1$,show that   $$a+b^2+c^3+d^4\ge \dfrac{1}{a}+\dfrac{1}{b^2}+\dfrac{1}{c^3}+\dfrac{1}{d^4}$$   it seems harder than I'm trying to run multiple Nodejs applications on Nginx server running on CentOS 7. I noticed that when I run a Nodejs app on some ports I get an 502 Bad Gateway error in the browser so I checked the error logs:  [notice] 12806#0: signal process started [crit] 12807#0: *13 connect() to 127.0.0.1:7777 failed (13: Permission denied) while connecting to upstream, client: **.**.99.58, server: myapp.com, request: "GET / HTTP/1.1", upstream: "http://127.0.0.1:7777/", host: "myapp.com" [crit] 12807#0: *13 connect() to [::1]:7777 failed (13: Permission denied) while connecting to upstream, client: **.**.99.58, server: myapp.com, request: "GET / HTTP/1.1", upstream: "http://[::1]:7777/", host: "myapp.com"   when I change the app to listen to 8008 for example everything is working fine. I checked permissions and if the process is running as root and everything seems ok. I played with the timeouts as well but no result. Can anyone help? identity element of $(D_n ,\gcd)$ I am starting to learn some Regex, therefore I use this command repeatedly:  grep pattern /usr/share/dict/american-english    Only the part with pattern changes, so I have to write the long expression "/usr/share/dict/american-english" again and again.   Someone made the remark that it is possible to expand an argument of a command from the command history by typing cryptic character combinations instead of the full expression.  Could you tell me those cryptic character combinations ? According to two questions  and  asked on this site earlier there exists a nice relation:  $$\frac1{n!} \left(\int_{0}^t\mathrm dt \; f(t)\right)^n = \int_{0}^t\mathrm dt_1 \int_{0}^{t_1}\mathrm dt_2 \cdots \int_{0}^{t_{n-1}}\mathrm dt_n\; f(t_1)\,f(t_2) \ldots f(t_n). $$  Unfrotunatly I am more interested in integrals of the form  $$\int_{0}^t\mathrm dt_1 \int_{0}^{t_1}\mathrm dt_2 \cdots \int_{0}^{t_{n-1}}\mathrm dt_n\; f(t_n). $$  Can it be somehow brought to an unary integral?  All I have figured out by now is that  $$\int_{0}^t\mathrm dt_1 \int_{0}^{t_1}\mathrm dt_2 \cdots \int_{0}^{t_{n-1}}\mathrm dt_n\; t_n^m = \frac{m!}{(m+n)!} t^{m+n} .$$ Upgrade to version newer than repositories I have  about how to upgrade ghostscript to a version that is available on 15.04 but not on 14.04LTS (which I have). On this site there are numerous almost identical question regarding different packages, a few examples include:         So I thought it would be very useful in general to know: is there  a general, automated way to upgrade a package, including all its dependencies, to a version that is newer than Ubuntu's repos? Is this more easily done if the newer version exists in more recent Ubuntu releases? The Download CSV link seems broken in SEDE query result window I've created   which works nice. I would really like to download those results as an CSV file. Therefor I click on the provided link on the right hand side of the screen called Download CSV. The result is:  The webpage cannot be found  https://data.stackexchange.com/stackoverflow/csv/202355?UserId=187606 I expected: A file in CSV format. It looks like a regression of  Queries without a parameter work as advertised. Can this be fixed? Is it acceptable to change the vid column of a term programmatically in the database?