When was the phrase "Timey Wimey" first invented by the Doctor?
Is the Doctor Who episode 'Blink' the first use of the phrase "timey-wimey"?
Is 3+1 spacetime as privileged as is claimed? Html form in email Why is that when I open up my file in blender, the reference picture is gone When you are using a reference picture in blender, do you have to keep it? Do the pictures have to stay in your computer? I sometimes delete my reference images, because I'm on my mother's computer and any file I download has to go away. When opening my blender file the pictures are gone. How can I get my reference images to stay in my blender file even if the original file is deleted? Positive series problem: $\sum\limits_{n\geq1}a_n=+\infty$ implies $\sum_{n\geq1}\frac{a_n}{1+a_n}=+\infty$ I have a scenario where I have multiple threads adding to a queue and multiple threads reading from the same queue. If the queue reaches a specific size all threads that are filling the queue will be blocked on add until an item is removed from the queue.  The solution below is what I am using right now and my question is: How can this be improved?  Is there an object that already enables this behavior in the BCL that I should be using?  internal class BlockingCollection&lt;T&gt; : CollectionBase, IEnumerable {     //todo: might be worth changing this into a proper QUEUE      private AutoResetEvent _FullEvent = new AutoResetEvent(false);      internal T this[int i]     {         get { return (T) List[i]; }     }      private int _MaxSize;     internal int MaxSize     {         get { return _MaxSize; }         set         {             _MaxSize = value;             checkSize();         }     }      internal BlockingCollection(int maxSize)     {         MaxSize = maxSize;     }      internal void Add(T item)     {         Trace.WriteLine(string.Format("BlockingCollection add waiting: {0}", Thread.CurrentThread.ManagedThreadId));          _FullEvent.WaitOne();          List.Add(item);          Trace.WriteLine(string.Format("BlockingCollection item added: {0}", Thread.CurrentThread.ManagedThreadId));          checkSize();     }      internal void Remove(T item)     {         lock (List)         {             List.Remove(item);         }          Trace.WriteLine(string.Format("BlockingCollection item removed: {0}", Thread.CurrentThread.ManagedThreadId));     }      protected override void OnRemoveComplete(int index, object value)     {         checkSize();         base.OnRemoveComplete(index, value);     }      internal new IEnumerator GetEnumerator()     {         return List.GetEnumerator();     }      private void checkSize()     {         if (Count &lt; MaxSize)         {             Trace.WriteLine(string.Format("BlockingCollection FullEvent set: {0}", Thread.CurrentThread.ManagedThreadId));             _FullEvent.Set();         }         else         {             Trace.WriteLine(string.Format("BlockingCollection FullEvent reset: {0}", Thread.CurrentThread.ManagedThreadId));             _FullEvent.Reset();         }     } } Bash history search, partial + up-arrow I have searched, but not found anything on this. I am looking for a functionality in bash, using a terminal.  Way back when, I had a user on a debian system, and a friend set me up with a convenient history search feature (I believe I used tcsh then), where I would type the beginning of a previous command, hit up-arrow, and it would do a search, based on the partial string.  E.g. if my history is:  ./script.pl ./script.pl arg1 cat output cat output | grep yada   And I type ., and press up-arrow, it would show me: ./script.pl arg1. Press it again and it would show ./script.pl, etc.  Very much like it would perform a grep on .bash_history. Is there a way to get this functionality? Even when /tmp has no file called something, searching for it with find will return 0:    $ find /tmp -name something    $ echo $?   0   How can I get a non-zero exit status when find does not find anything? Cannot get onto Apple Developer Forums Every time I attempt to log on to the apple developer forums it tells me I need to create a new user account (even though I already have one), and when I try to sign up it gives me an error:   Anyone else have this issue and/or know how to fix it? Thanks! I am trying to determine if the sum $\sum_{n=1}^\infty \frac{n+4^n}{n+6^n}$ is convergent or divergent.   In attempting to solve this problem I began by seeing if I could do the divergence test - in this case it is not helpful. The terms $4^n,6^n$ look like geometric series type terms but the $n$ in the numerator and denominator are troublesome. I first tried factoring $n$ out of the expression:  $$\sum_{n=1}^\infty \frac{n+4^n}{n+6^n} = \sum_{n=1}^\infty \frac{1+\frac{4^n}{n}}{1+\frac{6^n}{n}}$$  Next I tried comparing to the series $$\sum_{n=1}^\infty \frac{\frac{4^n}{n}}{\frac{6^n}{n}} = \sum_{n=1}^\infty \frac{{4^n}}{{6^n}} = \sum_{n=1}^\infty{\left(\frac{2}{3}\right)}^n$$  This is a convergent geometric series as $r = \frac{2}{3}\lt1$  now I reason that the series $\sum_{n=1}^\infty \frac{1+\frac{4^n}{n}}{1+\frac{6^n}{n}}$ is neither smaller not greater than the series $\sum_{n=1}^\infty{(\frac{2}{3})}^n$ Am I able to conclude anything in this case by a direct comparison test or can I only conclude that the first series is convergent if the second is greater than the first?  Thanks $127$ has an interesting property: It is the $31$st prime number and its rank ($31$) is also a prime. $31$ is the $11$th prime so its rank is also a prime. $11$ is also a prime number with a rank ($5$) that is also a prime. $5$ is the 3rd prime number and and so its rank ($3$) is also a prime. And finally $3$ is the $2$nd prime so its rank is also a prime... Is there a name for primes whose rank (index in the prime series) is also a prime? That is:     If $a_i$ is the $i$th prime number, then $i$ is a also a prime.   How about numbers like $127$ where going down ranks of ranks always produce prime numbers (down to rank $2$ of course)? The first $11$ :-) primes in this (infinite) series would be:  $3, 5, 11, 31, 127, 709, 5381, 52711, 648391, 9737333, 174440041, \dotsc$  Many thanks! Output from ls has newlines but displays on a single line. Why? I think I may be overlooking a relatively fundamental point regarding shell. Output from the ls command by default separates output with newlines, but the shell displays the output on a single line.  Can anyone explain this to me? I had always presumed that the output was simply separated by spaces, but now that I see the output separated by newlines, I would expect the output to be displaying on separate lines.  Example:  cpoweradm@debian:~/lpi103-4$ ls text* text1  text2  text3   od shows that the output is separated by newlines:  cpoweradm@debian:~/lpi103-4$ ls text* | od -c 0000000   t   e   x   t   1  \n   t   e   x   t   2  \n   t   e   x   t 0000020   3  \n 0000022   If newlines are present, then why doesn't the output display as:  text1  text2 text3 SOQL query for Multiselect picklist The earth is not a sphere, because it bulges at the equator.   I tried fiddling with centripetal force equations and gravity, but I couldn't derive why this bulge occurs.    Is there   (a) a mathematical explanation using forces (not energies) and   (b) a simple intuitive explanation to explain to others why the bulge occurs? What are the differences between proofs based on simulation and proofs based on games? I was editing my mesh and I wanted to only see a part of my mesh, so I pressed alt+B to only show a selected area. However, I did ctrl+B and created a red rectangle on my screen (I don't know what it does). Does anybody know how to get it off? I am trying to use netcat to send a simple message over TCP, e.g. I want to send the digit 1.  So I understood that I write the following in the terminal, after installing netcat  netcat [ip-address] [port]  But how do I specify the message to be sent? i.e. where to I write "1" ? Question about the Riemann-Lebesgue Lemma proof Ok, so one of the formulations of the Riemann-Lebesgue Lemma says: $$ f\in L^1(\mathbb{R}) \implies \hat{f}(\omega)\to 0\;\mbox{ when } \;|\omega|\to\infty.$$  I get all the steps of the proof, except the one which says that if $f$ is an arbitrary integrable function, it may be approximated in the $L^1$ norm by a compactly supported smooth function $g\in L^1$. My question is: Why? How do you know that for all $\epsilon&gt;0$, and for all arbitrary function $f\in L^1$ exists a compactly supported smooth function $g$ so that $||f-g||_{L^1}&lt;\epsilon$? The "proof" can be found in many places, but this step can be found in Wikipedia I have to compute this integral $$\int_{0}^{\infty} \frac{dt}{1+t^4}$$ to solve a problem in a homework. I have tried in many ways, but I'm stuck. A search in the web reveals me that it can be do it by methods of complex analysis. But I have not taken this course yet. Thanks for any help. If $$S=\frac{1}{1+1^2+1^4}+\frac{2}{1+2^2+2^4}+\cdots+\frac{n}{1+n^2+n^4}\,$$ find the value of $14S$.  The question can be simplified to:  Find $S=\sum\limits_{k=1}^n\,t_k$ if $t_n=\dfrac{n}{1+n^2+n^4}$.  As $1+n^2+n^4$ forms a GP, $$t_n=\frac{n(n^2-1)}{n^6-1}\,.$$ But I can't figure out how to solve further. It would be great if someone could help. Creation of entangled electrons