I purchased "Reputation to the Max" and increased my reputation by 10x.    And like a good SE citizen, I immediately went to the review queues to do my part (for the day).  However, the review queues indicate that I don't have enough precious repz in order to perform any of the much needed reviews.    I believe this must be some sort of bug within purchasing the "Reputation to the Max" power and ought to be resolved.
I just bought "Reputation to the max". I bought this first, because I really want to help the cleanup of the vote-to-close queue, which, despite the efforts I've been hearing about, is still quite large. According to SO, my reputation is now 15,750, but that queue still says I need at least 3k rep to review! That is clearly a bug!
How do I get a remote host IP address if I don't have ping, and don't have any bind utilities like dig, nslookup, etc?  I need an answer that does not include 'install X' or 'use sidecar container'. I am looking for something that relies on nothing more than bash and the basic shell commands. In C#, why can't a List object be stored in a List variable It seems that a List object cannot be stored in a List variable in C#, and can't even be explicitly cast that way.  List&lt;string&gt; sl = new List&lt;string&gt;(); List&lt;object&gt; ol; ol = sl;   results in Cannot implicitly convert type System.Collections.Generic.List&lt;string&gt; to System.Collections.Generic.List&lt;object&gt;  And then...  List&lt;string&gt; sl = new List&lt;string&gt;(); List&lt;object&gt; ol; ol = (List&lt;object&gt;)sl;   results in Cannot convert type System.Collections.Generic.List&lt;string&gt; to System.Collections.Generic.List&lt;object&gt;  Of course, you can do it by pulling everything out of the string list and putting it back in one at a time, but it is a rather convoluted solution. Elements of order 2 in $D_{2n}$ Im new at this abstract algebra stuff and im not comfortable with the proofs techniques yet, so I have a question related to the elements of order $2$ in $D_{2n}$.  Problem:   Prove that $\{x\in D_{2n}|x^{2}=1\}$ is not a subgroup of $D_{2n}$ for $n\geq 3$.   By now, I know that all the elements of the form $sr^{k}$ has order $2$ because I tested by brute force haha, but my real question is how do I prove prove that. How do I have to proceed to prove that $sr^k$ has order 2.  Any help will be really appreciated, thanks so much &lt;3 brute force password guessing on SSH server isn't going to work? I'm running an SSH server on my personal computer. The log had many people(or bots?) repeatedly trying to log in to my server (that is before I changed the default port), which made me a little freaked out. I was worried about their dictionary attacks or brute force password guessing.  But then if you type wrong password (or wrong username), the server waits for about 2 seconds before it asks for password again. So an attacker can try one password per 2 seconds. So I concluded that these attacks aren't that great a threat (as long as your password does not consist of dictionary words.) Am I correct? QGtkStyle was unable to detect the current GTK+ theme When I start any Qt app, I get this message in the terminal, and the Qt app doesn't use the same theme as my Gtk apps:  QGtkStyle was unable to detect the current GTK+ theme.   How do I make QGtkStyle detect my current GTK+ theme?  It seems that LXDE is using a settings daemon, and there is no gtkrc-2.0 file in my home folder. Why are ammeters used in series and voltmeters in parallel? how to *completely* turn off automatic updates in Windows 10 I have disabled the services &quot;Windows Update&quot; and &quot;Windows Update Medic Service&quot; in using services.mcs. Furthermore, I made changes to the registry, creating a key HKEY_LOCAL_MACHINE\SOFTWARE\Policies\Microsoft\Windows\WindowsUpdate\AU with a DWORD (32-bit) Value &quot;AUOptions&quot; with value set to 2. I still see frequent queries to ctldl.windowsupdate.com sent to my DNS server. Which services need to be disables to completely shut this down? Using conjugates to find a limit with a cubic root: $\lim_{h\to 0}\frac{\sqrt[3]{h+1}-1}{h}$ I currently have $$\lim_{h\to 0}\frac{\sqrt[3]{h+1}-1}{h}$$  Now, I know that when you have square root instead of a cubic root it's easy. You just multiply by the conjugate and simplify afterwards. If it were a sqrt I know that the limit is 1/2. I know that the result here is 1/3 but I can't seem to get there. I always end up with 1/4 due to getting something like: $$\frac{h+1-1}{h(\sqrt[3]{h+1}+1)(\sqrt[3]{h+1}+1)}$$  After simplifying and evaluating the limit you end up with $$\frac{1}{(\sqrt[3]{0+1}+1)(\sqrt[3]{0+1}+1)}$$  which turns out to be $1/4$.  What am I doing wrong? Check differentiability of multivariable functions I am trying to determine if the following functions are (totally)   differentiable at $(x,y)=(0,0)$.      $$f(x,y)=\sqrt{\vert xy \vert}$$      $$g(x,y)=e^{{{\vert x \vert}^3}y}$$   However I am not particularly sure where to start. The concept of the total derivative being the Jacobian matrix makes sense but I don't really understand how to work with functions that may not have a Jacobian matrix. Any help would be greatly appreciated! I have an upcoming trip where I will be flying to and from Copenhagen, through Toronto.  I notice that my departure and return gate in the Philadelphia airport is not in the international terminal.  Where will I clear customs? Find weak form of linear transport equation I am stuck on the following problem that says:       a) Find a weak formulation for the partial differential equation $${\partial u\over\partial t\ }+ c{\partial u \over \partial x\ }=0$$    b) Show that $u=f(x-ct)$ is a generalized solution of $${\partial u\over\partial t\ }+ c{\partial u \over \partial x\ }=0$$ for any distribution $f$    My Attempt:   I know that in order to find a weak form of a pde, we need to multiply it by a test function, then integrate it. Also, to find a generalized solution, we need to find a weak solution and just multiply it by the Heaviside function.  Let's take any test function $\phi $, then we have (integrating by parts second part of the integral) $$\int_{\Omega } ( {\partial u\over\partial t\ }+ c{\partial u \over \partial x\ })*\phi(x) dx= \int_{\Omega } {\partial u\over \partial t}\phi(x) dx - c\int_{\Omega } u(x,t)\phi'(x)dx$$ where $\phi $ vanishes at boundaries. So, is it the final form or can we proceed further? And how am I supposed to find a generalized solution?  Can someone help me out? Thanks in advance for your time. "See somebody do" and "see somebody doing" tar and its key letters: is it a bug or feature? I am wondering to ask the difference of these two commands (i.e. only the order of their options are different):   tar -zxvf foo.tar.gz tar -zfxv foo.tar.gz   The first one ran perfectly but the second one said:  tar: You must specify one of the `-Acdtrux' or `--test-label'  options Try `tar --help' or `tar --usage' for more information.   And tar with --test-label and -zfxv said :  tar (child): xv: Cannot open: No such file or directory tar (child): Error is not recoverable: exiting now tar: Child returned status 2 tar: Error is not recoverable: exiting now   Then I looked at tar manual and realised that all the example there are using switch -f in the end!!  AFAICT there is no need for this restriction, or is there?! because in my view switches should be order free. How to quickly and easily create a grid with Adobe Photoshop? Suppose I need to draw a grid in Photoshop, each square being the same size, and a certain amount of pixels tall and wide, and the grid lines having a certain pixel width. Like this:     Currently I do this by drawing one square, copy+pasting+moving+merging it a few times to create one row, copy/pasting that a few times to create more rows above each other.  It works, but feels very clumsy, I'm sure there ought to be a more efficient way to do this?  What are some efficient methods for creating a grid of equally sized squares? Unfortunately, despite having tried to learn regex at least one time a year for as many years as I can remember, I always forget as I use them so infrequently. This year my new year's resolution is to not try and learn regex again - So this year to save me from tears I'll give it to Stack Overflow. (Last Christmas remix).  I want to pass in a string in this format {getThis}, and be returned the string getThis. Could anyone be of assistance in helping to stick to my new year's resolution?    Related questions on Stack Overflow: View vote count button on mobile On the mobile site, can there be a button directly below the vote up/down buttons for viewing vote counts? When I am using the mobile site and I want to view vote counts, I have to switch to the full site to do it which is very inconvenient.   It could be a small link that says "vote counts," because I don't know what the button would be (the letter "V?" a "+/-" thing? I have no idea).  Related:  , but I am requesting an additional button below the vote buttons. That way you won't accidentally click a vote button. My group of 8 level 3 players are about to run through the Thundertree Ruins and will probably have a hand at fighting the dragon. My question stems from the fact that a single poison breath attack from the dragon will outright kill all but 1 player assuming they fail their saving throws.  I understand this encounter is supposed to be ridiculously deadly, but I don't want to be punishing my players for testing the lengths at which they can fight stuff. A fight should be challenging and they should be able to try and run away, but instant obliteration seems a bit much.  All PCs are level 3 (HP in parenthesis):   Wood elf moon druid  (27) dwarven frenzy barbarian (44) fire genasi archer ranger (37) (pseudodragon companion (12)) wood elf assassin rogue (27) human wild magic sorcerer (22) dragonborn fighter (29) human monk (24) human fighter (32) Difference between least squares and minimum norm solution Consider a linear system of equations $Ax = b$.   If the system is overdetermined, the least squares (approximate) solution minimizes $||b - Ax||^2$. Some source sources also mention $||b - Ax||$. If the system is underdetermined one can calculate the minimum norm solution. But it does also minimize  $||b - Ax||$, or am I wrong?   But if least squares is also a minimum norm, what is the difference, or the rationale of the different naming? Superscript outside math mode What is the easiest way to superscript text outside of math mode?  For example, let's say I want to write the $n^{th}$ element, but without the math mode's automatic italicization of the th.  And what if I still want the n to be in math mode, but the th outside? Where did the practice of using apostrophes for possessive nouns but not pronouns originate? Where did the practice of using apostrophes for possessive nouns but not pronouns originate?  For example, possessive nouns (both proper and common) are written with a apostrophe before the final s:        Bill’s, not Bills   Sarah’s, not Sarahs   the bear’s, not the bears   the lizard’s, not the lizards      On the other hand, several possessive pronouns do not have apostrophes before the s:        his, not hi’s   hers, not her’s   its, not it’s   theirs, not their’s   ours, not our’s   yours, not your’s      When and where did this usage originate? Was there any technical advantage of this usage?