How to save our php files so that we can load on our server . I have installed apache2 , php, and mySql . also I don't know how to connect these 3 so that I can simply work on my text editor. Please help me.
I recently installed Ubuntu 14.04, then I installed lamp-server and placed my webpages in /var/www directory, but when I opened localhost in the browser there was nothing. I think that happened because Zend updated Apache.  Whatever the reason may be, I want to know where to keep my php files so that I can access them from my browser.
Visiting Greece with back-to-back Schengen visas (One from Germany, other from Italy) How to inject Spring Bean for factory method requiring MyClass.class parameter How to configure idle period for auto locking screen I just installed a fresh Ubuntu 12.04 (Precise Pangolin).   I noticed that, there is no screensaver settings, which is fine. I like to control the period of time after which the blank screen is shown,which automatically locks the screen.  I do not want to enable screensaver. I only wish to be able to change the idle time period required to lock the screen automatically. It seems to me, it is by default around 10-15 minutes. I am trying to recall the name of a story I read when I was fairly young (maybe 20 years ago, but not sure how old the story is).    What I remember: A man acquires a set of creatures that he keeps in his house, I think in an aquarium.  They evolve over time, quickly, and think of him as their benevolent god. They build statues in his likeness.   Then, I believe some sort of accident happens, and the statues they build become a little less benevolent, which bothers him.  This pattern continues on with his cruelty increasing and their depiction of him becoming more cruel. Algorithm to find Largest prime factor of a number What is the best approach to calculating the largest prime factor of a number?  I'm thinking the most efficient would be the following:   Find lowest prime number that divides cleanly Check if result of division is prime If not, find next lowest Go to 2.   I'm basing this assumption on it being easier to calculate the small prime factors. Is this about right? What other approaches should I look into?  Edit: I've now realised that my approach is futile if there are more than 2 prime factors in play, since step 2 fails when the result is a product of two other primes, therefore a recursive algorithm is needed.  Edit again: And now I've realised that this does still work, because the last found prime number has to be the highest one, therefore any further testing of the non-prime result from step 2 would result in a smaller prime. What licence is subscriber content provided under 4.0, 3.0 or them all? In the footer it says:     site design / logo © 2018 Stack Exchange Inc; user contributions licensed under  with . rev 2018.8.7.31273   However, in the footer under Company > Legal > '6. Content Permissions, Restrictions, and Creative Commons Licensing' it instead doesn't specify which CC BY-SA licence we're releasing our content under. It also links to the CC BY-SA 4.0 license:     The CC-BY-SA Creative Commons license terms are explained in further detail by , but you should be aware that all Public Content you contribute is available for public copy and redistribution, and all such Public Content must have appropriate attribution.   Since  if subscriber content is only provided under 4.0, where the footer says 3.0 it can cause users to break the licences.  The footer under Area 51 also mentions that content is licensed under CC BY-SA 2.5.  Since it's not defined which version of the license the content is provided under, I also interpret it to potentially mean all the versions.    What license is subscriber content licensed under? Formation of supermassive black holes Scientists have found very bright source of light which they call  and the are found to be . So these black holes are so massive that they cannot be formed by a supernova. So how are these formed? How to extend summations to fractional orders? How to put a '+' sign inside a square like xor I'm currently developing a fake filesystem for a browsergame. I recently implemented ".." and "." folders so every folder has a reference to its parent. Then I checked in my terminal if "/" also has these folders.  Actually I was very surprised that it has a directory ".." which obviously is a reference to itself.  Is the reason for this consistency or is there a better explanation?  Edit: I'm basically looking for the document where this is documented. I can successfully tether my Mac (10.7.3) to my iPhone4 (5.0.1) via wifi, no problem, been doing it for months.  However, when I try to tether via bluetooth instead, I can't seem to see the internet from my mac.  Network Settings reports a green light for Bluetooth PAN, but my browser can't connect to anything at all.  My Mac reports very similar IP addresses for both, starting with 172.20.10 and differing only in the last octet.  Any idea why I can't successfully tether via bluetooth? Natural log approximation I've got an equation that contains   $$x^p - 1$$   $x$ is any positive number (such as 2) and $p$ is a small positive number close to 0 (such as 0.001).  For some reason (that I may have known in High School), this can be approximated by   $$\ln(x) \times p$$  Can anyone explain why this approximation works?  Does it have something to do with approximating a natural log with a series? Sudo doesn't work on Aliases I have added alias ll='ls -la' in /etc/bash.bashrc but sudo ll is not working. Is there a way to "source" bash.bashrc? In a related post, another user suggesting creating an alias for sudo with a space after it. Eg. alias sudo='sudo ' but there wasn't any context to this answer. Should I add this to my bashrc? Seems hackish.  What is the correct method for adding an alias for my sudo one-off commands? How to select lenses for outdoor sports photography? I would like to get into sports photography, and would probably want a better telephoto lens so I can get better close up shots.  What other factors should I keep in mind as I make my choice? Does IS (or VR) matter?  What is a good focal length?  I'll probably be shooting mostly little league baseball/softball, church softball leagues, and kids soccer. I would like to use  with a video.  With ffmpeg I can export some (.jpeg) images from a video. Can I convert a .jpeg into a valid .tiff or export directly .tiff images from the video with ffmpeg? Messed up my PATH environment variable and can't login to desktop To get an maven environment variable to run, I tried several options. Basically, I followed some options from , such as ~/.pam_environment, /etc/bash.bashrc and I don't really know anymore. Within them I exported sth like export PATH=/opt/apache-maven-3.6.0/bin:$PATH (I'm being so unconcrete because I cannot look it up).   Afterwards, I did run gnome-session-quit and my machine got stuck.   So after hard restart I try to login again, but I'm not able to do that: I see my username, enter the password, hit enter, screen turns black and after 2 seconds I'm back at the login screen.   So, that very strange and worrying. Next step: Login via tty (Strg + ALT + F3). Within there I can login, but can not do much. I thought about sth like . But whatever I do: The command could not be located because '\bin' is not included in the PATH environment variable. I think, altogether thats alarming and I'm getting really nervous.  Executing export PATH="/usr/bin:$PATH seems to work and echo $PATHgives an output starting with /usr/bin:/usr/bin:/usr/bin:/home/user/Documents/.../esper/examples/transaction/etc:/home/user/anaconda3/bin:/usr/lib/jvm/java-1.8.0-openjdk-amd64/bin:/opt/apache-maven-3.6.0/bin:/opt/apache-maven-3.6.0/bin:/opt/apache-maven-3.6.0/bin but does not really help.  I'm running an Ubuntu 18.04 on an Lenovo G50-70.   Can you help me accessing my desktop again and/or fixing my PATH issue? What changes when an Alienist becomes an outsider? I'm trying to answer the following question from the book :  Let $X_1,X_2,\dots$ be a sequence of sub-gaussian random variables, which are not necessarily independent. Show that   $E\bigg[ \max_i \frac{|X_i|}{\sqrt{1 + \log i}} \bigg] \le CK$,  where $K = \max_i \|X_i\|_{\psi_2}$. Deduce that for ever $N \ge 2$ we have   $E\bigg[ \max_{i \le N} |X_i| \bigg] \le CK \sqrt{\log N}$.  I've tried to figure out what is the distribution of the maximum of Gaussians, but I'm reaching only inequalities that that don't help me answer the question.   I've also seen a similar question .  Does anyone have a clue or something to start with in order to answer this question?  Thanks! Nth max salary in Oracle Catch multiple exceptions at once? It is discouraged to simply catch System.Exception. Instead, only the &quot;known&quot; exceptions should be caught. Now, this sometimes leads to unnecessary repetitive code, for example: try {     WebId = new Guid(queryString[&quot;web&quot;]); } catch (FormatException) {     WebId = Guid.Empty; } catch (OverflowException) {     WebId = Guid.Empty; }  I wonder: Is there a way to catch both exceptions and only call the WebId = Guid.Empty call once? The given example is rather simple, as it's only a . But imagine code where you modify an object multiple times, and if one of the manipulations fails expectedly, you want to &quot;reset&quot; the object. However, if there is an unexpected exception, I still want to throw that higher.