Some years ago I watched a movie I can't remember the title of. The action is kind of blurry as well, but I seem to remember some kind of 'game show' where the contestant got a 'new life'. The main character escapes through some service tunnels, I think, and eventually ends up in a city nearby... or something..? Does it ring any bells, anyone?
I'm trying to find a movie with an underground facility with people wearing white suits. The people have been affected such that they show no curiosity. There is one person that does and asks one of his co-workers where a tube leads to.      At the end there is an uprising where everyone gets to see the surface and sunlight.   What is the name of this movie?
Why can't two series-connected diodes act as a BJT? Another form of the question is: will joining two diodes with wires (pn-np) make a transistor-equivalent?  I read that they are not equivalent, but why? How do I suppress the whitespace above an equation block at the page top? How do I suppress the whitespace above the equation block at the page top ? It is added to the top margin, and I don't want that to happen. I know that \abovedisplayshortskip controls this for the whole document, but how can I change this for this particular equation block and NOT for any others ? Negative vspace doesn't work.  \documentclass[pdftex,12pt,a4paper,english,dutch,leqno]{article} \usepackage[top=1cm,right=1cm,bottom=1cm,left=1.5cm,noheadfoot]{geometry}         \usepackage{babel} \usepackage{amsmath} \usepackage{amssymb} \usepackage{empheq}  \begin{document}  \abovedisplayskip=6pt \abovedisplayshortskip=3pt % This should NOT be changed \belowdisplayskip=6pt \belowdisplayshortskip=3pt  \begin{equation*} \left.\begin{array}{r} a_{31}'=a_{11}\cdot a_{31}-a_{31}\cdot a_{11}=0\\ a_{32}'=a_{11}\cdot a_{32}-a_{31}\cdot a_{12}\\ a_{33}'=a_{11}\cdot a_{33}-a_{31}\cdot a_{13}\\ a_{34}'=a_{11}\cdot a_{34}-a_{31}\cdot a_{14}\\ b_{3}'=a_{11}\cdot b_{3}-a_{31}\cdot b_{1} \end{array}\!\!\right\} \Longrightarrow\; \begin{matrix*}[l] \text{Pseudo-code :}\\ a_{11}\cdot b_{3}-a_{31}\cdot b_{1}\mapsto b_{3}\text{.}\\ \forall\;i\in\{4,3,2,1\} : a_{11}\cdot a_{3i}-a_{31}\cdot a_{1i}\mapsto a_{3i}\text{.} \end{matrix*} \end{equation*}  \end{document} How can I swap or replace multiple strings in code at the same time? Intuitively, $\lim\limits_{t\to -\infty}te^t=0$, since $e^t\to 0$ much faster than $t\to -\infty$.   Is there a way to more rigorously compute this? Writing it as $e^t/(1/t)$ seems resistant to l'Hopital's rule. How do I convert html page to SharePoint 2013 master page? There is functionality provided in SP2013 for converting html page to SharePoint master page. I have tried this functionality but each time it convert nothing. Is there any specific method that I need to follow? Or is there any specif layouts of html page need to be converted into SP 2013 master page? How and when does the tracking of shared links work? Why do electron and proton have the same but opposite electric charge? How to set the background color of the Linux console screen? Note: I reworked the question to clarify the issues. This is a trivial question that can be answered in several parts because the question has several attributes.  Unfortunately, the question may be reworked when the person asking the question apprehends (knows) some parts of the answer as well as the structure of the question.  Therefore, the question is presented from a different point of view than the original one.  How to change the color setting¹ of the Linux console, using a shell utility? How to change the color setting¹ of a terminal emulator, using a shell utility?  Originally, I wanted to change the background color of the Linux console during the execution of a shell script. The following proposition works as I wanted.  #!/bin/sh  # set the background color of the terminal tput setab 6 clear  printf "%s\n" 'background: cyan'  # do some tasks  cd /usr/src/initramfs pwd ls -l  # the background of the shell output is cyan   Nonetheless, someone may encounter several glitches (or difficulties).   For instance, if the screen is not cleared, the background color is only applied to the text output, during a shell script execution. If the command tput setab 6 is submitted with the command line and the screen is not cleared, the background color is only applied to a small portion of the output text. If the command tput setab 6 is submitted on the command line and the screen is cleared, the background color is applied to the full screen but only persists until another command is submitted. [...]  ¹ background color 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? If string is stretched just by weight, where does the gravitational potential energy goes if only half is converted to elastic potential energy? If a spring is stretched by a weight of mass m, (so the extension is $\Delta x$) then $ k = \frac W{\Delta x} = \frac {mg}{\Delta x}$. So $ k\Delta x= mg $.  When the Spring is stretched by distance $\Delta x$ (by the weight) then it looses gravitational potential enegry. ($ \Delta GPE= mg\Delta x$)  But, when we calculate the change in elastic potential energy, We get  $ U = \frac 12 k(\Delta x)^2 $. Since $ k\Delta x = mg$, $U=\frac 12 mg\Delta x$  At, equilibrium we have no kinetic energy $E_k = 0$  Doesn't that violate Energy Conservation?  Where does the rest of lost GPE goes?  Here's a illustration I am looking for an English translation of Markov's 1958 paper, On insolubility of the homeorphy problem, which I remember coming across on a website for a computational topology course (taught by Afra Zomorodian). Where to place log4j.xml Cardinality of the Irrationals Possible Duplicate:          We previously proved that $\mathbb{Q}$, the set of rational numbers, is countable and $\mathbb{R}$, the set of real numbers, is uncountable. What can you say, then, about the cardinality of the irrational numbers?  I would say that the cardinality of irrational numbers is uncountable. That would be because the set $\mathbb{Q}$ is a subset of $\mathbb{R}$. The irrationals is also a subset of $\mathbb{R}$. Basically, my thought is that the continuum is composed of irrationals and rationals (only two subsets of reals). Because we can prove that the rationals are countable by Cantor's proof, then the remaining subsets of $\mathbb{R}$, the irrationals, has to be uncountable for $\mathbb{R}$ to be uncountable. My concern is how to go about the prove this (rigorous, intro level). How to organically merge nested associations? ii) Show that $u$ is not a real part of the function which analytic on $\mathbb{C} \backslash \lbrace 0 \rbrace$ Suppose $u(x,y)=\ln(x^2+y^2)$  i) Show that $u$ is harmonic on $\mathbb{C} \backslash \lbrace 0 \rbrace$  ii) Show that $u$ is not the real part of a function which analytic on  $\mathbb{C} \backslash \lbrace 0 \rbrace$  I manage to show the first part. For the second part, note that $u(x,y)=\ln(x^2+y^2)=\ln(|z|^2)=2 \Re \log(z)$  But this only show that $u$ is not a real part of $\log(z)$. I don know how to show $u$ cannot be the real part of a function which analytic on $\mathbb{C} \backslash \lbrace 0 \rbrace$  Can anyone guide me? I have been working on this exercise for a while now. It's in B.L. van der Waerden's Algebra (Volume I), page $19$. The exercise is as follows:     The order of the symmetric group $S_n$ is $n!=\prod_{1}^{n}\nu$. (Mathematical induction on $n$.)   I don't comprehend how we can logically use induction here. It seems that the first step would be proving $S_1$ has $1!=1$ elements. This is simply justified: There is only one permutation of $1$, the permutation of $1$ to itself.  The next step would be assuming that $S_n$ has order $n!$. Now here is where I get stuck. How do I use this to show that $S_{n+1}$ has order $(n+1)!$?  Here is my attempt: I am thinking this is because all $n!$ permutations of $S_n$ now have a new element to permutate. For example, if we take one single permutation $$ p(1,\dots,n) = \begin{pmatrix} 1 &amp; 2 &amp; 3 &amp; \dots &amp; n\\ 1 &amp; 2 &amp; 3 &amp; \dots &amp; n \end{pmatrix} $$ We now have $n$ modifications of this single permutation by adding the symbol $(n+1)$:  \begin{align} p(1,2,\dots,n,(n+1))&amp;= \begin{pmatrix} 1 &amp; 2 &amp; \dots &amp; n &amp; (n+1)\\ 1 &amp; 2 &amp; \dots &amp; n &amp; (n+1) \end{pmatrix}\\ p(2,1,\dots,n,(n+1))&amp;= \begin{pmatrix} 1 &amp; 2 &amp; \dots &amp; n &amp; (n+1)\\ 2 &amp; 1 &amp; \dots &amp; n &amp; (n+1) \end{pmatrix}\\ \vdots\\ p(n,2,\dots,1,(n+1))&amp;= \begin{pmatrix} 1 &amp; 2 &amp; \dots &amp; n &amp; (n+1)\\ n &amp; 2 &amp; \dots &amp; 1 &amp; (n+1) \end{pmatrix}\\ p((n+1),2,\dots,n,1)&amp;= \begin{pmatrix} 1 &amp; 2 &amp; \dots &amp; n &amp; (n+1)\\ (n+1) &amp; 2 &amp; \dots &amp; n &amp; 1 \end{pmatrix} \end{align}  There are actually $(n+1)$ permutations of that specific form, but we take $p(1,\dots,n)=p(1,\dots,n,(n+1))$ in order to illustrate and prove our original statement. We can make this general equality for all $n!$ permutations: $p(x_1,x_2,\dots,x_n)=p(x_1,x_2,\dots,x_n,x_{n+1})$ where $x_i$ is any symbol of our finite set of $n$ symbols and $x_{n+1}$ is strictly defined as the symbol $(n+1)$.  We can repeat this process for all $n!$ permutations in $S_n$. This gives us $n!n$ permutations. Then, adding in the original $n!$ permutations, we have $n!n+n!=(n+1)n!=(n+1)!$. Consequently, $S_n$ has order $n!$.  How is my reasoning here? Furthermore, is there a more elegant argument? I do not really see my argument here as incorrect, it just seems to lack elegance. My reasoning may well be very incorrect, however. If so, please point it out to me. Proving set theory question I need to prove the following letting A and B be subsets of a universal set U. $$A\cup B = U \iff A^c\subset B$$ It just isn't straight forward to me. Kernel did not upgrade between 14.04 LTS to 16.04 LTS I'm glad the outside overlay scrollbars are finally gone.  But the scrollbar is still a razor thin line that becomes a less razor thin scrollbar, but still thin scrollbar, when the mouse hovers.  How can I get a normal scrollbar? I.e., like in other OSes, like in Firefox, a scrollbar that doesn't change depending on what the mouse points to, and with a nice width.  I already tried  gsettings set com.canonical.desktop.interface scrollbar-mode normal   but no luck. In my class design, I use abstract classes and virtual functions extensively. I had a  feeling that virtual functions affects the performance. Is this true? But I think this performance difference is not noticeable and looks like I am doing premature optimization. Right?