When I browse to different websites using Firefox I regularly get a Firefox pop-up asking me to give the website permission to send me notifications.    I have 3 options here   Allow Notifications Not Now Never Allow   It appears that "Never Allow" is only for the specific site - if I go to another site the pop-up will appear again for that site.  I don't use the notification feature and would like the pop-up turned off completely for all sites, but am unsure if this is possible.  In the Firefox options, under Privacy and Security, there is a Permissions section that includes Notifications:    However choosing "Settings..." here just shows me the sites I have already Allowed or Not Allowed, and doesn't give an option to turn off the pop-up.  The Pause notifications until Firefox restarts does not stop these pop-ups from appearing, it just mutes notifications that you have previously allowed.  And clicking "Learn more" tells me about the notifications and how to add them to my own website, but not how to disable them in Firefox.  How can I turn off this pop-up so that I am no longer asked for permission for websites to send notifications?
If I'm on a page that has web notifications (like Slack or others), Firefox asks me if I want to enable them. However, my choices are "Yes" or "Ignore for now". The problem is, if I select "Ignore", every time there is a notification it asks me again. This is incredibly annoying.   How do I disable this completely? (I would accept disabling this feature entirely if that's easiest.)
How can I find the number of partitions of $n$ into exactly $k$ distinct parts, where each part is at most $M$?  The number of partitions $p_k(\leq M,n)$ of $n$ into at most $k$ parts, each of size at most $M$, is given by the generating function: $$  \binom{M+k}{k}_{x} = \prod_{j=1}^{k}\frac{1-x^{M+k-j+1}}{1-x^j}= \sum_{n=0}^{kM} p_{k}(\leq M,n) x^n $$  For the number of the partitions $p_k(\mathcal{D},n)$ of $n$ into at most $k$ parts there is the recurrence relationship: $$   p_{k}(\mathcal{D},n) = p_{k}(\mathcal{D},n-k) + p_{k-1}(\mathcal{D},n) $$  But what, if I want to count only the partitions with distinct parts and restricted number of parts and restricted part size?  Update: Now I know the generating function for the number of distinct restricted partitions $p_k(\leq M, \mathcal{D},n)$ of $n$ into exactly $k$ distinct parts, all at most $M$ is $$    \prod_{j=1}^{M} (1+xq^{j}) = \sum_{k,n=0}^{\infty}p_k(\leq M, \mathcal{D},n)x^{k}q^{n} $$ and there is also a recurrence relation $$    p_k(\leq M, \mathcal{D},n) =         p_{k-1}(\leq M-1, \mathcal{D},n-k) +         p_k(\leq M-1, \mathcal{D},n-k) $$ How can I prove this? Could you recommend a book, where I could read about this? Proving that the triangle inequality holds for a metric on $\mathbb{C}$ Show that $(X,d)$ is a metric space where $X =\Bbb C $ and the distance function is defined as:   $$d(x,y) = \frac {2|x-y|}{\sqrt {1+|x|^2} +  \sqrt {1 + |y|^2}}, \text{ for } x,y \in \Bbb C.$$   I have done the proof of the first two propositions for being a metric, but I'm having a problem in proving the triangle inequality. Install 18.04 server without network connection The latest version of Ubuntu server (18.04) seems to demand network configuration and refuse to boot without it. I have no desire to connect the server in question to the internet for anything, and have installed previous versions of Ubuntu server without network no questions asked.  Is a network connection an absolute requirement for the latest version of Ubuntu server? Or is there something I'm missing?  The installation cannot proceed past the network configuration page unless an ethernet connection is active, by my current estimates. I have no ethernet network within range of the machine so can't test it on an internet-less network. I only have WiFi within immediate range (which does have internet access) but it won't recognise the device and it should be simpler to get the installation to happen without any updates than to go to the effort of finding the drivers to support the WiFi adapter.  Note that this is NOT a duplicate of  since the new installer seems to be the real problem here. Sharepoint Online/O365 custom fonts This question and answer is a response to a request from Joseph Wright.   Why shouldn't I use getnonfreefonts to install additional fonts? Why shouldn't I use updmap when installing or removing fonts?     Background  There are a number of questions on the site concerning problems caused by people installing additional fonts and using updmap to update the 'map' files on which TeX depends.  One common cause of these problems is the use of getnonfreefonts.  Other causes are the use of other font installation scripts or executing updmap directly. Prove that the minimum number of cycles is $m-n+1$ The question I have is:   Prove that the minimum number of cycles is $m-n+1$ in a connected graph. Where one cycle is a path that starts that begins and ends at the same vertex. Where $m$ is edges and $n$ is the vertices.   I have no idea where to start. A few hints would be appreciated. Please do not provide me with the answer. This question is from [Number Theory George E. Andrews 1-1 #3].     Prove that $$x^n-y^n=(x-y)(x^{n-1}+x^{n-2}y+\ldots+xy^{n-2}+y^{n-1}).$$   This problem is driving me crazy. $$x^n-y^n = (x-y)(x^{n-1}+x^{n-2}y+\dots +xy^{n-2}+y^{n-1)}$$  $(x^n-y^n)/(x-y) =$ the sum for the first $n$ numbers and then I added $(xy^{(n+1)-2}+y^{(n+1)-1})$ which should equal $(x^{n+1}-y^{n+1})/(x-y)$ but I can't figure it out    This is a similar problem in the book and I tried this method but it wasn't working out      $\quad$Thereom $\bf1$-$\bf2$: $\,\,\,\,$ If $\,x$ is any real number other than $1$, then $$\sum_{j=0}^{n-1}x^j=1+x+x^2+\ldots+x^{n-1}=\dfrac{x^n-1}{x-1}.$$    $\quad$Remark: $\displaystyle\sum_{j=0}^{n-1}A_j$ is shorthand for $A_0+A_1+A_2+\ldots+A_{n-1}.$     $\quad$Proof: Again we proceed by mathematical induction. If $n=1$ then $\displaystyle\sum_{j=0}^{1-1}x^j=x^0=1$ and $(x-1)/(x-1)=1$. Thus the theorem is true for $n=1$.  $\quad$ Assuming that $\displaystyle\sum_{j=0}^{k-1}x^j=(x^k-1)/(x-1)$, we find that $$ \eqalign{ \sum^{(k+1)-1}_ {j=0}x^j &amp; = \sum^{k-1}_ {j=0}x^j+x^k=\dfrac{x^k-1}{x-1}+x^k \\ &amp;= \dfrac{x^k-1+x^{k+1}-x^k}{x-1}\\ &amp;= \dfrac{x^{k+1}-1}{x-1}. }$$   Hence condition $(\rm ii)$ is fulfilled, and we have established the theorem.    $\quad$Corollary $\bf1$-$\bf1$: $\,\,$ If $\,m$ and $n$ are positive integers and if $m&gt;1$, then $n&lt;m^n.$ How do I perform a Perl substitution on a string while keeping the original? In Perl, what is a good way to perform a replacement on a string using a regular expression and store the value in a different variable, without changing the original?  I usually just copy the string to a new variable then bind it to the s/// regex that does the replacement on the new string, but I was wondering if there is a better way to do this?  $newstring = $oldstring; $newstring =~ s/foo/bar/g; I think it would be very useful.  I have a question that I have an open bounty on. Putting up said bounty brought my reputation below the point where I am allowed to comment on other peoples' posts. It's so frustrating not to be able to comment and give feedback on the answers given!  Especially since it would be helpful, for them, me, and the readers, to know particularly what is good and isn't good about their answer, and therefore give some better guidelines to future answerers on how they can win the bounty. How do I complete "Find the Bitizen"? In tiny Death Star, Palpatine has given me the mission "Find the Bitizen" with the text "Working for tips is acceptable. Find 1 Bitizen(s)."  I assumed I had to wait for one of the events where you have to find a "rebel scum" and tap on it to get rid of. One of those events finally popped up but it did not complete the mission.   How do I complete this mission? Are there experiments that are banned from being done at the LHC? Extruding Vector Files in Blender I am sure this has been discussed quite a few times, but I found a tutorial recently doing the exact same thing as I did, but in my case my logo is messing up!  Here is the link to the workflow:   This is what it looks like after adding the solidify modifier:   I already recalced the normals of my spline, but besides that it messes up my spline shape, it had no effect.  Any suggestions on how to fix it? I've found some code that could add a modifier but none can set parameters like Octree. Does anyone know the location of this login hotmail background? Xubuntu or Lubuntu on a Mac mini? My Mac mini doesn't have sufficient hardware for Ubuntu 11.04 (specifically Unity I think), and so I have to use the classic environment, which is fine, but it seems to run slower on 11.04 (I'm upgrading now to 11.10).  However, I heard  that if it runs slow I should use Xubuntu or Lubuntu.   So my question is:    What is the best way to upgrade from Ubuntu 11.10 to Xubuntu or Lubuntu and which one would be better for a late 2005 model Mac Mini PPC? I have a notebook with no Scroll Lock key (or any shortcut using the 'Fn' key).  Somehow Excel 2010 got the Scroll Lock on. I see it left down in the status bar and now I can't navigate through cells using the arrow keys, which is pretty annoying. It wasn't turned on some hours ago, so I think I must have hit some Scroll Lock toggle shortcut in Excel 2010 by mistake.  Anyone knows what hot to turn off Scroll Lock in Excel (shortcut or menu option)? Distribution of the digits of Pi Can anything be stated about the distribution of the digits of Pi, i.e., if I were to sample n digits of Pi, can anything be said about the probability to observe certain digits, or is there any reason to assume that they would not be evenly distributed? This is purely a curiosity question. How to call child component controller function/helper from Parent Component Controller Possible Duplicate:          I sometimes work outside and are using a 3G usb connection with quite a limited data allowance.  I want some fast and easy way to temporary block all incoming and outgoing traffic in windows firewall except for chrome to be sure that Dropbox or something else is not using up my data.  I've tried to set Windows Firewall Properties to "Block" which gives "Outgoing/Incoming connections that do not match a rule are blocked".  Problem: There are many allow-rules like Dropbox that would "override" the block. And I don't want to disable all rules and then enable them, since there are some that I want disabled even when I get to the office...  Any suggestions?  Thanks! limit of the sequence $a_n=1+\frac{1}{a_{n-1}}$ and $a_1=1$