Fix the footer to bottom but not following the mouse to scroll
How do you get the footer to stay at the bottom of a Web page?
H2G2 — Teleportation Also Results in Time Travel? Compare dates in query from IMPORTRANGE and cell for a few days I'm stuck at comparing two dates.  In a big table with dates as columns and products as rows, we want to display the amount of sales per day per product.  What the following query does:   Import our sales via IMPORTRANGE query the specific sales for a given day and product ID return 0 if there is an error (e.g. not found) count the result   This is a working query with the date 2018-03-26 hard coded:  =COUNTA(IFERROR(query(IMPORTRANGE("1OHR0nr_w3oFNNxtMxRwv65xncCBRpK-vV3vvqmHGFPo"; "Sales March!A:K"); "select Col6 where Col6 = '"&amp;$A95&amp;"' and todate(Col11) = date '2018-03-26'"; 0)))  It shows how many sales a specific product has on the specified date.  Now I want the date from a cell in the sheet:  =COUNTA(IFERROR(query(IMPORTRANGE("1OHR0nr_w3oFNNxtMxRwv65xncCBRpK-vV3vvqmHGFPo"; "Sales March!A:K"); "select Col6 where Col6 = '"&amp;$A95&amp;"' and todate(Col11) = date '"&amp;$AR3&amp;"'"; 0)))  But this doesn't work. I tried A LOT of things for the past 3 days but I have no idea if I did that wrong (I'm a beginner) so I'm turning to you. What might be wrong with the date comparison in this section?  "select Col6 where Col6 = '"&amp;$A95&amp;"' and todate(Col11) = date '"&amp;$AR3&amp;"'"  You can see it  in Column AR Row 95 but I can't give edit rights. How to evaluate $\lim\limits_{n\to+\infty} \prod\limits_{k=1}^n (1+k/n^2)$? I've got a limit which puzzle me several days. The question is  $$ \lim_{n\to+\infty} \prod_{k=1}^n\left(1+\frac{k}{n^2}\right).$$  Can you help me? Thank you in advance How do I disable usb storage? I'm using Ubuntu 12.04 and I want to block usb storage on it. What is the correct way to do this? Fundamental group of a torus with points removed What is the difference between the dashed and solid attack bars? I was flipping through my Pokemon list to see which kind of attacks they had, and I notice there was a small different between the attacks. Some attacks contained a dashed blue bar where as others contained a solid blue bar.   What is the difference and significance between the two? Copy a DVD in Windows 7 Is there any built-in way of copying DVDs in Windows 7 or do I need to install a third party tool? Which meta am I supposed to post on? I'm mostly active on  and we have a separate . Most of my questions on IT Security meta have answers with links here. So my question is, where am I supposed to post what i.e. feature request, bug report, behavior questions? Do we need to unbind event listeners in directives when angular starts to destroy? Write Python stdout to file immediately When trying to write the stdout from a Python script to a text file (python script.py &gt; log), the text file is created when the command is started, but the actual content isn't written until the Python script finishes. For example:  script.py:  import time for i in range(10):     print('bla')     time.sleep(5)   prints to stdout every 5 seconds when called with python script.py, but when I call python script.py &gt; log, the size of the log file stays zero until the script finishes. Is it possible to directly write to the log file, such that you can follow the progress of the script (e.g. using tail)?   EDIT It turns out that python -u script.py does the trick, I didn't know about the buffering of stdout. Question :   Determine all natural numbers n such that 3   divides $n\cdot2^{n}+1$  Actually I don't have any ideas to approach but  my efforts :   I see $n=1,2,7,8,13,14$ so I think :   $n=6k+1$ and $n=6k+2$ $k\in \Bbb{N} $  If I'm not wrong but I don't know how ? I prove it ? Can you attack with different weapons using Extra Attack? The fighter's  feature (PHB, p. 72) says:     Beginning at 5th level, you can attack twice, instead of once, whenever you take the Attack action on your turn.   Assuming I am holding two different weapons, and don't want to spend my bonus action on Two-Weapon Fighting, can I attack once with each weapon? Number of solutions to the congruence $x^q \equiv 1 \mod p$. Let $p, q$ be distinct odd primes, I would like to compute the number of solution $\mod p$ to the congruence $x^q \equiv 1 \mod p$. (Show that it's $gcd(q, p - 1))$  If $x^q \equiv 1 \mod p$, since $q$ is prime, this must mean that $x$ is either $1$ or has order $q$.   Hence, the problem reduces to finding the number of elements of $U_p$ which is either $1$ or has order $q$.  If $ q \nmid  p - 1$, then there is only one element, namely $1$.  If $q \mid p - 1$, then the number of elements of order $q$ is $\phi(q) = q - 1$, and so the number of solutions to the congruence $\mod p$ is $q - 1 + 1 = q$, and in either case the number of solutions is $\gcd(q, p - 1)$.  Does this look fine? I want to load the new entries without reloading the page. I found a great solution for: The ajax script:  &lt;script&gt;     $(document).ready(function() {     var refreshId = setInterval(function()     {         $('#content').fadeOut("fast").load('http://neocsatblog.mblx.hu/new.php').fadeIn("fast");     }, 10000);      }); &lt;/script&gt;   And the php:  &lt;?php require_once("wp-blog-header.php"); ?&gt; &lt;div id="content" &lt;?php cyberchimps_filter_content_class(); ?&gt;&gt;          &lt;?php do_action( 'cyberchimps_before_content'); ?&gt;          &lt;?php if ( have_posts() ) : ?&gt;              &lt;?php while ( have_posts() ) : the_post(); ?&gt;                  &lt;?php get_template_part( 'content', get_post_format() ); ?&gt;              &lt;?php endwhile; ?&gt;          &lt;?php elseif ( current_user_can( 'edit_posts' ) ) : ?&gt;              &lt;?php get_template_part( 'no-results', 'index' ); ?&gt;          &lt;?php endif; ?&gt;          &lt;?php do_action( 'cyberchimps_after_content'); ?&gt;      &lt;/div&gt;   However, this is a special feature that works perfectly here:  However, the main page refuses to load new entries, I do not understand the reason for this, as we use everything the same. $(a^{2^n}+1,a^{2^m}+1)=1 or 2$ Prove that if $m\not =n,a$ are positive integers then $(a^{2^n}+1,a^{2^m}+1)$ is $1$ if $a$ is even and $2$ if $a$ is odd.    I solve the problem in the following way: I assume that $m&gt;n$ then  $$a^{2^m}+1=a^{2^m}-1+2$$ With this expression if I take a divisor prime $p$ of $a^{2^n}+1$ then if $p|a^{2^m}+1$ this prime must divide 2 and the result follows.   But, how can I prove this statement without use of primes? This exercise appears before the concept of prime is introduced then I prefer do not use it.    Any idea?   Thanks! What happens if I unsubscribe from Apple Music, then resubscribe at a later date? I want to cancel my apple music subscription for now, but may want to bring it back this summer. Will all the music I added be permanently removed when I unsubscribe, or will re-subscribing retrieve all my previous music? Automatic tagging of releases Enable replace image feature in LibreOffice A formula for the roots of a solvable polynomial Let $F$ be a field and $p(x)\in F[x]$ a separable polynomial, denote $K$ as the splitting field of $p$ and assume that $K/F$ is Galois with a solvable Galois group.  I don't understand if this imply of any formula (in radicals) for the roots of $p$ (however, I do understand how a formula would imply that $p$ is solvable by roots).  Is there some kind of a way to obtain the roots of a solvable polynomial ? Somewhere in the provided answer:   $$\int \frac{1}{\sqrt{2-x^2}} dx = \sin^{-1}{\frac{x}{\sqrt{2}}}$$  How did they get that? What I have:   $$\frac{1}{\sqrt{2-x^2}} = \frac{1}{\sqrt{2(1-\frac{x^2}{2})}} = \frac{1}{\sqrt{2} \sqrt{1-\frac{x^2}{2}}}$$  $$\frac{1}{\sqrt{2}} \int \frac{1}{\sqrt{1-(\frac{x}{\sqrt{2}})^2}} = \frac{1}{\sqrt{2}} \sin^{-1}{\frac{x}{\sqrt{2}}}$$  So I have an extra $\frac{1}{\sqrt{2}}$ ... I probably had some stupid mistakes?