In the , there's a  that shows:  Except that the hat-collecting arachnid actually approved it:  This  7 and a bit years ago, and was marked , but it's not.
In the 10 k tools,  is described as if I had approved it:    However, the review item itself (correctly) displays that I rejected this edit:    Going by   , this should be fixed, but it isn’t.  This could be solved by replacing approved by to reviewed by in the list or making an explicit list, who approved and rejected an edit (which is probably more complicated).
How to rename the User folder in Windows 10? How does Stack Overflow save and show tags? I am a user on Stack&nbsp;Overflow, and I think every page that shows questions, display all tags and the questions. Are the tags saved in a tags table or are they included together with the questions table? About the semantically related words Google's algorithm uses in mixed language websites Because I'm Latin, sometimes I use a word in English while talking in Spanish.   In a website, for example, I could be interested in ranking for a word as “promoter” inside a page in Spanish, because that is how my public understands that concept.  Does the latent semantic indexing (LSI) (or whatever Google uses for semantic relation) fail to relate “promoter” with the content (because there are not related words in English) and then could that prevent my site from ranking? How does CoffeeScript's existential operator work? I've taken multivariate calculus and am wondering if I can see a specific function where the order of taking the partial derivative matters. I've been told that there are some exceptions where $ \dfrac{\partial ^2 f}{\partial x \partial y} \ne \dfrac{\partial ^2 f}{\partial y \partial x} $, so I'm curious to see what this looks like.  EDIT: And why would this true? How do I handle the window close event (user clicking the 'X' button) in a Python Tkinter program? Can anyone point me to a reference (preferably either something online or something a small liberal arts school would be likely to have in its library) that goes through a derivation of the minimum uncertainty wavefunction in more detail than in the Griffiths?  Edit I've moved the second part of my original question to a separate post: limit of integral $n\int_{0}^{1} x^n f(x) \text{d}x$ as $n\rightarrow \infty$ I am trying to solve the following problem at the level of a senior undergrad analysis level. So, the problem is as follows: We are given a function $f$ which is continuous on the interval $\left [ 0,1 \right ]$, and the question is to find the limit: $$\lim_{n\rightarrow \infty}\int_{0}^{1}x^{n}f(x)dx\;.$$ The second part of the problem is to deduce the following limit: $$\lim_{n\rightarrow \infty}n\int_{0}^{1}x^{n}f(x)dx\;.$$  For the first part: I just did the following: For every $0\leq x&lt; 1$: $x\leq M$, where $0&lt; M&lt; 1$. Then: $$\int_{0}^{1}x^{n}f(x)dx\leq M^{n}\int_{0}^{1}f(x)dx\;.$$ Then: $$\lim_{n\rightarrow \infty }\int_{0}^{1}x^{n}f(x)dx\leq \lim_{n\rightarrow \infty }M^{n}\int_{0}^{1}f(x)dx= 0.\int_{0}^{1}f(x)dx=0\;,$$ so $$\lim_{n\rightarrow \infty }\int_{0}^{1}x^{n}f(x)dx=\lim_{n\rightarrow \infty }f(1)\int_{0}^{1}1dx=f(1)\;.$$ Does that make sense? If not, please show me the correct one.  As for the second part, I have no idea what to do. Any help? How does Java's PreparedStatement work? Introduction to proofs with a fair amount of hand-holding? Lately I've gotten a friend of mine interested in mathematics. He has no college-level education to speak of, but is well employed as a software engineer. So I feel he's competent to learn this stuff on his own.  He asked me recently if there was a 'mathematical' version of .  The point being, if there was an "introduction to proofs" book which took a more hand-holding approach. He's also expressed fondness for the .  However, metamath's proofs are obviously a bit too low level to learn anything serious.  At one point in our conversation, I mentioned the dependently typed programming language , but I felt it's not quite as helpful until he at least gets some experience with  (for which the target audience of Agda is Haskell programmers, hence the similarity in syntax).  Anyone have any good suggestions on a book? Why can't I transform faces, edges, or vertices without transforming the whole object? I would like to try a different video display driver, but I'm not sure which one I'm currently using.    What's the simple way to see what driver my system is using currently? Package Cache File corrupted From advice on  , I've opened a new question about the same issue, as it turned out my problem was not the one described in the question, information I did not know at the time. I'm running Ubuntu 16.04.  $ sudo apt-get update  Hit:1 http://archive.ubuntu.com/ubuntu xenial InRelease Get:2 http://archive.ubuntu.com/ubuntu xenial-updates InRelease [102 kB] Get:3 http://archive.ubuntu.com/ubuntu xenial-backports InRelease [102 kB] Get:4 http://archive.ubuntu.com/ubuntu xenial-security InRelease [102 kB] Get:5 http://archive.ubuntu.com/ubuntu xenial-updates/main amd64 DEP-11 Metadata [307 kB] Get:6 http://archive.ubuntu.com/ubuntu xenial-updates/main DEP-11 64x64 Icons [226 kB] Get:7 http://archive.ubuntu.com/ubuntu xenial-updates/universe amd64 DEP-11 Metadata [185 kB] Get:8 http://archive.ubuntu.com/ubuntu xenial-updates/universe DEP-11 64x64 Icons [268 kB] Get:9 http://archive.ubuntu.com/ubuntu xenial-updates/multiverse amd64 DEP-11 Metadata [5,888 B] Get:10 http://archive.ubuntu.com/ubuntu xenial-backports/main amd64 DEP-11 Metadata [3,324 B] Get:11 http://archive.ubuntu.com/ubuntu xenial-backports/universe amd64 DEP-11 Metadata [4,712 B] Get:12 http://archive.ubuntu.com/ubuntu xenial-security/main amd64 DEP-11 Metadata [62.7 kB] Get:13 http://archive.ubuntu.com/ubuntu xenial-security/main DEP-11 64x64 Icons [71.2 kB] Get:14 http://archive.ubuntu.com/ubuntu xenial-security/universe amd64 DEP-11 Metadata [51.3 kB] Get:15 http://archive.ubuntu.com/ubuntu xenial-security/universe DEP-11 64x64 Icons [85.1 kB] Fetched 1,578 kB in 1s (1,529 kB/s)                                     Reading package lists... Error! E: Read error - read (5: Input/output error) W: You may want to run apt-get update to correct these problems E: The package cache file is corrupted   If there's any more information you need, don't hesitate to ask in the comments.  Edit 1:  $ sudo df -h Filesystem      Size  Used Avail Use% Mounted on udev            5.9G     0  5.9G   0% /dev tmpfs           1.2G  9.4M  1.2G   1% /run /dev/sda1       135G  7.2G  121G   6% / tmpfs           5.9G   14M  5.9G   1% /dev/shm tmpfs           5.0M  4.0K  5.0M   1% /run/lock tmpfs           5.9G     0  5.9G   0% /sys/fs/cgroup tmpfs           1.2G   88K  1.2G   1% /run/user/1000 /dev/sdb1       932G  300G  633G  33% /media/adoria298/MDrive1   Edit 2 SMART Test results: Illogical twoside margins It looks like we'll be adding  support to Stack Overflow. This is necessary to prevent bots, spammers, and other malicious scripted activity. We only want human beings to post or edit things here!  We'll be using a JavaScript (jQuery) CAPTCHA as a first line of defense:    The advantage of this approach is that, for most people, the CAPTCHA won't ever be visible!  However, for people with JavaScript disabled, we still need a fallback and this is where it gets tricky.  I have written a  which we can re-use.    However, I'd prefer to go with something textual to avoid the overhead of creating all these images on the server with each request.  I've seen things like..   ASCII text captcha: \/\/(_)\/\/ math puzzles: what is 7 minus 3 times 2? trivia questions: what tastes better, a toad or a popsicle?   Maybe I'm just tilting at windmills here, but I'd like to have a less resource intensive, non-image based &lt;noscript&gt; compatible CAPTCHA if possible.  Ideas? I have a datetime column in MySQL.   How can I convert it to the display as mm/dd/yy H:M (AM/PM) using PHP? Wrong posts number on Review section Lately it's happening to me this:  After completing one or more "First Posts" reviews, I go back to the Review Section main page:   And the post counter shows that there are still posts to review. I click the link to review them, but there is nothing.  Refreshing the page doesn't solve the issue: it shows the wrong number again. When hyperref is loaded I receive the following error:     TeX capacity exceeded, sorry [input stack size=5000].   However, when I remove hyperref package it compiles successfully. I traced it back and found that \maketitle causes the error but don't know how to fix it. Is there any way to use hyperref in my setup.   Code:       %!TEX TS-program = xelatex     \documentclass[journal,transmag,]{IEEEtran}      \usepackage[hyphens]{url}     \usepackage{hyperref}      \usepackage{xunicode}      \usepackage{fontspec}      \usepackage{polyglossia}     \setmainlanguage{english}     \setotherlanguage{arabic}     \newfontfamily\arabicfont[Script = Arabic]{Amiri} % Replace 'Simplified Arabic' with a font from your system       \begin{document}     \title{A Very Nice Title}      \author{\IEEEauthorblockN{             John Doe\IEEEauthorrefmark{1}}%,~\IEEEmembership{Member,~IEEE}         \IEEEauthorblockA{\IEEEauthorrefmark{1}My address}         % &lt;-this % stops an unwanted space         \thanks{Manuscript received mm dd, 20xx; revised mm dd, 20xx.               }     }      % The paper headers     \markboth{headers...}%     {Shell \MakeLowercase{\textit{et al.}}: Bare Demo of IEEEtran.cls for IEEE Transactions on Magnetics Journals}      \IEEEtitleabstractindextext{%         \begin{abstract}My Abstract.\end{abstract}          % Note that keywords are not normally used for peerreview papers.         \begin{IEEEkeywords}             Key 1, Key 2     \end{IEEEkeywords}}      \maketitle       \IEEEdisplaynontitleabstractindextext     % \IEEEdisplaynontitleabstractindextext has no effect when using     \IEEEpeerreviewmaketitle       \section{Introduction}     English Text      \begin{Arabic}      السَلَامُ عَلَيكُمْ     \end{Arabic}       \end{document} Number of points on a line in a finite projective plane I've been reading some proofs regarding finite projective planes of order n, and often they start out by assuming that each line contains n+1 points. Is this a fact that follows from the axioms for finite projective planes? Or does this relate to the order of the finite field being projected? (for example in the Fano plane, does the fact that each line contains 3 points follow from the fact that there are 3 elements {0,1,2} in Z_2?) I haven't been able to find a clear explanation of this (clearly I do not yet have a solid understanding of how such planes are constructed). If someone could enlighten me that would be excellent. Can't read code blocks from the Stack Exchange android app