when I stopped eating red meat for 3 months, I was iron deficient , since I didn't have enough veggies either or since I didn't had enough veggies?
proper usage of didn't had or didnt have
Prove $\frac{|a+b|}{1+|a+b|}<\frac{|a|}{1+|a|}+\frac{|b|}{1+|b|}$. Prove that for every $a, b\in R\setminus\{0\}$ is correct this inequality:  $$\frac{|a+b|}{1+|a+b|}&lt;\frac{|a|}{1+|a|}+\frac{|b|}{1+|b|}.$$ Fact  The intersection of a closed set $A$ and a compact set $B$ is closed.  Background  I wanted to prove that the intersection of closed and compact sets is compact. There might be other ways, but I am not interested in them for now and am looking to prove the above statement.  Relevant Facts  I don't have much idea what to use. $A^c$ is open. Every cover $\cup_{i\ge1}U_i$ of $B$ contains a subcover $\cup_{i=1}^kU_i$. I might want to prove $A\cap B^c$ is open. Limit points may be another points to consider but I don't get any idea in that direction.  I also don't have that $B$ is closed otherwise it would be trivial.  Some Clarification  I am aware that compact sets are not closed in arbitrary topological spaces. The reason why I was motivated to believe tha intersection of closed and compact set is compact is true is: See Matt E.'s Answer      So if $K$ is compact in an arbitrary topological space (which is just to say that   it is a compact topological space when given its induced topology) and     $L$ is closed then $K \cap L$ is a closed subset of $K$ in its induced topology   Is it true if $A$ and $B$ are not whole spaces?  I would appreciate any hints. For some reason, I can run halt, poweroff, shutdown, and reboot as a regular user without root. How can I fix this? Is it something to do with user groups, or is it a seting somewhere? This is something I just realised I don't entirely know the answer to, so I'm going to ask it here as I think it's interesting.  In most non-scientific writing on depth of field, diagrams generally show camera and subjects as being perfectly parallel, e.g.    However, is this a more accurate representation of the focal plane?    Are there ways to optically alter the shape of the focal plane?  Note: Obviously these diagrams are two dimensional, but I'm assuming in the second diagram the shape would be spherical with the sensor at the center. Boats from Manaus, Brazil to Leticia, Colombia? I've heard of and met a few people who have done this route, and I hope to do it at the end of this year or early next year.  However, the descriptions were mostly sketchy, and I'm wondering if it's a regularly scheduled service, or more ad-hoc.  So I guess the question is, how can I find out which boats go from Manaus to Leticia, and when they go?  Ideally this wouldn't be a tour, but a 'locals' boat. Get the equation of a circle when given 3 points Show that if terms of a series have ratio less than the ratio of convergent series, then the series converges We have two infinite series $\sum a_n $ and $\sum b_n$, such that $a_n &gt; 0,\ b_n &gt; 0$ and $a_{n + 1}/a_n \leq b_{n + 1}/b_n$ for all $n$. Show that if $\sum b_n$ converges, then $\sum a_n$ also converges.   Any hints on how to prove this? I can sort of picture why this must be true, but I'm not sure how to prove this rigorously. I'm not sure using the ratio test would help here.. How does one attack a two-time pad (i.e. one time pad with key reuse)? My question might appear the same as the question , but actually I did read all the answers and none of them helped me with the details I need.  I am new to cryptography and my problem is with two time pad attacks on OTP. The problem I had in my course was that I have 10 ciphertexts encrypted with the same key $K$. I am then given another ciphertext that I should decrypt.  I know that XOR-ing two ciphers gives me the XOR of their original messages.  My question is what is the correct thing to do after that?  I tried to take 3 ciphertexts $C_1, C_2$ and $C_3$.  Then get $S_1 = C_1 \oplus C_2  \oplus $' ', also get $S_2 = C_1 \oplus C_3 \oplus$ ' '.  After that I compared all corresponding characters in $S_1$ and $S_2$,  and if $S_1[i] = S_2[i]$ then I calculate $S_1[i] \oplus C_2[i]$ to get $K[i]$.  I tried this on paper before coding and it worked, but I might be missing something.  Is this the right approach? Why does it work? This question is related to "The Last Jedi":  The maneuvre that vice admiral Holdo (with the purple hair) uses towards the end of the film seems remarkably effective.   It seems that it would have worked pretty well much earlier. Especially as two other ships were just allowed to run out of fuel and be destroyed.  It seems doing it earlier with different assets would have incurred less losses. Yet nobody seemed to consider it. Any in universe reason why? If $Ax = Bx$ for all $x \in C^{n}$, then $A = B$. Let $A$ and $B$ are $n\times n$ matrices and $x \in C^{n}$.  If $Ax = Bx$ for all $x$ then $A = B$. To prove this I have selected  $x$ from Euclidean basis B = {$e_{1},e_{2},...,e_{n}$}. Then $Ae_{i} = Be_{i}$ implies $i^{th}$ column of A = $i^{th}$ column of B for all $1 \leq i \leq n$. Hence $A = B.$    Is this proof complete? Adjectives or compound noun? True or false: if $f'(c)<0$, then $f$ is concave down at $x=c$? How can I determine the following statement is true or false?  If $f'(c)&lt;0$, then $f$ is concave down at $x=c$ ? How do I recover the default version of some configuration file? By accident, I messed up a configuration file. How do I recover the default version without reinstalling or affecting other things? Rising edge pulse detector from logic gates The circuits I describe are entirely made of 7400 series logic gates (7402, 7404 and 7408 ic). I'm trying to build a rising (positive) edge pulse detector using logic gates.  The following circuit should work in theory:   (see )  I do not expect the short output to be seen through a LED so, to test it, I make it trigger an SR latch to its up state:    However, it doesn't have effect on the latch. So I added an inductor to delay the input to the NOT gates in the pulse detector circuit and it worked:   But now I can see the short flashing output through a LED which I should not because it would mean it is too long to work with a circuit like that:   Which intends to toggle the D Latch output on each clock rising edge (Note that this is a D Latch not a D Flip-flop)  And anyway there is no place for inductors in integrated circuits so there must be a way to do this only with logic gates. Can someone solve this mystery?  BTW It does not show in my schematics but I did put 10K pull-down resistors where there might be floating pins. Automatically hide old comments Comments are useful. Many, many posts need some small amount of meta discussion, and comments fulfill this need.   Comments are also noisy and distracting. Occasionally, someone will post an insightful and informative comment that complements the post its attached to... But more often, they're tangential, quickly irrelevant and in the way: stale comments show up first, making newer comments less visible.  The guidance here for a long time has been that comments are transient, . And yet, some do hang around for months or years because .   So let's fix that.   I propose that all comments older than 7 days be hidden by default unless the comment has been up-voted in the past 30 days. Hidden comments should be indicated by a note below the post ("add / show 3 more comments") and made visible to anyone who cares to click it.   This doesn't destroy anything, but it would get it out of the way of most readers - and hopefully encourage folks to edit it into the actual answers as a result.  Note: I previously suggested this . Other  have been . However, I'm not suggesting that comments be automatically deleted, and they should be hidden based purely on the age / activity of the comment itself, not of the post to which they're attached. Looking at the following dataset:   Date        Visits   Carts      carts       Orders                       Created   converted    Created 2011-11-11    12277     161        9          36   2011-11-12    11871     93         5          19     2011-11-13    13072     107        8          8      2011-11-14    13594     112        4          34     2011-11-15    12741     129        8          43     2011-11-16    15491     261        16         57  2011-11-17    13418     186        17         42       I've been asked to plot this on a graph, using the Date has the X-Axis and the rest of the data on the Y-Axis. The problem is that the scale of the data is dramatically different. where Visits are in the thousands and Orders Created are in the low tens, the data doesn't plot well on a graph.     I was wondering what a statistician would do in this scenario, I could divide the the Visits by a 1000 and then put in the description (Visits (K)), but then I start to have the same problem with Carts Created, as they are in the hundreds and everything else is in the low tens.  What kind of thing is done in this scenario? Collection of clopen sets form a base for a countable completely regular space I have $X$ as a countable, Tychonoff space, and I want to show that the collection of clopen subset of $X$ form a base for the topology on $X$.  Can I first just define a base $\mathscr{B}$ of X, let $x\in X$ and $E \subset X$ is closed such that $x\notin E$. So $x\in X-E$, which is open.   I also noticed that the interval $[0,1]$ is uncountable. Can I define a function $f: X\to [0,1]$, then f is onto. Do I need to show that $f$ continuous next? Not enough reputation - wanting to answer/comment I've seen a few questions I'd like to comment on or give a different answer, but seeing how I don't have 50 reputation (I've been a lurker for years, finally decided to participate) do I really need to ask a few questions before I can comment/answer other people's stuff? Or am I missing something here?  Sorry if this has been answered before, but with a few search tries I couldn't find any similar stuff, even tried google just for "50 reputation stackoverflow" but that didn't give me anything either. My hypothesis is that $\mathbb{R \times R}$,  the set of all pairs $(r_1, r_2)$, of real numbers is uncountable. I understand that the set of all pairs of natural numbers is countable. But could someone explain why the set of all pairs of real numbers uncountable? I am having trouble proving it using diagolization Why does \cal{M}_n give “M>”?