What does (0, eval) () do?
(1, eval)('this') vs eval('this') in JavaScript?
Problem using atan in pgfplots I am looking for an example of a sequence which shows that, $a_{n+1} - a_n \to 0$ as $n \to \infty$ does not imply that sequence $a_n$ converges. I have a feeling that the sequence should be an oscillatory one but I am unable to think of an example. Display bare HTML from hook_menu() What would be the cleanest way to route URLs to functions and return only the HTML output from those functions (a.k.a. the menu callback)?  If I use hook_menu() the string that's returned will be the HTML within the rest of the site. I want the page to display only the string returned from the menu callback.  Should I use drupal_set_header() in the same way drupal_json() does? Is this not inefficient having fully bootstrapped Drupal, and then changing the header at the last minute?  I want the fastest code path possible since this is going to be for widgets on external sites.  I could start with a standalone .php file and bootstrap what I need but the hook_menu routing is nice.    How should you do this? I would like to use Flash Player to show web contents but since today (12 Jan 2021) Adobe is blocking it. Is there a way to use it? I've tried Firefox, Chrome, Safari and Brave browsers. A native speaker said: "I have ever went to" I heard a guy from Manchester, UK said &mdash;     It was the best restaurant I have ever went to.   And Google offers 23 million pages for the query "have ever went to", and only 3 millions for "I have ever gone to".  Is this form correct? Has the grammar changed? Prove that if $n$ is a natural number and $(3n+1)$ &amp; $(4n+1)$ are both perfect squares, then $56$ will divide $n$.   Clearly we have to show that $7$ and $8$ both will divide $n$.  I considered first $3n+1=a^2$ and $4n+1=b^2$. $4n+1$ is a odd perfect square.  - so we have $4n+1\equiv 1\pmod{8}$; from this $2|n$ so $3n+1$ is a odd perfect square.  - so $3n+1\equiv 1\pmod{8}$ so $8|n$ but I can't show $7|n$. How do I show this?  Thanks for the help. Can I get SSH to use an askpass program even if it was run from a terminal? says:  SSH_ASKPASS    If  ssh needs a passphrase, it will read the passphrase from the    current terminal if it was run from a terminal.  If ssh does not    have  a  terminal associated with it but DISPLAY and SSH_ASKPASS    are set, it will execute the program  specified  by  SSH_ASKPASS    and open an X11 window to read the passphrase.   I'd like SSH to use an askpass program even if it was run from a terminal.  On occasion, I have to connect to servers, where there's some delay in showing a password prompt (maybe due to network issues, maybe due to attempted reverse DNS lookups, …). I get annoyed and switch to something else, and forget about the attempted connection. (Insert joke about attention span of a goldfish.) When I finally get back to it, the prompt's timed out and even a correct password would just result in a closed connection.  Keys would be one solution, but not every system I use has my usual SSH keys. However, I usually use Ubuntu systems, and Ubuntu has an SSH askpass program installed by default.  If an askpass window popped up, however, I'd be immediately aware of it. That's a good enough compromise for me, if only I can get it to work. "How to format" block mentions syntax highlighting even if it is not available on the site When you edit the body of a post, the "How to Format" widget is shown in the right sidebar. It mentions the syntax highlighting function, even on  like :    It's probably also a good idea to move the part about code fences down for non-technical sites (like ); other formatting options are more important there. What is the best way to represent show and hide in icons? I have a web page that has a list of columns of information.  All columns have names and then some of the columns have items in them.   I want to have an icon to represent   Hide all empty columns Showing all columns   All of the icons i see for hide look like "delete" so i want to see if there are any representations of "hide" icons that don't look like delete.  And for "show" the only thing i see is an eye graphic which doesn't seem very intuitive to me.  Does anyone have any recommendations for good "hide" and "show" icons? I just want to write \Sha without ruining everything I realize similar questions have been asked before but I am not satisfied with any of the answers I've seen. I would like to use the Cyrillic letter Ш to denote a particular group in mathematics. Most solutions involve using OT2 or T2A encoding; for example, at . However, this makes the other text in the document look bad.   For example, using the solution above, I get    while I would like to have     The first seems to be shaded strangely and the characters don't seem to align right.  Does anyone know how I can write the character Ш (in math mode) without changing the default font for the rest of the text? Let $f$ be a complex function with the property that $f^{(n)} = 0$.  Does this imply that $f$ is a polynomial?  If so, why?  Upon thinking about this problem myself, I can easily observe that every $n$ degree polynomial satisfies $f^{(n+1)} = 0$.  Still, this doesn't show that some non-polynomial function couldn't also have this property. Which is correct: "the below information" or "the information below"? How do I compare 2 rows from the same table (SQL Server)? I need to create a background job that processes a table looking for rows matching on a particular id with different statuses. It will store the row data in a string to compare the data against a row with a matching id. I know the syntax to get the row data, but I have never tried comparing 2 rows from the same table before. How is it done? Would I need to use variables to store the data from each? Or some other way? (Using SQL Server 2008) I'm currently dual-booting to either Ubuntu 10.10 or Windows XP. However, I rarely use windows and would like to remove it.  I've use the Ubuntu live CD to access GParted. I've also deleted the windows partitions (I think), which were labeled both ntfs and fat32.  I'm just not sure how to extend the Ubuntu partition to cover the unallocated space. Furthermore, how do I deal with the 'key' designations, which state that a partition is busy.  Help! Distinct Sylow P subgroups Did Harry Potter lose Voldemort's powers when he lost his connection to Voldemort? Harry noted to Dumbledore that he had a number of things in common with Voldemort. And it was later revealed that some of Voldemort's power was transferred to Harry when Voldemort tried to kill him. So, what powers did Harry get from Voldemort (i.e. Parseltongue and others) and did they all leave him when he stopped being a horcrux?    Update In the Chamber of Secrets Dumbledore states that Harry has many qualities that Salazar Slytherin values in his hand picked students. Parseltongue - resourcefulness - determination - a certain disregard for rules.    So, does anyone know what specific powers Harry got from Voldemort and is there anyway to tell if he lost anything else besides Parseltongue? "Calling dibs" - what does it imply? The term "to have dibs on something" or "to call dibs on something" plays a recurring role in American film and television (e.g. ), so it gets exported a lot.   describes "dibs" as     [...] a common, "informal" convention to reserve or declare full or partial ownership of a community resource, such as a chair [...]   From the usages in the media I have seen, this convention also seems to contain some moral concept which is not described in dictionaries. For me, it looks like by calling dibs (or ), the caller actually receives the (implicit, moral) right to that resource, and this typically goes undisputed by their rivals.  Can you confirm the existence of this concept? Is this something that varies between groups of people (or maybe between regions), or is there a concensus on how to respond to this? Normal subgroup of prime index Generalizing the case $p=2$ we would like to know if the statement below is true.  Let $p$ the smallest prime dividing the order of $G$. If $H$ is a subgroup of $G$ with index $p$ then $H$ is normal. Solve recurrence relation $a_n = 3 a_{n - 3} + a_{n-1} + 2 n$ I am not able to solve the above recurrence relation which involves $n$. The initial conditions $a_0 = 1, a_1 = 2, a_2 = 3$, for $n \geq 0$. Please try to give closed form in terms of arbitrary $a_i \geq 1 $ for $i \geq 0$ I've made a simple snowfall particle simulation (using gandalf3's solution: ). Is there a way to loop the animation, so the transition between last frame and first frame is not visible? Is there a setting to do it?