For example in  shows changes I did not make, attributed to my suggested edit. I did not change contents of database examples (Qty columns). Similarly, I did not add "(with how many times it occured)". Same thing happened while editing  (revision 2). See .  That is a bit problematic, as it now attributes those changes to me.  Did I do something wrong, is that a bug in stack exchange, or should it work that way?
I just made some minor edits to the text of .  I didn't edit the tags at all.  When I completed my edits, my edit showed as:    Now, I think those tags were present before I started my edit, and so were probably slipped in by the OP in their edit grace window.  I have no problem with that tagging, but I don't like seeing edits attributed to me that I didn't make.  So, what the heck?
factorization of a^n+1? I'm trying to prove that $a^n+1$ can only be prime if $n$ is a power of $2$. Is there a general factorization of $a^n+1$? Who fired the shot and what is the symbolism in firing shot right next to Lucas at the end of the movie? At the end of , during the deer hunt, there’s a shot fired right next to Lucas (deliberately missing the shot).   Who fired the shot? Is it Theo's son? What is the meaning of that scene? Is someone warning Lucas that he made a mistake and definitely, Lucas will be punished in the future? Idempotent linear operators are projections I'm working on this problem: Suppose $V$ is a Hilbert space and $P : V \to V$ is a linear map such that $P^2= P$ and $\Vert Pf \Vert \leq \Vert f \Vert$ for every $f \in V$. Prove that there exists a closed subspace $U$ of $V$ such that $P = P_U$. I did do some searching online and I know that $P$ is an idempotent matrix and I know that $U$ is supposed to be $\text{range}P$, which I can show is closed. However, I'm having a hard time showing $P_{\text{range}P} = P$. I know that I can decompose $f = g + h$, where $g \in \text{range}P$ and $h$ is in the orthogonal complement of $\text{range}P$. I'm not sure how to proceed. Most of the online searches require that $P$ be self-adjoint, but this question doesn't have this condition. Can I get some help? Is there canon info on shelf life of various potions in Harry Potter? Do we know how long potions (in general, or at least specific ones) are potent (no pun intended) in Harry Potter canon?  E.g. do they last a couple of hours? Minutes? Years?   I seem to vaguely remember some comments of Snape's about Wolfesbane potion therfore I think at least some information exists. Citing two authors gets displayed incorrectly Identification of particles and anti-particles Sugar as a defence against bacteria? mentions that sugar "at a certain level acts as a preservative". I've always been taught that microorganisms eat sugar and expel acids, that is why sugary food are damaging to teeth. How is it that sugar acts as a preservative, then?  Googling the question I've found   though I don't credit the sources as being especially reputable. What is the real reason that sugar can act as a preservative? What happens to the holes in the skull where teeth were developing? In Skeptics.SE, a question regarding the skulls of children arose. Depicting a scary skull where the permenent teeth are "hidden" inside the jaws and the milk teeth are in the their place.  After all milk teeth fall out, and the permanent teeth "rise", do the holes left by them filled up, or do we go around with holes in our jaws?    The picture: Packages: graphics vs graphicx Different websites suggest using one of those two packages.  \usepackage{graphicx} \usepackage{graphics}   What are differences between them? Which is better? I have been trying to get a sense of the different problems in frequentist settings where MCMC is used. I am familiar that MCMC (or Monte Carlo) is used in fitting GLMMs and in maybe Monte Carlo EM algorithms. Are there more frequentist problems where MCMC is used? Can I fetch the value of a non-standard CSS property via Javascript? I am trying to read a custom (non-standard) CSS property, set in a stylesheet (not the inline style attribute) and get its value. Take this CSS for example:  #someElement {   foo: 'bar'; }   I have managed to get its value with the currentStyle property in IE7:  var element = document.getElementById('someElement'); var val = element.currentStyle.foo;   But currentStyle is MS-specific. So I tried getComputedStyle() in Firefox 3 and Safari 3:  var val = getComputedStyle(element,null).foo;   ...and it returns undefined. Does anyone know a cross-browser way of retreiving a custom CSS property value?  (As you might have noticed, this isn't valid CSS. But it should work as long as the value follows the correct syntax. A better property name would be "-myNameSpace-foo" or something.) Inserting a term into a custom taxonomy How to map inherited entities in EF code-first How did Sauron remain in control of the Nazgûl? How do I correct an HSA distribution when I was refunded by a health provider? Is "chutzpah" used by non-Jewish English speakers? If you get stuck in research, at what point in time should you ask for help? It's always worthwhile to take some time to try to figure it out by yourself. But eventually there's a point where you're unsure how much more time it would take to figure it out by yourself (which could take far longer than you originally think), and when asking for help could be more helpful.  So for analytical or computational research, what are some guidelines for when you should ask for help (from either your adviser, other grad students, or other researchers) when you get stuck? This may be a silly question, but I ask it still. If I have declared a shebang  #!/bin/bash    in the beginning of my_shell_script.sh, so do I always have to invoke this script using bash  [my@comp]$bash my_shell_script.sh   or can I use e.g.  [my@comp]$sh my_shell_script.sh   and my script determines the running shell using the shebang? Is it the same happening with ksh shell? I'm using AIX. Is there a proof for this Fibonacci relationship? I was looking at the decomposition of Fibonacci numbers using the definition of $F_n = F_{n-1} + F_{n-2}$, and noted the pattern in the coefficients of the terms were Fibonacci numbers. It appears to hold, and I believe it's true, but I haven't seen a proof for it. Does one exist?  $F_n = 1F_{n-1} + 1F_{n-2}$ $F_n = 2F_{n-2} + 1F_{n-3}$ $F_n = 3F_{n-3} + 2F_{n-4}$ $F_n = 5F_{n-4} + 3F_{n-5}$ etc  This can be generalized to $F_n = F_xF_{n-(x-1)}+F_{x-1}F_{n-x}$ How many triples $(x,y,n)$ are there such that $x^n - y^n = 2^{100}$