I'm a brand new user to Ubuntu and need some help installing programs. I can't get them to install and I don't know why. I download them from their websites, such as google chrome download, but after that I can't do anything. I'm starting to think it's because I'm "Trying Ubuntu". Is this true? Thanks for helping! :)
How can I install applications like Google Chrome on Ubuntu?  Are there any commands to install an application?    Index of answers:
Add Fake Display when No Monitor is Plugged In I have an Ubuntu 14.04 server that has no external monitor connected.  I use NoMachine to remote control the machine.  When I do so, the Unity/Gnome interface doesn't see any monitors connected, so I can only use 800x600 when connecting with NoMachine.  If I plug in a monitor, I can set the resolution to whatever size the NoMachine window is on the remote computer.  Is there a way to create a "fake" monitor device on Ubuntu so I can set a desktop resolution in Unity/Gnome? Make links posted by users open in a new window Most of the time when I follow a user's link, I just want to see their site, look it over, then return to answer their question (not leave SO completely and not come back). Could we make the links users post open in a new window please?  EDIT: I originally wanted this implemented because it's what some other sites did, but I now definitely prefer SO's way. If I want to open a new tab, I middle-click/control-click (or whatever); if not, I just click. I'm in control of what happens. Would never want to go back now. The coefficient of kinetic friction can be calculated using $\mu_k = F_k/F_n$. A change in angle does not affect the normal force, but doesn't a change in angle affect the friction? As in if the angle is steeper, wouldn't the object have a greater propensity to move down the slope, thus there will be less friction? Mid-2017  started publishing monthly updates. This post will continue that effort into 2018. (.)  Updates are posted at the beginning of the month. They cover what was done last month, what is still in progress and new work that will be started in the current month.  Updates:      (CoC, nav, OpenID, responsive design, bugs, campaigns)  (CoC, comment flags, nav, OpenID)  (question wizard, nav, user survey, OpenID)  (tag watching, GDPR)  (responsive design, tags, teams)  (responsive design, OpenID, teams, sponsorship)  (responsive design, facebook auth, question lists, teams)  (newsletter, sign up, Documentation reputation, channels)  (top bar issues, hats, question template) "You must wear a suit TO an interview" vs "You must wear a suit FOR an interview" In the sentence-     You must wear a suit to an interview   shouldn't the to be replaced by for? Or what's the difference between these two here? So I'm working on this class that's supposed to request help documentation from a vendor through a web service. I try to name it DocumentRetriever, VendorDocRequester, DocGetter, but they just don't sound right. I ended up browsing through  for half an hour trying to come up with an adequate word.   Start programming with bad names is like having a very bad hair day in the morning, the rest of the day goes downhill from there. Feel me? Statistical inference when the sample "is" the population How can I represent an 'Enum' in Python? I'm mainly a C# developer, but I'm currently working on a project in Python.  How can I represent the equivalent of an Enum in Python? I want to list a company name in the author field of a bibliographic entry:  @book{CUDA,   author    = {NVIDIA Corporation},   title     = {NVIDIA CUDA Compute Unified Device Architecture Programming Guide},   publisher = {NVIDIA Corporation},   year      = {2007} }   But the entry keeps showing up "N. Corporation".  Is there a way to get the full author name to show up?  I'm currently using the siam BibTEX style. Alternatives to one-way ANOVA for heteroskedastic data Does the OP of a flagged post get comment notifications if the post is deleted by mods? Regex to strip lat/long from a string Anyone have a regex to strip lat/long from a string? such as:  ID: 39.825 -86.88333 How to prove the positive definite property of the semidefinite matrix with regularization? If I have a positive semidefinite matrix $A_{n\times n}$, I want to transform it to positive definite matrix. I plug the following operation to the original matrix: $$B=A+\lambda I_{n}$$ where $\lambda &gt; 0$. I want to know whether B is positive definite matrix. Could anyone proof it? Integral of $\frac{1}{2x}$ I have scene that looks like this:   And I want to add volumetric lighting to it so that light forms a rays of light when it go through the trees like on this example that I found in youtube:   But the problem is that all of these tutorials show how to make this lighting coming from windows, but when I try to replicate it in my forest scene it looks like big ugly fog with cubical shape. Also the light is coming from the back of the camera (as you can see) and there are some spots that needs this special lighting (like places where light goes through trees) and some that don't (like big bright are on the bottom left corner) so I can't just add a giant cube to all of the scene. It's common in C++ to name member variables with some kind of prefix to denote the fact that they're member variables, rather than local variables or parameters. If you've come from an MFC background, you'll probably use m_foo. I've also seen myFoo occasionally.  C# (or possibly just .NET) seems to recommend using just an underscore, as in _foo. Is this allowed by the C++ standard? The formal solution of the time-dependent Schrödinger equation Consider the time-dependent  (or some equation in Schrödinger form) written down as $$ \tag 1 i \partial_{0} \Psi ~=~ \hat{ H}~ \Psi . $$ Usually, one likes to write that it has a formal solution of the form $$ \tag 2 \Psi (t) ~=~ \exp\left[-i \int \limits_{0}^{t} \hat{ H}(t^{\prime}) ~\mathrm dt^{\prime}\right]\Psi (0). $$ However, this form for the solution of $(1)$ is actually built by the method of successive approximations which actually returns a solution of the form $$ \tag 3 \Psi (t) ~=~ \hat{\mathrm T} \exp\left[-i \int \limits_{0}^{t} \hat{H}(t^{\prime})~\mathrm  dt^{\prime}\right]\Psi (0), \qquad t&gt;0, $$ where $\hat{\mathrm T}$ is the time-ordering operator.  It seems that $(3)$ doesn't coincide with $(2)$, but formally $(2)$ seems to be perfectly fine: it satisfies $(1)$ and the initial conditions. So where is the mistake? The reasoning my book uses is as follows:   Since $(3+i)(3-i) = 10$, $10 + \langle 3+i\rangle = 0 + \langle 3+i\rangle $. Also, $i + \langle 3+i\rangle = -3 + \langle 3+i\rangle = 7 + \langle 3+i\rangle$. So, $\mathbb{Z}[i]/\langle 3+i\rangle = \{k + \langle 3+i\rangle \mid k = 0,1,\ldots ,9\}$, since $1 + \langle3+i\rangle$ has additive order $10$.   I do not understand why the additive order of $1 + \langle 3+i\rangle$ is $10$, or why the fact that $(3+i)(3-i) = 10$, shows the additive order or $1 + \langle 3+i\rangle$  is $10$. If someone could please explain this I would greatly appreciate it.   Note: I apologize for not using MathJax to write this post. I intend to learn it over the coming weekend. I once saw watch a sci-fi movie or an episode of a tv series (not sure) in which:   Every police officer was a judge, and hence could act by themselves on the streets. Each "judge" had a gun, which appended their DNA to the bullet. This was used later in investigations about a crime scene, and I think was confidential before the trial was held. Only a judge could use the gun, try to use it and you've been electrified. Also the guns had a self-destruction feature. The main villain was an ex-judge who purchased and activated a very old "killer robot" which was a residue of a long-ended war. When a judge was exiled, they were given a copy of the book of law, and sent outside the city to enlighten the people outside cities.   Can you help me find it?  PS: It was difficult to select a title Show that if $n$ is not divisible by $2$ or by $3$, then $n^2-1$ is divisible by $24$.   I thought I would do the following ... As $n$ is not divisible by $2$ and $3$ then $$n=2k+1\;\text{or}\\n=3k+1\;\text{or}\\n=3k+2\;\;\;\;$$for some $n\in\mathbb{N}$. And then make induction over $k$ in each case.$$24\mid (2k+1)^2-1\;\text{or}\\24\mid (3k+1)^2-1\;\text{or}\\24\mid (3k+2)^2-1\;\;\;\;$$This question is in a text of Euclidean Division I'm reviewing, and I wonder if there is a simpler, faster, or direct this way.