Options are:  A. $20$ B. $12$ C. $12.5$ D. $13.3$  And steps to  calculate would be appreciated.  Edit: Apologies for having repeated the same question here.
If $a, b$ are positive real numbers and $a+b = 1$, prove that :  $$\left(a+\frac{1}{a}\right)^2 + \left(b+\frac{1}{b}\right)^2 \geq \frac{25}{2}$$  I can see that the value $\frac{25}2$ is attained for $a=b=\frac12$. But I do not know how to show that this is the minimal possible value.  Thank you.
Why cannot fermions have non-zero vacuum expectation value? In quantum field theory, scalar can take non-zero vacuum expectation value (vev). And this way they break symmetry of the Lagrangian. Now my question is what will happen if the fermions in the theory take non-zero vacuum expectation value? What forbids fermions to take vevs? making low-quality PDF files clearer Some research papers available on the web have low-quality outputs. For example, see . It seems that it was converted from a PS file and typeset in (La)TeX. However, it has all the font information. Is there any way to make the PDF file clearer? How to connect an LED indicator to a circuit? I would like to know how can i add a safety switch with an LED indicator to a circuit , so that if the safety switch is on then the LED lights , and when i want to use the device , all what i have to do is to press the normally-open switch.   I have attached this schematic and im not sure if it will work correctly  ,as i am a very beginner in electronics   Thanks What are the rules of parallelism? I've been reading a lot about it since yesterday and all I encounter is "They must have the same grammatical form"? What does this exactly mean?  I know how to make parallel sentences with gerunds. The things get trickier when it comes to using modifiers.  For example:     I love using the phone that you bought me and the computer.   On the left side of the conjunction there is a noun phrase that consists of an article + noun + another modifier and on the right side there is an article + noun.  They are both noun phrases but the first one has additional modifier. Is that still considered a parallel sentence?  Another example:     I like to swim and to feel good.   Here on the right side of the conjunction there is an infinitive and on the left side there is an infinitive + complement? Is that parallel? Play a Sound with Python Sign of Estimate (Coefficient) of Interaction Terms I create a linear regression model with interaction term in the model say: $$y=a_0+a_1x_1+a_2x_2+a_3x_1*x_2+e$$ where $x_1$ is continuous and $x_2$ is binary. Now, I have couple of questions:   If $x_1$ and $x_2$ both are significant and have positive coefficients, that means that if $x_1$ and $x_2$ increase, then $y$ increases. What can I say if $x_1*x_2$ is statistically insignificant? Does it mean that increase in. Does it mean that for $x_2=1$, the effect of $x_1$ on $y$ is not changed, i.e. increase in $x_1$ still leads to increase in $y$? What if the interaction is statistically significant? What can I say if the interaction term is statistically insignificant and negative? Does it indicate that if $x_2=1$, increase in $x_1$ actually leads to decrease in $y$?   Thanks. Remove Meta Privilege for MSE (only) What I am asking here is to please remove the privilege to participate in Meta for MSE.  This privilege is literally useless. You can't really have a meta site for a meta site. There's no Meta.Meta.SE here or any other SE site out there: Meta.SE covers for every site in SE, including itself.     When users find out that you don't really get anything new, it's kinda sad for those people. There is no use for it except just to be there and fill up the space between the first and third privilege. Privileges should be shown only if you earn something new, and this privilege to participate in the meta isn't new because it's where you report problems in all of SE, including Meta.SE.    So please remove the privilege to participate in meta just for Meta.SE.    This is not a dupe as this is a feature-request to remove it, not support on why it is there. Is there a bulletproof way to know a file has been successfully decrypted? I am wondering whether there is a bulletproof way to know if one is successful in decrypting a file.   As an example, say I encrypt a text file and protect it with a 3 letter password. I use brute force to decrypt it, but two different passwords lead to a file that contains English intelligible text. Is there a way for me to know which one is the original one? In other words, is there an infallible way to know I've entered the password correctly? Non-standard signature of main() compiles successfully When has Wonder Woman died? I know Wonder Woman has died in canon before, but in which issue did this happen? Suppose $G$ is a finite group and I know for every $k \leq |G|$ that exactly $n_k$ elements in $G$ have order $k$. Do I know what the group is? Is there a counterexample where two groups $G$ and $H$ have the same number of elements for each order, but $G$ is not isomorphic to $H$? I suspect that there is, but I haven't thought of one. Do any (non-hardware) RNGs exist which could be used to create an OTP for crypto purposes? How do I change the default file manager back to Nautilus? A while back, I set my default file manager to Nemo. I like it a lot, but it constantly crashes. I remember editing a text file to set it as default, but I forgot which file it was. How do I switch back to the Nautilus file manager? Disabling Intel Turbo Boost in ubuntu It's the first time I'm using Tikz on Latex. I have to draw this block diagram (this is a low resolution snip from a paper)   In Tikz I have done this:   That is very similar but I need some adjustments, like the u_i arrow and the node sum after the H(s) block.  Is there anybody that can help me with this?  my code:      \tikzstyle{block} = [draw, fill=white, rectangle,  minimum height=2em, minimum width=3em] \tikzstyle{sum} = [draw, fill=white, circle, radius=1mm, node distance=1.5cm] \tikzstyle{input} = [coordinate] \tikzstyle{output} = [coordinate] \tikzstyle{pinstyle} = [pin edge={to-,thin,black}]  \begin{tikzpicture}[auto, node distance=2cm,&gt;=latex'] \node [input, name=input] {}; \node [input, above of=input](input1) {}; \node [sum, right of=input] (sum) {}; \node [block, right of=sum] (controller) {$K(s)$}; \node [sum, right of=controller] (sum1) {}; \node [block, right of=sum1] (filterinv) {$H^{-1}(s)$}; \node [block, right of=filterinv] (system) {$G(s)$}; \node [output, right of=system] (output) {}; \node [output, above of=output] (output1) {}; \node [block, below of=filterinv] (filter) {$H(s)$}; \node [block, above of=controller] (delay) {$D(s)$}; \node [sum, below of=sum1] (sum2) {};  \draw [-&gt;] (filterinv) -- node[name=u] {$u_{i}$} (system); \draw [draw,-&gt;] (input) -- node {$s_{i-1}$} (sum); \draw [-&gt;] (sum) -- node {$e_{i}$} (controller); \draw [-&gt;] (system) -- node [name=q] {$q_{i}$}(output); \draw [-&gt;] (q) |- (filter); \draw [-&gt;] (filter) -- node {} (sum2); \draw [-&gt;] (controller) -- node {} (sum1); \draw [-&gt;] (sum1) -- node[name=xi] {$\xi_{i}$} (filterinv); \node [input, below of=sum1](input2) {}; \draw [draw,-&gt;] (input2) -- node {$r_{i}$} (sum2); \draw [-&gt;] (sum2) -| node[pos=0.99] {$-$}      node [near end] {$\tilde{s}_i$} (sum); \draw [-&gt;] (delay) -| node[] {}      node [near end] {} (sum1); \draw [draw,-&gt;] (input1) -- node[pos=0.15] {$u_{i-1}$} (delay); \draw [-&gt;] (u) |- node[pos=0.99] {$u_i$}      node [near end] {} (output1);  \end{tikzpicture} I don't know the command to set our spawn in Minecraft 1.12.1.  Is it /set spawn? I honestly can't figure it out. Thanks! I recall :    It was one that I knew could use a bit more spit and polish, but I didn't have the inclination or energy to edit it myself, so I skipped it.  I wander my way over to  (10K only), and look at the listing...    ...so, when did I approve this again? I skipped the question; that doesn't mean I gave my tacit approval, does it?  Seems like the dashboard needs to agree with the suggested edits view. Find all functions $f:\mathbb{N_{0}} \rightarrow \mathbb{N_{0}}$ satisfying the equation $f(f(n))+f(n)=2n+3k,$ for all &amp; $n\in \mathbb{N_{0}}$, where $k$ is a fixed natural number.  A friend of mine suggested me to use recurrence relation. While it is unfortunate that I have problems understanding recurrence relation. Please refer information to understand difference equation, homogeneous equation &amp; auxillary equation.  Thanks in advance! Kindly don't down vote for not showing my attempt. I am seriously not able to understand the question and the process suggested to use. How can I enable "clicklock"? I need a non trivial  examples of group isomorphism that maps $G\to H$ such that   $G/H \cong G$.