I want to show data from sql in my php page but I get this error:      "Error: SQLSTATE[42000]: Syntax error or access violation: 156   [Microsoft][SQL Server Native Client 11.0][SQL Server]Incorrect syntax   near the keyword 'user'. (SQLExecute[156] at   ext\pdo_odbc\odbc_stmt.c:258)"   This is the code I am using and when I check if the odbc:odbc2sqlserver connection it says 'true'.  I searched on other questions but I could not find working answer.  &lt;tr&gt;         &lt;td&gt;             &lt;div id="wrapper"&gt;                 &lt;?php                 echo "&lt;table style='border: solid 1px black;'&gt;";                 echo "&lt;tr&gt;&lt;th&gt;UserID&lt;/th&gt;&lt;th&gt;Username&lt;/th&gt;&lt;th&gt;Password&lt;/th&gt;&lt;th&gt;Beheerder&lt;/th&gt;&lt;/tr&gt;";                  class TableRows extends RecursiveIteratorIterator {                     function __construct($it) {                         parent::__construct($it, self::LEAVES_ONLY);                     }                      function current() {                         return "&lt;td style='width:150px;border:1px solid black;'&gt;" . parent::current(). "&lt;/td&gt;";                     }                      function beginChildren() {                         echo "&lt;tr&gt;";                     }                      function endChildren() {                         echo "&lt;/tr&gt;" . "\n";                     }                 }                  $servername = "localhost";                 $username = "root";                 $password = "";                 $dbname = "Taaltrainer";                  try {                     $conn = new PDO("odbc:odbc2sqlserver");                     $conn-&gt;setAttribute(PDO::ATTR_ERRMODE, PDO::ERRMODE_EXCEPTION);                     $stmt = $conn-&gt;prepare("SELECT * FROM user");                     $stmt-&gt;execute();                      // set the resulting array to associative                     $result = $stmt-&gt;setFetchMode(PDO::FETCH_ASSOC);                     foreach(new TableRows(new RecursiveArrayIterator($stmt-&gt;fetchAll())) as $k=&gt;$v) {                         echo $v;                     }                 }                 catch(PDOException $e) {                     echo "Error: " . $e-&gt;getMessage();                 }                 $conn = null;                 echo "&lt;/table&gt;";                 ?&gt;             &lt;/div&gt;         &lt;/td&gt;     &lt;/tr&gt;
One of my columns is called from. I can't change the name because I didn't make it. Am I allowed to do something like SELECT from FROM TableName or is there a special syntax to avoid the SQL Server being confused?
Change the passphrase of an ecryptfs directory How do I wire two lights with a switch? The series $\sum_{n=2}^{\infty }\frac{1}{\log (n!)}$ I'm trying to find out whether this Series $\sum_{n=2}^{\infty } a_{n}$ converges or not when $$a_{n}=\frac{1}{\log (n!)}$$  I tried couple of methods, among them: d'Alembert $\frac{a_{n+1}}{a_{n}}$,   Cauchy condensation test $\sum_{n=2}^{\infty } 2^{n}a_{2^n}$, and they both didn't work for me.  Edit: I can't use stirling, and integral.  Thank you Aware abbreviating those commands need not always be helpful, I would like to know how to abbreviate them? The following is what I tried, which does not work:  \documentclass[11pt,handout]{beamer} \newcommand{\bframe}{\begin{frame}} \newcommand{\eframe}{\end{frame}} \newcommand{\ftitle}{\frametitle}   \author{Author} \title{Title}   \begin{document} \maketitle  \begin{frame} \frametitle{Outline}  \end{frame}   \bframe \ftitle{Introduction}  \eframe    \end{document}   At first I thought it might be the case that commands such as \bframe was already defined. But using \def instead still gives no desired result. What is the purpose of the EBP frame pointer register? Does there exist a surjective homomorphism from $(\mathbb R,+)$ to $(\mathbb Q,+)$ ? Does there exist a surjective homomorphism from $(\mathbb R,+)$ to $(\mathbb Q,+)$ ?  ( I know that there 'is' a   'surjection' , but I don't know whether any surjective homomrophism from $\mathbb R$ to $\mathbb Q$ exist or not . Please help . Thanks in advance ) We have played a 7-team competition, all seven teams met, we eliminated the team with the lowest points. After that the remaining six teams played knock out games and the three winning teams will go direct to semi-finals.  We decided that 4 teams should be picked to go for semi-final and that the best loser will join the other three to make it four teams to battle at the semi-final and final.  During the quarter final games, one team is beaten 2-0, another is beaten 3-0 and the third team is beaten in a penalty shoot-out by 4-0.  Now should you want a best loser to join the other three teams making four teams to play in the semi-final, who among these three teams would be in the best losers position. If the sum of $n$ cubes is zero, then the sum must be no larger than $\frac n3$. Assume that $a_1,...a_n$ are real numbers and $-1 \leq a_i\leq 1$ for $1\leq i\leq  n$. If $$a_1^3+\ldots +a_n^3=0$$ Then show that $$a_1+a_2+\ldots+a_n\le n/3$$   I just came cross this problem the other day. I totally have no idea how to prove it. Are there any hints about which theorem, principle or method to apply? I was trying to solve the following:  Given: $0 &lt; a &lt; b$ and $n&gt;1$, prove: $$na^{n-1}(b-a) &lt; b^n-a^n &lt; nb^{n-1}(b-a)$$  I managed to get this far using the mean value theorem: $$a^n(b-a)&lt;b^n -a^n&lt;b^n (b-a)$$ Any idea how to continue? Increase iPhone call history Form inside a table Consider $\mathbb R^{[0,1]}$ the space of all functions from $[0,1]$  to $\mathbb R$  and the cylindrical sigma algebra $\mathcal B$  on it. The question is: how to prove that $C[0,1]\notin \mathcal B$. Sending 2D arrays in Fortran with MPI_Gather Cannot delete files, nothing seems to work I am on Windows 7.  I have some files on my computer leftover from an old version of Photoshop.  (I think... I don't remember exactly where they came from, but they seem to be Adobe files.)  There are 124 of them in a folder, which I have named "KILL."  (I don't remember what the original name of this folder is, it's been on my comptuer a long time.)  These files seem to be absolutely undeletable, as far as I can tell.  I can move them around and change the name of the folder, but deleting them is out of the question.  I also can't move them onto a different hard drive or flash drive, I've tried that.  So, let me list the things I've tried first:   A whole bunch of different "unlocking programs."  Including: IObit Unlocker, Lock Hunter, FileAssassin, and Project Kill box.  What I use LockHunter I am told: "No processes locking this file or folder have been found."  All of the other programs I've tried give me similar messages, telling me that nothing is locking the files.  Yet when I try to delete the files using LockHunter, I am simply told "Cannot delete x."  No reason is given. Tried using cmd.exe.  Even when I run a command window under administrator, it won't even let me access the KILL folder, much less delete anything.  I also tried killing explorer.exe from the task manager, and then using the cmd window.  Still can't even access that folder. Tried using safe mode in combination with these other options, doesn't change a thing. Tried changing permissions of the files using the security tab under properties.  It simply says "not inherited."  It will not allow me to change a thing. I am definitely the administrator of this computer. Tried Disk Cleanup and Defrag.  I suspected that some files must be damaged or something, but Disk Cleanup wasn't able to find any errors.  Defrag didn't help.   So, let me just say that I am not a computer expert.  But based on all the things I've tried, I suspect that this might be some hardware problem?  It seems strange that these files don't seem to be used by any processes, and yet are absolutely undeletable no matter what I do.  Is there anything else I can try?  Has anyone had any similar experience, and have any idea why this might have happened?  EDIT: Interesting recent development.  As I have toyed with moving the folder around, I moved it to the Program Files folder.  Now that it's there, it suddenly CANNOT be moved nor renamed.  It is stuck there, apparently permanently, as a folder called "KILL."  How irritating. If $A|B$ and $B|A$ then prove $A=\pm B$ If $A|B$ and $B|A$ then prove $A=\pm B$   So far I have $A|B \iff AX=B$ and $B|A \iff BY=A$ with $X,Y \in \mathbb{Z}$  Not sure how to finish, any help. Explicit construction of a finite field with $p^n$ elements Which is correct: "what if there was" or "what if there were"? Possible Duplicate:          Is this correct grammar?     What if there was a Stack Overflow on…    Shouldn't it be "what if there were a Stack Overflow on…"? Execute task if tasker profile has been active for some time How can I execute a tasker task only after a certain condition has been true for a certain time?  Normally a profile executes its task as soon as all conditions are met. I want to delay this activation, until the conditions have stayed true for some time.  E.g.    do something after the screen has been continuously off or on for 10 minutes do something after wifi xy has not been near for 10 minutes do something after cell towers x,y,z have not been near for 10 minutes. I often hear about subatomic particles having a property called "spin" but also that it doesn't actually relate to spinning about an axis like you would think. Which particles have spin? What does spin mean if not an actual spinning motion? How to prove that $\mathbb{Q}$ ( the rationals) is a countable set I want to prove that $\mathbb{Q}$ is countable. So basically, I could find a bijection from $\mathbb{Q}$ to $\mathbb{N}$. But I have also recently proved that $\mathbb{Z}$ is countable, so is it equivalent to find a bijection from $\mathbb{Q}$ to $\mathbb{Z}$?