I've been using Ubuntu 18.04 for about 3 days now and so far it runs smoothly. I now need to install a VPN for my work, and I got the following files from the sysadmin:   ca.crt VPNConfig.ovpn   I first ran sudo apt install openvpn. After that I wanted to install it using the GUI. So I went to the settings app and under "Network" I tried adding a new VPN. It gives the option to "Import from a file". So I selected the VPNConfig.ovpn file, but it says it can't import the file. I also tried importing the ca.crt file and importing the zip in which the two files came, but that didn't work either.   Could anybody help me out as to how I can make this VPN work?
I'm trying to setup OpenVPN using NetworkManager. The GUI seems buggy and unresponsive. Are there any other tools for setting up a VPN client?
Is there a shortcut for switching between these three modes? proof relating to limit definition of e I'm studying the book A Primer for the Mathematics of FinancialEngineering, along with it's solution guide. I've ran into trouble with the solution to question 7 in chapter 1.    The problem is:  Show that $(1+\frac{1}{x})^x &lt; e &lt; (1+\frac{1}{x})^{x+1}$ .   Specifically, I'm having trouble with one step in the solution.    It says that  $$x\ln\left(1+\frac{1}{x}\right)&lt;1&lt;(x+1)\ln\left(1+\frac{1}{x}\right)$$  can be written as   $$\frac{1}{x+1} &lt;\ln\left(1+\frac{1}{x}\right)&lt;\frac{1}{x}, \forall \ge 1.$$  How can the first equality (or is it inequality?) be written as the second? "does not contain a static 'main' method suitable for an entry point" Galois group of the product of two fields being the product of Galois groups? I'm just wondering if the following theorem is reasonable and whether the proof is makes sense or not? Also I have an application of it which I was trying to do earlier but I made a lot of mistakes so I would be very grateful if anyone would give some comments on this in case I have some very strong misunderstandings about Galois theory.    Theorem Let $E_1$ and $E_2$ be Galois field extensions of $F$ with trivial intersection ($E_1 \cap E_2 = F$), then $E_1 E_2$ has Galois group $\text{Gal}(E_1/F) \times \text{Gal}(E_2/F)$.  Proof   $E_1$ and $E_2$ are splitting fields (over $F$) of some polynomials $f_1$ and $f_2$ so $E_1 E_2$ is the splitting field of $f_1 f_2$ over $F$ and therefore it is Galois and we are justified using the "Gal" notation. Let $\sigma_1 \in \text{Gal}(E_1/F)$ and $\sigma_2 \in \text{Gal}(E_2/F)$ then by the fundamental theorem of Galois theory we can lift these both into elements of $\text{Gal}(E_1 E_2/F)$. The claim is that $\sigma_1 \sigma_2 = \sigma_2 \sigma_1$, to see this consider an element $\alpha \in E_1$, we have both $\sigma_2 \alpha = \alpha$ and $\sigma_2 \sigma_1 \alpha = \sigma_1 \alpha$ because it is invariant with respect to $\sigma_2$, but we can combine these equalities to get $\sigma_1 \sigma_2 \alpha = \sigma_2 \sigma_1 \alpha$. Both groups $\text{Gal}(E_i/F)$ ($i = 1,2$) are included in $\text{Gal}(E_1 E_2/F)$ and the degrees say there are no more elements, furthermore since they commute we can conclude $\text{Gal}(E_1 E_2/F) = \text{Gal}(E_1/F) \times \text{Gal}(E_2/F)$.     So hopefully that theorem is, if not correct, fixable.. and can be used to prove that $\mathbb Q (\sqrt{a_1},\sqrt{a_2},\cdots,\sqrt{a_n})$ has Galois group $C_2^m$ ($m \le n$) over $\mathbb Q$? I am currently working on a model which takes two parameters and produces a measurement statistic. Think of it as Z = f(X,Y).   Z is a matrix of my statistics and I am creating a surface plot of it in matlab. Basically, I am looking for a mathematical/analytical way of determining if the surface is smooth, or if it is jagged. Do large values tend to be clustered together or are they dispersed throughout the matrix? - that is my question. Basically, how mixed up are the values of my matrix?  I need to run the model over different parameter sets and I want to be able to analytically determine which one of my surfaces is the smoothest, has the greatest clustering of large values, and ideally, has no negative values.   Any help will be greatly appreciated and please let me know if you need any further information.   Cheers How to define orbital angular momentum in other than three dimensions? Characterization convex function. Let $f:[0,1]\rightarrow\mathbb{R}$ be a continuous function such that for all $a,b\in [0,1]$ with $a&lt;b$ $$f\left(\frac{a+b}{2}\right)\leq\frac{1}{b-a}\int_a^b f(x)\,dx.$$ How to prove that $f$ is a convex function? Thank you for your help. My father wrote some papers on cosmology that remained unpublished at the time of his death.  I have been looking for a publisher for them. I contacted IOP publishing but they said that, while Dad’s writings were interesting, they were not ready for publishing in any of their journals. For example, they need a reference list citing other current published research on the same topic.  I am not a scientist and have no idea how to do this. Where can I get help with this? Would something like  be a good idea? Hypothetically, should I pay off the smaller + higher interest rate loan first, or the larger + higher absolute interest cost? I have this hypothetical situation on my mind and I am not sure which is the best solution. Given:  Loan 1: $340,000 at an interest rate of 1.69% per year Loan 2: $40,000 at an interest rate of  3.6% per year  I have a fixed amount available to pay these, let's say, $1,500 monthly and I can decide how much I want to pay each one (I could pay 750/750, 1000/500, 1500/0 for instance). I do not have a time limit to pay these. My question: What is the optimal way to pay these? What I always heard is: pay the debt that has the highest interest first. This would lead me to a solution: pay loan 2 as fast as possible. But the total amount of interest on 340,000 is higher (in this case, $5780 annually) than the amount over $40,000 (1440, in this case), so, to me, it feels I should pay the Loan 1 first. I would love to run some simulations, but I have no idea how to calculate these things (I don't even have a clue on how to research it). ps: this is really a hypothetical situation, I am not getting such loans without being able to calculate it, don't worry ;) Recursively list files with file names, folder names and permission Are there dextral/sinistral higher animals? For example, almost every dog I've met in my life (more than 20 subjects) uses their right paw touching one while asking for attention. Can it be used as a criterion for calling them dextral? If not, what?  However, I realize that even those dogs who live in the street might get influenced by dextral people:     There is no domestic animal which has so radically altered its whole   way of living, indeed its whole sphere of interests, that has become   domestic in so true a sense as the dog (Konrad Lorenz)   Is there any research about it? Is $\mathbb{R}$ a subset of $\mathbb{R}^2$? Is it correct to say that $\mathbb{R}$ is a subset of $\mathbb{R}^2$? Or, put more generally, given $n,m\in\mathbb{N}$, $n&lt;m$, is $\mathbb{R}^n$ a subset of $\mathbb{R}^m$?  Also, strictly related to that: what is then the "relationship" between the set $\{(x,0)\in\mathbb{R}^2,x\in\mathbb{R}\}\subset\mathbb{R}^2$ and $\mathbb{R}$? Do they coincide (I would say no)? As vector spaces, do they have the same dimension (I would say yes)?  If you could give me a reference book for this kind of stuff, I would really appreciate it.  Thank you very much in advance.  (Please correct the tags if they are not appropriate) JavaScript: Bitwise shift of long long number I need to bitwise shift a value 64 times in JavaScript. But JavaScript starts rounding after 32.  For example:  for(var j = 0; j &lt; 64; j++) {     mask = mask &lt;&lt; 1;     console.log(mask); }   This prints value from 0 to 1073741824 but then rounds of and starts printing 0. How to install and run CPUSim 4.0.11 on Ubuntu 18.04 LTS? I'm going according to the steps mentioned on the cs colby .  First, I installed java on my system by typing the following commands-  sudo add-apt-repository ppa:linuxuprising/java sudo apt-get update sudo apt-get install oracle-java10-set-default sudo apt install oracle-java10-set-default     Then, according to the instructions, I downloaded the .zip file, extracted it and then in the terminal typed   java -cp .:richtextfx-fat-0.6.10.jar:reactfx-2.0-MR.jar -jar CPUSim-4.0.11.jar   But this didn't work.  of command 1 terminal.  Here is a screenshot of all the files that are there in the CPUSim folder,   On observing the names of the folders present, I thought that the previous command was wrong. So I tried the following ones,  java -cp .:richtextfx-fat-0.6.10.jar:reactfx-2.0-M4.jar -jar CPUSim-4.0.11.jar java -cp .:richtextfx-0.6.10.jar:reactfx-2.0-M4.jar -jar CPUSim-4.0.11.jar   But none of them seems to work. Now when I click on the CPUSim-4.0.11.jar file, nothing happens. I have just switched to Ubuntu from Windows 10, and have a very little knowledge about how things work here. Please tell me how I could install and run CPUSim 4.0.11 on Ubuntu 18.04 LTS. Let $n&gt;0$ and assume that $\chi^{(n)} \in \mathrm{Irr}(G)$ for every $\chi \in \mathrm{Irr}(G)$. Show that $G = H \times A$, where $A$ is abelian and $(|H|, n) = 1$.  $\chi^{(n)}$ is defined by $\chi^{(n)}(g) = \chi(g^n)$. $\mathrm{Irr}(G)$ is the set of all irreducible characters of $G$.  Here are the hints in the book:   Let $d = (|G|,n)$. Show that it is no loss to assume that $(|G|/d,n) = 1$. Let $A = \bigcap_{\chi \in \mathrm{Irr}(G)} \mathrm{ker} \chi^{(n)}$. Show that $A = \{g \in G | g^n=1\}$ and $|A| = d$. Let $H = \bigcap \{\mathrm{ker} \chi | \chi \in \mathrm{Irr}(G), \chi^{(n)} = 1_G\}$. Show $|G : H| = d$.   Hint 1 and 2 are easy, and it is easy to deduce the result from the hints. As for hint 3, I have proven that $\{ g \in G | (o(g), n) = 1 \} \subseteq H$, and that $|G : H| \mid d$. And I am stuck here.  Can anyone help me? Setting up different application instances under one DNS I would appreciate it if someone could refer me to a proof (or simply give one here) for the statement in the title. That is:  If $k&lt;n$, then every $k-$dimensional subspace of $\mathbb{R}^{n}$ has $n-$dimensional Lebesgue measure zero.  I've seen some proofs that use Sard's lemma but I'm not really familiar with that subject and I've never seen a proof of said lemma so I'd appreciate a proof that doesn't use it if possible.  Thanks in advance! Switching from MTB to road handlebars In Monopoly, Is it OK for a third party to make a trade with a player who is about to lose? I play with some serious board gamers, but we have neglected Monopoly for a number of years, so our knowledge is mostly based on high school &amp; house rules.  We played last week and enjoyed it, but there was a piece of contention. There are times where we decide that we don't like one of our friends for some reason and don't want them to win (i.e. we landed on their property a bunch, or they refused to make a deal, etc.).  So when player 1 has some property and player 2 lands on it and cannot pay the rent their assets (houses/hotels get liquidated), their property gets transferred to the other player. (Please correct me if I'm wrong.) In this case, though, player 3 "traded" the amount of money owing for a piece of property (way overpaid). In this case they did it so that player 1 would not get the properties. Player 2 had no chance of winning the game (all properties mortgaged, no cash to speak of and many of the other properties with 3+ houses/hotels on them).  To summarize: Is it OK for a third player to purchase/trade property or cash to/from a player who is about to lose? Why does the area of a bar in a histogram represent the frequency of that particular class In a bar-graph, the height of the bars represent the frequency of a particular category but it is counter-intuitive that in a histogram, instead of the height of the bar(which represents the frequency density), the area of the bar represents the frequency of the particular class. Why is this so?