Please start tracking views for all questions once per day.  This could be done database-economical, if only when a question is viewed at, there is a check, if today already is an entry in the views statistic, and only if not, then the actual viewcount is stored in that statistic. This way there will be maximal one entry for each question each day and only if there was at least one view today.  Once this is tracked, there could be made a statistic of how the views per day varies over time, which is relevant, if you want to see, in what era the question got most of its views (in the beginning, recently or due to a certain event...)
I'm not sure if this is possible architecturally, but when judging whether to set a bounty and how much it should be, it would be nice to see the impact based on our previous questions. If you're not visiting the site throughout the day, there is no way to tell how effective that bounty might be--particularly for increasing traffic. There is a similar question with adding and removing tags that increase the visibility in the right places, and the effect on views that may have.
I remember being taught that the correct order of adjectives in English was something along the lines of "Opinion-Size-Age-Color-Material-Purpose."  However, it's been a long time and I'm pretty sure I've forgotten a few categories (I think there were eight or nine). Can anyone fill them in? Question mark for sentence which starts with a question but doesn't end with one I'm basically looking at sentences which start with a question, and end with an explanation to it. But there may be more instances of a similar structure. Sample sentence :      Can you book a room in advance, because otherwise we'd be in trouble   Should this sentence end with a period or a question mark?  PS: I read the apparently similar question  but the sentence structure there is different from what I'm looking for.  Edit: I just discovered that this question is a duplicate. A resolved question already  exists:   But i do like the explanations here better. Best Pattern For Adding Commentary in align Environment? I've been using the align environment to line up equations in proofs/explanations/etc and I like to place parenthetical commentary for each step, similar to the code below:  \documentclass{article} \usepackage{amsmath} \begin{document}  \begin{align*}   f(ax + by) &amp; = f(ax) + f(by) &amp; (By Property 1) \\              &amp; = af(x) + bf(y) &amp; (By Property 2) \\ \end{align*}  \end{document}   The problem I have with this is that the commentary completely distorts the overall alignment of the equation area; far too much space is allocated to the column containing the commentary.  I would like, insofar as it is possible, for the equations themselves to be aligned in the center of the page and for the commentary to simply appear on the right without affecting the overall justification of the equations. What's the best way to achieve this? Steam not opening in Ubuntu 16.04 LTS Do I need a UK visa? How and where to apply? I live in Germany since May 2013 as a spouse of German citizen. In Nov 2015 we divorced and I have German residence permit till Jan 2018. We have a son in this marriage and legally I have the right to live in Germany indefinitely. I would like to visit my brother and sister who are British citizens living in UK. What is the visa procedure for me to travel to UK for a week.  Do I need a visa to enter UK ? How to find range $a_{75}$ of the term of the series $a_n=a_{n-1}+ {1 \over {a_{n-1}}} $ If $a_1=1$ and for n&gt;1$$a_n=a_{n-1}+ {1 \over {a_{n-1}}} $$ $a_{75}$ lies between (a) (12,15) (b) (11,12) (c) (15,18)  Now , in this question, I rewrote, $a_n-a_{n-1} = {1 \over {a_{n-1}}}$, to make a telescopic type and summed the terms to get $$a_n-a_{1}= {1 \over {a_{n-1}}}+ {1 \over {a_{n-2}}}...{1 \over {a_{1}}}$$ And as ${1 \over {a_{r}}} &lt;1$ for all r , I got $a_{75} &lt;76$ , but it's of no help as , the upper bound is much higher. I got no further ideas , on how to solve it, please help. In "", Mark Lutz mentions "mixins". I'm from a C/C++/C# background and I have not heard the term before. What is a mixin?   Reading between the lines of  (which I've linked to because it's quite long), I'm presuming it's a case of using multiple inheritance to extend a class as opposed to 'proper' subclassing. Is this right?   Why would I want to do that rather than put the new functionality into a subclass? For that matter, why would a mixin/multiple inheritance approach be better than using composition?  What separates a mixin from multiple inheritance? Is it just a matter of semantics? About the localization of a UFD I was wondering, is the localization of a UFD also a UFD?    How would one go about proving this? It seems like it would be kind of messy to prove if it is true.  If it is not true, what about localizing at a prime? Or what if the UFD is Noetherian? Why can't a domain's root be a CNAME? I've just read  which essentially says that when I set up DNS for example.com, the root record can't be a CNAME, it has to be an A record.  My question is, why?   I'm sure the clever people who designed DNS didn't make arbitary restrictions for no reason, but I don't see what we gain by requring root domains to be A records. I would love to just point my example.com domain to someserver.somewebhost.example and forget about it, but I can't.  Please enlighten me, billpg. Hadamard Product of $e^z-1$ Assuming the formulas $$\sin(z)=\frac{e^{iz}-e^{-iz}}{2i}\quad\text{and}\quad\frac{\sin(\pi z)}{\pi z}=\prod_{n=1}^\infty\left(1-\frac{z^2}{n^2}\right),$$ I want to find the Hadamard product of $e^z-1$. I think I've done the work correctly, but I end up having an extra factor of $2\pi i$ at the end (this is from Stein and Shakarchi's book and they list the answer for this particular problem). So, my work is \begin{align} e^z-1&amp;=e^{z/2}\left(e^{z/2}-e^{-z/2}\right)\\ \\ &amp;=e^{z/2}\left(e^{i(-iz/2)}-e^{-i(-iz/2)}\right)\\ \\ &amp;=2ie^{z/2}\left(\frac{e^{i(-iz/2)}-e^{-i(-iz/2)}}{2i}\right)\\ \\ &amp;=2ie^{z/2}\sin(-iz/2)\\ \\ &amp;=2\pi i ze^{z/2}\frac{\sin(-iz/2)}{\pi z}\\ \\ &amp;=2\pi i ze^{z/2}\frac{\sin\left(\pi(\frac{-iz}{2\pi})\right)}{\pi z}\tag{*}\\ \\ &amp;=2\pi i ze^{z/2}\prod_{n=1}^\infty\left(1-\frac{\left(\frac{-iz}{2\pi}\right)^2}{n^2}\right)\\ \\ &amp;=2\pi i ze^{z/2}\prod_{n=1}^\infty\left(1+\frac{z^2}{4n^2\pi^2}\right). \end{align}  The answer according to the book is $$e^z-1=e^{z/2}z\prod_{n=1}^\infty\left(1+\frac{z^2}{4n^2\pi^2}\right).$$Have I made a simple mistake in calculation, or are the two somehow compatible with each other?  Update: Thomas Andrews has pointed out a mistake in my infinite product formula. I've corrected that mistake.  $(*)$ The error occurs from this line to the next. Instead of multiplying and dividing by $z$, I should have multiplied and divided by $\frac{-iz}{2\pi}$. That would cause the appropriate cancellation. My pixel perfect picture gets blurry when compiled in LaTeX I have this picture:  (I have the original in Pixen and could export it to several different formats. I went with PNG though since it's lossless.)  When I open my picture in Preview (OS X) and zoom in, it looks fine. The characters have extremely sharp boarders between them and the background. However, when I put it into my LaTeX document, compile it to a PDF (using TeXShop) and then zoom in, it suddenly have gotten blurry (see screenshot: ).  Minimal working example:  \documentclass[12pt]{article} \usepackage{graphicx} \begin{document} \includegraphics[scale=1]{fig1.png} \end{document}   In the end, I would like to be able to scale the picture freely without there being any blurring at all. I'm reading the proof of the multiplicative property of $$s_k(n)=\sum_{d|(n,k)}f(d)g\bigg( \frac kd\bigg)$$ The book wrote that in order to understand the proof, we need to know if $a,b,k,m$ are integers such that $(a,k)=(b,m)=1$, then $$(ab,km)=(a,m)(b,k).$$  I have written proof, but I don't know is it consistent, and this seems used more tools than it necessarily has to.   My proof: Let $$S_1=\{d: d|(a,m), d&gt;0\}\\S_2=\{d: d|(b,k), d&gt;0\}\\S=\{d:d|(ab,km), d&gt;0\}.$$ I will prove the statement by showing that the function $\phi:S_1\times S_2\to S$ defined as $$\phi(d_1,d_2)=d_1d_2$$ is bijective, and complete the proof by connecting the maximal elements from these partial ordering sets.  Obviously, for $d_1\in S_1, d_2\in S_2$, this tells us $d_1 $ is both divisor of $a$ and $m$, and $d_2$ is both divisor of $b$ and $k$, hence $d_1d_2$ is both divisor of $ab$ and $km$, so we can tell $\phi(S_1\times S_2)\subseteq S$.  To show one-to-one, if we have $c_1,d_1\in S_1$ and $c_2,d_2\in S_2$ such that $$\phi(c_1,c_2)=\phi(d_1,d_2)$$ then $$c_1c_2=d_1d_2$$  In particular, $c_1|d_1d_2$, we need to show $c_1|d_1$. Indeed, if $(c_1,d_2)&gt;1$, this implies $a,k$ have common factor larger than $1$, contradicts the assumption. Therefore $c_1|d_1$. A similar argument implies $d_1|c_1$, therefore $c_1=d_1$. Again a similar argument implies $c_2=d_2$, which shows one-to-one.   To show onto, let $d\in S$, since $d|ab$, we can split $d$ into $d_1d_2$ such that $d_1|a$ and $d_2|b$. Since $(a,k)=1$, we see $(d_1,k)=1$, by property of $S$ we see also $d_1|m$, therefore $d_1\in S_1$, a similar argument implies $d_2\in S_2$. So every number in $S$ has a preimage in $S_1\times S_2$  This completes the proof. Is there any mistake in the proof?     Edit: A proof about the statement: If $d|ab$ then there are $d_1,d_2$ such that $d=d_1d_2$ and $d_1|a, d_2|b$.  Let $ab=p_1^{e_1}\cdots p_r^{e_r}$ for distinct prime factors $p_1,\cdots,p_r$, then we can write $$a=p_1^{x_1}\cdots p_r^{x_r}\\b=p_1^{y_1}\cdots p_r^{y_r}$$ where some of $x_i, y_i$ can be zero, and $x_i+y_i=e_i$ for all $i=1,\cdots,r$.  Since $d|ab$, we can write $$d=p_1^{f_1}\cdots p_r^{f_r}$$ with $f_i\leq e_i$ for all $i=1,\cdots,r$. Then since $$f_i\leq x_i+y_i$$ Split into two cases:   Case 1: $f_i&gt; x_i$, then we can choose $g_i=x_i$ and $h_i=f_i-x_i$.  Case 2: $f_i\leq x_i$, then we can choose $g_i=f_i$ and $h_i=0$.  Then the choice $$d_1=\prod_{i=1}^r p_i^{g_i}, \quad d_2=\prod_{i=1}^r p_i^{h_i}$$ will prove the statement. Why does $F=ma$? Is there a straightforward reason? Why is force = mass $\times$ acceleration? I have searched in many sites but didn't actually get at it. Simply I want to know that if a mass in space moves (gains velocity thus further accelerates), how can I think, postulate and further believe that force = multiplication  of mass and its acceleration ? Missing whitespace in beta site statistics box Does C# have an equivalent to JavaScript's encodeURIComponent()? In JavaScript:  encodeURIComponent("©√") == "%C2%A9%E2%88%9A"   Is there an equivalent for C# applications? For escaping HTML characters I used:  txtOut.Text = Regex.Replace(txtIn.Text, @"[\u0080-\uFFFF]",     m =&gt; @"&amp;#" + ((int)m.Value[0]).ToString() + ";");   But I'm not sure how to convert the match to the correct hexadecimal format that JS uses. For example this code:  txtOut.Text = Regex.Replace(txtIn.Text, @"[\u0080-\uFFFF]",     m =&gt; @"%" + String.Format("{0:x}", ((int)m.Value[0])));   Returns "%a9%221a" for "©√" instead of "%C2%A9%E2%88%9A". It looks like I need to split the string up into bytes or something.  Edit: This is for a windows app, the only items available in System.Web are: AspNetHostingPermission, AspNetHostingPermissionAttribute, and AspNetHostingPermissionLevel. Why is my crontab not working, and how can I troubleshoot it? This is a  about using cron &amp; crontab.   You have been directed here because the community is fairly sure that the answer to your question can be found below. If your question is not answered below then the answers will help you gather information that will help the community help you. This information should be edited into your original question.  The answer for 'Why is my crontab not working, and how can I troubleshoot it?' can be seen below.  This addresses the cron system with the crontab highlighted. Why are low-rep users rate-limited when posting questions? I just encountered the following error:  Oops! Your question couldn't be submitted because: users with less than 125 reputation can only post questions every 20 minutes; try again later.  Why do you have this rule? Why 20 minutes? "BookList" or "booksList?" Possible Duplicates:             I'm wondering whether or not I should use a plural form noun with a collection name. For example, which one is correct, bookList or booksList (obviously they are variables in a programming language)? A problem with my reasoning in a problem about combinations I was given the following problem to solve:     A committee of five students is to be chosen from six boys and five   girls. Find the number of ways in which the committee can be chosen,   if it includes at least one boy.   My method was $\binom{6}{1}\binom{10}{4}= 1260$, using the logic of choosing $1$ boy, then choosing the rest. This was wrong, as the answer was $\binom{11}{5}-\binom{5}{5}= 461$.  The correct answer's logic was committee with no restrictions – committee with no girls.  Why was my method wrong? Please help... What is the difference between "Redirection" and "Pipe"? This question may sound a bit stupid, but I can not really see the difference between redirection and pipes.  Redirection is used to redirect the stdout/stdin/stderr, e.g. ls &gt; log.txt.  Pipes are used to give the output of a command as input to another command, e.g. ls | grep file.txt.  But why are there two operators for the same thing?  Why not just write ls &gt; grep to pass the output through, isn't this just a kind of redirection also? What I am missing?