ORIGINAL POST   This I would imagine is going to be a simple answer. I have Apache2 running on my Ubuntu server but it seems PHP is not installed. When I try to load a php page it does not load properly.   Example:  (My Site)   At first I thought the php module was simply not loaded but when I try to run sudo a2enmod php but it did not work and I get this error: ERROR: Module php does not exist!  Thanks for help in advance!   EDIT  After trying to load a simple PHP page to show the php version I have gotten a new error trying to load the page. that error is visible here:  . This makes me think I have more of an Apache issue than a php issue. I have a main Apahce sever that proxys all incoming traffic to each server inside my network. The Apache config for the main server looks like this:   &lt;VirtualHost *:*&gt;         ServerName MaxKulik.net         ServerAdmin max@maxkulik.net         ProxyPreserveHost On         ServerName "www.MaxKulik.net"         ServerAlias "MaxKulik.net"         ProxyPass / http://192.168.1.5/         ProxyPassReverse / http://192.168.1.5/         ErrorLog ${APACHE_LOG_DIR}/error.log         CustomLog ${APACHE_LOG_DIR}/access.log combined &lt;/VirtualHost&gt;  &lt;VirtualHost *:*&gt;         ServerName MaxKulik.net         ServerAdmin max@maxkulik.net         ProxyPreserveHost On         ServerName "www.MaxKulik.net"         ServerAlias "MaxKulik.net"         SSLProxyEngine On         SSLProxyCheckPeerCN on         SSLProxyCheckPeerExpire on         ProxyPass / https://192.168.1.5/         ProxyPassReverse / https://192.168.1.5. &lt;/VirtualHost&gt;  &lt;VirtualHost *:*&gt;         ServerName USI         ServerAdmin max@maxkulik.net         ProxyPreserveHost On         ServerName "www.UrbanTurtles.servegame.com"         ServerAlias "UrbanTurtles.servegame.com"         ProxyPass / http://192.168.1.28         ProxyPassReverse / http://192.168.1.28         ErrorLog ${APACHE_LOG_DIR}/error.log         CustomLog ${APACHE_LOG_DIR}/access.log combined &lt;/VirtualHost&gt;
I set up a new VPS instance of Ubuntu and am wondering what the easiest way is to get up and running with a basic LAMP stack (i.e. which packages are required, which configuration options need to be tweaked, if any, etc.).
Why use a ReentrantLock if one can use synchronized(this)? Show that if $a$ and $b$ are positive integers with $(a,b)=1$ then $(a^n, b^n) = 1$ for all positive integers n  Hi everyone, for the proof to the above question,  Can I assume that since $(a, b) = 1$, then in the prime-power factorization of a and b, they have no prime factor in common, when they are taken to the $nth$ power, they will still have no prime factors in common, and so $(a^n, b^n) = 1$ for all positive integers n.  I think I'm jumping to conclusions here again, if so, leave some tips on how to do the proof properly, thanks :)  And also, I do not know how to approach the reverse problem where if $(a^n, b^n) = 1 then (a, b) = 1$, any guidance will be much appreciated! Why are the characters on the keyboard all capitalized? Why are all the letters (A, B etc) and all the writings (Home, Page Up etc) on the keyboard, capitalized?    Especially, the letters, because a new user could rightly expect uppercase letters to be entered upon pressing those keys to find the contrary. I've been reading the  and it mentions about virtual terminals which, if I understood it correctly, it is a Linux-specific feature (not in Unix) to allow multiple login consoles in a non X11 system. You create virtual terminals by pressing ALT-F2. I'm running Linux Mint and in my /dev folder though I see many tty devices and I don't know what they are for. Here is the grepped output:  crw-rw-rw-  1 root tty       5,   0 Jan  2 19:45 tty crw--w----  1 root tty       4,   0 Jan  2 19:10 tty0 crw-rw----  1 root tty       4,   1 Jan  2 19:10 tty1 crw--w----  1 root tty       4,  10 Jan  2 19:10 tty10 crw--w----  1 root tty       4,  11 Jan  2 19:10 tty11 crw--w----  1 root tty       4,  12 Jan  2 19:10 tty12 crw--w----  1 root tty       4,  13 Jan  2 19:10 tty13 crw--w----  1 root tty       4,  14 Jan  2 19:10 tty14 crw--w----  1 root tty       4,  15 Jan  2 19:10 tty15 crw--w----  1 root tty       4,  16 Jan  2 19:10 tty16 crw--w----  1 root tty       4,  17 Jan  2 19:10 tty17 crw--w----  1 root tty       4,  18 Jan  2 19:10 tty18 crw--w----  1 root tty       4,  19 Jan  2 19:10 tty19 crw-rw----  1 root tty       4,   2 Jan  2 19:10 tty2 crw--w----  1 root tty       4,  20 Jan  2 19:10 tty20 crw--w----  1 root tty       4,  21 Jan  2 19:10 tty21 crw--w----  1 root tty       4,  22 Jan  2 19:10 tty22 crw--w----  1 root tty       4,  23 Jan  2 19:10 tty23 crw--w----  1 root tty       4,  24 Jan  2 19:10 tty24 crw--w----  1 root tty       4,  25 Jan  2 19:10 tty25 crw--w----  1 root tty       4,  26 Jan  2 19:10 tty26 crw--w----  1 root tty       4,  27 Jan  2 19:10 tty27 crw--w----  1 root tty       4,  28 Jan  2 19:10 tty28 crw--w----  1 root tty       4,  29 Jan  2 19:10 tty29 crw-rw----  1 root tty       4,   3 Jan  2 19:10 tty3 crw--w----  1 root tty       4,  30 Jan  2 19:10 tty30 crw--w----  1 root tty       4,  31 Jan  2 19:10 tty31 crw--w----  1 root tty       4,  32 Jan  2 19:10 tty32 crw--w----  1 root tty       4,  33 Jan  2 19:10 tty33 crw--w----  1 root tty       4,  34 Jan  2 19:10 tty34 crw--w----  1 root tty       4,  35 Jan  2 19:10 tty35 crw--w----  1 root tty       4,  36 Jan  2 19:10 tty36 crw--w----  1 root tty       4,  37 Jan  2 19:10 tty37 crw--w----  1 root tty       4,  38 Jan  2 19:10 tty38 crw--w----  1 root tty       4,  39 Jan  2 19:10 tty39 crw-rw----  1 root tty       4,   4 Jan  2 19:10 tty4 crw--w----  1 root tty       4,  40 Jan  2 19:10 tty40 crw--w----  1 root tty       4,  41 Jan  2 19:10 tty41 crw--w----  1 root tty       4,  42 Jan  2 19:10 tty42 crw--w----  1 root tty       4,  43 Jan  2 19:10 tty43 crw--w----  1 root tty       4,  44 Jan  2 19:10 tty44 crw--w----  1 root tty       4,  45 Jan  2 19:10 tty45 crw--w----  1 root tty       4,  46 Jan  2 19:10 tty46 crw--w----  1 root tty       4,  47 Jan  2 19:10 tty47 crw--w----  1 root tty       4,  48 Jan  2 19:10 tty48 crw--w----  1 root tty       4,  49 Jan  2 19:10 tty49 crw-rw----  1 root tty       4,   5 Jan  2 19:10 tty5 crw--w----  1 root tty       4,  50 Jan  2 19:10 tty50 crw--w----  1 root tty       4,  51 Jan  2 19:10 tty51 crw--w----  1 root tty       4,  52 Jan  2 19:10 tty52 crw--w----  1 root tty       4,  53 Jan  2 19:10 tty53 crw--w----  1 root tty       4,  54 Jan  2 19:10 tty54 crw--w----  1 root tty       4,  55 Jan  2 19:10 tty55 crw--w----  1 root tty       4,  56 Jan  2 19:10 tty56 crw--w----  1 root tty       4,  57 Jan  2 19:10 tty57 crw--w----  1 root tty       4,  58 Jan  2 19:10 tty58 crw--w----  1 root tty       4,  59 Jan  2 19:10 tty59 crw-rw----  1 root tty       4,   6 Jan  2 19:10 tty6 crw--w----  1 root tty       4,  60 Jan  2 19:10 tty60 crw--w----  1 root tty       4,  61 Jan  2 19:10 tty61 crw--w----  1 root tty       4,  62 Jan  2 19:10 tty62 crw--w----  1 root tty       4,  63 Jan  2 19:10 tty63 crw--w----  1 root tty       4,   7 Jan  2 19:10 tty7 crw--w----  1 root tty       4,   8 Jan  2 19:10 tty8 crw--w----  1 root tty       4,   9 Jan  2 19:10 tty9 What happens to waves when they hit smaller apertures than their wavelenghts? Showing group with $p^2$ elements is Abelian I have a group $G$ with $p^2$ elements, where $p$ is a prime number. Some (potentially) useful preliminary information I have is that there are exactly $p+1$ subgroups with $p$ elements, and with that I was able to show $G$ has a normal subgroup $N$ with $p$ elements.   My problem is showing that $G$ is abelian, and I would be glad if someone could show me how.   I had two potential approaches in mind and I would prefer if one of these were used (especially the second one).   First: The center $Z(G)$ is a normal subgroup of $G$ so by Langrange's theorem, if $Z(G)$ has anything other than the identity, it's size is either $p$ or $p^2$. If $p^2$ then $Z(G)=G$ and we are done. If $Z(G)=p$ then the quotient group of $G$ factored out by $Z(G)$ has $p$ elements, so it is cylic and I can prove from there that this implies $G$ is abelian. So can we show theres something other than the identity in the center of $G$?  Second: I list out the elements of some other subgroup $H$ with $p$ elements such that the intersection of $H$ and $N$ is only the identity (if any more, due to prime order the intersected elements would generate the entire subgroups). Let $N$ be generated by $a$ and $H$ be generated by $b$. We can show $NK= G$, i.e every element in G can be wrriten like $a^k b^l $. So for this method, we just need to show $ab=ba$ (remember, these are not general elements in the set, but the generators of $N$ and $H$).   Do any of these methods seem viable? I understand one can give very strong theorems using Sylow theorems and related facts, but I am looking for an elementary solution (no Sylow theorems, facts about p-groups, centrailzers) but definitions of centres and normalizers is fine. I found the .bashrc file and I want to know the purpose/function of it. Also how and when is it used? I got this $$ f=a(x-1)(x-2)...(x-101) $$ knowing a and that $1 ,2 \ldots ,101$ are it's roots ... I need the roots of $f'$ , how should I do it ? More specifc how can I derivate a polynomial like that, is there a formula or something ? By definition a matrix representing a Lorentz transformation is orthogonal, so that its inverse is equal to its transpose.   Consider a pure boost in the t-x plane; $$\Lambda_x=\begin{pmatrix} \cosh(\gamma) &amp;&amp; \sinh(\gamma) &amp;&amp; 0 &amp;&amp; 0\\ \sinh(\gamma) &amp;&amp; \cosh(\gamma) &amp;&amp; 0 &amp;&amp; 0\\ 0 &amp;&amp; 0 &amp;&amp; 1 &amp;&amp; 0\\ 0&amp;&amp;0&amp;&amp;0&amp;&amp;1 \end{pmatrix}.$$ $\Lambda_x$ has inverse  $$\Lambda_x^{-1}=\begin{pmatrix} \cosh(\gamma) &amp;&amp; -\sinh(\gamma) &amp;&amp; 0&amp;&amp;0\\ -\sinh(\gamma) &amp;&amp; \cosh(\gamma) &amp;&amp; 0&amp;&amp;0\\ 0 &amp;&amp; 0 &amp;&amp; 1 &amp;&amp;0\\ 0&amp;&amp;0&amp;&amp;0&amp;&amp;1 \end{pmatrix}$$ but tranpose  $$\Lambda_x^T=\begin{pmatrix} \cosh(\gamma) &amp;&amp; \sinh(\gamma) &amp;&amp; 0&amp;&amp;0\\ \sinh(\gamma) &amp;&amp; \cosh(\gamma) &amp;&amp; 0&amp;&amp;0\\ 0 &amp;&amp; 0 &amp;&amp; 1&amp;&amp;0\\ 0&amp;&amp;0&amp;&amp;0&amp;&amp;1 \end{pmatrix}.$$ These are not equal. Where have I gone wrong? I have a really simple Java class that effectively decorates a Map with input validation, with the obvious void set() and String get() methods.  I'd like to be able to effectively call those methods and handle return values and exceptions from outside the JVM, but still on the same machine Update: the caller I have in mind is not another JVM; thanks @Dave Ray  My implementation considerations are typical    performance ease of implementation and maintenance (simplicity?) reliability flexibility (i.e. can I call from a remote machine, etc.)   Is there a 'right way?' If not, what are my options, and what are the pro/cons for each?  (Stuff people have actually done and can provide real-life feedback on would be great!) ArcPy importing error after setting path? This questions has been asked before too and I did go through most of the suggestions. Things I have tried so far: setting up correct  path variable environment, installing anaconda 32 bits, python 2.7, or even switching to python 2.7 in cmd while initially using Anaconda 3 , adding Desktop 10.4.pth file with  following path.  C:\Program Files (x86)\ArcGIS\Desktop10.4\bin C:\Program Files (x86)\ArcGIS\Desktop10.4\ArcPy C:\Program Files (x86)\ArcGIS\Desktop10.4\ArcToolBox\Scripts   I also added those paths in environment variable   These suggestions help me to reduce the error. But Now I am getting a different error. Looks like python can find arcpy but missing another package.  Getting this error while trying to import arcpy in python 3.6.   File "C:\Program Files (x86)\ArcGIS\Desktop10.4\ArcPy\arcpy\__init__.py", line 22, in &lt;module&gt;     from arcpy.geoprocessing import gp    File "C:\Program Files (x86)\ArcGIS\Desktop10.4\ArcPy\arcpy\geoprocessing\__init__.py", line 14, in &lt;module&gt;     from _base import *  ModuleNotFoundError: No module named '_base'   Any suggestions? If $\tan(\frac{\pi}{4}+\frac{y}{2})=\tan^3(\frac{\pi}{4}+\frac{x}{2})$,then prove that $\sin y=\frac{\sin x(3+\sin^2 x)}{(1+3\sin^2 x)}$ If $\tan(\frac{\pi}{4}+\frac{y}{2})=\tan^3(\frac{\pi}{4}+\frac{x}{2})$,then prove that $\sin y=\frac{\sin x(3+\sin^2 x)}{(1+3\sin^2 x)}$    $\tan(\frac{\pi}{4}+\frac{y}{2})=\tan^3(\frac{\pi}{4}+\frac{x}{2})$ $\frac{1+\tan\frac{y}{2}}{1-\tan\frac{y}{2}}=(\frac{1+\tan\frac{x}{2}}{1-\tan\frac{x}{2}})^3$ Applying componendo and dividendo rule on both sides, $\tan\frac{y}{2}=\frac{\tan\frac{x}{2}(3+\tan^2\frac{x}{2})}{(1+3\tan^2\frac{x}{2})}$ I am stuck here. probability that there is at least one defective part I study economics and I am trying to solve this problem - without success, unfortunately.     A machine has a defect rate of 6%.       a) Chosen at random 4 pieces (with replacement) from the production flow, compute the probability that none is defective.   b) In the event that extractions are performed 60, compute the probability that there is at least one defective part.   I have no idea how to answer the first question. What logical processes can I use?  Regarding the second question, I thought of using the binomial random variable with $n = 60$ and $p = 0.06$. Then:  $$\begin{multline} P (X \geq 1) = 1 - P (X &lt; 1) = 1 - P (X = 0) = \\ = 1 - \binom{60}{0}  \cdot (0.06)^ 0 \cdot (0.94)^{60} = 1 - 0.02446 = 0.97558.\end{multline}$$  Can somebody please explain me how to solve this problem? Thank you very much. SingleEmailMessage sending isn't working when called from Unit Test I have the following code:      public class OrderRequestCreationEmails {     public static void sendMail()     {          Messaging.reserveSingleEmailCapacity(2);         Messaging.SingleEmailMessage mail = new Messaging.SingleEmailMessage();         String[] toAddresses = new String[] {'dgriff@varonis.com'};           mail.setToAddresses(toAddresses);          mail.setReplyTo('dgriff@varonis.com');          mail.setSenderDisplayName('Mail Test');          mail.setSubject('Success! Mail Sent');          mail.setBccSender(false);         mail.setPlainTextBody('BODY');          Messaging.sendEmail(new Messaging.SingleEmailMessage[] { mail });     } }   I tried to call this function from a test as such: (I know its not an actual test, its just to see if I receive a mail).  @isTest private class CreationEmailsTest {     @isTest private static void sendMailTest() {         OrderRequestCreationEmails.sendMail();     } }   And I haven't received the mail, no idea why?  It's an example I took from the salesforce developer guide. couldn't find any answers online...  FYI - deliverability in the sandbox is turned on, and test deliverability works Prove by mathematical induction that $n^3 - n$ is divisible by $3$ for all natural number $n$ I'm going to install Linux on Lenovo B5400, which contains:   500GB Hybrid SSHD with a 8 GB SSD and 500 GB HDD   Designing partitions for my 2 Linux distros was quite easy before, when I had only HDD. I always had:   10GB for Linux distro (mounted as "/") 10GB for another distro (again "/"; for another distro; for testing purposes or to assure continuity when switching distros) 2GB for swap (used for both distros; no need to separate) 300GB+ for "/home" (used for both distros; different usernames eliminates possible conflicts)   It's simple, isn't it? I would like to keep this approach, but I know that SSD has its own specificity - it prefers to be read, continuous writing may affect its life span. I don't want to kill SSD in a year, so I would like to move some system partitions to HDD in order to protect SSD. As far as I know /tmp is one of often read&amp;written locations. How much space it needs? What else should be placed on HDD?  Or: how to design partitions to achieve exactly the same effect and to keep SSD as safe as possible?  I'd be grateful for your help. Contraction of quotient ideal is quotient of contractions? Model won't follow its armature in pose mode I've set up a rig and built it around my model, and I've linked it to my model but when I rotate the bones in pose mode, the character doesn't move with them.   My rig is the human meta rig that comes with rigify. I've seen tons of videos of it working. Why isn't it working on mine?  My character was made by creating different body parts and joining them together into the same object, then a texture was added by unwrapping them in texture mode. Showing a compact metric space has a countable dense subset I know that this is separable, but that has not been covered by the text at this point. I believe my proof (below) to be correct, but not very rigorous. Assuming that it actually is correct, could someone please help me make it more formal? (If it's not correct, please help with the proof). Thanks.  Proof: Let $X$ be a compact metric space. Let $B_n = \{B(x,\frac1{n}) : x\in X\}$. be the collection of open balls centered at $x$. Let $\{x\}^{(n)}$ be the set of centers for some particular $n$. Then by compactness of $X$, there are also a finite number of centers for a particular $n$ (corresponding to each open ball).   [This is where I have trouble properly saying what's on my mind:]  Consider $B(x,r_0)$, where $r_0 = \frac{1}{n_0}$. When we decrease the magnitude of $r_0$ to $r_1$, we must still be able to cover $X$. Meaning some open ball(s) must be "formed" where $B(x,r_0)$ was once "covering". So by adding open balls, we also add to our collection of centers. This means at $B(x,r_0)$, there was originally a point $y \in B(x,r_0)$ s.t. $B(y,r') \subset B(x,r_0)$ for some $r'$. That is, $B(x,r_0)$ contained another point of $X$. Thus, by definition, $X$ contains a countable dense subset. Does the Rule of Two Serve any Actual Purpose? I know Darth Bane came up with the Rule of Two to ensure the survival of the Sith, but, in reality (or in the Star Wars reality), does it (or any Sith rule) serve a true purpose?  And why does each successive Sith bother with it?  Due to the nature of the Sith, Sith Lords tend toward arrogance and self-importance.  Both the Sith master and Sith apprentice seem to regularly break the rule by training others.  Deceit and personal interest over loyalty is a way of life for the Sith.  What is to keep any Sith from following the Rule of Two (or any rule, for that matter) if it is against their own self interest?  If a Sith Master can stay in power longer by training a 2nd apprentice and pitting the two against each other, is he really going to worry about the Rule of Two more than his own plans and survival?  The Rule of Two also assumes that every Sith Master would place the survival of the Sith over his own survival, as opposed to attempting to ensure his own immortality in whatever way he could (like Plagueis).  When you have a group that, by default, is arrogant and self-serving, as well as deceptive, why would they want the Sith to survive themselves?  I can see how the Rule of Two, and any other Sith beliefs would be possible guidelines, but it terms of the nature of ambitious people (and the Sith are ambitious), it's hard to believe that each new Sith Master would follow this rule faithfully.  So does this rule, or any Sith rule, actually work?  Or is it more of a suggestion that is broken when convenient?