This has happened to me a lot of times and it drives me crazy, after writing a very detailed question, taking snapshots of my app behavior, pasting code and such I click submit and I get the message "You have exceed the 3 question limit per day" or something similar.  I never have any idea how many questions I've asked or how near I am the daily (or monthly) limit so it drives me crazy to spend time writing the question and only after finishing being told I cannot ask it. Would it be possible to show a message on top of the question form so I don't type the question?
It's a shame to type out an entire question, press post and then:     Sorry, you are only allowed to ask 50 questions in a 30 day period   Could you put some sort of notice on the page itself before submitting it to let you know the question won't be going through?  Or perhaps tell me how many questions I've asked in the last 30 days if it's >0?  Edit  This is not a complaint or statement about the limit, just a request that the error handling be done in a slightly better way to save people a lot of time.
What should we do about Stack Overflow-specific questions on Meta SE? Why do clocks measure arc-length? Suppose $\mu(X)&lt;\infty$. Show that if $\ f\in\ L^q(X,\mu)$ for some $1\le q&lt;\infty$ then $\ f\in\ L^r(X,\mu)$ for $1\le r&lt;q$   In the solution the assistant wrote this:  If $1\le r&lt;q$ then $q/r\ge 1$. Let p be the dual exponent to $q/r$ (i.e. $\frac{1}{q/r}+\frac{1}{p}=1)$  then by Hölder Inequality  $\int_{X}|f|^rd\mu\le\underbrace{(\int_{X}|f|^qd\mu)^{r/q}}_{??????}(\int_X1^pd\mu)^{1/p}&lt;\infty$  for me the middle part doesn't make sense (it is not the hölder inequality) can somebody show it ?  instead of this can't we say (only in this case) that   $\int_{X}|f|^rd\mu\le (\int_{X}|f|d\mu)^r$ then  $(\int_{X}|f|d\mu)^r\le ((\int_{X}|f|^qd\mu)^{1/q}(\int_X1^pd\mu)^{1/p})^r&lt;\infty$  ? How can I know what speed card to get for my camera? How do I technobabble without sounding like technobabble? On occasion, I've had reason to describe obviously fictional technical processes in-character. I'd like to be able to describe on these occasions without sounding like I'm saying utter gibberish. But it's not straightforward to do, particularly if I have to make stuff up on the spot.   How do I do it? Looking for an intuitive explanation why the row rank is equal to the column rank for a matrix I am looking for an intuitive explanation as to why/how row rank of a matrix = column rank. I've read the proof at  and I understand the proof, but I don't "get it". Can someone help me out with this ?   I find it hard to wrap my head around the idea of how the column space and the row space is related at a fundamental level. Can I shrink the transaction log file on a mirror database? This is a followup question to  about why I couldn't shrink the log file on the principal database.  To make a long story short, I setup database mirroring but forgot to make sure the job that backed up the transaction log was running again, and the transaction log grew to almost 60GB.   Since mirroring was set up, this size increase was duplicated on the mirrored server, and eventually took up all the disk space and made the mirror database unusable.  Per  about transaction log maintenance on a mirror database, you can't back up the log on the mirror, but when asked specifically in  about how to shrink an overgrown log file on a mirror database, a  was left that      One way to do this would be to failover to the mirrored database and   do the shrink there. Thoroughly test this out in a non-production   environment to ensure it has the behavior you want/expect.   This seems to suggest that there might be other ways to shrink the log file on a mirror, and this method might not necessarily be safe to do on a production server.  Is there a way to safely shrink the transaction log file on a database mirror? Steady-State Current I am in the process of completing some homework and have come across a question that says: "What is the steady-state current?" It is asking in reference to a circuit that includes two capacitors in parrallel and a DC source of 24V and an AC source given by $\epsilon = 20 \cos(120 \pi t)\ \text{V}$, where $t$ is in seconds. I assume that it is asking when the current is constant. Because naturally the current is not constant due to the AC source, would I just consider the DC source for this? A question that may sound very trivial, apologies beforehand. I am wondering why $( \mathbb{Q}_{&gt;0} , \times )$ is not isomorphic to $( \mathbb{Q} , + )$. I can see for the case when $( \mathbb{Q} , \times )$, not required to be positive, one can argue the group contains elements with order 2 (namely all negatives). In the case of the requirement for all rationals to be positive this argument does not fly. What trivial fact am I missing here? Label and caption without float I’d like to have an environment that works much like a float, except that it doesn’t float.  That is, in fact, I’d like to be able to define an environment that has a label and a caption.  I explicitly do not want to use a floating environment, though. For one thing, floats do many things fancy which I just don’t need, nor want (such as spacing) and for another, floats have their share of problems (for example consider the problem of ).  Is there a ready-made way to achieve this? Of course, I could always write my own based on the result of the other answer, i.e. harnessing \refstepcounter. But I’m not sure how to use that, documentation is scarce, and I’d prefer an existing solution. Why is there a magnetic field around a magnet if there are no charges moving? Change running heads in longtable (or other "long table" package) How to execute code after html form reset with jquery? Placing null at the end of the List Can I have multiple Schengen visas for future travels in my passport? I'm a citizen of Ukraine planning on visiting Italy early in October for tourism. Later that month I'm accepted as a speaker at the conference in Prague, Czech Republic. Both countries are members of Schengen agreement and a visa is required for me to visit them. Therefore, I need to visit Schengen countries 2 times and I need to get my visas ASAP (to confirm my talk to the conference organizers, as well as to avoid overpaying for hotels/flight tickets).   I've heard a number of times that a single person can't apply for a Schengen visa if already in possession of one, but I'd like to clarify this. Say, I've got a visa from Italy for the period of October 1st - October 14th. Can I get another one from Czech Republic for October 25th - October 30th before I visit Italy? Would the answer be different if I were to visit the second country (CZ) on October 13th - October 20th, thus, having a single day overlap between these visits. It would be of a tremendous help if you could link to the official documents that prove your point, but I'd certainly appreciate answers even without such links.  Both times I'm going to apply for a short-term tourist visa covering the dates of my travel. If the answer to both questions above is no - would several visits to multiple Schengen countries over a short period of time be a valid reason to apply for a single multiple-entry visa that covers the whole period from October 1st to October 30th from Italy? If space of bounded operators L(V,W) is Banach, V nonzero, then W is Banach (note direction of implication) Let $V,W$ be normed vector spaces, and $L(V,W)$ be the space of bounded linear operators. Usually I would only see the statement "If $W$ is Banach, then $L(V,W)$ is Banach.". But  writes that there is a converse: "If $L(V,W)$ is Banach, and if $V$ is non-trivial, then $W$ is Banach". This is pretty interesting since I never seen a converse before. I was wondering if anyone has a nice proof.  I tried reversing the proof for the usual direction, but the inequalities can't be reversed. I also tried to start with a Cauchy sequence in $W$, and construct linear operators (using Hahn-Banach to control the operator norms), but alas I cannot say much about the distance between these operators (much less say that it is Cauchy) I'd prefer as little formal definition as possible and simple mathematics. How to keep a constant baselineskip when using minipages (or \parboxes)? When a minipage is used to box a text paragraph, the first line of the minipaged text and the last line of the previous text paragraph are closer than two consecutive lines in a standard text paragraph; analogously, the last line of text inside the minipage and the first line of text after the minipage are also closer.  The following MWE illustrates this:  \documentclass{article} \usepackage{lipsum}  \newcommand\Text{Lorem ipsum dolor sit amet, consectetuer adipiscing elit. Ut purus elit, vestibulum ut, placerat ac, adipiscing vitae, felis. Curabitur dictum gravida mauris. Nam arcu libero, nonummy eget, consectetuer id, vulputate a, magna.\textbullet}  \begin{document}  \Text  \noindent\begin{minipage}{\linewidth} \Text \end{minipage}  \Text  \end{document}   How can I guarantee a constant baseline-skip even if minipages (or \parboxes) are used? Categorical Quotient and group actions I am trying to practice calculating categorical quotients and I ran into this example. I am unable to get the answer and was wondering if someone can help?  Let $G = Z/3Z =$ $\{1, \omega, \omega^2\}$, where $\omega$ is a cube root of unity. Let $G$ act on $𝔸^{2}$ via $\omega(x, y) = (\omega x, \omega y)$. Find the categorical quotient of $𝔸^{2}$ by G. In a document I'm writing, I'm using the familiar  option for my floating tables, and I  them. I'd like to avoid repeating that every time I'm creating a table. I assume it's easy to add something in my preamble that makes sure that these two options are used every time I begin a new table environment?  \documentclass{article} \begin{document} \begin{table}[hbt] \centering \begin{tabular}{*3{l}} 1 &amp; 2 &amp; 3\\ a &amp; b &amp; c\\ \end{tabular} \end{table} \end{document}