Before i buy this laptop, i would like to know other people experience with Ubuntu (and Linux) using it. Can anyone help me?
I have a device on which I would like to install Ubuntu. How do I find out if Ubuntu will work on it?
Concurrent updates to GDAL (to 2.1.3) and QGIS (to 2.18.5) on Linux Mint 18.1 from the Ubuntugis repos breaks QGIS, with a noted dependency for the virtual package gdal-abi-2-1-2 being uninstallable.    The stable Ubuntugis ppa currently supplies GDAL 2.1.0 (gdal-abi-2-1-0) while the Ubuntugis-unstable ppa has been updated to GDAL 2.1.3 (gdal-abi-2-1-3).  Has anyone found a way around this?    Update:  QGIS bug report for those interested is here:     UPDATE 2  The ticket has been closed as fixed. Everything should be back to normal now. Unknown error: '' ("The cache has no package named wine-staging-i386") How many ways can we let people into a movie theater if they only have half-dollars and dollars? My interest in combinatorics was recently sparked when I read about the many things that the Catalan numbers count, as found by Richard Stanley. I picked up a copy of Brualdi's Combinatorics, and while browsing the section on counting sequences I found a nice little puzzle that has definitely puzzled me.     Let $m$ and $n$ be nonnegative integers with $n\geq m$. There are $m+n$ people in line to get into a theater for which admission if $50$ cents. Of the $m+n$ people, $n$ have a $50$-cent piece and $m$ have a $\$ 1$ dollar bill. The box offices opens with an empty cash register. Show that the number of ways the people can line up so that change is available when needed is   $$ \frac{n-m+1}{n+1}\binom{m+n}{m}. $$     I first noted that the first person to enter must be one of the $n$ with a half-dollar. Now the register has a half-dollar change. The second person can be either a person with a half-dollar or a dollar. In the first case, the register will now have two half-dollars, in the second case, the register will now have one dollar bill. So it seems to me that when one of the $n$ people with a half-dollar enters, the number of half-dollars in the register increases by $1$, and when one of the $m$ people with a bill enters, the number of half-dollars decreases by $1$ but the number of bills increases by $1$.   I tried to model this by looking at paths in $\mathbb{Z}^2$. The $x$-axis is like the number of half-dollars, and the $y$-axis is the number of bills. You start at $(0,0)$, and you can take steps forward $(1,0)$ or backwards diagonally $(-1,1)$ corresponding to who enters, but you must always stay in the first quadrant of the plane without crossing over the axes. The goal is to make $m+n$ moves, and I figured maybe the number of such paths is counted by $\frac{n-m+1}{n+1}\binom{m+n}{m}$, but I'm not sure how to show this. I don't know if this observation simplifies the problem at all, as I don't know how to finish up. I'd be happy to see how this problem is done, thank you. $\lim\limits_{n \to \infty} \frac{a_n}{b_n}=l$ ; Prove $\sum\limits_{k=1}^\infty a_k$ converges iff $\sum\limits_{k=1}^\infty b_k$ converges. Written, in Ex.8 Ch.9.1 of the book Advanced Calculus by P. M. Fitzpatrick :     Suppose that $\sum\limits_{k=1}^\infty a_k$ and $\sum\limits_{k=1}^\infty b_k$ are series of positive numbers such that $$\lim_{n \to \infty} \frac{a_n}{b_n}=l \ \ \ \text{and} \ l&gt;0.$$ Prove that the series $\sum\limits_{k=1}^\infty a_k$ converges iff the series $\sum\limits_{k=1}^\infty b_k$ converges.   Am I correct by the following (sketch of) proof? :  1- For a given $\epsilon_1$ there is $N_1$ such that $\left|\frac{a_n}{b_n} - l\right| &lt; \epsilon_1$ for all $n \ge N_1$.  2- Since the series $\sum\limits_{k=1}^\infty a_k$ converges, for a given $\epsilon_2$ there is $N_2$ such that $\left|b_{n+1}+\dots+b_{n+k}\right|&lt; \epsilon_1$ for all $n \ge N_2$ any for all natural numbers $k$.  3- Define $N = \max {\{N_1,N_2}\}$.   4- From Step (1), $a_{n+k} &lt; (\epsilon_1+l) b_{n+k}$ for all $n \ge N$ any for all natural numbers $k$. [Also, $a_i$'s and $b_i$'s are all positive]. Thus $a_{n+1}+\dots+a_{n+k} &lt; (\epsilon_1+l) (b_{n+1}+\dots+b_{n+k})&lt; \epsilon_3$. Then the convergence of the series $\sum\limits_{k=1}^\infty b_k$ implies the convergence of the series $\sum\limits_{k=1}^\infty a_k$.  5- For the reverse implication, we use the fact that $\lim\limits_{n \to \infty}\frac{a_n}{b_n}=l \iff \lim\limits_{n \to \infty}\frac{b_n}{a_n}= \frac{1}{l}= l' &gt;0$ and repeat the process this time for a and b exchanged.   6- The Quotient Property For Sequences hold for a nonzero limit in the denominator, but since the limit in the numerator also is zero so we may use the The Quotient Property For Sequences.    Thanks. OpenSSL and error in reading openssl.conf file How to delete entry in Auto Complete in Microsoft Edge How do I delete an unwanted entry in AutoComplete in Microsoft Edge?  I have tried everything including highlighting with the down arrows and nothing works. Is it possible to remove a terminal command? For example, if there was a command call lookup (not an alias), how would I go about removing it? Preventing LibreOffice from using smart quotes (“ ”) instead of (dumb) straight quotes? I use LibreOffice Calc to make lists of programs with different parameters to run on an hpc cluster. For each batch of commands I must do a find and replace on the smart quotes, as they cause errors in command line arguments. It would be nice to cut this step out of my work flow. Does anyone know how I might change the default punctuation used?  Edit: Apparently the title font transforms dumb quotes into smart quotes.  Smart quotes have a different symbol depending on if they are at the start or end (“ ”)  Dumb quotes use the same symbol for the start and the stop ( " ) Passing custom string into a Salesforce email template. Why do we need a waveguide in a microwave oven? Why do we need a waveguide to move microwave power from the magnetron to the microwave cavity? Can't we just push magnetron antenna into the cavity? Why does it have to go through a waveguide? Test Class for a Custom Controller In the following figure prove that: $AK||BC$ In arbitrary triangle $ABC$, let $G$ be centroid and $AH$ be a height.We extend $HG$ beyond $G$ to intersect circumcircle at $K$.Prove that $AK||BC$       I connected midpoint of $BC$ to $K$ and $A$ to show $MA=MK$ but failed... How to reverse name and first name? With biblatex and verbose-trad2 style, I would like to reverse the order of the last name and the first name for inline references.  The default behavior is:     John DOE, Title, place : publisher, year   for inline references (in my case, in a footnote with footcite command) and:     DOE, John, Title, place : publisher, year   in the bibliography at the end of the document.  I would like to have both inline and final references in the following format (similar to the bibiography style).      DOE, John, Title, place : publisher, year   P-S : There are some close questions (like ) but only about the final bibliography (and no inline references). \DeclareNameAlias{sortname}{last-first} works only for the ending references (not inline ones). I've recently decided that I just have to finally learn C/C++, and there is one thing I do not really understand about pointers or more precisely, their definition.  How about these examples:   int* test; int *test; int * test; int* test,test2; int *test,test2; int * test,test2;   Now, to my understanding, the first three cases are all doing the same: Test is not an int, but a pointer to one.  The second set of examples is a bit more tricky. In case 4, both test and test2 will be pointers to an int, whereas in case 5, only test is a pointer, whereas test2 is a "real" int. What about case 6? Same as case 5? RSA is not designed to be used on long blocks of plaintext like a block cipher, but I need to use it to send a large (encrypted) message.  How can I do this? Tall curly brace I would like to put a tall (long) left curly bracket on the left side of the following:  \documentclass[12pt]{article}  \begin{document}  \noindent c: $\{$1, ..., n$\}$ $\rightarrow$ $\{$1, ..., n$\}$, such that  \hspace{20 mm}  \noindent c($a_i$) = $a_{i+1}$ for 1 $\le$ $i$ &lt; $l$  \hspace{20 mm}  \noindent c($a_l$) = $a_1$   \end{document}   Please let me know if you can help. Thanks! OneDrive for Windows 10 - Remove logged out account Coconut Water from White vs Brown Coconuts What does 'condescending' exactly mean? I'm really confused about the meaning of the word 'condescending'. Online dictionaries define it as bossy/disdainful, which fits with...    But I find other usages where being condescending is obviously considered a good thing, perhaps more like being humble, or equal, rather than superior...    (and  of "condescending and friendly" in Google Books)  What's going on? Does this word really have two almost opposite meanings? I am trying to implement the following K-map with a table    AB C     00 01 11 10       ______________     0| 1  0  1  0     1| 0  1  1  0   I implemented it like this:   \begin{table}[htdp] \begin{center} \begin{tabular}{c|c|c|c|c|}  &amp;00 &amp; 01&amp; 11&amp; 10 \\ \hline 0&amp;1&amp;1&amp;1&amp;1\\ 1&amp;0&amp;0&amp;0&amp;0\\ \end{tabular} \end{center} \label{default} \end{table}   However on the top row I have vertical lines that I'd like to not see. I went with this approach because if i was to use a one row with the information so that I wouldn't have to worry about aligning the headings. So is there a way I can get the vertical lines not to appear in the heading row?