I'm making a game using PHP with MySQL and I need an UPDATE query where the fields names could change from one user to another.  My code is:  $upd = $sql-&gt;prepare("UPDATE empire_users SET :p = :p + :p2 WHERE id = :id"); $upd-&gt;execute(array(     ':p' =&gt; "p".$type,     ':p2' =&gt; 10,     ':id' =&gt; $_SESSION["id"] ));   In my database, users have 3 columns : pwood, pstone, pwheat, and $type could only be "wheat", "stone", or "wood".  I want to update the selected field (which depends of $type) to increase by p2 (here 10).
Why can't I pass the table name to a prepared PDO statement?  $stmt = $dbh-&gt;prepare('SELECT * FROM :table WHERE 1'); if ($stmt-&gt;execute(array(':table' =&gt; 'users'))) {     var_dump($stmt-&gt;fetchAll()); }   Is there another safe way to insert a table name into a SQL query? With safe, I mean that I don't want to do  $sql = "SELECT * FROM $table WHERE 1"
The vertical line at the end of the cell where i used cell merge is missing. What is the difference between range and xrange functions in Python 2.X? I am trying to under stand how to build a barrel shifter using multiplexers. I understand how the barrel shifter works but I don't get how you decide the number of multiplexers to use, and how the shifting is done with the multiplexer basically.  So far wikipedia doen't help much. And the best I have so far is   But it does not really answer my question. Installation problem QGIS I do not manage to install QGIS on my windows 10 machine using the osgeo4w installer.  During the installation I get this message:   At the end of the installation I get this message:   And when I subsequently try to run QGIS, I receive this message:    Similar issue can be found in various fora, but none of them provides a conluding answer or did help me to solve the problem.  Any propositions? In simple terms, what is the purpose of flush() in ostream Proof of an elementary property of Projection Operators I'm asked to show the following:  Let $X$ be a linear space, and let $P : X \rightarrow X$ be a projection operator. Restricted to the linear space $range(P)$, the projection $P$ is the identity operator, that is, $Px = x$ for all $x \in range(P)$.  If anyone could offer a hint for how to show this. I'm rusty with linear algebra so don't really know what I'm supposed to bring in outside of what's specified in the lemma/definition of projection. What is so special about the range of P that would make this so? Show group of order $4n + 2$ has a subgroup of index 2. Let $n$ be a positive integer. Show that any group of order $4n + 2$ has a subgroup of index 2. (Hint: Use left regular representation and Cauchy's Theorem to get an odd permutation.)  I can easily observe that $\vert G \vert = 2(2n + 1)$ so $2 \mid \vert G \vert$ and 2 is prime. We have satisfied the hypothesis of Cauchy's Theorem so we can say $G$ contains an element of order 2.  This is where I am stuck  I am confused about how the left regular representation relates to the group. So my understanding at this point is that every group is isomorphic to a subgroup of some symmetric group. My question: is the left regular representation $\varphi : G \to S_G$ an isomorphism? where $G \cong S_G$ or is $S_G$ the same thing as $S_{\vert G \vert}$ and $\varphi$ is only an injection? I'm using Dummit and Foote for definitions.  I saw an argument online that said that since we have an element of order 2, there is a $\sigma \in S_G$ of order 2, but it is a product of $2n + 1$ disjoint 2-cycles. I don't understand how they could claim this and tried working it out on my own but didn't get there. -- They then went on to use the parity mapping $\varepsilon : S_G \to \{\pm1\}$ and since we have an odd permutation $\sigma$, we have $[S_G:\text{ker }\varepsilon] = 2$. I understood their computation but not how that directly shows that $G$ has a subgroup of order 2? unless $G \cong S_G$ because of how left regular representation is defined. (but again, I'm not understanding that concept very well yet.)  So, to be clear about my questions:   What is meant by left regular representation, is it an isomorphism or just an injection? and how would it be used here. If it is an isomorphism, the argument online starts to make more sense, but how can they say that since $\sigma$ is even, it is made up of $2n + 1$ disjoint transpositions? If you have a full, proof, I'd appreciate it, but good hints are just as good!   Thanks you! solve $T(n)=T(n-1)+T(\frac{n}{2})+n$ Using the recursion tree i tried solving this: $T(n)=T(n-1)+T(\frac{n}{2})+n$; the tree has two parts (branches) one that of $T(n-1)$ and other branch is of $T(\frac{n}{2})$. But as the term T(n-1) reach higher depth, I solved that part of the tree. Finally it resulted in O$(2^n)$ is it correct or is it $O(n^2)$? How can we solve it by substitution method? It has been a long time since I have used calculus, and I am trying to understand how the mean and variance of the Laplace distribution with pdf $$f(x|\mu,\sigma) = \dfrac{1}{2 \sigma}\,e^{-\Large\frac{|x-\mu |}\sigma}$$ are derived.  I know that E$[X] = \mu$ and Var$[X] = 2\sigma^2$, but I don't understand how that happens.   Many thanks. Why is there something instead of nothing? A simple but fundamental question.    The "something" means the whole Universe (known and unknown), it could be represented as the reality version of the set of all sets, which is itself . It includes all the  and such.  A better version of the whole Universe could be described with a .  The "nothing" means an absence of the whole Universe, not a particular void or emptiness in the whole Universe but a nonexistent whole Universe. single word that means which can be constructed at home Nuclear Binding energy Consider the following example:  \documentclass{article} \newtheorem{Theorem}{Theorem} \begin{document} \begin{Theorem} On the other hand, this one has only one claim. \end{Theorem} \begin{Theorem} \begin{enumerate} \item First claim \item Second claim \end{enumerate} \end{Theorem} \end{document}   Typesetting it results in:    Notice there is extra horizontal space before the first item in the list of the second theorem.     Is there a sensible way to get rid of that?   Ideally, the solution would work with amsthm, thmtools, enumitem.  N.B.: this is related to  but not quite the same. How can I send email attachment without using an additional library in Perl? Renaming files in lexicographical order with a numerical pattern that increases sequentially with fixed padding I have files such as  a bb ccc abc emrls   I would like to rename them so that, after sorting them (for example, lexicographically), each file gets the following name:  00001 00002 00003 etc   where the # of digits for the 0 padding is specified a priori, e.g. 6 in the case above (assuming that we know how many digits are needed).  Since the shell I am most comfortable with is zsh, I'm interested in solutions that benefit from features on zsh (maybe using zsh's zmv?). I would also be interested in solutions that are compatible with Bash. How do I enumerate the properties of a JavaScript object? "did shoot" vs "shot" Best book of topology for beginner? I am a graduate student of math right now but I was not able to get a topology subject in my undergrad... I just would like to know if you guys know the best one.. I know there are some command-line applications like pdflatex that can help me to compile a LaTex document from C#.Net (using the System.Diagnostics.Process class) .   I wanna know that what's the best command-line tool for compiling a TeX document ? Make Bash autocomplete guess the closest approximation I have a somewhat uncomfortable keyboard on my laptop, resulting in that I sometimes misspell things in Bash and when pressing Tab for an auto-completion nothing happens.   Is it possible to have Bash guess what I meant to type, by for example when wanting to change directory to Documents and then mistyping cd ocum[TAB], given no other folder beginning with "ocum" is present, Bash interprets it as cd Documents/ since it is the closest possible action to do?   Or is this idea terribly complicated to achieve?