I saw the ending of a movie with a lady about to sit in this massive machine in the shape of a loop/circle that looked to be discovered on earth. They had to draw massive amounts of energy to get it to go. When it did, she seemed to travel through space/time with an alien or being narrating about time/space. Only to be woken up with the scientist saying nothing happened due to a machine error.
I remember watching this sci-fi movie where a huge metallic capsule gets dropped from a few hundred meters. The capsule had a chamber inside where only one person could be seated. During the drop, time dilated and the person would transcend to another world, lasting for days, even meeting dead people. Kind of a parallel reality.  It was an amazing movie, but I cannot recall its name.
FFMPEG video from images comes out same (yet incorrect) duration regardless of frame rate Proof that a sequence is convergent Is MacBook Pro warming during gaming normal? I have a 2010 MacBook Pro MC371 (Core i5, GeForce 320M, 4Gb RAM).   When I launch a game either new one (i.e. Starcraft 2) or rather old (Unreal Tournament 2004, bootcamped) my MacBook gets rather warm, even hot in the top left corner, around the place where magsafe charger is plugged in. The temperature is more than 40C. The fact that confuses me is that this warming occures even when I play old games.  Is that OK? I'm reading that a 50mm lens is recommended as a first prime lens for DSLR owners as it's supposed to give a 'natural' perspective, but when used on (most) DSLRs, the view is cropped, as if you were zoomed in by 1.5-1.6x, so it's more of a telephoto lens when used on a DSLR. I've also read however that the 50mm lens gives the same perspective on a DSLR and a 35mm, and shouldn't really be considered to be 'equivalent' to an 80mm lens as the crop factor isn't really a magic focal length changer.  Can someone explain how the image is different from (for example) a 50mm lens on a DSLR and an 80mm lens (assuming 1.6x crop factor) on a 35mm camera? Replacing a toilet, when I turn the water valve off there is still water running into toilet? When trying to replace a toilet, the water valve to toilet will not stop water supply even when valve is shut off. I have opened and closed the valve several times but water continues to be supplied to toilet. Query standard input of lightning-input I want to query standard HTML textarea which is wrapped by lightning-textarea. How can I get it?  &lt;lightning-textarea name=&quot;secret_field&quot; label=&quot;Secret&quot; value={secretFieldValue}&gt;&lt;/lightning-textarea&gt; Can Xdebug be triggered by Drush commands? I'm running into an issue with my Features modules and installation profile when installing the site with drush si. There are a number of probably related issues in the Features issue queue, but none with good solutions. The interesting part (mentioned in some of the issues) is that it works fine when installing the site through the browser, but fails when installing with drush si.  I have an idea of what's wrong, but need to confirm it. The only way I can think of confirming it is to step through the code with a debugger (Xdebug is what I have set up). So, is it possible to trigger Xdebug from a command run with Drush? Specifically, can I get Xdebug to kick in when I run drush si? Migrated question's answers can be upvoted twice by the same user was created on Server Fault, answered on Server Fault, I upvoted some of those answers on Server Fault, and then moved by consensus to Super User.  Now that the question is on Super User, I can upvote the same answers I previously upvoted on Server Fault. If $I$ and $J$ are ideals in a ring $R$ with $1$ such that $I+J = R$, show that $I^m$ and $J^n$ are co-maximal for all $m,n \in \mathbb{N}$ If $I$ and $J$ are ideals in a ring $R$ with 1 which are  co-maximal, i.e $I+J = R$, show that $I^m$ and $J^n$ are co-maximal for all $m,n$ in $\mathbb{N}$  Work done:     Should I proceed using    By taking $$K=I^m+J^m \neq R$$  Let $$S=\{I,J \in R \mid I^m+J^n \neq R \}$$ be the required partially order set ordered by inclusion then  $$I+J \subseteq I^n+J \subseteq I^n+J^m \subseteq \ldots $$  Then, I think this chain doesn't have an upper bound...as $I^m+J^n \neq R$ for all $ m,n \in \mathbb N$. Am I right??  Thanks for any help!! $\DeclareMathOperator{\tr}{tr}$Let's consider a $n \times n$ matrix and the sequence of traces $\tr(A)=\tr(A^{2})= \ldots = \tr(A^{n})=0$. How to prove that $A$ is a nilpotent matrix (a matrix so that $A^{k} \times u = 0$ for all $u \in V$ and for some $k$)?  Maybe it would be reasonable to consider $A$'s Jordan form (we assume that the action occurs over an algebraically closed field, such as $\mathbb{C}$). For example, suppose that we have found it and $A'$ consists of $m$ blocks of sizes $r_{1}, \ldots r_{m}$ ($r_{1}+r_{2}+\ldots+r_{m}=m, r_{i} \in \mathbb{Z}_{+}$) with $\alpha_{1}, \ldots \alpha_{m}$ as corresponding eigenvalues to each of the blocks. Then, according to the problem will get the system  $$\begin{align} r_{1}\alpha_{1}+&amp;\ldots+r_{m}\alpha_{m}=0 \\ r_{1}{\alpha_{1}}^{2}+&amp;\ldots+r_{m} {\alpha_{m}} ^{2}=0\\ &amp;\ ~\,\vdots \\ r_{1}{\alpha_{1}}^{n}+&amp;\ldots +r_{m}{\alpha_{m}}^{n}=0  \end{align}$$  But the system's analysis over $\mathbb{C}$ seems to be too much complicated.  Actually, the problem must have more or less simple solution.  Any piece of advice would be much appreciated. Can you help me with my capacity planning? This is a  about  Related:      I have a question regarding capacity planning. Can the Server Fault community please help with the following:   What kind of server do I need to handle some number of users? How many users can a server with some specifications handle? Will some server configuration be fast enough for my use case? I'm building a social networking site: what kind of hardware do I need? How much bandwidth do I need for some project? How much bandwidth will some number of users use in some application? I came across this problem and I believe Lagrange's theorem is the key to its solution.  The question is:     Let $p$ be an odd prime. Prove that there is some integer $x$ such that $x^2 \equiv −1 \pmod p$ if and only if $p \equiv 1 \pmod 4$.   I appreciate any help.  Thanks. Find the domain of composition of two functions Let $$f(x)= \frac{x}{x-9} \text{ and } g(x) = \frac{-6}{x+5} $$   Find the domain of $f \circ g.$    Please show the steps and substitution/algebra to the problem. Thank you. Citrix receiver error 1000119 I am trying to run Citrix receiver on the Xenial version of Ubuntu, but I am getting this error below  ERROR: Cannot connect to &quot;0.0.0.2 - Remote Desktop Connection&quot; Unknown error 1000119. Verify your connection settings and try again.  What should I do? Is it possible to place windows with keyboard shortcuts in Gnome-Shell? With Compiz in Unity, I could press Ctrl+Alt+6 to place a window on the right-half of the screen, Ctrl+Alt+4 to place it on the left half, Ctrl+Alt+7 to place it in the top left quarter of the screen, and so on. Is there something similar in Gnome-Shell? How is hotness score calculated at larger sites? To start with, I am aware that hot questions from larger sites are somehow "penalized" and :     This is designed to ensure that a single site doesn't dominate the list, and that users see a good sampling of questions that are likely to interest them throughout the network...   I would like to understand how is hotness score really calculated at these sites. The reason why I ask is that per my observations, this seems to be quite different than is documented in the . Specifically, I would like to understand the difference in the impact of answer(s) score and aging factor.  Regarding impact of answers score, my observations of hot questions from smaller sites appear to be in agreement with known formula: (MIN(AnswerCount, 10) * QScore) / 5 + AnswerScore. For example, a question with low score (+1, +2) can get into hot list if it has got answer(s) with sufficiently high score.  At larger sites, this doesn't seem to be the case. Say, it looks like Stack Overflow questions just don't enter hot list until they reach certain score (+6,+7), no matter how many answers are there and how high is their score.  Does system simply totally ignore answers until question reaches certain score?  Another thing I noticed is that questions seem to age away from the hot list 2-3 times faster than ones from smaller sites (having comparable question and answers scores). Granted, this is harder to track and I am not yet sure if I figured that correctly. Do larger sites questions age away faster than those from smaller sites?    For those interested, here is a (partial) list of example questions I studied before asking this: , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , .  Although above examples are only from Stack Overflow, my question isn't (I only used it as an example of a large site in my studies). I would like to understand if hot questions from other larger sites are handled in a similar way. Custom unique constraint, only enforced if one column has a specific value Is there any software to sync files-folders and software between two PCs? For example if I install program 'A' to my desktop I want to be installed to my laptop as well if I have synchronized these two. I want the same with my files and folders. If I change something to my desktop I want the changes to effect my laptop too(I exclude Ubuntu One as a solution).  Thanks for your time and patience! Clear some doubts and questions about the Witch-king of Angmar I recently found out about the war between Arnor and Angmar, and was pretty shocked to learn that the Witch-king basically wiped the floor with the Dúnedain kingdom... I mean he's basically the sole reason Aragorn wanders around like a homeless person.  So with which army did the Witch-king defeat Arnor? Orcs? Men? Sorcery? Did he ever go to battle himself? Did he do this for laughs or by Sauron's orders?   How powerful was the Witch-king at this point, compared to in the Fellowship of the Ring and Return of the King? Were the other Nazgul with him in this war?   And it doesn't even matter to me if all of the eight Nazgul were with him, even if they all had their Rings of Power, and even if they had the largest of armies of Orcs, Men, Elves, Dwarves or even dragons (yes I'm exaggerating at this point), but just how do you defeat a kingdom full of Dúnedain?   We have all seen what Aragorn is capable of doing, so how do you defeat a kingdom worth of Aragorns?   And if it is not much to ask, does anyone know where I can read all about this war and more about the Witch-king? so far all I read about it was from the Internet, wikis, forums and alike, I'd like to read it from the source. $(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!