Here's the create statement pulled out of the database itself for a trigger:  CREATE DEFINER=`walkdot_logan`@`67.53.251.66` TRIGGER `wd_artists_bi_trg` BEFORE INSERT ON `wd_artists` FOR EACH ROW BEGIN     IF NEW.modified_on is null THEN          INSERT INTO wd_modified_records         (modified_date, table_name, record_identifiers)         SELECT SYSDATE(), 'artists', CONCAT('code:', NEW.code, ';');          SET NEW.modified_on = SYSDATE();      END IF; END;   Both HeidiSQL and MySQL Workbench are complaining about syntax errors; saying that the semi-colon is missing from the SELECT statement line. MySQL Workbench is even underscoring the closing parenthesis to tell me I'm missing the semi-colon.  EDIT: I should point out that I've tried several insert types, and even simple select statements and the semi-colon error persists. Also, I was able to make this trigger using the trigger creator form in HeidiSQL without incident.
I am trying to create the following trigger:      CREATE TRIGGER update_customers AFTER INSERT ON wp_usermeta     FOR EACH ROW      BEGIN             if new.wp_metakey = first_name then insert into test_customer(first_name) values (new.wp_meta_value);     END   I keep getting a 1064 error that says, "You have an error in your SQL syntax; check the manual that corresopons to your MySQL server version for the right syntaxt to use near " at line 5"  What am I doing wrong?
Cross-reference packages: which to use, which conflict? Inspired by my earlier question , here is another similar question.  There are many different packages for making cross references. Among them , , , , … The  package defines its own cross-referencing command for theorems…  Which collection of packages provides which kind of functionality, and which packages cause conflicts with each other? This morning after the new Fallout Shelter update (1.2), I saw a mysterious stranger hiding in one of my rooms. When he is tapped  there is a sound cue and he disappears in a puff of black vapor.   Does anyone know what's going on here? How to access specific raw data on disk from java How do I install Ubuntu alongside a pre-installed Windows with UEFI? In linear regression, when is it appropriate to use the log of an independent variable instead of the actual values? Consider the brief passage:     "I love your work, but calling you 'the artist' {1} just doesn't seem to be   cutting it anymore. What shall I call you?"      "OK. Call me George." {2}   So my instincts tell me to put {1} in single quotes as opposed to no punctuation (or perhaps even italics) but to do the opposite for {2}. Is this right? Why?  Let me expand this one further iteration:     "Wow, that's a great name, especially with this crowd. Maybe for your next book    you should call yourself Ringo."{3} Is it possible to restore a MySql database only using files from Data directory? Need to delete a directory with name '~' created accidentally Are there infinitely many primes of the form $6^{2n}+1$ or only finitely many? Does anyone know whether there are only finitely many of primes of the form $6^{2n}+1$, where $n$ zero or any natural number? Let $n\in\mathbb N$ and let $a_1,\ldots,a_n$ be natural numbers smaller than $10^n$. Write each $a_k$ in base $10$ and add $0$'s to the left of each decimal expansion, if needed, so that each $a_k$ is written with $n$ digits. Consider the matrix such that the entries of the $k$th row are the digits of $a_k$ (written in the same order). Let $d\in\mathbb N$ be such that $d$ divides each $a_k$. Prove that $d\mid\det A$.   For instance, suppose that $n=4$ and that your numbers are $3876$, $2784$, $684$, and $8388$, each of which is a multiple of $12$. Then$$A=\begin{bmatrix}3 &amp; 8 &amp; 7 &amp; 6 \\  2 &amp; 7 &amp; 8 &amp; 4 \\ 0 &amp; 6 &amp; 8 &amp; 4 \\  8 &amp; 3 &amp; 8 &amp; 8\end{bmatrix}$$and $\det A=-360$, which is, in fact, a multiple of $12$.  I learned about this problem yesterday. I found it quite cute and I decided to share it with all of you.  Note: I know how to prove it. In MTG, what happens when a player loses in multiplayer? In Magic: The Gathering, the rules for a player losing in a multiplayer game are quite complex, so I'd like to try to understand them by example. I would be happy to ask each of these situations as a separate question if that is preferred, but they all seem related, and I would love to have one place to look up all of these answers.  Let's say I'm playing with two friends, Bob and Chloe, in a simple free for all. Unfortunately, I lose. When I lose, suppose the following:   I controlled an  which has exiled Bob's , does he get his bear back? I have a  on the stack targeting Chloe, does Chloe take the 2 damage still? Earlier in the turn I cast  to prevent damage to one of Bob's . If it later takes 3 damage, will that damage be prevented? Something I controlled gave Bob a 1/1 soldier token. What happens to the token? Something Chloe controlled gave me a 1/1 soldier token. What happens to the token? I had a  enchanting one of Bob's army of . What happens to the bear? I had also played  on Bob's final . What happens to the last bear? Chloe had  my . What happens to the Clone? Are there any other situations specifically addressed by the rules? How do I create an Ubuntu live USB using a Mac? Reasons not to use a 741 op-amp? Best way to center a &lt;div&gt; element on a page both vertically and horizontally?  I know that margin-left: auto; margin-right: auto; will center on the horizontal, but what is the best way to do it vertically, too? Emulate "double" using 2 "float"s If a linear operator has an adjoint operator, it is bounded This is a question I'm struggling with for a while:  Let $H$ be a Hilber space. Let  $T,S: H\rightarrow H$ be linear operators (not neccessarily bounded) such that for every $x,y\in H$: $\langle Tx,y\rangle=\langle x,Sy \rangle$.  Prove $T,S$ are bounded.    What I did so far:  First attempt:  $||Tx||^2=\langle Tx,Tx\rangle=\langle x,STx\rangle\le||x||*||STx||\le||x||*||S||*||Tx||$  I'm not entirly sure I'm allowed to do the last inequallity, since $||S||$ might be $\infty$.  It follows $||Tx||\le ||x||*||S||$  and analogly  $||Sx||\le ||x||*||T||$  From the first I'd get $||T||\le ||S||$ and from the second $||S||\le||T||$. Therefore $||S||=||T||$. I don't know where to go from here.  Second Attempt: assume  $T$ isn't bounded, therefore so is $S$, therefore there are series $(x_n),(y_n)\subset H$ such that $||x_n||=||y_n||=1$ and $\lim ||Tx_n||=\infty,\lim ||Sy_n||=\infty$. I'll keep it going soon, but it didn't go so well..    I'd love some guide. Not neccessarily the whole solution, but something that would tell me what i'm missing.  Thanks :) Import PLY doesn't display vertex colors I'm trying to import a .PLY mesh in Blender. I've troubles with colors: the mesh appear in a grayscale palette. Other softwares open it correctly (eg. MeshLab).  This is the header of the PLY file:  ply format binary_big_endian 1.0 comment created by Geomagic Sculpt Exporter. element vertex 182488 property float x property float y property float z property uchar red property uchar green property uchar blue element face 364980 property list uchar int vertex_indices end_header   Any tips? Thanks! Ted Shifrin on this site posed an interesting problem to me: show that   $$ \lim_{(x,y) \to (0,0)} \frac {|x|^ \alpha |y|^ \beta} {|x|^ \gamma + |y|^ \delta} \text {exists} \iff \frac\alpha\gamma + \frac\beta\delta &gt; 1, \,\,\,\,\text{where } \alpha, \beta, \gamma, \delta &gt;0$$  I think I've got the $(\Leftarrow)$ direction as follows: assume WLOG that $\gamma \leq \delta$. Then switch to polar coordinates and get   $$\frac {r^ {\alpha + \beta} (*) } {r^\gamma (1(*) + r^{\delta - \gamma}(*))},$$  where $(*)$ represents some trig stuff that is bounded near zero.   Edit: I need to make sure that $(1(*) + r^{\delta - \gamma}(*))$ is bounded below here.  The other direction is giving me some trouble. It seems we need a lower bound for the fraction (something to force to zero), and I'm not sure where to find one. In particular, I'm not sure what to do with the denominator. Any ideas? 50 question per month limit? I get a message:     Sorry, you are only allowed to ask 50 questions in a 30 day period   Why is there a question limit? 50/month is just not enough :) Let $\mathbf{FinVec}$ denote the category of finite-dimensional real vector spaces and linear maps, let $F\colon\mathbf{FinVec}\rightarrow\mathbf{FinVec}$ be a functor. For each pair of objects $V,W$, the Hom-set $\operatorname{Hom}(V,W)$ is itself a finite-dimensional vector space and we equip it with the unique structure of a topological space/of a smooth manifold that is compatible with its vector space structure. The composition maps are then continuous/smooth. In this way, we view $\mathbf{FinVec}$ as enriched over the category $\mathbf{Top}$/$\mathbf{Diff}$ respectively. It then makes sense to ask whether the functor $F$ is enriched over $\mathbf{Top}$/$\mathbf{Diff}$. That is just to ask whether the induced map $F\colon\operatorname{Hom}(V,W)\rightarrow\operatorname{Hom}(FV,FW)$ is continuous/smooth for all $V,W$. (Irrelevant to the rest of the question, but the reason this is a useful notion is that it is the natural hypothesis assuring that the functor induces another functor on the category of topological/smooth vector bundles, applying the original functor fiberwise.) In the case $V=W$, by functoriality, we can restrict $F$ to a group homomorphism $\operatorname{GL}(V)\rightarrow\operatorname{GL}(V)$. If the functor is continuous/smooth, so is this map. Note that $\operatorname{GL}(V)$ is a Lie group. It is a general result that a measurable group homomorphism between Lie groups is automatically smooth. This begs the following questions:  What's an argument for the existence of functors that aren't continuous? Can we construct one? Given the above, it either happens that the restrictions to $\operatorname{GL}(V)\rightarrow\operatorname{GL}(V)$ are continuous and continuity fails elsewhere, or the induced maps will be non-measurable, so that the construction will necessarily have to involve choice to some extent. Are there continuous functors that aren't smooth? Given the above, a continuous functor will have smooth restrictions to $\operatorname{GL}(V)\rightarrow\operatorname{GL}(V)$, but smoothness may fail elsewhere.