If $I_n=\int _0^{\pi }\:sin^{2n}\theta \:d\theta $, show that $I_n=\frac{\left(2n-1\right)}{2n}I_{n-1}$, and hence $I_n=\frac{\left(2n\right)!}{\left(2^nn!\right)2}\pi $  Hence calculate $\int _0^{\pi }\:\:sin^4tcos^6t\:dt$  I knew how to prove that $I_n=\frac{\left(2n-1\right)}{2n}I_{n-1}$ ,, but I am not very good at English, what does it mean Hence $I_n=\frac{\left(2n\right)!}{\left(2^nn!\right)2}\pi $ do we need to prove this part as well or is it just a hint to use? and for the other calculation to find $\int _0^{\pi }\:\:sin^4tcos^6t\:dt$ is there something in the first part that I can do to help me solve this question because otherwise it becomes very long and it's part of the question.
If $I_n=\int _0^{\pi }\sin^{2n}\theta \:d\theta $, show that $I_n=\frac{\left(2n-1\right)}{2n}I_{n-1}$, and hence $I_n=\frac{\left(2n\right)!}{\left(2^nn!\right)2}\pi $  Hence calculate $\int _0^{\pi }\:\sin^4t\cos^6t\:dt$  I knew how to prove that $I_n=\frac{\left(2n-1\right)}{2n}I_{n-1}$, but I am not very good at English, what does it mean Hence $I_n=\frac{\left(2n\right)!}{\left(2^nn!\right)2}\pi $ do we need to prove this part as well or is it just a hint to use? and for the other calculation to find $\int _0^{\pi }\:\sin^4t\cos^6t\:dt$ is there something in the first part that I can do to help me solve this question because otherwise it becomes very long and it's part of the question.
A photon emitted from a receding source (Doppler redshift) has less energy when detected at an observer's location. Please explain the energy loss from the perspective of energy conservation. Considering the irreducible (by condition) polynomial $f=X^4-2aX^2+b\in\mathbb Q[X]$ and the field extension $K=\mathbb Q(\sqrt{a^2-b})$ of $\mathbb Q$, I want to show the following result:    For $[L:\mathbb Q]=4$ we have $\sqrt b\in K$ where $L$ is the splitting field of $f$.   My thoughts so far: The four roots of $f$ are $\pm\sqrt{a\pm\sqrt{a^2-b}}$. If $L$ is of degree $4$ it must be primitive since $f$ is irreducible, so $L=\mathbb Q\left(\sqrt{a+\sqrt{a^2-b}}\right)$. Then, by multiplying the two roots $\sqrt{a+\sqrt{a^{2}-b}}\cdot\sqrt{a-\sqrt{a^{2}-b}}=\sqrt{b}$ we have that $\sqrt{b}\in L$. Now I want to look at $$\mathbb Q\subset K\subset K(\sqrt b)\subset L$$ and differentiate some cases. The case where $[L:K]=1$ is trivial and the case $[L:K]=4$ can't happen because if we square any root and subtract $a$, we get $\pm\sqrt{a^2-b}\in K$ which means $[L:K]\leq 2$. So let's look at the case where $[L:K]=2$. As I see it, we get two subcases:   For $[L:K(\sqrt b)]=2$ we have $K(\sqrt b)=K$ which finishes the proof. For $[L:K(\sqrt b)]=1$ we have $K(\sqrt b)=L$. This means that $L$ is also the splitting field of $(x^2-b)(x^2-(a^2-b))$. Is this a contradiction? How do I finish this case? Usernames vs. Real Names I want to create a social network mainly geared towards user-to-user interactions such as commenting and discussion boards. From my observations, I've found that users are more likely to engage in constructive conversations when using their full names as opposed to creating flame wars when hiding behind a username. While the latter still has the possibility to exist using one's real name, it's not as evident considering that the user is bearing his or her identity—either through the site's main registration or through Facebook Connect.  Don't get me wrong I've seen many communities manage to still offer insightful user contributions using usernames. All in all, what are the pros and cons of the two? I have a laptop which is connected to the internet with ADSL modem, and I would like to share the internet for any laptop connecting to wireless router from my laptop using hotspot.  This is what I want:  ┌────────────────────┐ │ ADSL modem         │ └───┬────────────────┘     │ ┌───┴───────────────────────┐ │ laptop's wired adaptor    │ │                           │ │ Hotspot software          │ │                           │ │ laptop's wireless adaptor │ └───┬───────────────────────┘     │ ┌───┴──────────────────────┐ │ wireless router(linksys) │ └───┬──────────────────────┘     │ ┌───┴─────────────────────────────┐ │ Laptop computers and cellphones │ └─────────────────────────────────┘   How can I do that? Is there a rhetorical term for remarks like "you're exactly what I've come to expect from..."? Is there a specific term for a statement that uses words such that their precise meaning conveys a subtext contrary to the colloquial meaning?  For example, the joke in Men in Black:     Gentlemen, congratulations. You're everything we've come to expect   from years of government training.   where the precise use of the words conveys a sarcastic meaning (ie that the candidates are inept because that's what he's come to expect from government training).  I was going to use "irony" to describe this but then realized this is basically the opposite of irony - the use of words to convey their literal intention, when a nonliteral intention was expected. Solutions of $x^2 \equiv 1 \pmod N$ I am stuck with this exercise:     Show that $\forall s &gt;0 \quad \exists N &gt;0$ such that $$x^2 \equiv 1\pmod N$$ has more than $s$ solutions.   I think I cannot use the theory if quadratic residues, because the modulus is not prime, so maybe I must prove it with square roots or roots of unity, but I don't know how to approach it at all.  Thanks for any help. There are Recurrent Neural Networks and Recursive Neural Networks. Both are usually denoted by the same acronym: RNN. According to , Recurrent NN are in fact Recursive NN, but I don't really understand the explanation.  Moreover, I don't seem to find which is better (with examples or so) for Natural Language Processing. The fact is that, although Socher uses Recursive NN for NLP in his , I can't find a good implementation of recursive neural networks, and when I search in Google, most of the answers are about Recurrent NN.  Besides that, is there another DNN which applies better for NLP, or it depends on the NLP task? Deep Belief Nets or Stacked Autoencoders? (I don't seem to find any particular util for ConvNets in NLP, and most of the implementations are with machine vision in mind).  Finally, I would really prefer DNN implementations for C++ (better yet if it has GPU support) or Scala (better if it has Spark support) rather than Python or Matlab/Octave.  I've tried Deeplearning4j, but it's under constant development and the documentation is a little outdated and I can't seem to make it work. Too bad because it has the "black box" like way of doing things, very much like scikit-learn or Weka, which is what I really want. How can I correct a reviewer's opinion? Fibonacci addition law $F_{n+m} = F_{n-1}F_m + F_n F_{m+1}$ Question: Let $F_n$ the sequence of Fibonacci numbers, given by $F_0 = 0, F_1 = 1$ and $F_n = F_{n-1} + F_{n-2}$ for $n \geq 2$. Show for $n, m \in \mathbb{N}$: $$F_{n+m} = F_{n-1}F_m + F_n F_{m+1}$$   My (very limited) attempt so far: after creating a small list of the values $F_0=0, F_1=1, F_2=1, F_3=2, F_4=3, F_5=5, F_6=8, F_7=13, F_8=21, F_9=34, F_{10}=55$ i can see that yes it does seem to work for instance $F_{6+3}=F_5 F_3 +F_6 F_4 = 10 +24 = 34 = F_9$. However, I really don't know where to begin as showing that this must hold in general terms. Should I be looking to use limits? Or perhaps induction? What is the best way to solve this? I'm trying to typeset some python code, and I would like integer literals to be highlighted. I've come up, after about two hours of fighting with the documentation and various other questions here and on SO, with the following:  \lstset{ %     language=Python,     otherkeywords={1, 2, 3, 4, 5, 6, 7, 8, 9, 0},     morekeywords=[2]{1, 2, 3, 4, 5, 6, 7, 8, 9, 0},     keywordstyle=[2]{\color{orange}},     keywordstyle=\color{blue}\bfseries,     stringstyle=\color{red}, }   Unfortunately, that doesn't work. Numbers found in strings are also highlighted, which is rather annoying, and not only are they highlighted: they are highlighted in blue. Numerals in regular program text, on the other hand, are rightly highlighted in red.  Help?  EDIT: Thanks Peter Grill for your very nice solution. Is there a way to not break string colouring, though? When I use you code, the stringstyle=\color{red} doesn't seem to work anymore (strings are just plain black). Similarly, comments can be enclosed in triple quotes in python, and if I adapt your quote to detect """ blocks, then the corresponding  comments are not highlighted anymore. Is given metric space $(M, d)$. Let $A\cap B = \emptyset; \,\,\text{dist}(A,B):=\inf\{d(x,y):x\in A, y\in B\}$. $A, B$ are both closed sets. Is it possible that $\text{dist}(A,B)=0$?  The first thought comes into mind is that obviously $\text{dist}(A,B)&gt;0$, but possibly there are some tricky $d$ and $A, B$ so that it's untrue.  Thanks in advance! What is $n!$ when $n=0$? Getting "experimental" true displacement to work Date and time panel is greyed out, how do I restore it? Date and time is showing in the login screen (unity-greeter) but not when I login to my session.  When I go to date and time settings the panel is all grey :    Any idea how to recover from this ? Properties of $x_k=\frac{a_{k+1}-a_{k}}{a_{k+1}}$ where $\{a_n\}$ is unbounded, strictly increasing sequence of positive reals Let $\{a_n\}$ be an unbounded, strictly increasing sequence of positive real numbers and let $x_k=\frac{a_{k+1}-a_{k}}{a_{k+1}}$. Which of the following statements is/are correct? (CSIR NET December 2014)         For all $n\geq m, \sum\limits^{n}_{k=m}x_k&gt;1-\bf{\frac{a_m}{a_n}}$   There exist $n\geq m, \sum\limits^{n}_{k=m}x_k&gt;\frac{1}{2}$      My attempt:  Analysing question in light of $a_k=k\implies x_k=\frac{k+1-k}{k+1}=\frac1{k+1}$, I feel both are correct, I doubt if  I can generalise the result in light of this one example.   Any way to prove that this true for general case?    Note: Please do not confuse  with my question. The first two options are different, I've marked the difference in bold. Let $m$ be the largest real root of the equation $\frac3{x-3} + \frac5{x-5}+\frac{17}{x-17}+\frac{19}{x-19} =x^2 - 11x -4$ find $m$ Let $m$ be the largest real root of the equation $$\frac3{x-3} + \frac5{x-5}+\frac{17}{x-17}+\frac{19}{x-19} =x^2 - 11x -4.$$ Find $m$.   do we literally add all the fractions or do we do something else  I have no clue how to solve this Transformation of Random Variable $Y = X^2$ I'm learning probability, specifically transformations of random variables, and need help to understand the solution to the following exercise:      Consider the continuous random variable $X$ with probability density function $$f(x) = \begin{cases} \frac{1}{3}x^2 \quad  -1 \leq x \leq 2, \\ 0 \quad \quad \text{elsewhere}. \end{cases}$$ Find the cumulative distribution function of the random variable $Y = X^2$.   The author gives the following solution:   For $0 \leq y \leq 1: F_Y(y) = P(Y \leq y) = P(X^2 \leq y) \stackrel{?}{=} P(-\sqrt y \leq X \leq \sqrt y) = \int_{-\sqrt y}^{\sqrt y}\frac{1}{3}x^2\, dx = \frac{2}{9}y\sqrt y.$  For $1 \leq y \leq 4: F_Y(y) = P(Y \leq y) = P(X^2 \leq y) \stackrel{?}{=} P(-1 \leq X \leq \sqrt y) = \int_{-1}^{\sqrt y}\frac{1}{3}x^2\, dx = \frac{1}{9} + \frac{1}{9}y\sqrt y.$  For $y &gt; 4: F_{Y}(y) = 1.$    Previous to this exercise, I've managed to follow the solutions of two similar (obviously simpler) problems for a strictly increasing and strictly decreasing function of $X$, respectively. However in this problem, I don't understand the computations being done, specifically:    How does the three intervals $0 \leq y \leq 1$, $1 \leq y \leq 4$ and $y &gt; 4$ are determined? In the two previous problems I've encountered, we only considered one interval which was identical to the interval where $f(x)$ was non-zero. In the case where $0 \leq y \leq 1$, why does $P(X^2 \leq y) = P(-\sqrt y \leq X \leq \sqrt y)$ and not $P(X \leq \sqrt y)$? I have put question marks above the equalities that I don't understand.   I think I have not understand the theory well enough. I'm looking for an answer that will make me understand the solution to this problem and possibly make the theory clearer. Guess the formula for $\sum\frac 1{(4n-3)(4n+1)}$ and prove by induction Styling multi-line conditions in 'if' statements? Kubuntu - can not enter wifi credentials after adding external wifi card My ethernet connection is quite unreliable (It uses powerline adapters) so I bought an external wifi adapter. I have plugged it in and run the command sudo ip address add 192.168.0.39/24 brd + dev enp7s0, and KDE has detected it. Unfortunately, it doesn't seem to realise it is a wireless network and therefore needs credentials. Where I could normally find a place to enter credentials (the network widget, system settings) there are none. KDE reports that the device is connected in the UI. How do I make it work out that it is wireless and therefore needs credentials? Edit: With ethernet plugged out, (USB) adapter plugged in: $ ip address show 1: lo: &lt;LOOPBACK,UP,LOWER_UP&gt; mtu 65536 qdisc noqueue state UNKNOWN group default qlen 1000     link/loopback 00:00:00:00:00:00 brd 00:00:00:00:00:00     inet 127.0.0.1/8 scope host lo        valid_lft forever preferred_lft forever     inet6 ::1/128 scope host         valid_lft forever preferred_lft forever 2: enp7s0: &lt;NO-CARRIER,BROADCAST,MULTICAST,UP&gt; mtu 1500 qdisc fq_codel state DOWN group default qlen 1000     link/ether 04:d9:f5:8a:f5:e0 brd ff:ff:ff:ff:ff:ff  With ethernet plugged in, adapter plugged in: 1: lo: &lt;LOOPBACK,UP,LOWER_UP&gt; mtu 65536 qdisc noqueue state UNKNOWN group default qlen 1000     link/loopback 00:00:00:00:00:00 brd 00:00:00:00:00:00     inet 127.0.0.1/8 scope host lo        valid_lft forever preferred_lft forever     inet6 ::1/128 scope host         valid_lft forever preferred_lft forever 2: enp7s0: &lt;BROADCAST,MULTICAST,UP,LOWER_UP&gt; mtu 1500 qdisc fq_codel state UP group default qlen 1000     link/ether 04:d9:f5:8a:f5:e0 brd ff:ff:ff:ff:ff:ff     inet 192.168.0.51/24 brd 192.168.0.255 scope global dynamic noprefixroute enp7s0        valid_lft 863988sec preferred_lft 863988sec     inet6 fe80::7eb1:eca2:96a0:fe5c/64 scope link noprefixroute         valid_lft forever preferred_lft forever  With just ethernet: 1: lo: &lt;LOOPBACK,UP,LOWER_UP&gt; mtu 65536 qdisc noqueue state UNKNOWN group default qlen 1000     link/loopback 00:00:00:00:00:00 brd 00:00:00:00:00:00     inet 127.0.0.1/8 scope host lo        valid_lft forever preferred_lft forever     inet6 ::1/128 scope host         valid_lft forever preferred_lft forever 2: enp7s0: &lt;BROADCAST,MULTICAST,UP,LOWER_UP&gt; mtu 1500 qdisc fq_codel state UP group default qlen 1000     link/ether 04:d9:f5:8a:f5:e0 brd ff:ff:ff:ff:ff:ff     inet 192.168.0.51/24 brd 192.168.0.255 scope global dynamic noprefixroute enp7s0        valid_lft 863960sec preferred_lft 863960sec     inet6 fe80::7eb1:eca2:96a0:fe5c/64 scope link noprefixroute         valid_lft forever preferred_lft forever  With nothing: 1: lo: &lt;LOOPBACK,UP,LOWER_UP&gt; mtu 65536 qdisc noqueue state UNKNOWN group default qlen 1000     link/loopback 00:00:00:00:00:00 brd 00:00:00:00:00:00     inet 127.0.0.1/8 scope host lo        valid_lft forever preferred_lft forever     inet6 ::1/128 scope host         valid_lft forever preferred_lft forever 2: enp7s0: &lt;NO-CARRIER,BROADCAST,MULTICAST,UP&gt; mtu 1500 qdisc fq_codel state DOWN group default qlen 1000     link/ether 04:d9:f5:8a:f5:e0 brd ff:ff:ff:ff:ff:ff  lsusb, adapter plugged in: Bus 004 Device 001: ID 1d6b:0003 Linux Foundation 3.0 root hub Bus 003 Device 002: ID 046d:c31c Logitech, Inc. Keyboard K120 Bus 003 Device 001: ID 1d6b:0002 Linux Foundation 2.0 root hub Bus 002 Device 001: ID 1d6b:0003 Linux Foundation 3.0 root hub Bus 001 Device 003: ID 1d57:32da Xenta 2.4GHz Receiver (Keyboard and Mouse) Bus 001 Device 004: ID 0bda:b812 Realtek Semiconductor Corp. 802.11ac NIC Bus 001 Device 001: ID 1d6b:0002 Linux Foundation 2.0 root hub  I'm not adding it with it plugged out because it's obviously the Bus 001 Device 004: ID 0bda:b812 Realtek Semiconductor Corp. 802.11ac NIC. There were no restarts between any of these changes.