I have installed an Ubuntu server on a VMWare workstation with a space of 20GB storage as seen below:    After the installation I've attached another 40GB worth storage to the existing Ubuntu server installation (seen below):    Now I want to add this 40GB to my / (root) directory or to /var/ directory but my df -h result shows;  root@Userver:~# df -h Filesystem      Size  Used Avail Use% Mounted on /dev/sda1        18G  900M   16G   6% / udev            990M  4.0K  990M   1% /dev tmpfs           400M  308K  399M   1% /run none            5.0M     0  5.0M   0% /run/lock none            999M     0  999M   0% /run/shm none            100M     0  100M   0% /run/user root@Userver:~#   What should I do now? Further, I have only ssh access to the server.   some one told me to do :  sudo mkfs.ext4 /dev/sdb -I   and when i do this command :  root@Userver:~# ls /dev/sd* /dev/sda  /dev/sda1  /dev/sda2  /dev/sda5   if you look carefully you , you don't see  "sdb" or "sdb1"  Next , i'm restart Ubuntu-server and after restart there was a "sdb" on "/dev/"  like this :  root@Userver:~# ls /dev/sd* /dev/sda  /dev/sda1  /dev/sda2  /dev/sda5  /dev/sdb   now when i do this command :  root@Userver:~# mkfs.ext4 /dev/sdb -I mkfs.ext4: option requires an argument -- 'I' Usage: mkfs.ext4 [-c|-l filename] [-b block-size] [-C cluster-size]         [-i bytes-per-inode] [-I inode-size] [-J journal-options]         [-G flex-group-size] [-N number-of-inodes]         [-m reserved-blocks-percentage] [-o creator-os]         [-g blocks-per-group] [-L volume-label] [-M last-mounted-directory]         [-O feature[,...]] [-r fs-revision] [-E extended-option[,...]]         [-t fs-type] [-T usage-type ] [-U UUID] [-jnqvDFKSV] device [blocks-count]   ,,,,,,,,,  please help me, i want to add the 40G hard to ubuntu 12.04, and mount it to "/var/www/"  but i cant do that  i use some how to's and i get this error's :  root@Userver:~# mount /dev/sdb1 /var/www/ mount: mount point /var/www/ does not exist   i dont know what should i do
I have installed an Ubuntu server on a VMWare workstation with a space of 20GB storage as seen below;    After the installation I've attached another 40GB worth storage to the existing Ubuntu server installation (seen below);    Now I want to add this 40GB to my / (root) directory or to /var/ directory but my df -h result shows;  root@Userver:~# df -h Filesystem      Size  Used Avail Use% Mounted on /dev/sda1        18G  900M   16G   6% / udev            990M  4.0K  990M   1% /dev tmpfs           400M  308K  399M   1% /run none            5.0M     0  5.0M   0% /run/lock none            999M     0  999M   0% /run/shm none            100M     0  100M   0% /run/user root@Userver:~#   What should I do now? Further, I have only ssh access to the server.
The staircase paradox, or why $\pi\ne4$ How do I go about backing up/saving installed device drivers in Windows? I want to reinstall Windows on a machine which has some very obscure drivers. I don't much fancy having to hunt round for them (that's if I'm able to locate them at all). Is it possible to save or backup already installed drivers? If so, how do I do this? How do I then go about installing these 'saved' drivers? I'm writing up my dissertation and I'm really confused where to use "the". Examples:     In this experiment, (the?) heat transfer coefficient was calculated, allowing to estimate (the?)frost thickness.    And:     Firstly, (the?) air properties are defined.   And:     As (the?) crystals grow in radius, the amount of air in (the?) ice is reduced, due to (the?) ice becoming more packed.   None of the nouns mentioned above have been used for the first time, so I rule out the use of "a".   Would appreciate any help. I've been battling the following two questions for more than a day today.  Write a regular expression (comprised of {a, b}) that contain at least two b and do not contain abb. Write a regular expression (comprised of {a, b}) that contain abba and do not contain baa.  For the first part I wrote a basic one to start off with that doesn't handle the must two-b: b* OR a* OR (a+ AND b)* OR a*  I ran a few &quot;truth tables&quot; inputs over it and it seems ok. But the moment I add the requirement, things go haywire. Mostly because when pushing in those &quot;b&quot;s, you can suddenly use the OR to break things up. Same thing on the second one.... Any help would be greatly appreciated! Norah Extract reply addresses from all emails in an outlook folder (sent on behalf of) I've got to send a bulk email out to a bunch of people in reply to emails they sent me. I've got all the original emails stored in a single outlook folder. I want to extract all of the reply addresses from the emails in that folder so I can send an email to all of them.  The article  shows you how to export the FROM address of these emails, however a large amount of them came from a web service that sends emails 'on behalf of' the person I'm trying to mail to. So I need the reply-to address, and the export wizard doesn't do that.  Does anyone have a tip on how to do this? This is Outlook 2007 on Exchange 2010. I have the following code:  MemoryStream foo(){     MemoryStream ms = new MemoryStream();     // write stuff to ms     return ms; }  void bar(){     MemoryStream ms2 = foo();     // do stuff with ms2     return; }   Is there any chance that the MemoryStream that I've allocated will somehow fail to be disposed of later?    I've got a peer review insisting that I manually close this, and I can't find the information to tell if he has a valid point or not. Showcase of beautiful typography done in TeX & friends If you were asked to show examples of beautifully typeset documents in TeX &amp; friends, what would you suggest? Preferably documents available online (I'm aware I could go to a bookstore and find many such documents called 'books'). Extra bonus for documents whose LaTeX source is available.  This is not an idle question. Seeing great examples of any craft is both educational and inspiring, let alone explaining why we prefer TeX to Word or other text editors.  For instance, I like how Philipp Lehman's  looks. I don't know enough LaTeX to realize how much customization was done, but the ToC looks polished.  Your nominations, please ... $\lim\limits_{n \to \infty} \frac{a_n}{b_n}=l$ ; Prove $\sum\limits_{k=1}^\infty a_k$ converges iff $\sum\limits_{k=1}^\infty b_k$ converges. Written, in Ex.8 Ch.9.1 of the book Advanced Calculus by P. M. Fitzpatrick :     Suppose that $\sum\limits_{k=1}^\infty a_k$ and $\sum\limits_{k=1}^\infty b_k$ are series of positive numbers such that $$\lim_{n \to \infty} \frac{a_n}{b_n}=l \ \ \ \text{and} \ l&gt;0.$$ Prove that the series $\sum\limits_{k=1}^\infty a_k$ converges iff the series $\sum\limits_{k=1}^\infty b_k$ converges.   Am I correct by the following (sketch of) proof? :  1- For a given $\epsilon_1$ there is $N_1$ such that $\left|\frac{a_n}{b_n} - l\right| &lt; \epsilon_1$ for all $n \ge N_1$.  2- Since the series $\sum\limits_{k=1}^\infty a_k$ converges, for a given $\epsilon_2$ there is $N_2$ such that $\left|b_{n+1}+\dots+b_{n+k}\right|&lt; \epsilon_1$ for all $n \ge N_2$ any for all natural numbers $k$.  3- Define $N = \max {\{N_1,N_2}\}$.   4- From Step (1), $a_{n+k} &lt; (\epsilon_1+l) b_{n+k}$ for all $n \ge N$ any for all natural numbers $k$. [Also, $a_i$'s and $b_i$'s are all positive]. Thus $a_{n+1}+\dots+a_{n+k} &lt; (\epsilon_1+l) (b_{n+1}+\dots+b_{n+k})&lt; \epsilon_3$. Then the convergence of the series $\sum\limits_{k=1}^\infty b_k$ implies the convergence of the series $\sum\limits_{k=1}^\infty a_k$.  5- For the reverse implication, we use the fact that $\lim\limits_{n \to \infty}\frac{a_n}{b_n}=l \iff \lim\limits_{n \to \infty}\frac{b_n}{a_n}= \frac{1}{l}= l' &gt;0$ and repeat the process this time for a and b exchanged.   6- The Quotient Property For Sequences hold for a nonzero limit in the denominator, but since the limit in the numerator also is zero so we may use the The Quotient Property For Sequences.    Thanks. Title says it all, I don't see confirmation in  and a cursory google search seemed to say assume no and speculate about the pokemon bank. Do electrons have shape? In Harry Potter and the philosophers stone Harry was "receiving" his letters in a way that was so labour intensive. First, one was sent in the mail, and the others where then sent, either shoved into the letterbox or through the door cracks. It then it got, "out of hand," as twenty four letters found their way inside the house. The letter sender (Minerva, I do believe, Deputy Headmistress) must, obviously have known they were not getting to Harry, so why keep sending them? I cannot even believe Minerva sending more than thirty letters! Why not either,  A) Send the letters directly to Harry  OR  B) Show up at the house, to explain everything.  Why not do a more logical way of sending/explaining Harry's being? Non-blocking Synchronous AJAX How to redirect output of wget as input to unzip? I have to download a file from this . The file download is a zip file which I will have to unzip in the current folder.  Normally, I would download it first, then run the unzip command.  $ wget http://www.vim.org/scripts/download_script.php?src_id=11834 -O temp.zip $ unzip temp.zip   But in this way, I need to execute two commands, wait for the completion of first one to execute the next one, also, I must know the name of the file temp.zip to give it to unzip.  Is it possible to redirect output of wget to unzip? Something like  $ unzip &lt; `wget http://www.vim.org/scripts/download_script.php?src_id=11834`   But it didn't work.      bash: wget   http://www.vim.org/scripts/download_script.php?src_id=11834   -O temp.zip: ambiguous redirect   Also, wget got executed twice, and downloaded the file twice. How can I tell Ubuntu to do nothing when I close my laptop lid? I have come across these three definitions of the limit superior (or upper limit) and the limit inferior (or lower limit) of a sequence of real numbers and I wonder how to establish the equivalence of these.    Walter Rudin: PRINCIPLES OF MATHEMATICAL ANALYSIS, 3rd edition:  Definition 3.16: Given a sequence $\{s_n\}$ of real numbers, let $E$ be the set of numbers $x$ (in the extended real number system) such that $s_{n_k} \to x$ for some subsequence $\{s_{n_k}\}$. This set contains all subsequential limits ..., plus possibly the numbers $+\infty$, $-\infty$. We now ... put  $$s^{*} = \sup E,$$ $$s_{*} = \inf E.$$ The numbers $s^{*}$, $s_{*}$ are called the upper and lower limits of $\{s_n\}$; we use the notation  $$ \lim_{n \to \infty} \sup s_n = s^{*}, \, \, \, \lim_{n \to \infty} \inf s_n = s_{*}.$$ Tom M. Apostol: MATHEMATICAL ANALYSIS, 2nd edition:  Sec. 8.3: Definition 8.2: Let $\{a_n\}$ be a sequence of real numbers. Suppose there is a real number $U$ satisfying the following conditions:    i} For every $\epsilon &gt; 0$ there exists an integer $N$ such that $n &gt; N$ implies $$a_n &lt; U + \epsilon.$$ ii) Given $\epsilon &gt; 0$ and given $m &gt; 0$, there exists an integer $n&gt; m$ such that $$a_n &gt; U - \epsilon.$$ Then $U$ is called the limit superior (or upper limit) of $\{a_n\}$, and we write $$U = \lim_{n \to \infty} \sup a_n.$$ Statement (i) implies that the set $\{a_1, a_2, a_3, \ldots \}$ is bounded above. If this set is not bounded above, we define $$\lim_{n\to\infty}\sup a_n = +\infty.$$ If the set is bounded above but not bounded below and if $\{a_n\}$ has no finite limit superior, then we say $\lim \sup_{n\to\infty} a_n = -\infty$. The limit inferior (or lower limit) of $\{a_n\}$ is defined as follows: $$\lim_{n\to\infty}\inf a_n = -\lim_{n\to\infty}\sup b_n,$$ where $b_n = -a_n$ for $n= 1, 2, 3, \ldots$.    Robert G. Bartle and Donald R. Sherbert: INTRODUCTION TO REAL ANALYSIS, 3rd edition: Exercises for Section 3.3: Problem 10: Let $(x_n)$ be a bounded sequence of real numbers, and for each $n\in \mathbb{N}$ let $s_n \colon= \sup \{x_k \colon k \geq n\}$ and let $t_n \colon= \inf \{x_k \colon k \geq n\}$. Prove that $(s_n)$ and $(t_n)$ are monotone and convergent. Also prove that if $\lim (s_n) = \lim (t_n)$, then $(x_n)$ is convergent. [One calls $\lim (s_n)$ the limit superior of $(x_n)$ and $\lim (t_n)$ the limit inferior of $(x_n)$.]   Now how can one show that the above three definitions are equivalent (i.e. these three definitions are of the same pair of numbers)? I need a number of different full-page DOM samples for my qUnit test suite How to create script with auto-complete? If $f:E\rightarrow S$ is an elliptic curve over a scheme $S$ (so $f$ is proper and smooth of relative dimension one with geometrically connected fibers of genus one, equipped with a section $0:S\rightarrow E$), then is the sheaf $\underline{\omega}_{E/S}:=f_*\Omega_{E/S}^1$ actually free of rank one? According to the statement of Grothendieck-Serre duality in Hida's book Geometric Modular Forms and Elliptic Curves, there should be a canonical isomorphism $\underline{\omega}_{E/S}\cong\mathcal{Hom}_{\mathscr{O}_S}(R^1f_*\mathscr{O}_E,\mathscr{O}_S)$, and the first result on elliptic curves in this book is that $R^1f_*\mathscr{O}_E\cong\mathscr{O}_S$. It's also not clear to me whether $S$ is being assumed (locally) Noetherian, but if that's necessary for Grothendieck-Serre duality to hold, then I'm fine with assuming it. I can't find another reference with a statement of Grothendieck-Serre duality in this generality which does not use the language of derived categories (which I unfortunately don't understand).  The reason I'm kind of skeptical about this is that in Hida's book, as well as in Katz-Mazur, it is said that $\underline{\omega}_{E/S}$ is invertible, so that an $\mathscr{O}_S$-basis $\omega$ for $\underline{\omega}_{E/S}$ can be found locally on $S$. If the invertible sheaf in question were really trivial then one would be able to choose a global $\mathscr{O}_S$-basis for $\underline{\omega}_{E/S}$, and there would be no reason to talk about doing so locally. Hida goes on to say that, choosing an $\mathscr{O}_S$-basis $\omega$ locally on $S$ allows one to regard $(\Omega_{E/S}^1,\omega)$ as a relative effective Cartier divisor in $E/S$, which also doesn't make complete sense to me because if we can only find $\omega$ locally, how are we getting a global section $\omega\in H^0(E,\Omega_{E/S}^1)=H^0(S,\underline{\omega}_{E/S})$ (unless $\underline{\omega}_{E/S}$ really is trivial)? Persist variables between page loads Algorithms for computing multiplicative order modulo $n$ If I take the $k \in \mathbb{N}$ power of 10 and mod it by a large prime, I notice that the remainders repeat at some point.  For instance $10^k mod~7$ seems to repeat every $8$th value of $k$.  Given $k$ (the power of ten), and a large prime number $p$, how can I compute the size of the cycle?  I tried writing a python script that computes the first instance of a repeat. However, I don't know if this works since a single instance of a repeat may not necessarily mean a full cycle.