What to do with the 6 character edit limit? Disclaimer: I searched and I found a lot of questions about the character limit, but none include the comprehensive feature request I make here, so I kindly request to consider this post not a duplicate.    As we all know, there is a 6 character limit imposed on edits. This has been questioned before, for instance:          Yes, often there is more that can be fixed, but as these questions and others show, that is not always the case. People complain about perfectly good edits, that would enhance the value of the Stack, being rejected.  So what can be done about this constraint?
Change this behavior to allow for spelling corrections and the like: "Edits must be at least 6 characters" Now, it is easy to workaround this: add 10 characters, plus your one-character change, then remove these 10 characters in the next edit for the same post.  But this can hardly be what the designers intended. Instead, my suggestion is to change it to something like on Wikipedia, where you can mark an edit as "minor". Something like this:     Edits must be at least 6 characters, or select the checkbox "Minor, spelling or punctuational correction."   Edits like that will, of course, not count toward the edit-limit (before it becomes Community Wiki).  The suggestion often seen on Meta Stack Overflow is "just edit more in that post". But sometimes the post is just right, and there aren't any other spelling mistakes to correct. Why force a user to change more than necessary, or use an ugly hack?
Let $A,B \subset \mathbb{R}$. Show that $\sup(A \cup B) = \max\{\sup A, \sup B\}$ Let $A,B \subset \mathbb{R}$. Show that $\sup(A \cup B) = \max\{\sup A, \sup B\}$   Here's what I did so far:  Let $\sup A, \sup B$, and $\sup (A \cup B)$ denote upper bounds of $A,B$, and $A \cup B$, respectively. If $x \in A$, then $x \le \sup A$. If $x \in B$, then $x \le \sup B$. In either case, $x \in (A \cup B)$. So either $x \le \sup A$ or $x \le \sup B$. In either case, $x \le \max \{\sup A, \sup B\}$. So $\max \{\sup A, \sup B\}$ is the upper bound of $A \cup B$, which means $\sup (A \cup B) \le \max\{\sup A, \sup B\}$.  I do not know if there's a better way to go at it, but all I did was show the inequality. Can I do this, and show the reverse inequality? If so, how can I go about doing that? From 8th June there's been a  period for people entering the UK. From 10th July, travellers from  via a travel-corridor. If more countries are added to the list of exemptions then the date for each country will be later than the 10th July. If a traveller entered the UK from a country that is not on the exempt list and that country is added to the exempt list prior to the end of the 14 day self-isolation period does the self-isolation period end early? For example, if an individual entered the UK from France on the 5th July, should they remain in isolation for 14 days or does the isolation end on the 10th when France is added to the list of exempt countries? Born rule and unitary evolution Is the  a fundamental , or can it be inferred from unitary evolution? Take a screenshot of a webpage with JavaScript? I had to take ownership of the special folder C:\Program Files\WindowsApps to fix . The issue is now resolved, so I'd like to reset the permissions to the way they were before I took ownership of the folder.  I reverted NT SERVICE\TrustedInstaller to the owner and removed my account's permission entries:     But I still have full control of the folder and can browse the folder in Explorer without getting the usual warning that I would have to take ownership:     Is it possible to restore the default permissions of this folder? Stupidly, I had been using a condition like this as part of a script:  if [ $(ls FOO* 2&gt; /dev/null) ] # if files named "FOO*" were downloaded  then     echo "Files found"      # ... process and email results else     echo "Not found"     # ... email warning that no files were found (against expectations) fi   That works for zero and one files named FOO*, but fails if there are more than one. From logs I found several different error messages stemming from this:  [: FOO_20131107_082920: unary operator expected [: FOO_20131108_070203: binary operator expected [: too many arguments   My question is: what is the correct way to check, in a Bash if condition, whether one or more files whose name begins with FOO exist?  GNU bash, version 4.2.25(1)-release (x86_64-pc-linux-gnu) Why do I give my pets "food" but my livestock "feed"? When I feed my cat or my dog, the package tends to say "Dog Food" or "Cat Food."  In contrast, I give my chickens "chicken feed" or "poultry feed."  Likewise, a cow's silage is her "feed."  Why does this distinction exist?  Is there an historical or grammatical explanation, or is it merely idiom? How can I prove the following?  $\gamma (t)$ is unit speed, $\dot \gamma(t) \not= 0 \Rightarrow \ddot \gamma(t)$ is perpendicular to $\gamma(t)$   I don't really see where a problem would arise when $\dot \gamma(t)=0$ would cause such a problem Calculating Latitude/Longitude X miles from point? I am wanting to find a latitude and longitude point given a bearing, a distance, and a starting latitude and longitude.  This appears to be the opposite of this question ().  I have already looked into the haversine formula and think it's approximation of the world is probably close enough.  I am assuming that I need to solve the haversine formula for my unknown lat/long, is this correct? Are there any good websites that talk about this sort of thing? It seems like it would be common, but my googling has only turned up questions similar to the one above.  What I am really looking for is just a formula for this. I'd like to give it a starting lat/lng, a bearing, and a distance (miles or kilometers) and I would like to get out of it a lat/lng pair that represent where one would have ended up had they traveled along that route. What are the drawbacks with using UUID or GUID as a primary key? I would like to build a distributed system. I need to store data in databases and it would be helpful to use an  or a  as a primary key on some tables. I assume it's a drawbacks with this design since the UUID/GUID is quite large and they are almost random. The alternative is to use an auto-incremented INT or LONG.  What are the drawbacks with using UUID or GUID as a primary key for my tables?  I will probably use Derby/JavaDB (on the clients) and PostgreSQL (on the server) as DBMS. I want to show that  $$\int_{0}^{\frac{\pi}{2}}\frac{d\theta}{a + \sin^2(\theta)} = \frac{\pi}{2\sqrt{a(a+1)}}$$  for $a &gt; 0$.  I try several methods   Substitutions to rationalize The famous $U = \tan(\frac{\theta}{2})$ Multiplying by conjugates   and other calculus techniques and still, I can not prove the equality.   Anyone can give me a hint of how should I begin to work this integral?  I'm very ashamed that I can not solve this problem. Proof of matrix norm property: submultiplicativity I've been searching for the definition of the submultiplicative (I think it has multiple names from what I've seen) property in proof form. Some books define it as part of the properties that define matrix norms, and some include it as an additional property. I still haven't been able to work it out for myself or find it anywhere.  Let $A$ and $B$ be $n\times m$ and $m\times l$ matrices respectively, prove that:  $$\begin{align} \|AB\| \le \|A\|\|B\|  \end{align}$$ is it possible to create this kind of material with the standard textures? The Voronoi texture (set to cells) is coming close but I don’t know if it is possible to a) set the single cells apart from each other and b) to give them seperate colors. How many associative binary operations for a set of two elements? Suppose we have a set  $S=\{a,b\}.$ Obviously, the total number of binary operations on $S$ is the number of all the pairs such that $$*(a,b)=a \, \text{or}  \, b,$$ which gives  $ 2 \cdot 2 \cdot 2 \cdot 2=2^4$ possible ones. Is there a way to find which of these $16$ binary operations are associative without writing all the operation matrices and checking it by hand? I am very new to the TikZ package, and I need to draw some flow chars by using the following shapes.   However I couldn't figure out how to draw the 4th and and 6th ones below. It would be very nice (for completeness) to help with all of the shapes in the list below.      Your help will be greatly appreciated.  Note: I have visited  but it contains some other shapes. apt-get remove with wildcard removed way more than expected. why? Generalizing polygon file while maintaining topology in QGIS? I have a polygon Shapefile, which I need to generalize. How can I generalize the poligons and ensure that there are no topological errors like "slivers".   I already tried:   Vector -> Geometry Tools  -> polygones to lines Vector -> Geometry Tools  -> simplfy geometries ... here I can already see on the screen, that I am producing overlaps and gaps nevertheless now I try Vector -> Geometry Tools  -> lines to polgones   and here the program show an error and crashes TTY doesn't wait for password Why does `type which` say that `which is hashed`? I wonder whether it is possible to perform within R a clustering of data having mixed data variables. In other words I have a data set containing both numerical and categorical variables within and I'm finding the best way to cluster them. In SPSS I would use two - step cluster. I wonder whether in R can I find a similar techniques. I was told about poLCA package, but I'm not sure ...