I want to redirect this way: from www.example.com/link.php?a=1&amp;b=1 to www.example.net/subdirectory/link.php?a=1&amp;b=1  I tried to use this .htaccess which isn't working:  Options +FollowSymLinks RewriteEngine On RewriteBase /  RewriteCond %{HTTP_HOST} ^(www\.)?example\.com$ [NC]  RewriteRule ^(.*)$ http://www.example.net/subdirectory$ [L,R=301]   The above redirects www.example.com/link.php?a=1&amp;b=1 to www.example.net/subdirectory/?a=1&amp;b=1, omitting the link.php part.  System is apache2.2 + mod_rewrite running on debian wheezy 64bit. Thanks in advance.
This is a  about Apache's mod_rewrite.   Changing a request URL or redirecting users to a different URL than the one they originally requested is done using mod_rewrite. This includes such things as:   Changing HTTP to HTTPS (or the other way around) Changing a request to a page which no longer exist to a new replacement. Modifying a URL format (such as ?id=3433 to /id/3433 ) Presenting a different page based on the browser, based on the referrer, based on anything possible under the moon and sun. Anything you want to mess around with URL   Everything You Ever Wanted to Know about Mod_Rewrite Rules but Were Afraid to Ask!  How can I become an expert at writing mod_rewrite rules?   What is the fundamental format and structure of mod_rewrite rules? What form/flavor of regular expressions do I need to have a solid grasp of? What are the most common mistakes/pitfalls when writing rewrite rules? What is a good method for testing and verifying mod_rewrite rules? Are there SEO or performance implications of mod_rewrite rules I should be aware of? Are there common situations where mod_rewrite might seem like the right tool for the job but isn't? What are some common examples?   A place to test your rules  The  web site is a great place to play around with your rules and test them. It even shows the debug output so you can see what matched and what did not.
Get the title instead of the number of a referenced chapter/section? The direction of static friction? In my book, the following are described to be the steps that one must follow if he wishes to find the direction of static friction force acting on an object:  &quot;(1) Draw the F.B.D(free body diagram) of the object in question with respect to the other object on which it is kept. (2) Include the pseudo force also, if the contact surface is accelerating. (3) Decide the direction of the resultant force and resolve this force into two components; one along the surface of contact and the other along the normal to this surface. (4) The direction of static friction is opposite to the component of the result force along the contact surface.&quot;  Firstly, are these steps correct? Will I always obtain the correct answer by following these steps? Secondly, consider the following problem:  In questions like these, when I try to find the resultant force and then assign the direction to static friction, I find that my answer is incorrect! Are there some other steps to follow when I know that the object is definitely accelerating in one direction or another? Edit 1: I approached the above question by doing exactly what my book suggests; first, I identified all the forces acting on the smaller block, being the normal force applied by the block A and its weight mg downward. Adding these two forces, I get another force that actually acts on the body like so:  I wonder if I'm not supposed to take either of the contact forces into consideration when drawing the F.B.D to figure out the direction of static friction acting on the body. Also, are there other steps for finding the direction of kinetic friction? Edit 2: From Judge's answer, I have been able to figure out my mistake, it being that I completely missed step (3) and didn't resolve the resultant force into components! Sheesh. Sorry! Much thanks in advance! :) Regards. The photon sphere is a spherical region in space where photons are forced to travel in an orbit at $r = \frac{3GM}{c^{2}}$.   Is it possible to detect these spheres?  What happens if I fall through it? What happens to a photon that tangentially hits the event horizon, wouldn't this also lead to a photon orbiting the black hole? EDIT Since neutron stars also might have a , do we know neutron stars that should have such a sphere? When working with an image in Photoshop, I'd like to have a simple keyboard shortcut, like in , that automatically does:   Export > Export As or Export > Save For Web  Resize to biggest dimension = 600px (either width or height) Add suffix _600.jpg to filename   How to do that?  I'm not sure how to edit a recorded macro to do that (add the suffix and choose 600px for the biggest dimension).  Example: you open myphoto.png, you press F6 and then you automatically get myphoto_600.jpg. Two numbers are chosen randomly and independently from the unit interval $(0,1)$.  What is the probability that they differ by more than $\frac{1}{2}$? Hint: Think of the $2$ numbers chosen as coordinates in the Cartesian plane. Draw a square with vertices at $(0,0)$,$(1,0)$,$(1,1)$, and $(0,1)$. Allowable choices for the $2$ points lie below the line $y=x-\frac{1}{2}$ or the above $y=x+\frac{1}{2}$. Find the combined area of these regions.  I need help on this. I know what $y=x-\frac{1}{2}$ and $y=x+\frac{1}{2}$ looks like but I am not understanding the problem as a whole Excel function that evaluates a string as if it were a formula? Suppose I have a text string like "11+5" or even "=11+5" stored in a cell. Is there a function in Excel that will allow me to actually evaluate that string as if it were a formula?  This would be helpful for another project where I would like to be able to write 'dynamic' formulas in Excel. I just started playing Overwatch (played a few games during open beta, but wasn't able to play much). I'm enjoying Mercy, but who (in a group situation) should be getting the damage buff? Additionally, when my team splits up, who should I follow to support? Is SHA-256 secure as a CTR block cipher? Generate a 256-bit random nonce. XOR it with a 256-bit reusable symmetric key. This is x.  We represent numbers in simple binary instead of a counting function. 0 in dec = [256 zeros] in binary, 1 = [255 zeros]1, 23092348 = [241 zeros]1011000000101110001111100, etc.  For each nth block needed for the length of the plaintext, XOR x with n and hash it with SHA-256 to form b[n].  Let p[n] be the nth 256-bit block in the plaintext and c[n] be the nth block in the ciphertext. Then c[n] := b[n] XOR p[n].  Send the unencrypted nonce along with the ciphertext.  To decrypt c[n], XOR it with b[n] to retrieve p[n].  Is this secure? If so, then why do we need AES-256?  If this is not secure, then is there any mode of operation for which SHA-256 is secure as a block cipher? Specifically, it would need to be used in cipher feedback, output feedback, or any other mode that only uses the cipher in the encryption direction. How do you set, clear, and toggle a bit? When is it okay to exceed the absolute maximum rating on a part? Showing that $e^x > 1+x$ $(\Bbb Z\oplus \Bbb Z)[X] \not\cong \Bbb Z[X]\oplus \Bbb Z[X]\,$? Well i tried to prove it but failed. They are both commutative and have the same set of units. So i can't see a property of one ring which the other ring does not possess. Thank you for any help. In how many ways can a number be expressed as a sum of consecutive numbers? All the positive numbers can be expressed as a sum of one, two or more consecutive positive integers. For example $9$ can be expressed in three such ways, $2+3+4$, $4+5$ or simply  $9$. In how many ways can a number be expressed as a sum of consecutive numbers?  In how many ways can this work for $65$?  Here, for $9$ answer is $3$, for $10$ answer is $3$, for $11$ answer is $2$. Fixing "Page is not mobile friendly" report from Google test In search results google reports "this page is not mobile-friendly". I want to fix this.   when I test my website in the mobile-friendly test, it reports:   Content wider than screen. Clickable elements too close together.   How can I find the items/content that are creating these problems?  Any help would be appreciated. How do we control web page caching, across all browsers? Our investigations have shown us that not all browsers respect the HTTP cache directives in a uniform manner.  For security reasons we do not want certain pages in our application to be cached, ever, by the web browser. This must work for at least the following browsers:   Internet Explorer 6+ Firefox 1.5+ Safari 3+ Opera 9+ Chrome   Our requirement came from a security test. After logging out from our website you could press the back button and view cached pages. From a previous question, we have that $\sqrt[3]{3} \notin \mathbb{Q}(\sqrt[4]{3})$, and I am assuming that we would need to use this to justify the answer to the question.   Would it be right to use some idea of a splitting field here? Or is it something to do with $\mathbb{Q}(\sqrt[3]{3}, \sqrt[4]{3})$ not containing a primitive 3rd root of unity?   This is a past exam paper question worth 8 marks, so it doesn't seem like it's a few lined answer, but I am a little stuck on where to go. Prove that the functions $f(z)$ and $\overline{f(\overline{z})}$ are simultaneously holomorphic.   I take this to mean that $f(z)$ is holomorphic if and only if $\overline{f(\overline{z})}$ is holomorphic.  Let $g(z)=\overline{f(\overline{z})}$. Note that $\overline{g(\overline{z})}=f(z)$. So it suffices to prove that if $f(z)$ is holomorphic, then $g(z)$ is holomorphic.  Write $f(z)=u(z)+iv(z)$. Since $f(z)$ is holomorphic, the real and imaginary parts satisfy the Cauchy-Riemann equations:  $$\frac{\partial{u(z)}}{\partial{x}} = \frac{\partial{v(z)}}{\partial{y}}, \frac{\partial{u(z)}}{\partial{y}} = -\frac{\partial{v(z)}}{\partial{x}}.$$  We have $g(z) = u(\overline{z})+i(-v(\overline{z}))$. To prove that $g(z)$ is holomorphic, we must prove that its real and imaginary parts satisfy the Cauchy-Riemann equations:  $$\frac{\partial{u(\overline{z})}}{\partial{x}} = \frac{\partial{(-v(\overline{z}))}}{\partial{y}}, \frac{\partial{u(\overline{z})}}{\partial{y}} = -\frac{\partial{(-v(\overline{z}))}}{\partial{x}}.$$  How can we obtain this from the above relations? Divisor function asymptotics Define $\tau_{r}(n) = \sum_{d_1...d_r = n}1$.   One exercise in a book on sieve theory asked for an elementary proof by induction of the fact that   $$\sum_{n\le x}\tau_r(n) = \frac{1}{(r - 1)!}x(\ln x)^{r - 1} + O\left(x(\ln x)^{r - 2}\right)$$  The base case $r = 2$ is easy with reversing the order of summation.  The only other progress that I made was the fact that $\sum_{n\le x}\tau_{r}(n) = \sum_{d\le x}\left\lfloor\frac{x}{d}\right\rfloor\tau_{r- 1}(d)$, but I don't know how to proceed. Is it possible to use "negative sound waves" to "cancel out" a sound to create silence? Is transferring to another university an option for an unhappy PhD student?