Event handler not working on dynamic content
Event binding on dynamically created elements?
Clip tool gives ERROR 000732? Solve the integral $\int_0^\infty x/(x^3+1) dx$ I'm new here!  The problem: integrate from zero to infinity x over the quantity x cubed plus one dx. I checked on wolfram alpha and the answer is that the indefinite integral is this:  $$\int \frac{x}{1+x^3} dx = \frac{1}{6}\left(\log(x^2-x+1)-2 \log(x+1)+2 \sqrt{3} \arctan((2 x-1)/\sqrt{3})\right)+\text{constant}$$  and the definite integral is this:  $$\int_0^\infty \frac{x}{1+x^3} dx = \frac{2 \pi}{3 \sqrt{3}}\approx 1.2092$$  I am trying to figure out all the steps in between. I see that there are logs, which are equivalent to the ln variant that i am more familiar with, which means it was integrating $1/x$ at some point; I also see an inverse tangent in there.  I started with long division to simplify and I got (which could be wrong because I am very tired right now) $x/(x^3+1) = x^2+ 1/(x^3+1)$ which seems to be a step in the right direction. Wolfram Alpha thinks I definitely did that step wrong. The two equations do not evaluate as equal.  Then I cheated and took the wolfram alpha factorization of $(x^3+1) = (x+1)(x^2-x+1)$...I probably should have known that but didn't offhand. Now it is looking like $x^2$ plus the partial fraction decomposition $1/(x^3+1) = A/(x+1)+(Bx+C)/(x^2-x+1)$. Am I heading in the right direction with this? At this point do I just plug in and crunch? Understanding the impact/risk of turning off "verify backup integrity" on SQL backup Currently we use standard maintenance plans for backups on the SQL Server 2005/2008/2008R2/2012 servers in our environment, and the "Verify backup integrity" box has always been checked.  Some of the backups run very long, so I've recommended turning off that option, but management needs me to document the impact and risks of this change.  I understand the use and history of this option, it just seems unnecessary to me to double the time for the backup job when (in my opinion), any error that is likely to occur would occur during the backup step, not during the verify.  Am I wrong? Is it minimal risk to turn this off, if I am backing up to disk and not to streaming tape or something? (We back up over the network to an EMC DD-800 backup appliance, if that is relevant.)  Is there any official MS recommendations for when it is safe to turn this off?   Do you run "verify" on every backup in your environment? Do you spot-check them?  EDIT: To clarify, when you check "verify backup integrity" in the maintenance plan, SQL will do a full RESTORE VERIFYONLY on each database immediately after each backup. This is just as data/IO intensive as the original backup, and (basically) doubles the overall time of the backup job. This is not the same as enabling the "checksum" option on backup (which can't be done in the wizard, as far as I know). Is "a total of 10 payments" singular or plural? A total of 10 payments were made.   OR     A total of 10 payments was made.   Which is correct? Or can both be correct? How are Anonymous inner classes used in Java? Let $G$, $H$, and $K$ be abelian groups. Assume $G \oplus H \cong G \oplus K$. If each are finitely generated, then the structure theorem easily gives us that $H \cong K$. However, there are counterexamples in the general case, namely $H=\mathbb{Z}$, $K=\mathbb{Z} \oplus \mathbb{Z}$, and $G=\bigoplus_{i=1}^\infty\mathbb{Z}$.   I am wondering what goes wrong with the following argument:   Form the split short exact sequence  $$0 \to G \xrightarrow{i} G \oplus H \xrightarrow{\pi} H \to 0$$  where $i$ and $\pi$ are the inclusion and projection, respectively. Then don't we immediately get from the first isomorphism theorem that $H \cong (G \oplus H)/G$, which would contradict the counterexample above?   If we run this for the counterexample given, we get the sequence   $$0 \to \bigoplus_{i=1}^\infty\mathbb{Z} \to \bigoplus_{i=1}^\infty\mathbb{Z} \to \mathbb{Z} \to 0$$  which seems to still be short exact, even though here $G \cong G \oplus H$. But of course here we can see directly that $(G \oplus H)/G \cong G/G$, which is trivial. So what went wrong?   It seems to me to be something along these lines: In this case, the kernel of the projection is not the same as the original group, it is just, say, $0 \oplus \mathbb{Z} \oplus \mathbb{Z} \oplus \dots$, i.e. nontrivial from the second coordinate on, which just happens to be isomorphic to the original group. So if we form the other short exact sequence with $K$ in place of $H$, then the difference seems to be that we have two different projection maps with different (but isomorphic) kernels.   But I'm not really sure how to explain this in the general case, if my reasoning is correct to begin with.   Thanks in advance for any help! Why doesn't hydrogen gas exist in Earth's atmosphere? Is there a way to indicate to  how/where to find (paths to)  tools such as python, nmap, php and so on?  I ask this because when I schedule a job using crontab -e, I always need to specify the full path of python, nmap and whatever other tool I want to use. What does increased caster level affect? How to select a clustering method? How to validate a cluster solution (to warrant the method choice)? One of the biggest issue with cluster analysis is that we may happen to have to derive different conclusion when base on different clustering methods used  (including different linkage methods in hierarchical clustering).  I would like to know your opinion on this - which method will you select, and how. One might say "the best method of clustering is which gives you the right answer"; but I may question in response that cluster analysis is supposed to be an unsupervised technique - so how do I know which method or linkage is the right answer?  In general: is a clustering alone robust enough to rely on? Or we need a second method and get a shared result to be based on both?  My question is not only about possible ways to validate / evaluate clustering performance, but is broader - on what basis do we select/prefer one clustering method/algorithm over another one. Also, is there common warnings that we should look around when we are selecting a method to cluster our data?  I know that it is very general question and very difficult to answer. I only would like to know if you have any comment or any advise or any suggestion for me to learn more about this. I am currently working on an update of tkz-euclide and new documentation but I just met the following problem. If I compile this code with pdflatex or lualatex and pgf 2.1 (The library babel does not exist with pgf 2.1) then the code compiles fine but with 3.0 pgf I must comment on the call \usetikzlibrary{babel} (pgf doc gives so I recommend to always load this library by saying \usetikzlibrary{babel}).  I'd like to know where the error occurred. Especially I would like to work around this problem.   With \usetikzlibrary{babel} I get the error Latex Error: ./untitled 2.tex:46 Undefined control sequence. l.1 \tkz@line@start  Bug in babel, bug in tikzlibrary{babel} bug in my code. I would like to keep  \usetikzlibrary{babel} but to avoid the error.  %!TEX TS-program = pdflatex \documentclass[a4paper]{article} \usepackage[french]{babel} \usepackage{tikz}  \usetikzlibrary{calc} %\usetikzlibrary{babel}  \makeatletter \pgfkeys{%     tkzdrawline/.cd,     start/.code         =  {\gdef\tkz@line@start{#1}},%     end/.code           =  {\gdef\tkz@line@end{#1}},%     start style/.code   =  {\tikzset{tkzstartstyle/.style={#1}}},%     end style/.code     =  {\tikzset{tkzendstyle/.style={#1}}},%    /tkzdrawline/.unknown/.code ={\let\searchname=\pgfkeyscurrentname\pgfkeysalso{%                          \searchname/.try=#1,/tikz/\searchname/.retry=#1}}}  %&lt;--------------------------------------------------------------–&gt; %                              Draw line %&lt;--------------------------------------------------------------–&gt; \pgfkeys{tkzdrawline/.cd, start/.code       =  {\def\tkz@line@start{#1}},% end/.code         =  {\def\tkz@line@end{#1}}, start style/.code =  {\tikzset{tkzstartstyle/.style={#1}}}, end style/.code   =  {\tikzset{tkzendstyle/.style={#1}}},   /tkzdrawline/.unknown/.code   = {\let\searchname=\pgfkeyscurrentname                                  \pgfkeysalso{\searchname/.try=#1,                                 /tikz/\searchname/.retry=#1}}}%         %&lt;--------------------------------------------------------------–&gt;  \def\tkzDrawLine{\pgfutil@ifnextchar[{\tkz@DrawLine}{%                                   \tkz@DrawLine[]}}%   \def\tkz@DrawLine[#1](#2,#3){%  \begingroup   \pgfkeys{tkzdrawline/.cd,start = {}, end = {}, start style={}, end style={},}   \pgfqkeys{/tkzdrawline}{#1}   \draw[ /tkzdrawline/.cd,#1] (#2) to%     node [at start,left,/tkzdrawline/.cd,tkzstartstyle] {\tkz@line@start}%     node [at end,right,/tkzdrawline/.cd,tkzendstyle] {\tkz@line@end} (#3);  \endgroup  }%   \makeatother   \begin{document}    \begin{tikzpicture}      \node (A) at (0,1) {};       \node (B) at (5,2) {};       \tkzDrawLine[end = {$\alpha$}](A,B)       \end{tikzpicture}  \end{document} How to submit a form when the return key is pressed? Can someone please tell me how to submit an HTML form when the return key is pressed and if there are no buttons in the form? The submit button is not there. I am using a custom div instead of that. Proving that closed (and open) balls are convex Is there a quick way to lock my Mac? On Windows you can hit the keys Windows+L to lock your computer if you step away.  I don't want to have to remember if sleep currently asks for a password, if there is a time out where my screen isn't locked during a short period. Even with Lion supporting resume of many apps, I don't want to log out.   I do want to be sure data is secure when stepping out for lunch or a smoke break. What is time dilation really? Most of us have seen on the profile page a loss of reputation citing as a reason "User was removed". This reason comes with the useful link:  which explains (emphasis mine):     This message means that a user who voted for one of your posts had their account deleted (either by request or due to violating the network's terms of service). As a result, all of their votes were removed, and the reputation you gained or lost from them was undone. The resultant reputation change could be any amount; it could even be a reputation gain if enough of the removed votes were downvotes. All the reputation changes from a single user's deletion are rolled into a single event in the reputation page labelled "User was removed".      This removal occurs whenever a user is deleted, unless that user had a very high reputation score. Because high-reputation users have usually cast a great many votes, removing all of them could be that much more disruptive to other users. In such cases, the staff use a special deletion that preserves the votes, resulting in no reputation change for those who had been voted on by that user.   However, I have got recently such a message on one of beta sites, where I have no posts. Here is  on that site. As you can see, I have only got points from association bonus,  and the last event in my reputation history is the reputation loss with the message 'User was removed'. (Notice that the post, where I made suggested edit, was not deleted. And the users who approved the posts are Community♦ and one another user, who did not delete their account.)  You can also see from  on that particular site that I have posted no questions/answers there so far. Which means there are no votes on my posts which could have been removed.     Why this did happen? How can I lose reputation points in this way if I have never made a post on that site?   I am not sure if this is a . (Feel free to remove the tag if it does not fit the question.) (EDIT: The answer and the comments posted so far indicate, that it is not a bug, so I have removed the tag from the question.) But if there is some reason why reputation posts can be lost even without having some posts and actual votes on the posts, then the description of "User was removed" seems to be a bit imprecise. (Of course, if it is a very rare edge case, it is probably not that important to have it included in the explanation.)    Just a short disclaimer: I do not care that much for the 2 points I lost. (Obviously, it would be very silly to make a fuss just for 2 points, and even more on a site which I do not frequent that much.) But if this could be indication of some hidden bug, it might be interesting to know more about this.    I have also noticed two related questions       In both cases in some answers or in comments as a possible explanation was given that probably a post, where a suggested edit was made, has been deleted. As you can see from the links I, this is not the case here. How do I install OpenStack? How do I install ? Is there an easier way other than official installation instructions? What is the concept of erasure in generics in Java? This bug was found on a couch in . The couch, and the two beds in the room show no signs of other bugs. Is this a bed bug that I should worry about or something harmless? It was slightly larger than a common tick. How to shop for a lens filter? What should I consider when shopping for a lens filter?    I see filters that range from $15 to $115 and more.  What are the differences between the $15 and the $115 filter?    I'm asking in the generic sense but if you need specifics, I'm looking to buy a UV filter and a polarizing filter for a Panasonic GF1 w/ 20mm pancake lens.  EDIT: I've read some of the other posts and some refer to multi-coating but doesn't explain what is this and why it matters.  What I've gathered from reading related posts is that price is generally the only indication of quality in the case of choosing a filter.  Is this right?