Find the condition on a &amp; b so that the two tangents drawn to the   parabola $y^2=4ax$ from a point are normals to the parabola $x^2=4by$   I tried finding the joint equation of tangents to the parabola $y^2=4ax$ like $SS_1=T^2$.Then I tried to apply the condition of normality to the joint pair of straight lines.But its becoming too huge.Please let me know if you can think of a shorter and more elegant method to prove $a^2&gt;8b^2$.Thanks.
Find the condition on $a$ and $b$ so that the two tangents drawn to the parabola $y^2=4ax$ from a point are normals to the parabola $x^2=4by.$  The required condition is $a^2&gt;8b^2$.I dont know how to prove it.I tried.  Let $(h,k)$ be the point from where tangents are drawn to the parabola $y^2=4ax$.Let $m_1,m_2$ be the slopes of the tangents.Equations of tangents are $y=m_1x+\frac{a}{m_1}$ and $y=m_2x+\frac{a}{m_2}$ and equations of normal to the parabola $x^2=4by$ is $y=m_1x-2bm_1-bm^3_1$ and $y=m_2x-2bm_2-bm^3_2$.  As $y=m_1x+\frac{a}{m_1}$ and $y=m_1x-2bm_1-bm^3_1$  are the same lines.Therefore,$\frac{a}{m_1}=-2bm_1-bm^3_1$  $bm^4+2bm^2+a=0$  And I am stuck.I cannot get the desired condition.Please help me.
What is the difference between: Rooting, Jailbreak, ROM, Mod, etc.? Fred and George Weasley are known for their trouble-making and general &quot;solemnly swearing they are up to no good&quot;. Their antics/adventures give something to smile about and show us not all wizards are as serious as Professor McGonagall and Hermione. This gives them a reputation of being less intelligent and indeed they only achieved three OWLs. However, we also see the twins have quite a brilliant side! Being able to open and successfully run a shop in Diagon Alley without having completed their Hogwarts education is no easy take (IMO, anyway). Their creations helped students get out of class, our heroes out of tight spot, and even stop our enemies execute an evil plot. Ginny may have said it best:  &quot;We’ve been hearing explosions out of their room for ages, but we never thought they were actually making things,&quot; said Ginny. &quot;We thought they just liked the noise.&quot; Harry Potter and the Goblet of Fire  Do we know how many things Fred and George invented? Copy all files created after a specific hour in command line (Windows)? I would like to easily copy a batch of files from one very big directory to another based on the hour of creation (every hour i want to copy the files from last hour).  I have used Xcopy /D function but you can only put the date but not the hour.  Is there another command?  the directory is really big and it's very long to test each file for it's creation date in a Script. Xcopy is great but lacks the hour. Is it possible to get rid of the bullets in the miniframes outer theme Isomorphism equivalence implies fundamental group is abelian What are good methodologies for creating sprocs that reduce the pain of debugging? And what tools are out there for debugging stored procedures?  Perhaps most importantly, what are indications to look out for that errors are happening in a sproc and not in the code? I hope I'm not all over the board too terribly bad here. Votes for answers to any of the above. Thanks.  For what it's worth, I work in a .NET environment, SQL servers. Today, on C.SE, I reviewed some 'Late Answers' and First Posts.  I was not even near my daily vote limit.  And yet, I was given a message that said      comments disabled on deleted / locked posts / reviews   It seems I was not the only one either:   The workaround, of course, was simply to go back and provide the guidance - but was this a design or a bug?  If it is design, why would you want to discourage the feedback? Especially with first posts, there is often a high percentage of 'didn't read the FAQ' usage, which can best be addressed by gently providing guidance. (e.g. "Unfortunately, this doesn't answer the question" or "This reads like a comment" or "This really isn't on-topic here - can I suggest you checkout our [faq]" etc...)  Timely first post guidance goes a long way towards making good users.   If it was a bug, was other functionality silently rolled out? Jet stream of water I would like to simulate a stream of water like the one in the picture, but I don't know how to simulate the fast-moving, white water. Should I use particles to simulate foam or is it much better to concentrate in the material properties? Thanks How to run shell script via terminal The importance of a factor depends on how importance is defined.   The word importance has a fuzzy nature open to different   interpretations and the importance of a factor depends on how   importance is defined.      In other words, importance is ...   How can I complete this sentence with one word?   Edit:  I prefer to use a neutral word without negative connotations, since I'm not against having different interpretations in this case. Rather, I mean depending on how importance is defined, we need a different method. Why is TV remote's infrared wave shown by a camera as purple light, why not red or something else? Case-insensitive string comparison in C++ Hyphenation of words containing slash How can I tell LaTeX to automatically split up the german word  Kontrast/Rausch-Verhältnis    into   Kontrast/Rausch-|Ver|hält|nis   LaTeX complains that "/" is not a letter. "What kind of a person" vs. "what kind of person" I often hear people saying what kind of [singular noun] rather than what kind of a [singular noun].  Are we not supposed to use an article (a) before noun? Say you take a dice and you roll it twice so that you have a pair (X,Y) where X represents the first roll, Y represents the second.   When you have a distribution like max(X,Y), what type of distribution is that? It's not uniform, obviously, because the outcomes of max(X,Y) are clearly more favorable towards the higher numbers. I'm being asked to "describe" the distribution. I know that we can look at each distinct outcome, like:  max(1,1) = 1  max(1,2) = 2  max(1,3) = 3  max(1,4) = 4  max(1,5) = 5  max(1,6) = 6  max(2,1) = 2  max(2,2) = 2  max(2,3) = 3  max(2,4) = 4  max(2,5) = 5  max(2,6) = 6  max(3,1) = 3  max(3,2) = 3  max(3,3) = 3  max(3,4) = 4  max(3,5) = 5  max(3,6) = 6  max(4,1) = 4  max(4,2) = 4  max(4,3) = 4  max(4,4) = 4  max(4,5) = 5  max(4,6) = 6  max(5,1) = 5  max(5,2) = 5  max(5,3) = 5  max(5,4) = 5  max(5,5) = 5  max(5,6) = 6  max(6,1) = 6  max(6,2) = 6  max(6,3) = 6  max(6,4) = 6  max(6,5) = 6  max(6,6) = 6  But is that the most effective way to look at a distribution like this? Is there a faster and more concise way to describe this distribution other than saying the probability of each outcome?  i.e.,  P(max = 1) = 1/36  P(max = 2) = 3/36 = 1/12  P(max = 3) = 5/36  P(max = 4) = 7/36  P(max = 5) = 9/36 = 1/4  P(max = 6) = 11/36  So, obviously, I understand how to LOOK at a discrete distribution and see what the probabilities are, but not until I look at each possible outcome. But what does it mean to "describe" a distribution? This isn't uniform or any sort of discrete distribution we're taught. Can someone provide clarity? iOS Calendar Access Permission Dialog, force it to appear? Normal ordering of the commutator between annihilation and creation operator According to the commutation relation of annihilation and creation operators,   $$[a,a^{\dagger}]=1. \tag{1}$$   I would like to calculate the vacuum expectation value of the normal order of this commutator. We claim that since this commutator is just a c-number, then there is no effect from the normal ordering. We therefore get   $$\langle 0|(:[a,a ^\dagger]:)|0 \rangle=1. \tag{2}$$  However, if we expand the commutator first and do normal order later, we will get something like   $$\langle0|(:[a,a^\dagger]:)|0\rangle=\langle0|(:aa^\dagger-a^\dagger a:)|0\rangle=\langle0|(a^\dagger a-a^\dagger a)|0\rangle=0.\tag{3}$$ Which is contradicting with itself. Another homework problem from my Group Theory class.  Let $a,b$ be elements of a group, $G$.  Let $\operatorname{ord}(a)=m$ and $\operatorname{ord}(b)=n$. Let $a$ and $b$ commute. Prove: If $m$ and $n$ are relatively prime, then the $\operatorname{ord}(ab)=mn$.  So I am having trouble starting off on this problem.  Here is what I believe I know:  $a^m=e$ and $b^n=e$ [as defined by the order of the elements] which leads $a^m=b^n$  $\operatorname{ord}(ab)=mn=\operatorname{ord}(ba)=nm$ as defined by commuting.  $\gcd(m,n)=1$ as defined by $m,n$ being relatively prime.    I don't know how to start this proof. Do I want to to go the route of $a^mb^n=e$?  Then $(ab)^{mn}=e$?   Any tips to start this would be greatly appreciated!!! Enabling Nvidia driver messes up splash screen If $R_{1}$ and $R_{2}$ are relations on a set S with $R_{1};R_{2}=R_{2};R_{1}$. Then $R_{1}$ and $R_{2}$ are bijective maps For the surjectivity part, I showed that if $(a,b)\in I$ then $(a,c)\in R_{1}$ and $(c,b)\in R_{1}$ and $(a,c)\in R_{2}$ and $(c,b)\in R_{2}$ for some $c\in S$. Now for arbituary $(x,y)\in R_{1}$ we have $(x,z)\in I$ which implies that $(y,z)\in R_{2}$. But also $(y,z)\in R_{1}$, so $R_{1}$ is surjective. Similar argument for $R_{2}$  And for Injectivity, I've tried to show that if $aR_{1};R_{2}c$ and $bR_{2};R_{1}c$, then $a=b$ but I am not entirely sure what $a=b$ means in this context. Do I have to show that there is an equivalence relation containing (a,b)?  edit: $R_{1};R_{2}$ is a composition of two relations and $I=R_{1};R_{2}$