Is there an idiom/ phrase/ expression or proverb that conveys this meaning:  "As long as there is a more simple solution for solving a problem don't choose a more complicated one." or: "when you can do something in a more simple way, why do you use a  more difficult way?"  we  use this proverb in Farsi:     "When you can open a knot with your hands, you don't have to open it with your teeth!"   Suppose that there are some different ways for solving a problem (and all of them will work),  if you choose the most complicated solution among those available ways, instead of trying the more simple ones at first, you'll be criticized by being told this proverb. (It doesn't necessarily mean that your making the problem bigger, it just mean that you postpone solving the problem by using that complicated available solution).  You can use this proverb specially in political issues, for example; as long as negotiation can work, there in no need to use military actions.  Edit( sep 25th):  I just found this proverb: "Cross the stream where it is shallowest."  Do you think that it could be the answer to my question?
So I know I've heard this saying in American English before but I just can't quite find the original.  I have come up with several made up variations like:   I don't send the Navy (or whole army, or a battalion) when all you need is a diplomat. Don't buy the whole cow when all you need is milk.   What's the more commonly heard saying/phrase for this of expression?
Abount linear functional: If $T(B)$ is bounded, is $T$ bounded? Let $H$ be a infinite dimensional Hilbert space and let $B$ be a basis of $H$ that $H=\overline{span(B)}$  moreover, let $T : H \rightarrow K$ be a linear functional   If $T(B)$ is bounded, is $T$ bounded? How can I set the drawableRight resource via code? How to check the count of .txt files in a folder (dir command)? How can use dir command to check how many .txt files there are in a folder (for example,  C:\Temp\)? Why does the weighing balance restore when tilted and released I'm talking about a Weighing Balance shown in the figure:    Press &amp; Hold on onside of the horizontal beam and then release it. It makes some oscillations and comes back to equilibrium like shown in the figure.  Both the pans are of equal equal masses. When the horizontal beam is tilted by an angle using external force, the torque due to these pan weights are equal in magnitude &amp; opposite in direction. Then why does it come back to it position? What's making it to come back? What is the correct way to install proprietary ATI Catalyst Video Drivers (fglrx) directly from AMD? I am planning on doing a fresh install of Ubuntu and want to know what is the correct way to install ATI Catalyst Video Driver?      There are multiple valid answers for this question spanning over several versions of Ubuntu. For your convenience an index of each below: Buffering GeoJSON file using Python? In a few large projects i have been working on lately it seems to become increasingly important to choose one or the other (XML or Annotation). As projects grow, consistency is very important for maintainability.   My questions are: what are the advantages of XML-based configuration over Annotation-based configuration and what are the advantages of Annotation-based configuration over XML-based configuration? Mounting /cow on root failed: Invalid argument overlay mount failed I am using an xps 13 9365, which was data wiped from bios by a friend who then gave it to me thinking it was dead. I tried booting with a USB (current LTS distro (18.04 or similar)) boot disk and got into the language selection / setup menu. By using the F6 option I selected noapic. In bios sata is set to raid and legacy the secure boot option is off.   But when I try to install I get kicked into a tiny font window with the following message  (initramfs) mount: Mounting /cow on root failed: Invalid argument overlay mount failed  Any ideas? C# Compiler should give warning but doesn't? How to open a PDF file from terminal? I used to work on the Mac terminal before and I used:   open file2open.pdf   and the PDF file would be opened on preview or whatever my default viewer was. When I use it in the terminal in Ubuntu I get this error message:   Couldn't get a file descriptor referring to the console Baby Rudin Theorem 1.20 (b) Proof I have a question about Rudin's proof of Theorem 1.20 (b) in his book Principles of Mathematical Analysis.  Theorem 1.20 is stated as follows:     (a) If $x\in R, y\in R$, and $x&gt;0$, then there is a positive integer $n$ such that $$nx&gt;y.$$   (b) If $x\in R, y\in R$, and $x&lt;y$, then there exists a $p\in Q$ such that $x&lt;p&lt;y$.     I understand Rudin's proof of (a).  The beginning of Rudin's proof of (b) is given below:     Since $x&lt;y$, we have $y-x&gt;0$, and (a) furnishes a positive integer $n$ such that $$n(y-x)&gt;1.$$  Apply (a) again, to obtain positive integers $m_1$ and $m_2$ such that $m_1&gt;nx$, $m_2&gt;-nx$.  Then $$-m_2&lt;nx&lt;m_1.$$  Hence there is an integer $m$ (with $-m_2\leq m\leq m_1$) such that $$m-1\leq nx&lt;m.$$   I don't understand the justification for this last sentence beginning "Hence...."  How is $m$ found, and why are $m_1$ and $m_2$ needed to find $m$? A term for when people insist on giving you help you didn't ask for? People love to tell other people what to do. It may not be control, so much as trying to help, especially when you've asked for help directly. However, there's a difference between answering someone's question and answering while piling on recommendations the person didn't ask about, and this is what I'm seeking a term for. Advertising and marketing feel similar to me in this vein. In the worst cases this can be overzealous religious followers professing your damnation if you don't follow with them (I think in Christianity they call it "witnessing"). Any which way, it comes across to me as a form of unsolicited advice: I didn't ask for it, so I don't want it; I want to stay focused.  Is there a better term for this than "unsolicited advice"? Also, is there a term for a person who exhibits this kind of behavior frequently? have already been created through .  have already completed their beta stage and are waiting for launch.  are in public beta stage.  are in commitment phase in   proposals are listed in   Now it is really confusing to find a suitable site to ask a question. As an example - I host a blog using . Now I have a question about this hosting. I want to post it in a . Where will I post? I have 2 options available now.     Are developers trying anything to solve this confusing matter? illustrates drag coefficients for several shapes:    It is generally accepted that some variation of the teardrop/airfoil shape has the lowest drag coefficient.  I was wondering what shape has the highest drag coefficient.  The image suggests that it is a flat plate, and that would seem to be an intuitively correct answer, but is that correct?  Is there some other shape (perhaps with a concave front or back relative to motion) that has an even higher drag coefficient? How can I efficiently drive an LED? I understand that I can not connect an LED directly to a battery because it will draw too much current. Thus, there must be something else in the circuit to limit the current. What options are there? Are some methods more efficient than others? Sum of two squares modulo p I have heard somewhere that for all primes $p$, for all $k$, there exist $x, y$ s.t. $x^2 + y^2\equiv k \pmod{p}$? I recall that the proof is very elementary, but I can't remember such a proof. How would one prove this? One way is to use Cauchy-Davenport, but I don't think that this is the simplest solution. Are token creatures considerd as a creature spell? Are token creatures considerd creature spells? For instince when I use  tap effect combined with  would it allow me to draw a card? Good math books for physicists In his first lesson (transcripted in "Tips on Physics"), Feynman talks about math for physicists in a very cool and practical way. And at the end of the section he talks something like "so the first thing to do is to learn to learn derivative, integral and algebra" (I don't know how much precise I'm being because I've read it in Portuguese). I would to know if there is some book that deals with math as Feynman did it in this lesson (respecting formalities, but teaching how to use the practical rules)? Also, someone have any recommendations for algebra book (college level)? The isomorphism $\mathbb{Z}[i]/(a+bi) \cong \Bbb Z/(a^2+b^2)\Bbb Z$ is , when the integers $a$ and $b$ are coprime. But what happens when they are not coprime, say $(a,b)=d&gt;1$?      — For instance if $p$ is prime (which is not coprime with $0$) then $$\mathbb{Z}[i]/(p) \cong \mathbb{F}_p[X]/(X^2+1) \cong \begin{cases} \mathbb{F}_{p^2} &amp;\text{if } p \equiv 3 \pmod 4\\ \mathbb{F}_{p} \times \mathbb{F}_{p} &amp;\text{if } p \equiv 1 \pmod 4 \end{cases}$$ (because $-1$ is a square mod $p$ iff $(-1)^{(p-1)/2}=1$).  — More generally, if $n=p_1^{r_1} \cdots p_m^{r_m} \in \Bbb N$, then  each pair of integers $p_j^{r_j}$ are coprime, so that by CRT we get $$\mathbb{Z}[i]/(n) \cong \mathbb{Z}[i]/(p_1^{r_1}) \times \cdots \times \mathbb{Z}[i]/(p_m^{r_m})$$  I was not sure how to find the structure of $\mathbb{Z}[i]/(p^{r}) \cong (\Bbb Z/p^r \Bbb Z)[X] \,/\, (X^2+1)$ when $p$ is prime and $r&gt;1$.  — Even more generally, in order to determine the structure of $\mathbb{Z}[i]/(a+bi)$ with $a+bi=d(x+iy)$ and $(x,y)=1$, we could try to use the CRT, provided that $d$ is coprime with $x+iy$ in $\Bbb Z[i]$. But this is not always true: for $d=13$ and $x+iy=2+3i$, we can't find Gauss integers $u$ and $v$ such that $du + (x+iy)v=1$, because this would mean that $(2+3i)[(2-3i)u+v]=1$, i.e. $2+3i$ is a unit in $\Bbb Z[i]$ which is not because its norm is $13 \neq ±1$.  — I was not able to go further. I recall that my general question is to known what $\mathbb{Z}[i]/(a+bi)$ is isomorphic to, when $a$ and $b$ are integers which are not coprime (for instance $a=p^r,b=0$ or $d=(a,b) = a^2+b^2&gt;1$).  Thank you for your help! How to build Blender as a Python module? I have seen this question now many times and every question here and on other forum points to  experimental tutorial by . Now sadly a lot of answers are invalid right now because this central link is down. I couldn't find anything by Googling so if anybody has a fork of the tutorial or a second source that would be great? The link can't be gone for too long, I saw an answer with it 4 months ago.  The only other thing I have found is , but it also references the now missing tutorial. Any ideas how to find it?