Term for words like "Hanky-Panky"
crisscross, dillydally, riffraff, etc
I'm asking about someone who's employed by a company and does different jobs (both a qualified and unqualified person). Who knows; maybe in English those two are two different words? What are they called in English?  All I know is a navvy but that usually means physical work.  Let me just try a few things here. These are just wild guesses, nothing more.    odd job man/worker   shiftman   (unskilled) labourer I know and understand the mean value theorem. But at the moment I don't have the intuition to understand the generalized mean value theorem     If $f$ and $g$ are continuous on the closed interval $[a,b]$ and differentiable on the open interval $(a,b)$, then there exists a point $c\in(a,b)$ where$$[f(b)-f(a)]g'(c)=[g(b)-g(a)]f'(c).$$If $g'$ is never zero on $(a,b)$, then the conclusion can be stated as$$\frac{f'(c)}{g'(c)}=\frac{f(b)-f(a)}{g(b)-g(a)}.$$   What is the intuition? And how can you prove this (generally) ? Why would a company like Apple be buying back its own shares? What is the reason that a company like AAPL is buying back its own shares? Does it have too much cash and it doesn't know what to do with it? So it is returning the cash back to investors? Case insensitive searching in Oracle How can I resize an ext root partition at runtime? How can I increase the size of the root partition of a system at runtime?   I have a partition that is not allocated after the root partition (which is also ext4), how can I add that unallocated space to the space allocated to the root partition without having to shutdown the server? Is it possible to have a 100% secure virtual private server? Does time stretch all the way back for infinity or was there a point when time appears to start in the universe?  I remember reading long ago somewhere that according to one theory time began shortly before the creation of the universe.  Does time have a starting point of note? Polynomial bounded real part of an entire function Let $f(z)$ be an entire function whose real part is bounded by a polynomial in $|z|$. Does it follow that $f(z)$ is a polynomial?  Or, without loss of generality and more suggestively $$(f(z)=\sum_{k=0}^\infty a_k z^k \quad \land \quad \operatorname{Re}(f(z))\leq |z|^n)\quad \forall z\in \mathbb{C} \qquad \Rightarrow \qquad f(z)=\sum_{k=0}^n a_k z^k \quad\forall z\in \mathbb{C}$$ rake db:migrate doesn't seem to work in production How can I utilize the whole terminal, like htop or emacs do? I want to write a program that can "draw" in the terminal the same way as htop or emacs. By that I mean "get rid of the prompt and make the output dependent on the current size of the terminal".   To make this a bit more clear:   I want to use the terminal this way:     in stead of this way: What is the relative speed of two near-light speed particles headed towards each other? I understand that nothing can move faster than light due to time dilation. I want to build upon my understanding of Einstein's theory of Special Relativity, so I came up with this hypothetical problem for myself:  If both particles are moving at 0.9c towards each other (according to an observer on Earth), what speed does each particle have relative to the other?  I'm stumped since I am only familiar with Newtonian classical mechanics to solve this (which would be wrong). I am aware of Lorentz' factor $\gamma =\frac{1}{\sqrt{1 - \frac{v^2}{c^2}}}$ and the time dilation equation $t_m = \frac{t_o}{\sqrt{1 - \frac{v^2}{c^2}}}$, but I'm not sure how to apply it in this instance. I'm just looking for a gentle push in the right direction. Edit: My prior research:  This article, ,  talks about the effect of a baseball thrown at 0.9c would have as it traveled towards a batter. This is not what I'm looking for since it doesn't explain the math behind finding the collision speed between two high velocity entities.  This question on Yahoo, , asks a similar question to mine, but no math is involved to demonstrate the calculations behind the reasoning.  This question on Physics.SE, , does not answer my question either. I have not been able to find a similar Physics.SE question which can provide me to clues to my own hypothetical question.  I have also Googled the following phrases:    i. &quot;collision faster than the speed of light&quot; ii. &quot;collision of high speed particles&quot; iii. &quot;lorentz transformation in a collision&quot; iv. &quot;collision analysis at light speed&quot; Check server activity with code I would like to see the activity on of the SQL server. So I can run a query when the server load is low. I know there is an activity monitor in SQL server but my company doesn't want me to give the rights to use this tool. Apparently you can kill other people queries and this is too dangerous.  Is there a way to check the status of the server with code? (Or view the activity without needing those rights so I can manually run them?) Since I upgraded to the latest version of Ubuntu, I cannot install the Java OpenJDK package needed to compile Android custom ROMs. When I run sudo apt-get install openjdk-7-jdk, the following error appears:  Reading package lists... Done Building dependency tree        Reading state information... Done Some packages could not be installed. This may mean that you have requested an impossible situation or if you are using the unstable distribution that some required packages have not yet been created or been moved out of Incoming. The following information may help to resolve the situation:  The following packages have unmet dependencies:  openjdk-7-jdk :  Depends: openjdk-7-jre (= 7u51-2.4.6-1ubuntu4) E: Unable to correct  problems, you have held broken packages.   How do I fix this problem? In how many different ways can you split $10$ people into two groups with the same amount of people?  My attempt: Since the order in which you choose someone doesn't matter, I chose to calculate the combinations: $10 \choose 5$ This is just a curiosity. I have come across multiple proofs of the fact that there are infinitely many primes, some of them were quite trivial, but some others were really, really fancy. I'll show you what proofs I have and I'd like to know more because I think it's cool to see that something can be proved in so many different ways.  Proof 1 : Euclid's. If there are finitely many primes then $p_1 p_2 ... p_n + 1$ is coprime to all of these guys. This is the basic idea in most proofs : generate a number coprime to all previous primes.  Proof 2 : Consider the sequence $a_n = 2^{2^n} + 1$. We have that  $$ 2^{2^n}-1 = (2^{2^1} - 1) \prod_{m=1}^{n-1} (2^{2^m}+1), $$  so that for $m &lt; n$, $(2^{2^m} + 1, 2^{2^n} + 1) \, | \, (2^{2^n}-1, 2^{2^n} +1) = 1$. Since we have an infinite sequence of numbers coprime in pairs, at least one prime number must divide each one of them and they are all distinct primes, thus giving an infinity of them.  Proof 3 : (Note : I particularly like this one.) Define a topology on $\mathbb Z$ in the following way : a set $\mathscr N$ of integers is said to be open if for every $n \in \mathscr N$ there is an arithmetic progression $\mathscr A$ such that $n \in \mathscr A \subseteq \mathscr N$. This can easily be proven to define a topology on $\mathbb Z$. Note that under this topology arithmetic progressions are open and closed. Supposing there are finitely many primes, notice that this means that the set $$ \mathscr U \,\,\,\, \overset{def}{=} \,\,\, \bigcup_{p} \,\, p \mathbb Z $$ should be open and closed, but by the fundamental theorem of arithmetic, its complement in $\mathbb Z$ is the set $\{ -1, 1 \}$, which is not open, thus giving a contradiction.   Proof 4 : Let $a,b$ be coprime integers and $c &gt; 0$. There exists $x$ such that $(a+bx, c) = 1$. To see this, choose $x$ such that $a+bx \not\equiv 0 \, \mathrm{mod}$ $p_i$ for all primes $p_i$ dividing $c$. If $a \equiv 0 \, \mathrm{mod}$ $p_i$, since $a$ and $b$ are coprime, $b$ has an inverse mod $p_i$, call it $\overline{b}$. Choosing $x \equiv \overline{b} \, \mathrm{mod}$ $p_i$, you are done. If $a \not\equiv 0 \, \mathrm{mod}$ $p_i$, then choosing $x \equiv 0 \, \mathrm{mod}$ $p_i$ works fine. Find $x$ using the Chinese Remainder Theorem.   Now assuming there are finitely many primes, let $c$ be the product of all of them. Our construction generates an integer coprime to $c$, giving a contradiction to the fundamental theorem of arithmetic.  Proof 5 : Dirichlet's theorem on arithmetic progressions (just so that you not bring it up as an example...)  Do you have any other nice proofs? Automate fixes for issues found by Sonar Recursive function, if and which statements I can work. I could work. I will work. I would work. I shall work. I should work. iOS app crashes after deleting a comment A borderline between on-topic questions and questions about library recommendation? I have a consideration about new off-topic close reason:     Questions asking us to recommend a tool, library or favorite off-site   resource are off-topic for Stack Overflow as they tend to attract   opinionated answers and spam. Instead, describe the problem and what   has been done so far to solve it.   For example take that question:   It has a close vote with the reason above. But if it would be formed     How to zoom image in an absolute position div to the side?   The answer would be probably also a jQuery plugin or javascript library, but it would follow the patter of most questions about jQuery.  Take that question:   This is the good question about real-life problem. The answer is to use a maven plugin. It is correct, there's no need to reinvent the wheel or rediscover the America.   But  I'm afraid the off-topic text could be misleading and could be misused to close such a questions as that about maven simply because a tool, library or plugin is the answer.   Is it a new guideline that the questions such as cited above should be banned, no matter how they are formed (this would make most how-to-do-in-maven/jquery) questions illegal? Or the close reason should be changed to make more clear what the guidelines are (it's not clear to me now)?