error:brokenCount >0
How can I accept the Microsoft EULA agreement for ttf-mscorefonts-installer?
Where did dedicated.abac.net. come from in my rDNS and PTR records? When is $(p - 1)! + 1$ a power of $p$? A friend asked me this question:     If $p$ is a prime, prove that $(p - 1)! + 1$ is a power of $p$ if and only if $p = 2, 3$ or $5$.   Clearly one direction is obvious, namely that $p=2,3,5$ implies $(p - 1)! + 1$ is a power of $p$.  The other direction is not clear to me. Since by Wilson's theorem $p$ divides $(p - 1)! + 1$ so we need to show that if there are no other prime factors then $p=2,3,5$. Can someone give me a hint for establishing this?  Thanks Why is Linux's filesystem designed as a single directory tree? ubuntu 18.04 how do I install drivers for my NVIDIA GeForce GTX 1050? Using divisibility theorems, prove that if $\gcd(a,b)=1$ and $a|c$ and $b|c$, then $ab|c$.   This is pretty clear by UPF, but I'm having some trouble proving it using divisibility theorems. I was looking at , and if this could be proven, then the solution would follow immediately. Was drafting an email and my senior wanted to type "Planting saplings is our way of saying we care for our Nature". I felt that's wrong English. Shouldn't it be "we care for Nature"? (it makes it a bit impersonal to remove the 'our', but if 'our nature' isn't right, can the cuteness factor of mentioning 'our nature' be preserved?. Which is correct?) a) Determine the number of ways to colour a 1 by n grid using the colours red and white if an even number of squares are to be coloured red.   Note that n is greater than or equal to 1 and the number of red squares could be 0.  I know I must consider the cases of n being even and odd, and determine the sum, from zero to n of the squares being red, where the number of red squares is even. But I just want to make sure I haven’t missed any arrangements by saying a) is $2^{n-1}$ when n is even and $2^{n-1}-1$ when n is odd.  b) Determine the number of ways to colour the squares using red, white and blue if an even number of squares are to be coloured red.  For this case, I can have arrangements including red only, white only, blue only, white and blue only, red and white only, red and blue only, and finally all three colours.  Thank you for any help provided. I would like to open 4 Notepad++ windows at once, in the same pannel. Currently, I am only able to split it into two, and would like to know if there is a plugin that enables 4 views at at same time, or 3.   thanks Pre-1980s Sci-fi movie about killer aliens Persist variables between page loads Creation parameters menu greyed out I recently installed Ubuntu 18.04 and I'm not keen on the desktop environment. I want the desktop env. I used to have in Ubuntu 14.04. How can I get it?  I've attempted to use , but when I try to install the Unity's 7.2.5 version using the command:  apt install unity=7.2.5   it gives me   E: Version '7.2.5' for 'unity' was not found   For sure I need to add a PPA for this, but which one!? Loading multiple CSV files into QGIS 2.10 How can I load multiple CSV files into QGIS with Longitude/Latitude already included in it. I downloaded the &quot;Load Them All&quot; plug-in, however, the result loaded was converted as text files and cannot be visualize on the map canvass. Any help? Are there any available plug-ins that can load multiple CSV file that will work fine in QGIS? A doubt on the definition of limit of a function definition I want to prove the definition of limit of a function from definition (1) to definition (2).  (1) A function $f(x)$ is said to have $f^*$ as the limit as $x$ tends $x^*$ iff for every sequence $\{x_n\}$ with limit $x^*$, the limit $\lim_{n-&gt;\infty}f(x_n)$ exists and is equal to $f^*$. (2) A function is said to have $f^*$ as the limit as $x$ tends $x^*$ iff for each $\epsilon &gt;0$, there exists a $\delta_\epsilon &gt;0$ such that $|f(x)-f^*| &lt;\epsilon \forall |x^*-x|&lt;\delta_\epsilon$  I am confused about the steps. Suppose I am given an $\epsilon &gt; 0$ and $x^*$. I have to show the existence of a $\delta_\epsilon &gt;0$ such that for all $x$ satisfying  $|x^*-x|&lt;\delta_\epsilon$ I can construct a sequence $x_n$ which converges to $x^*$ and $x_n=x$ for some $n \geq N$. Then I can say that $f(x_n)-f^*=f(x)-f^* &lt; \epsilon$. I think I may have made some mistake about the steps.  My main confusion is the following : Suppose I choose $\delta_\epsilon=\epsilon$. Then if a sequence $\{x_n\}$ converges to $x^*$ then $x_n=x$ (where $x$ satisfies $|x-x^*|&lt;\epsilon$) for some $n\geq N$. Now, $\lim_{n-&gt;\infty}f(x_n)$ exists implies there exists an $M$ such that $\forall n\geq M$, $f(x_n)-f^* &lt;\epsilon$. Now, I need to show that for some $n \geq M$ indeed $x_n=x$. How do I show that ? This $M$ and $N$ are different. How do I add a new, valid tag when I don't have enough reputation? I'd like to post a question on StackOverflow, but I think I should be able to tag it with    . Poor me, there is no  tag; There is  and , I'm certainly not sure this is the right thing to do, so figure I'll start here.  Edit Question located here: How to check that a cubic polynomial is irreducible? At which moment does the 'Surprised' state disappear? I have 1-band GeoTIFF file. The color interpretation for band is gray. I want a color table in order to transform my Col.tiff to Col.jpeg or Col.png.  I tried putting a color table in this tiff via a .vrt:  gdal_translate -of VRT  Col.tiff Col.vrt   then adding in the .vrt:  &lt;ColorInterp&gt;Palette&lt;/ColorInterp&gt; &lt;ColorTable&gt;    &lt;Entry c1="0" c2="0" c3="255" c4="240"/&gt;    &lt;Entry c1="0" c2="0" c3="254" c4="240"/&gt;    &lt;Entry c1="0" c2="0" c3="253" c4="240"/&gt;    &lt;Entry c1="0" c2="0" c3="252" c4="240"/&gt; &lt;/ColorTable&gt;   And translate again :  gdal_translate Col.vrt Col.tiff   But it answered:  Warning 1: Unable to export color table to GeoTIFF file.  Color tables can only be written to 1 band or 2 bands Byte or UInt16 GeoTIFF files.   How can I do it?  For information, there is gdalinfo for the Band:  Band 1 Block=55x18 Type=Float64, ColorInterp=Gray   Description = Something   Metadata:     GRIB_COMMENT=Something[p]     GRIB_ELEMENT=TMP     GRIB_FORECAST_SECONDS=0 sec     GRIB_REF_TIME=1401926400 sec UTC     GRIB_SHORT_NAME=SMTHG     GRIB_UNIT=[p]     GRIB_VALID_TIME=1401926400 sec UTC I installed jockey-gtk but how do I run it? zuber@zuber-pc:~$ sudo apt-get install jockey-gtk   Reading package lists... Done Building dependency tree        Reading state information... Done The following packages were automatically installed and are no longer required:   nvidia-common python-xkit Use 'apt-get autoremove' to remove them. The following NEW packages will be installed:   jockey-gtk 0 upgraded, 1 newly installed, 0 to remove and 0 not upgraded. Need to get 0 B/3,158 B of archives. After this operation, 53.2 kB of additional disk space will be used. Selecting previously unselected package jockey-gtk. (Reading database ... 156414 files and directories currently installed.) Unpacking jockey-gtk (from .../jockey-gtk_0.9.7-0ubuntu11_all.deb) ... Setting up jockey-gtk (0.9.7-0ubuntu11) ... zuber@zuber-pc:~$ jockey-gtk The program 'jockey-gtk' is currently not installed. You can install it by typing: sudo apt-get install jockey-gtk   And this not only occur with jockey-gtk. I have same problem with synergy(I did not tried with other software). Is it known problem or am I only one? How do I fix it? Deleting elements from std::set while iterating