Assume I have a program that executes the following pseudocode  x = 1 for 0 to n     y = random real in [0,1)     if y &lt; x         x = y return x   What is the expected value of the return of this function wrt to n?  In english, set X to 1000.  Choose a random real in the half-open interval [0,1) n times, setting the minimum to X.  What is the expected value of X in terms of n?
$x_{1}...x_{n}$ are independent continuous random variables with common distribution function $F(x)$,consider the order statistics $(x_{(1)},...,x_{(n)})$, compute $E(F(x_{(n)})-F(x_{(1)}))$  I have no idea to this problem, anyone could help me? Thanks!
Why are memory statistics in top and htop different? Whenever I use top and htop commands to see memory stats, they are always different as shown in figures. Which should I trust? Starcraft Installation asks for a mythical Disk 2 I was viewing  question in the Android app. As shown in the below screenshot, while the top shows "4 answers", the bottom button will ask to "View 6 Answers". After checking the question, there are indeed six answers to the aforementioned question.    I am using Android 4.3 with the 0.1.64 version of the app.    EDIT: The changes to the UI made this question obsolete. Getting JavaScript object key list Pressing Enter in comment box unexpectedly submits form How to Map a subset of list elements to a function? I lost my Italian residence permit abroad, how can I obtain a duplicate so that I can fly back to Italy? Sweden is going to ban me from flying if I can't show them my lost permesso di soggiorno from Italy. It was issued in Florence because my old one expired while I was in school. How do I get a copy? Proof of $a^n+b^n$ divisible by $a+b$ when $n$ is odd I read somewhere that     $(a^n - b^n)$         It is always divisible by $a-b$.   When $n$ is even it is also divisible by $a+b$.   When $n$ is odd it is not divisible by $a+b$.      and     $(a^n + b^n)$         It is never divisible by $a-b$.   When $n$ is odd it is divisible by $a+b$.   When $n$ is even it is not divisible by $a+b$.      I wonder what's the proof for this.  First postulate is clear. $(a-b)$ would or would not be a factor. Any light on others? How to Tail -f output with colors using only Awk and show the rest of the output? I was able to do a tail -f output with colors using the awk command. But I'm unsure how to output the rest of the log as it seems to be filtering only those 2 lines. I also want to see the other lines as the log is written.  What do I need to put in the awk command to show the rest of the output?  Image of my issue. The red text above is without using awk and displays the entire tail -f log. And below that is the same command with the awk color filtering. Consequences of a master thesis with errors I finished my master thesis 6 years ago, since then I gained a lot of experience on my field and also in academia. I can say that in that time I was a "child" , very inexperienced. I think that also my advisor did not help a lot, and I tried to do  a lot of things by my own, without someone to really review my things. Despite that, I still received a good mention by the master committee on final results.   Some days ago, I just decided to read part of master thesis, and I just realized a big nightmare coming. I identified a lot of typos, some references errors, and some improvements that I should do, but I did not. The worst thing is that I wrote a paper to a conference with my master thesis results (and some errors are there). The conference is not a high impact conference, but still the paper has my name and is available for everyone...   As I am finishing my PhD studies for now, I am concerning a lot that situation. My dream and goal is to pursue a Professor career. So, my questions are: What are (or could be) the consequences of a master thesis and paper with errors (some minor and some major) in academia? Revoke degree after years by errors in master is possible ( I am concerning a lot this situation that I thought on it)? How can I minimize it (I thought that I can put a fixed version of my thesis and paper in the future, for instance on my personal website)? How those errors can impact me in a Professor recruitment process?  Sorry for the long text, I am blaming myself all the time, and really afraid about the possibilities since I know that Academia career is really competitive. Gauss's Law with Moving Charges Prove that $\binom{m+n}{m}=\sum\limits_{i=0}^m \binom{m}{i}\binom{n}{i}$ I need to proof this following equality :  $$\binom{m+n}{m}=\sum_{i=0}^m \left(\binom{m}{i}\binom{n}{i}\right)$$  This is what I did combinatoric proof:  Left : subset with $m$ members from $m+n$  Right : $\binom{m}{i} \rightarrow$ The number of subsets in set $m$ could also be written as $2^m$ AND $\binom{n}{i} \rightarrow$ the number of subsets with $m$ members from set $n$  In case $ n \leq m \implies \binom{n}{i}=2^n$  So this is what I came up with I still can't see why those expression are equal.  Any ideas? Thanks. Let $x_n$ be a sequence of the type described above. It is not monotonic in general, so boundedness won't help. So, it seems as if I should show it's Cauchy. A wrong way to do this would be as follows (I'm on a mobile device, so I can't type absolute values. Bear with me.) $$\left|x_{n+1} - x_n\right| \leq \frac{1}{n^2}.$$ So, we have $$ \left|x_m -x_n\right| \leq \sum_{k=n}^{m} \frac{1}{k^2}$$ which is itself Cauchy, etc., etc. But, of course, I can't just use absolute values like that. One thing I have shown is that $x_n$ is bounded. Inductively, one may show $$ \limsup_{n \to \infty} x_n \leq x_k + \sum_{k=n}^{\infty} \frac{1}{k^2},$$ although I'm not sure this helps or matters at all. Thanks in advance.  Disclaimer I've noticed that asking a large number of questions in quick succession on this site is often frowned upon, especially when little or no effort has been given by the asker. However, I am preparing for a large test in a few days and will be sifting through dozens of problems. Therefore, I may post a couple a day. I will only do so when I have made some initial, meaningful progress. Thanks. How do I perform a Perl substitution on a string while keeping the original? This question is present as a matter of historical interest.  While you are encouraged to help maintain its answers, please understand that "big list" questions are not generally allowed on Ask Ubuntu and will be closed per the .   It is possible to greatly extend the usage time of a laptop or netbook running on battery by disabling various services and installing various packages.   What tricks or tips do people have for getting an extra hour or two out of their batteries? Determine value of the limit:  $$L=\lim_{n\to \infty}\sqrt[n]{1^2+2^2+\cdots+n^2}$$  My try:  $$1^2+2^2+\cdots+n^2=\frac{n(n+1)(2n+1)}{6}$$  Hence: $$L=\lim_{n\to \infty} \sqrt[n]{\frac{n(n+1)(2n+1)}{6}}=?$$  But, come here, i do not know how, because please help me. I can understand the choice of material, silicon 28, but why is it a sphere rather than (say) a cube? Article   I would have thought that a sphere would have been the hardest shape to machine accurately. How do I bypass "this connection is not private" warnings in safari? What is the principle of underdetermination? While studying I read about the principle of underdetermination of scientific theories. I made some researches online but I am more confused than before. I read about the Quine-Duhem holistic thesis, but I do not know if is the same as underdetermination. Calling delete on variable allocated on the stack