Multiplication of two successive Fibonacci numbers
For the Fibonacci numbers, show for all $n$: $F_1^2+F_2^2+\dots+F_n^2=F_nF_{n+1}$
Why does resistivity increase with temperature?  The explanations I have heard so far are that increasing temperature increases vibrations in the lattice structure resulting in the number of collisions increasing.  But the vibrations from thermal energy are random, so around half of the vibrations would result in the atoms moving out of the electrons way and half would result in atoms moving into the way of the electrons.  And since half of the vibrations result in increasing the drift speed and half reduce it, shouldn't the average drift speed remain the same? How can I find the following limit :$$\lim_{n\to\infty}\left(1-\frac{1}{3}\right)^2\left(1-\frac{1}{6}\right)^2\left(1-\frac{1}{10}\right)^2\cdots\left(1-\frac{1}{\frac{n(n+1)}{2}}\right)^2$$There are four options $(a)\frac1{3}(b)\frac1{9}(c)\frac1{81}(d)0$ Thanks! While CtrlX works fine in vim under windows, CtrlA selects all (duh).  Is there a way to increment a number with a keystroke under windows? Vertical spaces between lines in cases environment \documentclass{article} \usepackage{amsmath} \begin{document} \begin{equation*}   X_i =    \begin{cases}     \left[\begin{smallmatrix}       0 \\ 1 \\ 2     \end{smallmatrix}\right]     &amp;     \text{if $i$ is even;}     \\     \left[\begin{smallmatrix}       2 \\ 1 \\ 0     \end{smallmatrix}\right]     &amp;     \text{otherwise.}   \end{cases} \end{equation*} \end{document}   This is the LaTeX code that I wrote based on a cases environment. There's no space between the matrices on the right. What's the best way to add some vertical spaces to separate them?    p.s. This is a simplified form of my original writing, so I cannot just accept suggestions like 'use a matrix transpose to transform the column vector into a row vector.' How do I manually install Adobe Flash player for Chromium? Set value of textarea in jQuery I am attempting to set a value in a textarea field using jquery with the following code:  $("textarea#ExampleMessage").attr("value", result.exampleMessage);   The issue is, once this code executes, it is not altering the text in the textarea?  However when performing an alert($("textarea#ExampleMessage").attr("value")) the newly set value is returned? Inverse of a diagonal matrix plus a constant I am looking for an efficient solution for inverting a matrix of the following form:  $$D+aP$$   where $D$ is a (full-rank) diagonal matrix, $a$ is a constant, and $P$ is an all-ones matrix.   gives a solution to the special case where all diagonal entries of $D$ are the same.  The  formula is also capable of providing a solution to this problem by setting appropriate $u$ and $v$, but it loses efficiency ($O(n^3)$ time complexity to compute) at high dimension. I am hoping to get a result in the same form so the space and time complexity are both $O(n)$. Ubuntu 20.04 Failed to Set MokListRT: Invalid Parameter I have a MacBook Pro and only use Ubuntu on it. I just upgraded from 18.04 to 20.04. Now when I start the computer it says: Failed to Set MokListRT: Invalid Parameter Could not create mokListRT: Invalid Parameter Importing MOK states has failed: import_mok_state() failed: Invalid Parameter Continuing boot since secure mode is disabled.  Does anyone know EXACTLY how I can fix this?? Step-by-step process I don't want to mess anything up trying to fix this. $n!+1$ being a perfect square One observes that  \begin{equation*} 4!+1 =25=5^{2},~5!+1=121=11^{2}  \end{equation*} is a perfect square. Similarly for $n=7$ also we see that $n!+1$ is a perfect square. So one can ask the truth of this question:   Is $n!+1$ a perfect square for infinitely many $n$? If yes, then how to prove. Is there a difference in meaning among 'should', 'happens to', or 'should happen to'? What are Thumbs.db files for? How can I prevent them from being created? jQuery Event Handler created in loop How to host my existing website with Google Drive Google has given me 15GB of storage. Can I host my own website having my own domain? Free GIS workshops, tutorials, and applied learning material This Q&amp;A lists free as in $0 workshops in GIS and related fields that have their material available to view or download online. The list is not limited to FOSS GIS, as GISers usually use a combination of open and closed source tools to accomplish their tasks. Some of these tools are easier than others and some are better documented. This list will be a great benefit to the community especially for new comers to the field. General GIS   from   from   from   from   Open-source GIS   from   from   from   from   from   ESRI Products   from   from   Transportation These links include either theoretical or applied transportation knowledge in transportation planning          Disaster Management    Databases   from   Geo Statistics    from Why do we need the trilogy instead of just one site? Cross-site AJAX requests I need to make an AJAX request from a website to a REST web service hosted in another domain.  Although this is works just fine in Internet Explorer, other browsers such as Mozilla and Google Chrome impose far stricter security restrictions, which prohibit cross-site AJAX requests.  The problem is that I have no control over the domain nor the web server where the site is hosted. This means that my REST web service must run somewhere else, and I can't put in place any redirection mechanism.  Here is the JavaScript code that makes the asynchronous call:  var serviceUrl = "http://myservicedomain"; var payload = "&lt;myRequest&gt;&lt;content&gt;Some content&lt;/content&gt;&lt;/myRequest&gt;"; var request = new XMLHttpRequest(); request.open("POST", serviceUrl, true); // &lt;-- This fails in Mozilla Firefox amongst other browsers request.setRequestHeader("Content-type", "text/xml"); request.send(payload);   How can I have this work in other browsers beside Internet Explorer? Bounded in Probability and smaller order in probability How to find range $a_{75}$ of the term of the series $a_n=a_{n-1}+ {1 \over {a_{n-1}}} $ If $a_1=1$ and for n&gt;1$$a_n=a_{n-1}+ {1 \over {a_{n-1}}} $$ $a_{75}$ lies between (a) (12,15) (b) (11,12) (c) (15,18)  Now , in this question, I rewrote, $a_n-a_{n-1} = {1 \over {a_{n-1}}}$, to make a telescopic type and summed the terms to get $$a_n-a_{1}= {1 \over {a_{n-1}}}+ {1 \over {a_{n-2}}}...{1 \over {a_{1}}}$$ And as ${1 \over {a_{r}}} &lt;1$ for all r , I got $a_{75} &lt;76$ , but it's of no help as , the upper bound is much higher. I got no further ideas , on how to solve it, please help. Google Chrome is my favorite browser, and I can't imagine going on without it. Suddenly (without closing and re-opening) the browser; chrome has been reading characters upside down, very weird:    Chrome version:    I tried restarting my browser and my MAC (running OS X Yosemite 10.10), but the error keeps on coming. Embed data in a C++ program