How does a light move in a material?
What really causes light/photons to appear slower in media?
If $x+y+z=xyz$, prove $\frac{2x}{1-x^2}+\frac{2y}{1-y^2}+\frac{2z}{1-z^2}=\frac{2x}{1-x^2}\times\frac{2y}{1-y^2}\times\frac{2z}{1-z^2}$ given that $x^2~,~y^2~,~z^2\ne1$  I came across this question in an ancient ($19$th century) Trigonometry book, and this is the method they use to prove the result (please note: I understand this method fully): Let $x=\tan A$ ,$~y=\tan B$ and $z=\tan C$ which is acceptable without any loss of generality. This means that we are saying that $$\tan A+\tan B+\tan C=\tan A\tan B\tan C$$ Consider $\tan (A+B+C)$: $$\tan (A+B+C)=\frac{\tan A+\tan B+\tan C-\tan A\tan B\tan C}{1- \tan A \tan B- \tan C \tan A - \tan B \tan C}$$ So if $~\tan A+\tan B+\tan C=\tan A\tan B\tan C~~$ then $~~\tan (A+B+C)=0$. Hence, let $~A+B+C=\pi$. Now consider $\tan (2A+2B+2C)$: $$\tan (2A+2B+2C)=\frac{\tan 2A+\tan 2B+\tan 2C-\tan 2A\tan 2B\tan 2C}{1- \tan 2A \tan 2B- \tan 2C \tan 2A - \tan 2B \tan 2C}=0$$ $$\implies \tan 2A+\tan 2B+\tan 2C=\tan 2A\tan 2B\tan 2C$$ $$\implies \frac{2\tan A}{1-\tan^2 A}+\frac{2\tan B}{1-\tan^2 B}+\frac{2\tan C}{1-\tan^2 C}=\frac{2\tan A}{1-\tan^2 A}\times\frac{2\tan B}{1-\tan^2 B}\times\frac{2\tan C}{1-\tan^2 C}$$ $$\therefore\frac{2x}{1-x^2}+\frac{2y}{1-y^2}+\frac{2z}{1-z^2}=\frac{2x}{1-x^2}\times\frac{2y}{1-y^2}\times\frac{2z}{1-z^2}$$ as required.  My question is, is there any other way of proving this without this rather heavy use of trigonometry? I also would prefer not to work through heaps of algabraic manipulation and expansion to obtain the required result, although if that's necessary I will put up with it ;) Thank you for your help. How to create individual chapter PDFs from included TeXs? My document structure has   one file with preamble (i.e. MainTex) and around 75 individual .tex files (i.e. Chapter_01, Chapter_02, ..., Chapter_75) representing each chapter.   I am using \include command to create a one big PDF file, the output is MainTex.pdf. Life is all good up to this point.   If I have to create individual PDF for each chapter then do I need to run 75 times with each chapter name and rename the PDF manually to match to chapter name. Because if I include only Chapter_01 and run it creates PDF named as MainTex.pdf.  Is there a way I can automate this workflow? How can I send mail from an iPhone application Is there a way of conditionally triggering a compile-time error in verilog? I have a parameterised module in verilog, where the parameters are a clock rate and refresh rate, which is used to calculate how many cycles of inactivity are inserted between instances of a repeating operation.  However, it is very easy to set parameters that cannot be attained (because the operation takes a non-trivial length of time, so the repeat would have to occur before it had completed), and at the moment the design does not give any feedback on this.  I was wondering if there was some way I could trigger an error during synthesis (or compilation prior to simulation) if the conditions cannot be met (i.e. if one localparam is less than another)?  Some equivalent of the popular C/C++ compile-time-assert hack, perhaps. I had originally coded the program wrongly. Instead of returning the Fibonacci numbers between a range (ie. startNumber 1, endNumber 20 should = only those numbers between 1 &amp; 20), I have written for the program to display all Fibonacci numbers between a range (ie. startNumber 1, endNumber 20 displays = First 20 Fibonacci numbers). I thought I had a sure-fire code. I also do not see why this is happening.  startNumber = int(raw_input("Enter the start number here ")) endNumber = int(raw_input("Enter the end number here "))  def fib(n):     if n &lt; 2:         return n     return fib(n-2) + fib(n-1)  print map(fib, range(startNumber, endNumber))   Someone pointed out in my Part II (which was closed for being a duplicate - ) that I need to pass the startNumber and endNumber through a generator using a while loop. Can someone please point me in the direction on how to do this? Any help is welcome.    I'm a learning programmer and I've run into a bit of a jumble. I am asked to write a program that will compute and display Fibonacci's Sequence by a user inputted start number and end number (ie. startNumber = 20 endNumber = 100 and it will display only the numbers between that range). The trick is to use it inclusively (which I do not know how to do in Python? - I'm assuming this means to use an inclusive range?).  What I have so far is no actual coding but rather:   Write Fib sequence formula to infinite Display startNumber to endNumber only from Fib sequence.   I have no idea where to start and I am asking for ideas or insight into how to write this. I also have tried to write the Fib sequence forumla but I get lost on that as well. Conditional distributions of the multivariate normal Font corruption: lines through characters I have a problem where a one-pixel high white line is displayed through certain letters of text. Almost always only a single character type is affected at once, and only in one font size (though that size can change over time). Most of the time things are fine, but this happens several times a day. It happens frequently in Firefox, but system dialogs, menus, etc. can also be affected. It's been happening ever since I upgraded to 10.10. Only restarting seems to fix it.  Two examples (in the first, only the larger "r" is corrupted):     Any help would be appreciated, thanks.  Edit: I've since noticed that I can (sometimes) make the fonts appear correctly by zooming in/out all the way and returning to the default in Firefox (one or two steps, then going back, does nothing) seems to make the problem go away temporarily.  Edit 2: I figure it's worth noting that the solution below doesn't fully work for me any longer (I'm now using Ubuntu 11.10). It does significantly reduce the frequency of this problem occurring.  Edit 3: Still around in 12.04. The fix provided by Vanni works perfectly now for me, but apparently doesn't for some.  Edit 4: This seems to be an xorg problem, with Vanni's answer fixing it for many Intel video cards. I've had this occasionally happen with AMD graphics cards in 13.10 and 14.04, but very rarely (only two or three times). Help with this trigonometry problem In the context of metric (and in general first-countable) topologies, it's reasonably clear what a closed set is: a set $F$ is closed if and only if every convergent sequence of points in $F$ converges to a point also in $F$. This naturally generalises to the definition of a closed set in an arbitrary topological space using the concept of limit points... but limit points are defined in terms of open sets, which are, to me, somewhat more mysterious than closed sets.  I was once told that ultrafilters axiomatise the concept of (sets of) big sets. I'm hoping here to find a similar conceptual picture of topologies defined by systems of open sets, preferably without reference to closed sets. One such explanation I've seen is that open set axiomatise the concept of nearness, which, I suppose, is fair enough at least for metric topologies. Indeed, if something is "happening" at points near $x \in X$, then it's usually the case that every open neighbourhood $U \subseteq X$ of $x$ contains an open subset $V \subseteq U$, $x \in V$, such that the something "happens" at all points in $V$. But what about non-metrisable topologies, particularly the coarse ones where there are no "small" open sets?  Consider, for example, the Zariski topology on affine $n$-space $\mathbb{A}^n$. $\mathbb{A}^n$ is irreducible, so every non-empty open set is dense. It seems reasonable to interpret this to mean that every non-empty open set is "large". Indeed, if we work over the complex numbers, then in the usual metric geometry, Zariski-open sets are unbounded and have full measure, so are very large indeed, so I don't think it's fair to say that open sets are capturing the notion of nearness here.  I'm also curious about the history of point set topology. When were the axioms first written down? What were the first "non-geometric" examples of topological spaces — "non-geometric" here referring to either non-metrisable topologies or topologies on sets other than sets of points of some intuitively geometric object — and were they part of the motivations for creating point set topology? Prove that $ S=\{0\}\cup\left(\bigcup_{n=0}^{\infty} \{\frac{1}{n}\}\right)$ is a compact set in $\mathbb{R}$, but $\bigcup_{n=0}^{\infty} \{\frac{1}{n}\}$ is not a compact set.   (Can we use definition of compact set for this problem? ) This is the first part of the first half of the a proof in the Axiom of Choice. The proof that the Axiom of Choice is equivalent to the choice function. REsources: Keith Devlin's Joy of Sets: pg. 58. F.R. Drake and Singh Intermediate Set Theory: pg. 110).   I am confused on proving disjointness and will ask further questions of proof once I get this first part v. clear for myself.   AC1: Let $\mathcal F$ be a family of pairwise disjoint, non-empty sets. Then there is a set $\mathcal M$ that consists of precised one element from each member of $\mathcal F$  AC2: For every family $\mathcal F$ of non-empty sets, there is a choice function $\mathcal f$. (I.e. $\mathcal f(X)$ is a member of X, for each X in $\mathcal F$.   Disjointness: Two sets are disjoin if Q $\cap$ R = $\emptyset$. Meaning that they have zero elements in common. These sets do not overlap.   Show: AC1 $\leftrightarrow$ AC2   (1) ($\rightarrow$) Let $\mathcal F$ be a set of nonempty sets.   (2)For each X $\in$ $\mathcal F$, let $X^*$ = (X $\times$ {X}) = {(x, X) | x $\in$ X})  (3) Show Disjointness.  An outline of how book proves  disjointness:  (a) if u = {(X $\times$ {X}) | x $\in$ X} then u is of the form $\lt  z, t \gt$ where z = X and t=x, i.e. x $\in$ X.   (b) then if u $\in$ ({X} $\times$ x) $\cap$ ({Y} $\times$ Y) $\rightarrow$ u = $\lt z, t \gt$ with z = X and z=Y, i.e. X=Y. Which means ({X} $\times$ x) = ({Y} $\times$ y).  Questions: (1) Apparently we cannot prove disjointness in $\mathcal F$ but must prove in a different set. If so, why is that?  (2) why is the case that if u $\in$ ({X} $\times$ X) $\cap$ ({Y} $\times$ Y) then z =X and z=Y? I am not following that step at all.   (3) why does the axiom of choice have to do with ordered pairs? Why are we setting X $\in$ $\mathcal F$, let $X^*$ = (X $\times$ {X})?    Thank you! Map matrix element to string At the end of every day you will be required to write a review.   At the end of each day you will be required to write a review.   Which one of those sentences is better if this action will repeat itself every day for longer period of time, several weeks for example, maybe even months? Proving that a doubly-periodic entire function $f$ is constant. Let $f: \Bbb C \to \Bbb C$ be an entire (analytic on the whole plane) function such that exists $\omega_1,\omega_2 \in \mathbb{S}^1$, linearly independent over $\Bbb R$ such that: $$f(z+\omega_1)=f(z)=f(z+\omega_2), \quad \forall\,z\in \Bbb C.$$Prove that $f$ is constant.   The intuition seems clear to me, we have the three vertices of a triangle given by $0$, $\omega_1$ and $\omega_2$. All points in the plane are one of the vertices of that triangle under a suitable parallel translation. The constant value will be $f(0)$, fine. Throwing values for $z$ there, I have found that $$f(n\omega_1) = f(\omega_1) = f(0)=f(\omega_2) = f(n\omega_2), \quad \forall\, n \in \Bbb Z.$$  I don't know how to improve the above for, say, rationals (at least). Some another ideas would be:   Checking that $f' \equiv 0$. I don't have a clue of how to do that. Write $w = a\omega_1+b\omega_2$, with $a,b \in \Bbb R$, do stuff and conclude that $f(w) = f(0)$. This approach doesn't seem good, because I only have a weak result with integers above. Finding that $f$ coincides with $f(0)$ on a set with an accumulation point. This seems also bad: the set on with $f$ coincides with $f(0)$ by which I found above is discrete.    Nothing works and this is getting annoying... And I don't see how analyticity comes in there. I'll be very thankful if someone can give me an idea.  (On a side note.. I know that this title is not informative at all. Feel free to edit if you come up with something better.) Combining Multiple Lists How do I enter a strong (long) DKIM key into DNS? What causes a black-body radiation curve to be continuous? The  (unlike the quantized emission seen from atomic spectra), is continuous over all frequencies.  Many objects approximate ideal blackbodies and have radiation curves very similar in shape and continuity to that of an ideal black-body (often minus some emission and absorption lines from the atoms in an object, such as radiation curves seen from stars).  I am wondering what exactly gives rise to a basically continuous black-body radiation curve in real objects? Since atomic energy states are quantized, it seems real life black-body curves would have some degree of measurable quantization to them (or perhaps the degree of quantization is so small the radiation curves look continuous). Is it possible to group several objects and then manipulate them (scale, rotate, translate) as one? If the Universe is expanding, how is that galaxies run into each other? As the title says. If everything is moving outward, thrown by the Big Bang, how could two Galaxies end up with velocity vectors that run them into each other? PWM complementary square output waveforms PWM channels in certain microcontrollers such as the SAM3X8E have two complementary square output waveforms, PWMH and PWML, per channel. What is the purpose of having two waves that are the inverses of each other?