The banner shown encouraging upvoting is redundant when the question is locked, as locking prevents voting on any of the answers or the question. (Answers can still be voted on, as pointed out in .)  Should the banner be omitted for questions that cannot be voted on?  Example image:
When I visit a site I haven't visited (while logged in) for a while, I see:  Welcome back! If you found this question useful, don't forget to vote both the question and the answers up.  That's often intended behavior. But today I visited  and was shown that banner even though the question and all its answers are locked. Voting arrows aren't even shown on any of the posts on that page. I believe that banner should be disabled on pages where there is no post that can be voted on by anyone.
Very hot network questions found Does a non-trivial solution exist for $f'(x)=f(f(x))$? Allow moderators to edit/delete comments directly from the per-user comment moderation page A while back, a new dashboard was added to the user moderation tools to .  It's great for scouring a user's comment history to find certain comments, but I can't do anything from this dashboard except filter by flagged1, deleted, or active comments, and visit the posts to which the comments are attached where I can then edit or delete them.  Can we have the ability to edit and delete comments from this dashboard just as we're able to from the flag queue? It gets particularly tedious to have to open 100 tabs just to delete 100 spam comments from the posts they're attached to (and no, I'm not making that number up2...).    1 .  2 Alright, fine, I made that up; the actual number of spam comments I had to delete was 111. When is $2^n -7$ a perfect square? This came up while solving another ENT problem. I want to ask when is: $$2^n -7 \text{ where } n\geq 3$$ a perfect square? Specifically, I also wanted to know what would be the solutions when $n$ is odd? How should I solve this?  I can check that $n=3, 4, 7$ are solutions but cannot find more. As it is of the form $4k+1$, it doesn't help as well. Define additional math operators to be typeset in roman What is the maximum or minimum tire width I can fit on my bicycle can I change value of $_SERVER['DOCUMENT_ROOT']? JavaScript equivalent to printf/String.Format I'm looking for a good JavaScript equivalent of the C/PHP printf() or for C#/Java programmers, String.Format() (IFormatProvider for .NET).  My basic requirement is a thousand separator format for numbers for now, but something that handles lots of combinations (including dates) would be good.  I realize Microsoft's  library provides a version of String.Format(), but we don't want the entire overhead of that framework. The Software Center has a section of For Purchase programs &mdash;see screenshot below&mdash;, which is annonying me every time I want to install something.  Is there any way to remove or hide these programs from the Software Center?     Links to answers:                     Please leave a comment or send a mail to jmendeth@gmail.com   if it's not working for you or you're having trouble! What should I do if my Windows computer seems to be infected with a virus or malware?  What are the symptoms of an infection? What should I do after noticing an infection? What can I do to get rid of it? how to prevent from infection by malware?   This question comes up frequently, and the suggested solutions are usually the same. This community wiki is an attempt to serve as the definitive, most comprehensive answer possible. Feel free to add your contributions via edits. How to get all possible combinations of a list’s elements? I have a list with 15 numbers in, and I need to write some code that produces all 32,768 combinations of those numbers.   I've found  (by Googling) that apparently does what I'm looking for, but I found the code fairly opaque and am wary of using it. Plus I have a feeling there must be a more elegant solution.  The only thing that occurs to me would be to just loop through the decimal integers 1–32768 and convert those to binary, and use the binary representation as a filter to pick out the appropriate numbers.   Does anyone know of a better way? Using map(), maybe? Keep only essential packages If I would show someone a yellow object and ask them, "is this object yellow?" That person would say "yes".  But I could never know if my perception of the color yellow is the same as that other person's. Because he or she could actually be seeing, what I know to be the color green. But then tells me that its the color yellow because that has been taught to him or her from young age.  So how can you test if people are really seeing the same color?  Question closed and can now be found @ What is the name of the tactic that politicians use to bury people with torrent of words? Some people write bloated books and long essays with skilful use of hooks, e.g. Jared Diamond; some others speak in long-drawn sentences with torrents of words, e.g. Noam Chomsky. It reminds me of a tactic politicians use in public discourse to waste people's time. I came across this word before but I can't retrieve it from either memory or the internet. How to control a motor with only relays and push button? Hello I´ve been working in this project for some days, I need to make a circuit with only relays that can make a dc motor start, stop and a reverse. The thing is that when you push the start or the reverse button the motor need to keep running, I can´t keep it pushed.  This is as far as I can get. SW1 turns the engine on, SW5 turns it off and SW7 reverse the motor but only if it is already running. What i need is that the reverse button also turns the engine on. Please help.  notes: -i can only use three push buttons and as many relays as needed. Yes is a school assignment.  THANKS! Consider the sequence defined by $a_1 = \sqrt{2}$, $a_2 = \sqrt{2 + \sqrt{2}}$, so that in general, $a_n = \sqrt{2 + a_{n - 1}}$ for $n &gt; 1$. I know 2 is an upper bound of this sequence (I proved this by induction). Is there a way to show that this sequence converges to 2? What I think is that the key step is to prove 2 is the least upper bound of this sequence. But how? I'm a Windows/Mac/Ubuntu and Android user, so I know what I'm talking about, when I say: How do I open binary image files? (.img) They just won't open, on any OS…  I'm an Android dev… I'm currently working on a ROM, (I also program, using Windows) but I need to extract files, from .img files. I've converted them to .ext4.img but they just aren't recognized by Linux (Definitly not by Android), by Mac OS or Windows. In other words, I can't open, extract or mount them.  Can anyone help me? I'm kinda confused… Let $I$ and $J$ be ideals of a Noetherian ring $A$. If $JA_P\subseteq IA_P$ for every $P\in \operatorname{Ass}_A(A/I)$, then $J\subseteq I$.   I'm reading Matsumura's Commutative Ring Theory book on my own. This is exercise $6.4$ in that book, and I fail to prove it. Could you help me with this? Thanks in advance. Why would Mystique's DNA allow for Sentinels that can duplicate mutant powers? The future Sentinels in  are clearly shown adapting to powers thrown at them by copying them. Isn't that what Rogue's DNA would allow for, not Mystique's? Mystique can just change appearance, not copy powers ... right? So why would study of her mutant genes allow for the abilities of the future Sentinels? What is the difference between "accumulative" and "cumulative"? I'm having a hard time understanding the real distinction between  and .  accumulative     adjective         tending to accumulate or arising from accumulation; cumulative.   tending to accumulate wealth; acquisitive.      cumulative     adjective         increasing or growing by accumulation or successive additions: the cumulative effect of one rejection after another.   formed by or resulting from accumulation or the addition of successive parts or elements.   of or pertaining to interest or dividends that, if not paid when due, become a prior claim for payment in the future: cumulative preferred stocks.      These definitions (and those from other dictionaries as well) say different things but I can't understand how they aren't really meaning the same thing.  Yet, when thinking about it, it seems there are some cases where it is distinctly more correct to use one or the other.  What's the difference, practically?