Please refer the attached image. I want an inverted colour arrow on the username part in the terminal.  This screenshot is taken from a Mac Terminal.   For the below image, i want an arrow on top the of the whole left side text(as in above image), starting from  dp0522 till the $(in the below image),
is a plug-in to display informational and beautiful statusline for vim, tmux and shell prompt for bash, zsh.  Vim statusline:     How can I install and setup Powerline for different applications and shells in Ubuntu?
iOS: Your passcode is required to enable Touch ID Occasionally, when unlocking my iPhone or iPad, I get the following message:     Your passcode is required to enable Touch ID   Now this is not after a number of failed attempts or turning the device off. The device was used within the last 12 hours. Two of the devices are less than 2 months old, and one is a year old. Everything is up to date. It appears to be happening more-or-less at random.  Does anybody know why this message might appear? Reading the Result of Traceroute When you use tracert www.example.com in the command prompt, what exactly does the returned information tell you, and how does it go about getting that information. Up until now I have only used traceroute to get the I.P. address of a website without really thinking about the bigger purpose of traceroute. Probability that $m$ balls will fall into first box Suppose we have $n$ balls that are randomly distributed into $N$ boxes. Find the probability that $m$ balls will fall into the first box. Assume that all $N^m$ arrangements are equally likely.  Attempt: First, we notice that for the first box, we have $n$ choices, and for the second box we also have $n$ choices, and so on. Thus, we have $n^N$ ways to place the balls into the boxes. Pick $m$ balls out of the total $n$ balls, that gives ${n \choose m}$. In how many ways can these $m$ balls go into the first box? Well, in just ${1 \choose 1 }= 1 $ ways. Thus, $$ P = \frac{ {n \choose m } }{n^N } $$ Is this correct? if $f^{(n)}(x_0),g^{(n)}(x_0)$ exist and $\lim_{x\to x_0} \dfrac{f(x)-g(x)}{(x-x_0)^n}=0$ then $f^{(r)}(x_0)=g^{(r)}(x_0 )$ for all $0\leq r\leq n.$ Show:   if $f^{(n)}(x_0),g^{(n)}(x_0)$ exist and   $$\lim_{x\to x_0} \dfrac{f(x)-g(x)}{(x-x_0)^n}=0$$   then $f^{(r)}(x_0)=g^{(r)}(x_0 )$ for all $0\leq r\leq n.$   My attempt:  let n = 1,  since $f'(x_0),g'(x_0)$ exists then The taylor polynomial exists: $$T_{f,1}(x)=f(x_0)+f'(x_0)(x-x_0), \lim_{x\to x_0} \dfrac{f(x)-T_{f,1}(x)}{(x-x_0)}=0$$  $$T_{g,1}(x)=g(x_0)+g'(x_0)(x-x_0), \lim_{x\to x_0} \dfrac{g(x)-T_{g,1}(x)}{(x-x_0)}=0$$  Then, \begin{align} \lim_{x\to x_0} \dfrac{f(x)-g(x)}{(x-x_0)^n} &amp; =\lim_{x\to x_0} \dfrac{f(x)-g(x)+T_{f,1}(x)-T_{f,1}(x)+T_{g,1}(x)-T_{g,1}(x)}{(x-x_0)^n}\\ &amp;=\lim_{x\to x_0} \dfrac{f(x)-g(x)+T_{f,1}(x)-T_{f,1}(x)+T_{g,1}(x)-T_{g,1}(x)}{(x-x_0)^n}\\ &amp;=\lim_{x\to x_0} \dfrac{f(x)-T_{f,1}(x)}{x-x_0}-\lim_{x\to x_0} \dfrac{g(x)-T_{g,1}(x)}{x-x_0}+\lim_{x\to x_0} \dfrac{T_{f,1}(x)-T_{g,1}(x)}{x-x_0}\\ &amp;=\lim_{x\to x_0}\dfrac{T_{f,1}(x)-T_{g,1}(x)}{x-x_0}\\ &amp;=0 \end{align}  Then, \begin{align} \lim_{x\to x_0}\dfrac{T_{f,1}(x)-T_{g,1}(x)}{x-x_0} &amp;=\lim_{x\to x_0}\dfrac{f(x_0)+f'(x_0)(x-x_0)-g(x_0)-g'(x_0)(x-x_0)}{x-x_0}\\ &amp;=\left(f(x_0)-g(x_0)\right)\lim_{x\to x_0}\dfrac{1}{x-x_0}+f'(x_0)-g'(x_0) \\&amp;=0 \end{align} I am confused because  $\lim_{x\to x_0}\dfrac{1}{x-x_0}$ does not exist. center text in div S(x), which stands for “x is a surgeon”  P(x, y), which stands for “x is a patient of y”  R(x), which stands for “x recovers”  H(x), which stands for “x is happy”  1>"A surgeon with no patients is happy" means: for any person xx, if xx is a surgeon and there is no person yy for which yy is a patient of xx, then xx is happy.  2> "A surgeon is happy if all her patients recover" means: for any person xx, if xx is a surgeon and - if for every person yy for which yy is a patient of xx, we have that yy recovers - then xx is happy.  I have these as solution:  1:∀(x) ( S(x)∧ ∀(y)P(y,x) → H(x) ) 2: ∀(x) [ { S(x)∧ (∀(y)P(y,x) ∧ R(y)) } → H(x)]  Are these okay?  And how do prove that 1 follows from 2 by resolution (not by drawing a truth table)? Make a failed SSH forward a fatal error I have a script which connects to a remote host to replicate some files via SSH.  I must connect to an rsync daemon listening on port 873.  To accomplish this I have a ssh configuration like this.  Host blah     LocalForward 10873 127.0.0.1:873     Hostname 10.2.4.1   Unfortunately because of the timing of this script, there is a small chance that on occasion when it attempts to establish the SSH session another similar script will have the port open to a different host.  If I connect while another ssh session is open I get the obvious message Address already in use.  me@local:~$ ssh blah bind: Address already in use channel_setup_fwd_listener: cannot listen to port: 10873 Could not request local forwarding. Linux remote 2.6.26-2-amd64 #1 SMP Tue Jan 25 05:59:43 UTC 2011 x86_64 motd... remote:~$    What I want to have happen is to have the SSH client immediately exit with a exit code so I can put some logic into my script to report a failure instead of trying to run any commands against the port forwarded to the incorrect host. Installing Reaver 1.4 I am trying to install reaver 1.4, but when I run ./configure ; make I get this message at the end  int ret_val = EXIT_FAILURE, r = 0;   I have searched a fair bit and cannot find an answer, any help would be appreciated. I apologize if this has been answered and I've just failed to find it. ConcurrentModificationException for ArrayList Has Java 3D changed much since 2005? I'm thinking of picking up the book called "Killer Game Programming" by Andrew Davidson, but its pretty old, now. I know Java, and I've been messing with jMonkeyEngine for a few days, but I'm curious to see if I would benefit from the 3D chapters of this book.   The book was published was in 2005. Has Java changed to the point where this book would now be obsolete, assuming it was up to date at time of publication? Why is this power adapter transformerless? What's the best way to find the inverse of datetime.isocalendar()? Boy asks 'How about pie?' I am looking for the title of a 1950s science fiction movie, involving an astronomer trying to decode some extraterrestrial signal, where the juvenile (male) character asks 'how about pi?' which all the adults interpret as a foolish 'how about pie?' question. The book "A First Course in Abstract Algebra" by Fraleigh says      If $G$ is a finite subgroup of the multiplicative group $\langle F^*,\cdot\rangle$ of a field $F$, then $G$ is cyclic. In particular, the multiplicative group of all nonzero elements of a finite field is cyclic.    I wonder why that is. Take $a,b\in F$ such that $a^2=b^2=1$. Then $\{1,a,b,ab\}$ is a non-cyclic subgroup of $F$. Where am I going wrong?  Thanks in advance! Every infinite subset of a countable set is countable. Here is the proof I tried to weave while trying to prove this theorem:     Theorem. Every infinite subset of a countable set is countable.      Proof. Let $A$ be a countable set and $E\subset A$ be infinite. Then $A\thicksim\mathbb{N}$. This implies that there is a sequence $\left\{x_{n}\right\}_{n\in\mathbb{N}}$ where $x_{n}\in A$. Construct a sequence $\left\{n_{k}\right\}_{k\in\mathbb{N}}$ where $x_{n_{k}}\in A$, $n_{1}$ is the smallest positive integer such that $x_{n_{1}}\in A$, and $n_{k+1}&gt;n_{k}$. Then      $$ E=\bigcup_{k=1}^{\infty}x_{n_{k}}, $$      and $E$ is countable, because $E\thicksim\mathbb{N}$. $\blacksquare$   Is it convincing? After hitting 80% LTV, my mortgage lender refuses to remove PMI. Any recourse? To prove Cayley-Hamilton theorem, why can't we substitute $A$ for $\lambda$ in $p(\lambda) = \det(\lambda I - A)$? My regex is matching too much. How do I make it stop? Merge duplicate records into 1 field How to clear current “read-only” state on a USB flash drive I setup with Rufus? Three weeks ago I used  2.2 to install Windows 10 on my machine, and it has write-protected my flash drive. I’ve tried diskpart:  diskpart att disk clear readonly  clean create partition primary format fs=fat32 quick   And it kinda worked, it removed the image off the USB, but now it’s showing:  Current Read-only State : Yes Read-only  : No Boot Disk  : No Pagefile Disk  : No Hibernation File Disk  : No Crashdump Disk  : No Clustered Disk  : No   And I can’t format it or write on it.    The drive is a a Kingston DataTraveler G4 32GB model, without physical switches. How would I restore it back to normal (rw) state?