I have filter for producttypes which is getting created as per enteries in database via ajax:  HTML Part:  &lt;ul id="foodtype"&gt;&lt;/ul&gt;   Ajax Code to show filter:      function showtypes(){         $.ajax({           type: "POST",           url: "ajax/incl/showtype",           data:'',           dataType : 'json',           cache: false,           success: function(records1){                 $('#foodtype').html(makefoodType(records1));           }         });        }         function makefoodType(data1){           var tbl_body = "";             $.each(data1, function() {               var tbl_row = "",                   currRecord = this;               $.each(this, function(k1 , v1) {             tbl_row += "&lt;li&gt;&lt;input type=checkbox id="+v1+" name="+v1+" /&gt;                          &lt;span style=font-size:14px&gt;"+v1+"&lt;/span&gt;&lt;/li&gt;";               })               tbl_body += tbl_row;             })          return tbl_body;       }    The categories are getting displayed properly but when i select checkbox then following code needs to be executed   function getFilterOptions(){    var opts = [d,de];    $checkboxes.each(function(){      if(this.checked){        opts.push(this.id);    }   return opts;   }    var $checkboxes = $("input:checkbox");   $checkboxes.on("change", function(){     var opts = getFilterOptions();     updateProducts(opts);    });   I want the ID of checkbox to be pushed to page having php code. But nothing is happening on checking checkbox.  Note: When i view source code then &lt;ul id="foodtype"&gt;&lt;/ul&gt; code remains inact.. No &lt;li&gt; elements are displayed :(
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.
How can I calculate sensor size (width and height) from focus length, vertical, and horizontal angle of view? How can I tell how long (more or less) it will take me to complete a game? I'm going down my huge backlog of unplayed Steam games and I'm thinking the best way to tackle the list is to go through the shortest games first and then concentrate on the 20+ hour ones. I'm wondering if there's a website or something else that has an estimated amount of gameplay time for games.   Is there anything like that? Intuitive Understanding of the constant "$e$" Quantum mechanics textbooks that use path integrals I'm looking for a textbook in quantum mechanics that relies heavily on Green functions and the path integral formalism to supplement my QM books. I want to do some calculations using alternative methods (path integrals, green functions, Lagrangians etc). Where do I ask a question about copyright? Biblatex with Biber: Configuring my editor to avoid undefined citations Running the minimal example  \documentclass{article} \usepackage{filecontents} \begin{filecontents*}{\jobname.bib} @ARTICLE{example,   author  = {Other, Anthony Norman},   title   = {Some things I did},   year    = {2014},   journal = {J.~Irrep. Res.},   volume  = {1},   number  = {1},   pages   = {1-10} } \end{filecontents*} \usepackage[backend=biber]{biblatex} \addbibresource{\jobname.bib} \begin{document} Hello\cite{example}. \printbibliography \end{document}   I get the warning There were undefined references.  I have read  and know that I need to run:   LaTeX Biber LaTeX   However, my editor is only set up to run BibTeX. How do I go about setting up my editor/IDE to be able to run Biber, and how do I run the LaTeX/Biber/LaTeX cycle?  Answers (sorted alphabetically by editor name)                    Answer guidelines   Each answer should be for one editor. If the editor is cross-platform, if possible give a single answer with notes covering the minor platform variations. Please edit the question to include new answers in the 'link list' Each answer should be 'stand alone', i.e. don't say 'It's almost the same as editor Y but ...' for the editor part Instructions for 'build tools' such as arara or latexmk are welcome but should explain how to set up the editor in question as not all editors allow simple addition of arbitrary tools What's the blue pentagon for in Pokemon XY? On the Pokemon status screen, underneath the Pokemon and to the left of the custom markings, is a small blue pentagon:  This doesn't seem to be present on Pokemon obtained through the Pokemon Transporter from Gen V:  I've looked into it myself, and popular opinion seems to be that it's either some kind of &quot;Legitimate Pokemon&quot; mark or simply to indicate that the Pokemon originates from Gen VI. The latter seems far more likely to me, but do we know for sure what this blue hexagon means? Is it possible for an encryption method to exist which is impossible to crack, even using quantum computers? Quantum computers are known to be able to crack  a broad range of cryptographic algorithms which were previously thought to be solvable only by resources increasing exponentially with the bit size of the key. An example for that is .  But, as far I know, not all problems fall into this category. On , we can read     Researchers have developed a computer algorithm that doesn’t solve problems but instead creates them for the purpose of evaluating quantum computers.   Can we still expect a new cryptographic algorithm which will be hard to crack using even a quantum computer? For clarity: the question refers to specifically to the design of new algorithms. Prove that simultaneously diagonalizable matrices commute Two $n\times n$ matrices $A, B$ are said to be simultaneously diagonalizable if there is a nonsingular matrix $S$ such that both $S^{-1}AS$ and $S^{-1}BS$ are diagonal matrices.      a) Show that simultaneously diagonalizable matrices commute: $AB = BA$.      b) Prove that the converse is valid, provided that one of the matrices has no multiple eigenvalues. Is every pair of commuting matrices simultaneously diagonalizable?   My attempt:  a) Let $M=S^{-1}AS$ and $P=S^{-1}BS$, then it follows that $A= S^{-1}MS$ and $B=S^{-1}PS$. Thus $AB =S^{-1}MSS^{-1}PS = S^{-1}MPS = S^{-1}PMS$ (is it wrong that I switched MP to PM?) $=S^{-1}PSS^{-1}MS=BA$.   b) How can I do this? Fibonacci addition law $F_{n+m} = F_{n-1}F_m + F_n F_{m+1}$ Question: Let $F_n$ the sequence of Fibonacci numbers, given by $F_0 = 0, F_1 = 1$ and $F_n = F_{n-1} + F_{n-2}$ for $n \geq 2$. Show for $n, m \in \mathbb{N}$: $$F_{n+m} = F_{n-1}F_m + F_n F_{m+1}$$   My (very limited) attempt so far: after creating a small list of the values $F_0=0, F_1=1, F_2=1, F_3=2, F_4=3, F_5=5, F_6=8, F_7=13, F_8=21, F_9=34, F_{10}=55$ i can see that yes it does seem to work for instance $F_{6+3}=F_5 F_3 +F_6 F_4 = 10 +24 = 34 = F_9$. However, I really don't know where to begin as showing that this must hold in general terms. Should I be looking to use limits? Or perhaps induction? What is the best way to solve this? How to determine function name from inside a function Using 3rd party Python modules I'm currently developing a script for Blender to handle Mesh Frequency Decomposition.  The script is nearly complete, but i need one more thing: The SciPy library to compute eigenvalues and eigenvectors.  Following the installation instructions on , I'm able to install it as well as Numpy. Numpy works fine, but I can't even import SciPy:  Traceback (most recent call last): File "/CAF_FD.py", line 4, in &lt;module&gt; ImportError: No module named 'scipy' Error: Python script fail, look in the console for now...   By the way, I'm working on Linux 64 bit and I've installed SciPy and Numpy with my package manager.  Edit: When I try to use SciPy with a terminal prompt, it works. What tool do I need to install to make my terminal show the autocompletion of the command that I'm writing? When should I use velocity versus addForce when dealing with player objects? Is there a way to prove that the order of an element in a Group divides the order of the Group, WITHOUT USING LAGRANGE'S This is a very easy fact we use in Group Theory,  But somehow, I wondered that whether there may be another way (other than Lagrange's Theorem) to prove that the order of an element divides the order of Group.  I attempted to go on the term "exponent" of the Group (just assume that G is a Finite Group), which we may define the least common multiple of orders of elements in G. But this exponent divides $|G|$, since the order of each element divides $|G|$. So it became a little paradox.   Shall I think that; before teaching this fact in a Course, one should teach about Lagrange's first? What does "very approximate" mean? An approximate answer is one which is close to the correct answer.  Likewise, we can talk of an approximate model, or approximate methods in mathematics.  The etymology is from the Latin ad, "to" and proximus, "closest", see e.g. .  I don't think this can be disputed.  Occasionally proximate is used as a synonym, though that word has a different meaning in legal English.  So if an approximate answer is close, a very approximate answer should be very close.  In practice, "very approximate" or "very approximately" is overwhelmingly used with the opposite meaning of "roughly", indicating that an answer or estimate is not necessarily accurate.  For examples,   Is there any justification for this use? Is there any justification for my suggested use?  Should we avoid the phrase altogether? Prove that a non-empty closed convex $S$ has an extreme point iff it does not contain any line I am wondering how to prove the following theorem: Let $S \subset \mathbf{R}^{n}$ be a non-empty closed convex set. Then $S$ has at least one extreme point iff $S$ does not contain any line. Extreme point $x \in S$ means that there is no couple of points $y, z \in S$ and $\lambda \in (0;1)$ such that $x = \lambda y + (1-\lambda)z$. I know that every non-empty closed convex set can be represented as an intersection of all closed half-spaces containing the set but I do not know if it is helpful in proving the theorem. Difference between if () { } and if () : endif; Are there any differences between...  if ($value) {  }   ...and...  if ($value):  endif;   ? Cross product term in linear regression why is it zero I'm trying to see why this is the case. I have taken  the LHS and added $X\hat{\beta}$ and subtracted $X\hat{\beta}$.  From this I can get both terms on the right but I end up with a cross product term  $2(y-X\hat{\beta})^T(X\hat{\beta} - X\beta)$  that I can't prove equals to zero. I think there is some trick I'm missing, anybody remember it? Difference between >> and >>> in verilog?