Third party graphics drivers on ubuntu 16.04 causing boot loop
Ubuntu gets stuck in a login loop
Given fields $K\subseteq L$, why does $f,g$ relatively prime in $K[x]$ imply relatively prime in $L[x]$? Using Fingerprint reader in 16.04 I have a Dell laptop with fingerprint reader inbuilt. I just ran lsusb on terminal and got the following result:   Bus 002 Device 003: ID 138a:0011 Validity Sensors, Inc. VFS5011 Fingerprint Reader Bus 002 Device 002: ID 8087:0024 Intel Corp. Integrated Rate Matching Hub Bus 002 Device 001: ID 1d6b:0002 Linux Foundation 2.0 root hub Bus 004 Device 001: ID 1d6b:0003 Linux Foundation 3.0 root hub Bus 003 Device 002: ID 046d:c077 Logitech, Inc. M105 Optical Mouse Bus 003 Device 001: ID 1d6b:0002 Linux Foundation 2.0 root hub Bus 001 Device 004: ID 05ca:1820 Ricoh Co., Ltd Integrated Webcam Bus 001 Device 003: ID 0a5c:21bc Broadcom Corp. BCM2070 Bluetooth 2.1 + EDR Bus 001 Device 002: ID 8087:0024 Intel Corp. Integrated Rate Matching Hub Bus 001 Device 001: ID 1d6b:0002 Linux Foundation 2.0 root hub   Is it possible to use fingerprint scanning instead of traditional login with 16.04 and Unity ? Thanks. How can one motivate the relativistic momentum? My refrigerator line is 20 amp with 12 gauge wire. Can I tap into that with 14/2 wire, and run a light switch and 1 LED light? Plotting complex numbers Top angular speed of electric motor I recently came across a question asking the following:     If a motor is switched on, it quickly reaches a top speed. Why does it not just go faster and faster and faster?   I thought it might be related to the fact that the electrical power is constant, so I tried approaching with $P=\tau \cdot \omega$. However I still do not have any clue to reaching the conclusion.  Is it somehow related to the energy loss (due to friction)? Like the terminal speed of a parachute or something? But I was thinking that friction should be constant ($f=\mu \cdot N$) while air drag is related to the speed, so this may not be the answer.  Thank you. Intel HD Graphics 620: Does my display adapter support HDMI 2.0 necessary for a 4k display? I want to connect my laptop (Inspiron 15 5000 Series) to a 4k display. When I read online about this it seems that HDMI 2.0 is a necessaity to handle the large resolutions / refresh rates involved to get full benefits of a 4k display.  Use case: I'm not going to use this to play games. Most of my use-case is editing documents, emails, spreadsheets and some engineering drawings and video (watching not editing).   The goal behind going 4k is to boost productivity by having more things open at once to read side by side.   I looked into the Dell specs and they only mention an HDMI without going into the details of what type or whether it will support HDMI 2.0 / 4K TV.     How do I tell whether my Dell Inspiron Laptop (i7 7500 U processor) supports this?  I looked under the Display Adapters and can see that I have an "Intel HD Graphics 620"  listed.   Will this suffice to tell me if this display adapter will support HDMI 2.0 / 4k display?   Or should I be checking out some other settings?  Thanks! Show that there is a positive integer $n$ such that $G \cong \ker(\phi^{n}) \times \phi^{n}(G)$ Let $G$ be a finite abelian group and let $\phi: G \rightarrow G$ be a group homomorphism. I am trying to show that there is a positive integer $n$ such that $G \cong \ker(\phi^{n}) \times \phi^{n}(G)$.  I know that since $G$ is abelian we have that $\ker(\phi^{k})$ and $\phi^{k}(G)$ are normal subgroups of $G$ for any $k$  I also suspect we have the following towers which stabilize at $m$ and $m'$  $$\phi(G) \unrhd \phi^{2}(G) \unrhd \cdots \unrhd \phi^{m}(G)=\phi^{m+1}(G)=\cdots$$  $$\ker(\phi) \unlhd \ker^{2}(\phi) \unlhd \cdots \unlhd \ker^{m'}(\phi)=\ker^{m'+1}(\phi)=\cdots$$  I know that if given a group of the form $HK$ where $H$ and $K$ are normal subgroups of $HK$ and $H\cap K=1$ then $H \times K \cong HK$. I want to apply this to this situation but I am unable to show how write $G$ as a product $HK$  Resolution One of the comments directed me to the following article:  The last part of which answers the question. Below is what is says:  Choose $n=\max(m,m')$, then we have for $x \in \ker^{n}(\phi) \cap \phi^{n}(x)$, this means that $x=\phi^{n}(y)$ for some $y \in G$. This gives:  $0=\phi^{n}(x)=\phi^{2n}(y)$ which means that $y \in \ker^{2n}\phi=\ker^{n}{\phi}$. and then we have that $0=x=\phi^{n}(y)$.  The answer below kindly points out that every element $x$ is contained in one of the cosets of $G/\ker^{n}(\phi)$, this means that $x=k+g$ for some $k \in \ker^{n}(\phi)$ and $g \in G$. We also have that $g=\phi^{n}(h)$ for some $h \in G$. Writing $x=k+\phi^{n}(h)$ essentially shows that $G=\ker(\phi^{n}) + \phi^{n}(G)$. Using the fact above, the claim follows. I want my Ubuntu to look like Mac OS X. Just icon and theme if possible! Is it possible? Is there any way to install slingshot launcher? Repeat command n times? Is it possible to define a command, which repeats the following command n-times? Call it for example \Repeat, then   \Repeat[4] \command{...}    should be equivalent to   \command{...} \command{...} \command{...} \command{...} I wonder if someone knows any general rules of thumb regarding the number of bootstrap samples one should use, based on characteristics of the data (number of observations, etc.) and/or the variables included? I've been studying the Cox Proportional Hazards model, and  this question is glossed over in most texts.    Cox proposed fitting the coefficients of the Hazard function using a partial likelihood method, but why not just fit the coefficients of a parametric Survival function using the maximum likelihood method and a linear model?    In any cases where you have censored data, you could just find the area under the curve.  For example, if your estimate is 380 with standard deviation of 80, and a sample is censored >300, then there is an 84% probability for that sample in the likelihood calculation assuming normal error. Targeting only Firefox with CSS JavaFX: Undecorated Window How can I make my laptop boot automatically from the hard drive without having to press F10 each time? I used to be able to go to Accounts and Import → Add another email address you own and add an email account that's only a forwarding address. That is, it's not a mailbox and I don't have SMTP access to it.  Gmail would send me a confirmation email to that address, I'd confirm it's mine, and done. Now it only gives me the option to add SMTP credentials.  Did they stop supporting the previous method? Is there any other way I can get that option back? For $a,b,c,d \in \mathbb{R}$, is $\sqrt{a^2+b^2} + \sqrt{c^2+d^2} \geq \sqrt{(a+c)^2 + (b+d)^2}$? I have tried to show this using the fact that $\sqrt{x+y}\leq\sqrt{x}+\sqrt{y}\; $  for non-negative $x,y$ but haven't been able to arrive at a proof. Arduino-controlled slot cars - alternative to MOSFETs for speed control? I'm attempting to control the speed of two slot cars in a set using Arduino.    Each car is controlled by a controller with a variable resistor that looks like this:    They're wired in parallel to the same 17V DC power supply:    Simplified:    For Arduino control, I experimented with manipulating a single car's speed using a MOSFET. It worked really well. Using a PWM output on the Arduino, I was able to pulse the MOSFET on and off to throttle the current and change the car's speed. The behavior of the MOSFET seemed to be exactly the same as the variable resistor controller; the resistance, voltage, and current fluctuated the same way on various parts of the circuit.  Enter car B. I added a MOSFET to the setup and mimicked the MOSFET wiring for car A, grounding them both to the Arduino ground. The result looks like this:    Here's a sketch:    Close up, MOSFET A:    MOSFET B:    At first, all seemed well. I sent signals to MOSFET A and successfully changed Car A's speed. I stopped Car A and pulsed MOSFET B, and I was able to control Car B's speed just fine.  Then, I turned Car B to a constant speed, and sent a signal to MOSFET A while Car B was still running. Car A started, but Car B's speed immediately dropped as a result of running Car A.  I hooked a multimeter up across the rails of Car B and watched its voltage while it ran on its own. Then, sure enough, when Car A started running alongside it, Car B's voltage dropped dramatically.  I figured this was because of my wiring configuration, so I left the multimeter on Car B, and made one change. I replaced MOSFET A with the original slot car controller:    I started running Car B again using its MOSFET. The multimeter showed a steady voltage, so I began to squeeze Car A's controller (the variable resistor), and Car A's speed increased. This time, however, unlike using a MOSFET to control Car A, the variable resistor did not affect Car B's voltage at all. Car B remained at a steady speed the whole time.  Any idea why this happens? The MOSFET seemed to function the same as the variable resistor (empirically) with a single car, but had totally different behavior with two cars in parallel. Is it because the MOSFET is not really changing resistance to current, but just switching it on and off, so it opens up another path for current to flow fully every time it closes? Is there an Arduino-controllable alternative to a MOSFET that would fluctuate actual resistance like the variable resistor? Digital potentiometer? Servo hooked up to a potentiometer? ;) I'm really curious what the difference is and what causes the major differences in behavior. Calculate the area on a sphere of the intersection of two spherical caps Given a sphere of radius $r$ with two spherical caps on it defined by the radii ($a_1$ and $a_2$) of the bases of the spherical caps, given a separation of the two spherical caps by angle $\theta$, how do you calculate the surface area of that intersection?   To clarify, the area is that of the curved surface on the sphere defined by the intersection. At the extreme where both $a_1,a_2 = r$, we would be describing a spherical lune.   Alternatively define the spherical caps by the angles  $\Phi_1 = \arcsin(a_1/r)$ and $\Phi_2 = \arcsin(a_2/r)$. Proof/Derivation of Closed form of Binomial Expression $\sum\limits_{k=0}^{2n}(-1)^k\binom{2n}{k}^2$ The binomial expression given as follows: $$\sum_{k=0}^{2n}\left(-1\right)^{k}\binom{2n}{k}^{2}$$ results nicely into the following closed form: $$(-1)^{n}\binom{2n}{n}$$ I wish to know how exactly is it being done? I haven't been able to make much progress in solving it. My approach: \begin{align} \sum_{k=0}^{2n}(-1)^{k}\binom{2n}{k}^{2} = \binom{2n}{0}^{2} - \binom{2n}{1}^{2} + \binom{2n}{2}^{2} - ... -\binom{2n}{2n-1}^{2} + \binom{2n}{2n}^{2} \\ = \binom{2n}{0}.\binom{2n}{0} - \binom{2n}{1}.\binom{2n}{1} + \binom{2n}{2}.\binom{2n}{2} - ... -\binom{2n}{2n-1}.\binom{2n}{2n-1} + \binom{2n}{2n}.\binom{2n}{2n} \\ \text{By Symmetry of binomial coefficients} \\ = \binom{2n}{2n}.\binom{2n}{0} - \binom{2n}{2n -1}.\binom{2n}{1} + \binom{2n}{2n-2}.\binom{2n}{2} - ... -\binom{2n}{1}.\binom{2n}{2n-1} + \binom{2n}{0}.\binom{2n}{2n} \\ = \binom{2n}{2n}.\binom{2n}{0} + \binom{2n}{2n -1}.\binom{2n}{1} + \binom{2n}{2n-2}.\binom{2n}{2} + ... +\binom{2n}{1}.\binom{2n}{2n-1} + \binom{2n}{0}.\binom{2n}{2n} - 2.\left(\binom{2n}{2n -1}.\binom{2n}{1} + \binom{2n}{2n -3}.\binom{2n}{3} + ... + \binom{2n}{1}.\binom{2n}{2n-1}\right) \\ \text{By Vandermond's identity, first component, i.e.not enclosed within -2.(...) evaluates to C(4n, 2n)} \\ \binom{4n}{2n} - 2.(\binom{2n}{2n -1}.\binom{2n}{1} + \binom{2n}{2n -3}.\binom{2n}{3} + ... + \binom{2n}{1}.\binom{2n}{2n-1}) \end{align} I'm lost beyond this point. It will be extremely helpful if someone can direct me in the right direction or provide the answer to this perplexing and challenging problem. Thank you.