I want to create a new div tag via  $(this).prepend("&lt;div class='test_close'&gt;&lt;/div&gt;");   and onclick it should close  $(function() {     $(".test_close").click(function() {         console.log("clicked");         $(this).remove();     }); });   but it doesn't work for me...  do you have an idea how i can do this?  thanks in advance and sorry for my bad english
I have a bit of code where I am looping through all the select boxes on a page and binding a .hover event to them to do a bit of twiddling with their width on mouse on/off.  This happens on page ready and works just fine.  The problem I have is that any select boxes I add via Ajax or DOM after the initial loop won't have the event bound.  I have found this plugin (), but before I add another 5k to my pages with a plugin, I want to see if anyone knows a way to do this, either with jQuery directly or by another option.
For example, when I type ping 8.8.8.8 &amp;, why can we see ping process working? And when I type find / -name '*test*' &amp; , it's also seen on monitor.  Why is that? Is it not really in background? Training involved to ride 175 miles (281 km) in a day I want to be able to ride 175 miles (281 km) in a day (to do the ). I used to be able to do about 60 miles (96.5 km), only once hitting 80 miles (128 km), but I'm out of shape now. Wondering how I can systematically train to get to 175 miles at an average of 15 mph (24 km/h) Are there guides out there to help with this?  What's some advice?  [update] The  will happen each year, so my intention isn't to ride this year, rather what do I need to do to ride it in some future year? Im having trouble with the second part of this question,  Let $H$ be a normal subgroup of $G$ with $|G:H| = n$,  i) Prove $g^n \in H$ $\forall g \in G$ (which i have done)  ii) Give an example to show that this all false when $H$ is not normal in $G$.(which I am having trouble with showing)  Any suggestions? I found this in . I've paraphrased for clarity.  There are 100 professors. Some are honest, while others are dishonest. There are more honest professors than dishonest ones. Honest professors always tell the truth, but the dishonest ones sometimes tell the truth and sometimes lie. You can ask any professor the following question about any other professor, "Professor Y, is Professor X honest?" to which he/she will answer yes or no. Design an algorithm that allows you to figure out which of the professors are honest with no more than 198 questions.  The bold part is the kicker. If liars always lied, then the problem is trivial - just ask 99 people about one guy. The majority would be the truthful answer, so you know your honest guys and your liars.  So, any advice? If you give the answer please put it in spoiler tags since I'm just looking for direction. Any subgroup of index $p$ in a $p$-group is normal. How strong is Superman on Krypton? When Superman goes back to visit his home planet (using his ability to travel through time, I guess), is he:    an exceptionally strong and athletic Kryptonian? just an average Kryptonian male? a weakling on account of spending a lifetime in the comparative microgravity of Earth?   A possibly related question: why is Superman so muscular? What kind of weights does he lift to stay in shape?  The answers to  are all about Superman's superpowers on Earth compared with other visitors from Krypton; I'm asking about Kal El without his superpowers.  Clarification: I'm asking about the "classic"  Superman, say late Golden to early Silver Age, roughly 1945-1960. (Yes, I know the concept evolved during those years.) I'm not sure what that would be in terms of "numbered Earths", those came along after my time. I'm pretty sure the Kryptonians of that era had no superpowers in their native milieu, nor would Kal El if he were deported in space-time to his native world. Prove that inequality is true for $x>0$: $(e^x-1)\ln(1+x) > x^2$ I was given a task to prove that inequality is true for x>0: $(e^x-1)\ln(1+x) &gt; x^2$. I've tried to use derivatives to show that the $f(x) = (e^x-1)\ln(1+x)-x^2$ is greater than zero, but has never succeeded.  Any help will be appreciated. I want to run a script on all files with two specific extensions on a disk with a hierarchy of multiple nested folders.  My script works fine when I choose a folder further down the line with fewer subfolders but I'd like to run it on an entire archive with over a thousand folders.  The AppleScript takes forever to get all the files and then exits without returning anything and without executing the operations after getting the files.  No timeout message, no error message.  And the Finder becomes unresponsive (and remains stuck after the script exits).   set myFolder to choose folder with prompt "Choose a folder:"     tell application "Finder"         try             set eafFiles to (every file in entire contents of myFolder whose name ends with ".eaf") as alias list         on error             try                 set eafFiles to ((every file in entire contents of myFolder whose name ends with ".eaf") as alias) as list             on error                 set eafFiles to {}             end try         end try         try             set pfsxFiles to (every file in entire contents of myFolder whose name ends with ".pfsx") as alias list         on error             try                 set pfsxFiles to ((every file in entire contents of myFolder whose name ends with ".pfsx") as alias) as list             on error                 set pfsxFiles to {}             end try         end try         set myFiles to eafFiles &amp; pfsxFiles     end tell      repeat with CurrentFile in myFiles         set CurrentFile to CurrentFile as string          do shell script "perl /path/to/perl/script.pl " &amp; quoted form of CurrentFile     end repeat .NET - What's the best way to implement a "catch all exceptions handler" I'm wondering what the best way is to have a "if all else fails catch it".  I mean, you're handling as much exceptions as possible in your application, but still there are bound to be bugs, so I need to have something that catches all unhandled exceptions so I can collect information and store them in a database or submit them to a web service.  Does the AppDomain.CurrentDomain.UnhandledException event capture everything? Even if the application is multithreaded?  Side note: Windows Vista exposes native API functions that allow any application to recover itself after a crash... can't think of the name now... but I'd rather not use it, as many of our users are still using Windows XP. Evaluating $\lim\limits_{n\to\infty}(a_1^n+\dots+a_k^n)^{1\over n}$ where $a_1 \ge \cdots\ge a_k \ge 0$ Need to find $\lim\limits_{n\to\infty}(a_1^n+\dots+a_k^n)^{1\over n}$ Where $a_1\ge\dots\ge a_k\ge 0$  I thought about Cauchy Theorem on limit $\lim\limits_{n\to\infty}\dfrac{a_1+\dots+a_n}{n}=\lim a_n$ and something like what happen if all $a_i=0$ or $a_1=\dots=a_k$, but may be something I am thinking wrong?  Maybe it is too simple but I am not getting it; please help. Algorithm to detect intersection of two rectangles? I'm looking for an algorithm to detect if two rectangles intersect (one at an arbitrary angle, the other with only vertical/horizontal lines).  Testing if a corner of one is in the other ALMOST works.  It fails if the rectangles form a cross-like shape.  It seems like a good idea to avoid using slopes of the lines, which would require special cases for vertical lines. Asking users to accept answer when they comment that it answers their question I've had a couple of answers today where the OP indicated via a comment that I solved their problem, but the question wasn't upvoted or accepted.  In both cases the person probably wasn't able to upvote since they were new, but they could have accepted my answer. I felt a little guilty asking them to accept the answer, but since it solved their problem I felt that it would help others who stumbled on the question trying to solve their own problem to know that my solution really was the answer. Is asking the OP to accept your answer when they've said that it solved their problem a reasonable thing to do or does that feel like nagging for reputation? Given two ciphertexts $c_1 = enc(p_1)$ and $c_2= enc(p_2)$ using any additive homomorphic encryption scheme (or specifically Paillier).   Can we find out whether the underlying plaintexts $p_1,p_2$ are equal without decrypting $c_1,c_2$ i.e. homomorphically? Understanding English (Listening skills) What's the difference between $(stuff) and `stuff`? I want to leave my Mac awake overnight so it syncs 4GB of data from Dropbox. I need to prevent the machine from going to sleep because that pauses the Dropbox sync  I've been using  to keep the computer awake, but it also keeps the computer unlocked which is insecure.  I need a method to keep my Mac awake (so that Dropbox can sync overnight) but also locked (so no one can read my email). It'd be great if this method also turned off the screen (to preserve power), but honestly that's not even 100% necessary. What is the best (or preferred method) of setting a url parameter on a visualforce page embedded on a standard layout page?    This is easy to do when creating a custom link or a button, but I don't get how to do this on page load via the Apex Controller for the page.   When using a custom button you can do something like /apex/MyPageName?parameter=value  Can I use something like this?   ApexPages.currentPage.getParameters().put('Id',myId) If a product of relatively prime integers is an $n$th power, then each is an $n$th power Show that if $n$, $a$, $b$, and $c$ are positive integers with $\gcd(a, b) = 1$ and $ab = c^n$, then there are positive integers $d$, and $e$ such that $a = d^n$ and $b = e^n$.   I know that (by Bezout) $\gcd\left(a,b\right) = 1$ implies $ax + by = 1$ for some integers $x$ and $y$, and also that $\gcd\left(a^n,b^n\right) = 1$, but this does not help me. elementary row operation change the eigenvalue of a matrix I know that elementary row operations may change the eigenvalues of a matrix, but if these operations don't change the determinant, why should change the eigenvalues??  Thanks How to calculate the limit of $\frac{a_n}{n^2}$ for the sequence $a_{n+1}=a_n+\frac{2 a_{n-1}}{n+1}$? Assume $\{a_n\}$is a sequence which  satisfies the following recursion formula: $$a_{n+1}=a_n+\frac{2a_{n-1}}{n+1}~(n\geqslant 1).$$ and $a_0=\pi,a_1=\pi^2 $. How to compute $\displaystyle\lim_{n\to \infty}\frac{a_n}{n^2}$?