Consider this image and quotations from :      When a continuous spectrum is viewed through some cool gas, dark spectral lines   (called absorption lines) appear in the continuous spectrum.        If the gas is viewed at an angle away from the source of the continuous spectrum, a pattern of bright spectral lines (called emission lines) is seen against an other-wise dark background.        As the radiation passes through a gas, certain wavelengths are absorbed. Those same wavelengths appear in emission when the gas is observed at an angle with respect to the radiation source.   Since the gas absorbs photons and then re-emits them isotropically by my logic there is no reason why there should be any dark lines appearing on the absorption spectrum. Explicitly, I don't understand why the diagram doesn't look like this instead:    Since, as I understood it, this should be the case:      Since the absorbed photons in the gas are re-emitted why do we see any dark lines?
I was looking at  on why  and emission lines don't cancel out:      An experiment shining light on the material and looking at the   reflected spectrum will see absorption lines at those frequencies,   because the relaxation of the excited electrons will emit back   radiation all around randomly, whereas the reflected spectrum is at a   specific angle.   However it is not totally convincing to me. The photons that get emitted towards the center of the Sun (by the electrons in higher energy states that absorbed a photon earlier) would get absorbed again when they hit a different electron (and then re-emitted) and would eventually make it out. So why don't absorption and emission lines cancel out in our Sun?
How to convert decimal to hexadecimal in JavaScript How do you convert decimal values to their hexadecimal equivalent in JavaScript? Was drafting an email and my senior wanted to type "Planting saplings is our way of saying we care for our Nature". I felt that's wrong English. Shouldn't it be "we care for Nature"? (it makes it a bit impersonal to remove the 'our', but if 'our nature' isn't right, can the cuteness factor of mentioning 'our nature' be preserved?. Which is correct?) I've found a strange thing: some Stack Exchange sites have their own domain names instead of https://[site name].stackexchange.com. The websites which have their own domain names are:          Are there any parameters for allocating specific URLs to Stack Exchange sites? Proving a basis for inner product space V when $||e_j-v_j||< \frac{1}{\sqrt{n}}$. Suppose $(e_1,e_2,...,e_n)$ is an orthonormal basis of the inner product space $V$ and $v_1,v_2,...,v_n$ are vectors of $V$ such that $$||e_j-v_j||&lt; \frac{1}{\sqrt{n}}$$ for each $j \in \left\{1,2,...,n \right \}$. Prove that $(v_1,v_2,...,v_n)$ is a basis of $V$.  I am completely lost and just starting to learn about inner product spaces. Could someone provide a proof with the explanation of how you got there? set of almost complex structures on $\mathbb R^4$ as two disjoint spheres The set of almost complex structures on $\mathbb R^{2n}$ is given by $$ M_n = \frac{GL(2n,\mathbb R)}{GL(n,\mathbb C)} = \mathcal C_+ \sqcup \mathcal C_-,$$ taking into account that $\det = \pm 1$ gives two disjoint sets.  How do we show that $M_2=S^2 \sqcup S^2$? Moreover, I'm a bit confused by dimensions: how does $\dim_{\mathbb R}M_2=8$ relates with the latter decomposition?  This is exercise 1.2.1 from the book Complex geometry by Huybrechts. An infinite subset of a countable set is countable In my book, it proves that an infinite subset of a coutnable set is countable. But not all the details are filled in, and I've tried to fill in all the details below. Could someone tell me if what I wrote below is valid?  Let $S$ be an infinite subset of a countable set $T$. Since $T$ is countable, there exists a bijection $f: \mathbb{N} \rightarrow T$. And $S \subseteq T = \{ f(n) \ | \ n \in \mathbb{N} \}$. Let $n_{1}$ be the smallest positive integer such that $f(n_{1}) \in S$. And continue where $n_{k}$ is the smallest positive integer greater than $n_{k-1}$ such that $f(n_{k}) \in S$. And because $S$ is infinite, we continue forever. Now consider the function $\beta : \mathbb{N} \rightarrow S$ which sends $k \rightarrow f(n_{k})$.   So in order for $S$ to be countable, $\beta$ would have to be a bijection. $\beta$ is injective since if $f(n_{k}) = f(n_{j})$, then $n_{k} = n_{j}$ because $f$ is injective. We also can conclude $k = j$ because the various $n_{i}$ chosen were strictly increasing.   Edit: $\beta$ also needs to be surjective. So for every $r \in S$ there exists a $q \in \mathbb{N}$ such that $\beta(q) = f(n_{q}) = r$. We know that $f^{-1}(r) \in \{n_{1}, n_{2}, ..., n_{k} ... \}$, so we can let $f^{-1}(r) = n_{d}$. Thus $\beta(d) = f(n_{d}) = r$. There have been a few questions regarding installing this package in the past, but they now seem to be out of date. I'm using MiKTeX 2.9 and TexMaker. When I try \usepackage{mathtools} in TexMaker it will try to install the package for me but will fail. I took the advice given in this thread:   As suggested I tried installing the mh package using the MiKTeX Package Manager, unfortunately I get the "unknown archive size" error, which I have read means that the package no longer exists. Another thread (lost the link) said you can use the MiKTeX Package Manager to directly install mathtools, however I do not see mathtools listed anywhere in the MiKTeX Package Manager...   So I ask, is the package under a different name? Are there any other ways to install this package? How to test randomness (case in point - Shuffling) First off, this question is ripped out from  question. I did it because I think this part is bigger than a sub-part of a longer question. If it offends, please pardon me.  Assume that you have a algorithm that generates randomness. Now how do you test it? Or to be more direct - Assume you have an algorithm that shuffles a deck of cards, how do you test that it's a perfectly random algorithm?  To add some theory to the problem - A deck of cards can be shuffled in 52! (52 factorial) different ways. Take a deck of cards, shuffle it by hand and write down the order of all cards. What is the probability that you would have gotten exactly that shuffle? Answer: 1 / 52!.  What is the chance that you, after shuffling, will get A, K, Q, J ... of each suit in a sequence? Answer 1 / 52!  So, just shuffling once and looking at the result will give you absolutely no information about your shuffling algorithms randomness. Twice and you have more information, Three even more...  How would you black box test a shuffling algorithm for randomness? How do I watch a file for changes? I have a log file being written by another process which I want to watch for changes. Each time a change occurs I'd like to read the new data in to do some processing on it.  What's the best way to do this? I was hoping there'd be some sort of hook from the PyWin32 library. I've found the win32file.FindNextChangeNotification function but have no idea how to ask it to watch a specific file.  If anyone's done anything like this I'd be really grateful to hear how...  [Edit] I should have mentioned that I was after a solution that doesn't require polling.  [Edit] Curses! It seems this doesn't work over a mapped network drive. I'm guessing windows doesn't 'hear' any updates to the file the way it does on a local disk. What are Vertex and Pixel shaders? How to remove a filter that is an anonymous object? How is double negation interpreted in English? In my native language, double negations "cancel out". I have been trying to learn English using movies and such things, but double negation confuses me. I see instances when double negation cancels out, and some when they do not.  For example, "I haven't got no money" is interpreted as "I have no money." "There wasn't anyone who didn't enjoy the party" is interpreted as "Everyone enjoyed the party."  Is this context dependent? If so, how does one decide which interpretation is correct? "DataBinding: 'index+NewsItem' does not contain a property with the name 'Link'", but property exists (Not a Typo) I was trying to remove all the lines of a file except the last line but the following command did not work, although file.txt is not empty.  $cat file.txt |tail -1 &gt; file.txt  $cat file.txt   Why is it so? Is there a particle called a "tachyon" that can travel faster than light?  If so, would Einstein's relativity be wrong?  According to Einstein no particle can travel faster than light. Are repository lists secure? Is there an HTTPS version? Are repository updates secure?  As a bear of little brain from the developer side, I cannot understand why the repository list is http://security.ubuntu.com and the other http(unsecured) sites listed in /etc/apt/sources.list.  Without a certificate chain match this appears as "ask any responder for a list of packages to update" instead of "ask the ubuntu.com site..."  Can any network choose to spoof the update sites, and is this a common practice to provide a locally cached and vetted copy? How can I give a user one password for normal usage when logging in, and another password for system administration and sudo access? I want one user to have two passwords. How can I make a directory on the desktop?  I tried cd /desktop command but it gives an error  no such file or directory.  What's the correct command? Adjective Used as an Adverb? That cake looks good.    In formal proper grammar, may good (adjective) get used as an adverb? Or, may you read it as, That cake (noun phrase, nominal[?], argument[?]), looks (verb, predicate[?]), good (subject compliment[?].? How may I discern this, grammatically? warning message at command line `sudo` Everytime I try to sudo something at the terminal, I get a warning message:  alexandre@XPS-15Z $ sudo mount file.iso /mnt/ -o loop [sudo] password for alexandre:  no talloc stackframe at ../source3/param/loadparm.c:4864, leaking memory   It's just annoying to get that all the time. How do I solve that? I'm on Ubuntu 14.04 (upgraded from 13.10)