Currently I have 11 settlers, hoping to get some more but I need more food.  However the issue is I can't tell which settlers are farming food, or doing 'other' things such as slacking off enjoying the radiation.  Is there anyway to see what each settler is up to in your settlement without selecting each on of them in turn?
Is it possible to see a list of the settlers in a given settlement and the jobs they are assigned to? It would make it easier to pick a settler for a new job.
Is it possible to animate which characters of a text object are assigned to a material? My online friend is asking for money in order to visit my home country. Is this a legit request or a scam? On Travel.SE we often see questions about a person (usually a love interest) asking for money to pay for airfare, visas, permits and other expenses. For example        What general advice can be given in such situations to the person asking the question? Is it all a scam or can there be legitimate situations in which an online friend could be asking for money? Does this seemingly elementary question require König's theorem? Attributing contributions to academic work that occur in Stack Exchange Differences among "It feels...", "It looks...", and "It seems..." How many combinations can I make? let $n \gt 1$ be an integer, and consider $n$ people; $P_1, P_2,..., P_n$ let $A_n$ be the number of ways these $n$ people can be divided into groups, such that each group have either one or two people  determine $A_1, A_2, A_3$  So I have  $A_1 = 1$ way $A_2 = 4$ way $A_3 = 12$ way  But I am not sure if this is right... Can anyone confirm?  edit:  My way of getting this is  $A_1 = 1 $ because {P1} only has 1 way to sort  $A_2 = 4$ because {P1,P2} = {P1,P2},{P2,P1},{P1P2},{P2P1}  etc. Why do I see a saddle in this picture of a computer screen? I am not entirely sure this is an appropriate question for PSE, however since many of you have such diverse backgrounds, I'll give it a shot.  I have noticed that when one takes a picture of a computer, TV screen with a phone, you can "see" what looks like a saddle phase portrait.     Why does this happen? Does it have any relevance to differential equations or other areas of math? Derivative of the product of operators and Derivative of exponential I'm asked to show that  $$\frac{d(\hat{A}\hat{B})}{d\lambda} ~=~ \frac{d\hat{A}}{d\lambda}\hat{B} + \hat{A}\frac{d\hat{b}}{d\lambda}$$ With $\lambda$ a continuous parameter. Should I use the definition $$\frac{d\hat{A}}{d\lambda} ~=~ \lim_{\epsilon \to 0} \frac{\hat{A}(\lambda + \epsilon) - \hat{A}(\lambda)}{\epsilon}$$ applied to $\hat{A}\hat{B}$ like $$\frac{d(\hat{A}\hat{B})}{d\lambda} ~=~ \lim_{\epsilon \to 0} \frac{\hat{A}(\lambda + \epsilon)\hat{B}(\lambda + \epsilon) - \hat{A}(\lambda)\hat{B}(\lambda)}{\epsilon}$$ and do some algebra to get the RHS of the first equation, or I'm missing something? Another interesting derivative to pay attention to is: $$\frac{d}{d\lambda}\exp(\hat{A}(\lambda) )~?$$ How do we remove an ex-girlfriend from a car loan? Ubuntu 18.04 opening system setting logs me out I've recently installed Ubuntu 18.04 in a dual-boot configuration with Windows 10. I noticed today that, when trying to open system settings, Ubuntu seems to log me out to the lock screen. When I log back in, all previously-running applications are now closed. Very unsure what to do from here, any help much appreciated. The Raspberry Pi B+ models have a protection circuit between the USB connector and the 5V net on the board.  They recommend putting a similar protection circuity on a Pi HAT before 'backpowering' the pi through its GPIO header along with a polyfuse.  I understand why this is the recommendation, but I'd like to understand more about how this circuit works.  I did some searching before posting this question and found information on using a MOSFET as a low voltage drop diode, but they all had the gate wired directly to ground without the pair of PNP's and the resistors.  What are they doing for this circuit?  Also, is this primarily using the body diode?  In which case, what's the relevant info on the datasheet that qualifies DMG2305UX for this application?  In the other circuits I found, it appeared low Rdson and Vgsth compatible with the circuit seemed like the relevant characteristics. How to automatically install entire Google Web Fonts collection? Suppose that   $$f(x)=1+\sum_{n=1}^\infty a_n \frac{x^n}{n!}\ \ \forall \ x\in \mathbb{R}$$   where $\sup_{x&gt;0}\left|e^xf(x)\right| &lt; \infty$ and $\sup_{n\in\mathbb{N}} |a_n|&lt; \infty$.      Prove that $a_n = (-1)^n$ , $\forall n\in \mathbb{N}$   It seems amazing to me. What we need to prove is $f(x)=e^{-x}$. It seems insufficient to prove this strong conclusion, but actually it is true and all the "counterexamples" I found were wrong.  My attempt  Put $g(x)=e^x f(x)$. $$\left|g^{(n)}(0)\right|=\left|\sum_{k=0}^n \binom{n}{k} f^{(k)}(0)\right|\le 2^n\sup_{n\in\mathbb{N}} |a_n|  $$ Put $h(x)=g(\frac{x}{2})$. Thus  $$h^{(n)}(0)=\frac{1}{2^n}g(0) \le \sup_{n\in\mathbb{N}} |a_n|$$ which implies that $$h(x)=1+\sum_{n=1}^\infty b_n \frac{x^n}{n!}\ \ \forall \ x\in \mathbb{R}$$ where $$|b_n|\le \sup_{n\in\mathbb{N}} |a_n| \ \ \forall \ n\in\mathbb{N}  \,\,\,\,\,\&amp; \,\,\,\,\,  \sup_{x&gt;0}\left|h(x)\right| &lt; \infty $$   And hence if $b_k&lt;0$, then there exists $l&gt;k$ such that $b_l&gt;0$. I want to yield a contradiction by supposing this, but I failed.  Any hints or other new ideas? Thanks in advance!   (I heard that this problem can be solved by complex analysis. This is the reason why I attach the complex-analysis tag.) Browsing the internet from the command line True Ubuntu on Chromebook ARM How can I monitor the memory usage? I have used top to see the memory usage at the moment. But I would like to monitor the memory usage over a period of time. E.g start monitoring and then execute a few commands, and final stop the monitoring and see how much memory that have been used during the period.  How can I do this on Ubuntu Server?  I guess I could start a cronjob every 5th second or so, and invoke a command that log the current memory usage in a textfile. But what command should I use to get the current memory usage in a format that is easy to log to a text file? How to run test methods in specific order in JUnit4? As the title suggests, I'd like to prove that the sum $$ \sum_{n=2}^\infty (\ln n)^{- \ln n} $$ is finite.  The root and ratio test both fail here, but  suggests that there is a comparison that can be used to show convergence.  The only thought I have is that it may help to write the terms as $e^{-\ln(n)\ln(\ln(n))}$, but this has not led me to any particular insight.  Any ideas are appreciated. I noticed the other day when serving the public that when asking for something, people were saying "Can I get an xyz, please". The previous time I had such a job it was "Could I have an xyz", or "May I have..." if they were being very polite.  Does anyone know when this trend started and what caused it? how many semantically different boolean functions are there for n boolean variables? In short, this is an assignment question for a course I am taking - the exact wording is this:  "Given n Boolean variables, how many 'semantically' different Boolean functions can you construct?"  Now, I had a crack at this myself - and got pretty stuck. The question doesnt state how many boolean operators there are (and, or, xor, nand, nor, iff, implies, not) nor does it state whether brackets should be used, i.e. a ^ (b v c) is different from (a ^ b) v c.  So, my question for you is - is this question possible given the limited information available?   Is it going to be something like ${n^x}$ where x is the number of boolean operators.  Any direction here would be greatly appreciated.