Since when going after the road-map, firefox 57 will be released on 14.11.207.   Now my problem is that I use a whole lot of legacy add-ons I want to keep working with.   So how can I prevent firefox from updating via the repositories?
Because of  I'd like to prevent apt-get upgrade and Update Manager from updating the "libgtk2.0-0" package.   How can this be achieved?
Can helium disappear from Earth? Helium is lighter than air, so it should fly off from Earth. Is it possible that in the future we will run out helium? Upper bound on the number of charts needed to cover a topological manifold If $M^n$ is a compact topological manifold (not necessarily with additional structure), is there an upper bound on the number of charts needed to cover $M$ ? Does this bound depend on the dimension of $M$ ?  Thanks in advance...  Cheers How to graphical remote control an Ubuntu server? I've tried googling and .  I'm connecting my Windows 7 SP1 machine to an Amazon EC2 Ubuntu cloud server, Ubuntu 10.04 LTS. What I have done is   Enabling Remote Desktop in Ubuntu (, ) Connect to my server using 1)  and 2)  &ndash; I don't use  since it contains viruses.   But all of those result in Connection failed. I'm giving up!  More Detail Ubuntu server to remote to: Ubuntu 10.04 LTS (codename lucid)  My Windows: Windows 7 SP1 Is true that $\sum_{k=1}^n\frac{[kx]}{k}\leq[nx]$, for every $x\in\mathbb{R}$ and for every $n\in\mathbb{Z}^+$? Is true that $\displaystyle\sum_{k=1}^n\dfrac{[kx]}{k}\leq[nx]$, for every $x\in\mathbb{R}$ and for every $n\in\mathbb{Z}^+$?  My work:  Let $x\in\mathbb{R}$ be given. For every $k=1,\dots,n$, define $i_k\in\{0,1,\dots,k-1\}$ such that  $$ [x]+\frac{i_k}{k}\leq x&lt;[x]+\frac{i_k+1}{k}\hspace{20mm} (*). $$  On one hand, we have that $[kx]=k[x]+i_k$ for every $k=1,\dots,n$.  So  $\displaystyle\sum_{k=1}^n\dfrac{[kx]}{k}=n[x]+\displaystyle\sum_{k=1}^n\dfrac{i_k}{k}=[nx]+\displaystyle\sum_{k=1}^n\dfrac{i_k}{k}-i_n$  Thus  $$\displaystyle\sum_{k=1}^n\dfrac{[kx]}{k}\leq[nx]\Leftrightarrow\displaystyle\sum_{k=1}^n\dfrac{i_k}{k}\leq i_n\,.$$  On the other hand, from $(*)$ is direct that $i_k=[k(x-[x])]$. Thus  $$\displaystyle\sum_{k=1}^n\dfrac{[kx]}{k}\leq[nx]\Leftrightarrow\displaystyle\sum_{k=1}^n\dfrac{[k(x-[x])]}{k}\leq [n(x-[x])]\,.$$  In other words, we can assume that $x\in[0,1)$.   Now the questions is:  Is true that $\displaystyle\sum_{k=1}^n\dfrac{[kx]}{k}\leq[nx]$, for every $x\in[0,1)$ and for every $n\in\mathbb{Z}^+$?  Any simpler approach? Any thoughts? Does removing an iPhone from my icloud account also erase the data? 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! How do I know what symbols/characters are available in a font package? I usually use xelatex, but I'm exploring pdflatex now. When loading specific fonts in xelatex, I can always know what characters the font has available, since I can inspect the font file in any font viewing program, or I can find out the hard way by just entering the unicode and see if the character is displayed in the output. But how does this work with a font package?  Say, for instance, that I would like to use phonetic symbols in the  font. How do I know whether the font has phonetic symbols (I assume it does), and how do I know what command I need to type in order to make them appear? My only resource is , but this only tells me what characters/commands there are available in LaTeX2e by default (depending on the font encoding), and what symbols I can find in specific packages. Phonetic symbols, for instance, are said to be in the tipa package. Does that mean I am locked to tipa if I want to use phonetic symbols with pdflatex?  Here's a pointless MWE:  \documentclass{article} \usepackage{gentium} \begin{document} Please give me some phonetic symbols here? \end{document} Wifi not working in Ubuntu 14.04.3 Diagram Software I study computing on an advanced level and I need a program that will make it easier to create flowcharts and other diagrams efficiently. I don't need too many features; I just want something that works! I'm aware that there are many website that do exactly what I need but most of the times when I need to draw diagrams I don't have access to the internet How can I intercept XMLHttpRequests from a Greasemonkey script? Why doesn't Ubuntu 16.04 in Windows have ubuntu.exe? I hope this is not a repeat question. I tried searching but couldn't come up with the right search words for this question.  I see the following in the sidebar of my flagging history tab:    I notice that I have raised 28 helpful flags from my user page, but I see "27 deemed helpful" and "1 deemed helpful". What is the difference between the top half and the bottom half of the entries in the flagging history sidebar? How should I interpret the results displayed in the sidebar? Redefining "cited on" string (and others) in biblatex Generator of rational functions unchanged under $\sigma(X) = X + 1$ Let $L = K(X)$ be the field of rational functions over a field $K$ with characteristic $p &gt; 0$, and let $\sigma \in \operatorname{Aut}_K(L)$ with $\sigma(X) = X + 1$.   Show that $G = \left&lt;\sigma\right&gt;$ is finite, and determine a generator of $L^G = \{ f \in L: \rho(f) = f$ for all $\rho \in G \}$ over $K$.    My solution so far: $G = \left&lt;\sigma\right&gt;$ is finite because char $(K) = p &gt; 0$ and therefore $\sigma^p (X) = X + p = X $.  A rational function unchanged under $\sigma$ will also be unchanged under any $\sigma^n$, so we don't have to worry about powers of $\sigma$ I think.   Any ideas for finding a generator? Thanks. Support showing image in original size in overlay I don't know what exactly it's called, by cache refresh I mean, refresh the page after clearing its cache. I don't want to clear the entire browser cache.  I can't seem to cache refresh my pages. In Firefox, I know it to be Shift+Refresh.  In Chrome, I've tried Ctrl+R, Ctrl+Refresh, Alt+Refresh, Shift+Refresh but none of them work. New three-tiered badge idea: Explainer →Refiner → Illuminator The difference between a poor or meh question and a stellar question can often simply be someone understanding it and providing it a great answer. I can't begin to count the number of times I've justified re-opening a question as a moderator by saying:     Look at the answer it got, though. This isn't something we want deleted, this is something we want fixed, because it's obviously valuable. Someone with domain knowledge can easily edit that question based on the answer it received.   This doesn't only apply to borderline-poor or poor questions – sometimes a good edit means the difference between 100 and 10,000 people finding something through typing things into Google. Good titles are hard.   We think we've come up with a way to provide incentive for good, opportunistic edits to happen more often, ideally without questions needing to go through closure or collecting a centimeter of dust before they do. What if we simply rewarded folks that answered and edited questions with a special, relatively difficult to earn badge?  Let's say that you answer something, and:   You edit the question 12 hours before or after answering it. This allows you to edit now, answer later &mdash; or answer now and edit later, when you have the time. Your edit isn't rolled back, or outright rejected if it was a suggested edit The question is not closed for any reason, even simply being a duplicate Your answer has a score of 1 or higher   &hellip; then you've done something that we probably want to recognize. You understood something, you provided the knowledge that you have, and then you provided an edit to make sure that more people in need of this knowledge can find it, while raising the overall quality of the site.  Here's the proposed tiers for the badge (within the above stated criteria):   Explainer (Bronze): Answered &amp; edited 10  questions Refiner (Silver): Answered &amp; edited 50 questions Illuminator (Gold): Answered &amp; edited 500 questions   We think this is going to be pretty hard to game. You can't go leaving streaks of terse snark all over the place on questions you know are going to be closed anyway, and junk edits aren't going to fly.  We're talking about rewarding folks that take a tiny bit more time out of their day just to write a more descriptive title so that folks can find the awesome answer that they wrote. Just doing that alone can make a big difference. Sure, it's a tad hard to get at the gold level, but it's supposed to be. If you routinely edit questions that you answer and have done so for some time, you'd probably get it the day we roll it out.  While this is technically something that we came up with on the quality initiative ( | ) &mdash; this badge could be earned on all of our sites.  What do you think? What did we miss? What could be better about the idea? I am reading a paper and have questions about the details of the procedure described. I have read other papers by the same team but they don't explain too much about that procedure anyway. I think it might be common, but my supervisor doesn't know it too.  I am stuck and I want to get out of it. As a student working on my master thesis, can I email the contact author for the manuscript cold out, or should I ask someone to contact him for me? I would ask my supervisor but I don't want it to imply that I'm avoid taking initiatives when I could do it on my own. Android adware lets me opt out: is it safe? Recently my mom's phone running Android 5.0 has been infected with a piece of adware:    At first we thought this was caused by applications, but as you can see here, only the Google/METROPCS Internet browser is running.  In the photo, there is a button that reads 'opt out'. So I clicked on it and it took me to this link at http://tracker.tpc.re/optout/mobile/:    BUT both of these options smelly fishy. For starters, the manual app is not a download link in the play store but an APK, making it seem like a virus. The second (manual) as for sensitive information, which could harm me even more.   Which one of these options do I choose? Are they legit or do I have to do get rid of it another way? Who is doing the normalization of wave function in the time evolution of wave function? In the Schrödinger equation, at any given time $t$ we should jointly add another sub equation, like $$||\psi_t(x)|| = 1$$ where $\psi_t(x) = \Psi(x,t)$, and then try to solve the two equations simultaneously. Why not? I know it does not yield, but I am always baffled, who is doing the normalization of the wave function? Observers, the system, the measuring process, God?