Which is the best or preferred flavour of Ubuntu for running alongside the macOS on a dual-bootable MacBook Air (8,1) ?
For a given hardware configuration, how do I find out if Ubuntu will run on it? What considerations should I take into account when choosing an Ubuntu version and  such as:    with a lighter desktop than the usual Gnome and Unity  with the even lighter LXDE desktop   Obviously Ubuntu does not run on some processor architectures. So how do I go about choosing the right version and derivate. How can I find out the minmal system requirements?
Conventions for function notation I'm in year 11 right now and I just had a brief discussion with my maths teacher about function notation in trigonometry.  For a test, I wrote this,   sin(50)^2   I assumed that would be interpreted as sin(50)*sin(50)  But I was told the correct notation for this is is  sin^2 (50)   or optionally  (sin (50))^2   I'm curious if that is the 'proper' mathematical convention, or just how things are taught in high schools?  I'm Australian, in case there are some regional differences.  Thanks for the help! How to construct a relative path in Java from two absolute paths (or URLs)? Given two absolute paths, e.g.  /var/data/stuff/xyz.dat /var/data   How can one create a relative path that uses the second path as its base? In the example above, the result should be: ./stuff/xyz.dat Customize equation numbering for Equation environment? I want to manually label equation number ? For example I want to label this equation 3.1 instead of (1) which automatically pops up. Is it also possible in split environment as well or not ?      \begin{equation}     \log \mu_{ijk}= \lambda + \lambda_i ^I + \lambda_j ^J+\lambda_k ^K+\lambda_{ij} ^{IJ}+\lambda_{ik} ^{IK}+\lambda_{jk} ^{JK}+\lambda_{ijk} ^{IJK} \label{eq:3.1}     \end{equation} Why "?v=hash" is added to my URLs? I'm new to wordpress, I set up everything, but there's something that bothers me: on every single URL or link, there's a "?v=hash" appended everywhere (example.com/?v=d21feabed96b).  I tried to see inspect every plugin, I don't understand how this parameter is added.  It looks like it's added in js, because if I see the source, there's no trace of this hash, but I can see in firebug live source.  Plugins installed:   jetpack sumome wp-piwik wp super cache woocommerce   Theme: Storefront  I tried to disable everything, but still I get this hash, does anyone knows how and why it's added?  I'm also using cloudflare What is the most "pythonic" way to iterate over a list in chunks? I have a Python script which takes as input a list of integers, which I need to work with four integers at a time.  Unfortunately, I don't have control of the input, or I'd have it passed in as a list of four-element tuples.  Currently, I'm iterating over it this way: for i in range(0, len(ints), 4):     # dummy op for example code     foo += ints[i] * ints[i + 1] + ints[i + 2] * ints[i + 3]  It looks a lot like &quot;C-think&quot;, though, which makes me suspect there's a more pythonic way of dealing with this situation.  The list is discarded after iterating, so it needn't be preserved.  Perhaps something like this would be better? while ints:     foo += ints[0] * ints[1] + ints[2] * ints[3]     ints[0:4] = []  Still doesn't quite &quot;feel&quot; right, though.  :-/ Related question: Review Count - Fix It or Lose It Another meta question identified a bug that was marked as designed. To summarize the bug, the little number that appears next the Review link in the header shows an incorrect value most of the time.         I would like to propose that the feature be dropped. Honestly, I would prefer it be fixed, but the response to the question above gives me little faith that it will be. Half of the time, I click that little brown box and find out that I was lied to. There's nothing to review.  The little number no longer does the job it was created to do.        Oh sweet! Three things I can review!        Just kidding... I'm looking for a word that can describe a person who does nice things for other people (e.g holding the door open, carrying someone's things) but only for self gain; this person only does nice things to make themselves look good in the eyes of others, but doesn't actually care about the well-being of the people they're helping. How does Newtonian mechanics explain why orbiting objects do not fall to the object they are orbiting? The force of gravity is constantly being applied to an orbiting object.  And therefore the object is constantly accelerating.  Why doesn't gravity eventually "win" over the object's momentum, like a force such as friction eventually slows down a car that runs out of gas?  I understand (I think) how relativity explains it, but how does Newtonian mechanics explain it? All internal links on Stack Exchange sites should be protocol-relative In preparation for the eventual deployment of full HTTPS support on Stack Exchange, and also to make the currently available "alpha" HTTPS support more usable, all links from Stack Exchange sites to other Stack Exchange sites should be .  Currently, at least the following places still feature links with explicit http: protocol prefixes:   the page footer, the "Hot Network Questions" and "Community Bulletin" modules in the sidebar,  (the site switcher menu is OK, though),   and, of course,   lots and lots of user-supplied links in post and comment content.   I've posted this feature request with the intent to provide a single central place for tracking these issues, rather than having them scattered across multiple meta threads.  If you find more places on SE where protocol-relative links should be used, please report them below.  I fully expect this request, in its full sense, to be treated as  for the time being; however, these issues do need to be fixed at some point before our HTTPS support is ready for "prime time".  Ps. Yes, the next release of  (v1.10) is going to include a general client-side fix for most of these issues.  In the mean time, the  plugin effectively provides the same functionality, and much more besides. Number of zero digits in factorials Here is a riddle someone has been asked in a job interview: How many zero digits are there in $100!$?  Well, I found the first $24$ quite fast by counting how many times five divides $100!$ ($5$ divides $20$ times and $25$ divides it $4$ times).   However, there are more zero digits in the middle of the number (these can be found by hand, by typing factorial(100) in sage).  My question is whether there is a smart way to determine the number of zero digits in $100!$, and more generally in $n!$.  By the way, this will not affect the job interview as it was finished some time ago. Not sure this is something which people will know on here are not.    We currently have a BI setup where we have Integration services on one SQL instance and the data warehouse database on a separate SQL Instance.    My question is, as no users physically connect to the Integration services SQL instance and it is purely used to execute package from the integrations service catalog via SQL agent, do we need to License every user i.e. Cal's for that SQL instance.  Basically i'm wanting to know if I could utilize SQL 2016 for an integration services instance and use features like Json manipulation etc and then load this data into the 2014 version instance...but what level of licensing will I need? What are the correct settings for min-memory and max-memory in this use case?  The server has 8GB ram, dual Intel Xeon processors, running Windows Server 2008 R2 / Sql Server 2008 Standard Edition. It's running several databases ranging from 30GB - 5GB in size.  Originally the memory usage was set to the default settings (min=0 max=2,147,483,647). On these settings most of the memory usage was taken up by sqlservr.exe and the server would eventually need to be restarted every day or two. It would run normally at first but within a day start to timeout on simple operations like looking up a record using the primary key.   I have changed min=4,096 and max=6,144. This results in only 1.4GB memory usage. However now all four cpus are running at 50-60% cpu usage constantly. Tasks are taking roughly 1/3rd longer to execute, although the server is much more stable. Are there any known uncountable transfinite increasing sequences of real numbers? The real numbers are uncountable, so assuming the axiom of choice there is at least transfinite sequence of real numbers $r_0, r_1, r_2, ..., r_\omega, r_{\omega + 1}, ..., $ up to (and possibly including) $r_{\omega_1}$ that contains an uncountable number of terms. However, it's not guaranteed that $r_0 &lt; r_1 &lt; ..., r_\omega &lt; ...$  Is there a known transfinite sequence of real numbers that is monotonically increasing and which contains uncountably many real numbers?  Thanks! "More clear" vs "Clearer": when to use "more" instead of "-er"? How to add right-click (on desktop) to create text file functionality 16.04.2 Ubuntu GNOME Why can't I press the Install button when installing applications from unknown sources? I'm trying to sideload an application, as seen in the picture below.    I have allowed the installation of applications from unknown applied actions in settings, but I can't seem to press the install button. The cancel button works correctly and installing applications via adb install works correctly. What's the problem?  EDIT: For those who have this problem, using ChainFire's  will correct it because the app uses hardware compositing, and Android doesn't notice a "layer" on top of the current screen. Set of discontinuity of monotone function is countable The result I am trying to prove is the following:     Let $F:\Bbb R\to\Bbb R$ be increasing. Then the set of points, at which it is discontinuous, is countable.   I have been reading this form Folland's Real Analysis and he proves this by considering the sum $\sum_{|x|&lt;N}[F(x^+)-F(x^-)]$ which has to be finite by some sort of telescoping sum. Now, I am not sure how he defines this sum. I am assuming he does this by using nets (let me know if there is another way to look at this), but he doesn't introduce the concept of nets until the next chapter. So I was looking for some other ways to prove this result and I found the following result (from Stein-Shakarchi) which is quite similar but assumes $F$ to be bounded.      A bounded increasing function $F$ on $[a,b]$ has at most countably many discontinuities.   This is shown by using the density of rationals in $\Bbb R$, i.e. $\exists r_x\in\Bbb Q$ s. t. $F(x^-)&lt;r_x&lt;F(x^+)$ corresponding to each point of discontinuity $x$.   Now I feel like there shouldn't be a problem in doing the exact same thing for unbounded increasing function. Is this right? Secondly how does this proof relate to the first one? I feel like there isn't much of a difference between the two proofs. To be precise I think that the previous sum is well defined/finite because of this countability of discontinuous points. What do you think about this way of thinking?  Edit. Here is the Folland's proof in more detail:  Since $F$ is increasing, the intervals $(F(x^-),F(x^+))$ are disjoint for all $\forall x\in\Bbb R$. Moreover,  $\forall|x| &lt; N$ such intervals are contained in $(F(-N),F(N^+))$ and so  $$\sum_{|x|&lt;N}[F(x^+)-F(x^-)] \leqslant F(N) - F(-N) &lt; \infty. $$ Hence the set $\{ x \in (-N,N) : F(x^+) \neq F(x^-)\}$ is countable. Click Answer your own question Check community wiki A dialog box     Are you sure you want to make this post Community Wiki?   will appear, Click OK or Cancel; The same dialog will appear again.   Google Chrome 44.0.2403.107 / Windows8.1 / site rev 2015.7.25.3609 I was wondering this today, and my algebra professor didn't know the answer.      Are subgroups of finitely generated groups also finitely generated?    I suppose it is necessarily true for finitely generated abelian groups, but is it true in general?  And if not, is there a simple example of a finitely generated group with a non-finitely generated subgroup?  NOTE:  This question has been merged with another question, asked by an undergraduate.  For an example not involving free groups, please see Andreas Caranti's answer, which was the accepted answer on the merged question. Pausing/stopping and starting/resuming Java TimerTask continuously?