I was trying to install a hard drive by following the , but I accidentally formatted my 2 TB external hard drive instead of my 1 TB internal hard drive.  I'm running Ubuntu 14.04 and I have 3 hard drives:   80gb Intel SSDSC2BW080A4 (DC22) master boot record ST1000DM003-1ER162 (CC43) GUID Partition Table (the one i wanted to install and mount) My 2 TB Segate external Hard Drive that now is inaccessible and formatted.   When i go to my disks tool and choose this hard drive it tells me that its 1.6% full, which sounds like good news to me.  I read a couple of different post look into some programs but I'm not really sure how to proceed.  results of the deep analysis with testdisk  Disk /dev/sdc - 2000 GB / 1863 GiB - CHS 243201 255 63  The harddisk (2000 GB / 1863 GiB) seems too small! (&lt; 17833196 TB / 16219197 TiB Check the harddisk size: HD jumpers settings, BIOS detection...  The following partitions can't be recovered:  Partition               Start        End    Size in sectors     VMFS                 38417 201 39 3789016855  14 45 3924794316768135   SysV 4               49694 147  2 7723719 218 31 123283216128 [^\%^DK]  VMFS                 138906 191 51 3432453218  29 16 34830459532972999  XFS 4                179830 196 24 1053386502  20 50 17956568663837018 [~[JR4  NTFS                 243201   0 63 486402   0 62 3907024065  i probably should have mentioned that im very new to this. so cant really make sense of any of that.
About two weeks ago I had a problem with my PC that my brother wrote a question about at .  I still haven't solved the problem, so my PC is unusable now.  Now I think that it would be simpler to re-install both Win7 &amp; Ubuntu than repair them, but there're some data on their partitions. I want to recover this data.  These partitions are not mountable for some reason. I don't know why.  sudo fdisk -l about the problematic partitions:     Device    Boot      Start         End      Blocks   Id  System /dev/sda1            2048     147912703    73955328   83 Linux /dev/sdb2            206848   174079999    86936576    7  HPFS/NTFS/exFAT   And in GParted:      And the error of the mount command:  Failed to mount '/dev/sdb2': Invalid argument The device '/dev/sdb2' doesn't seem to have a valid NTFS. Maybe the wrong device is used? Or the whole disk instead of a partition (e.g. /dev/sda, not /dev/sda1)? Or the other way around?   And the exact same message for /dev/sda1  How can I recover my data from those HDDs?  EDIT     I have tried to specify the type of the drive:  $ sudo mount -t ext4 /dev/sda1 /olddisk mount: wrong fs type, bad option, bad superblock on /dev/sda1,        missing codepage or helper program, or other error        In some cases useful info is found in syslog - try        dmesg | tail  or so $ sudo mount -t ntfs /dev/sdb2 /olddisk NTFS signature is missing. Failed to mount '/dev/sdb2': Invalid argument The device '/dev/sdb2' doesn't seem to have a valid NTFS. Maybe the wrong device is used? Or the whole disk instead of a partition (e.g. /dev/sda, not /dev/sda1)? Or the other way around?   EDIT     sudo ntfsfix /dev/sdb2 returns:  Mounting volume... NTFS signature is missing. FAILED Attempting to correct errors... NTFS signature is missing. FAILED Failed to startup volume: Invalid argument NTFS signature is missing. Trying the alternate boot sector Unrecoverable error Volume is corrupt. You should run chkdsk.
Tristate Checkboxes in Java How does one prove that if $n \mid (a^{n}-b^{n}) \ \Longrightarrow$ $ \displaystyle n \mid \frac{a^{n}-b^{n}}{a-b}$ where $a,b, n \in \mathbb{N}$.  What i thought of is to consider $$(a-b)^{n} \equiv a^{n} + (-1)^{n}b^{n} \ (\text{mod} \ n)$$ and if we suppose that $n$ is odd then we have, $$(a-b)^{n} \equiv a^{n} -b^{n} \ (\text{mod} \ n)$$ and since $n \mid (a^{n} - b^{n})$ we have $$(a-b)^{n} \equiv 0 \ (\text{mod} \ n) $$  I think i am far away from the conclusion of the problem, but this is what i could work on regarding the problem. Return FileName Only when using OpenFileDialog Is there a reason, beyond historical reasons, that three phases has become the dominant number of phases?  I am aware of the advantages against one phase and two phase, namely the reduced amount of conductor needed, and that motors can provide torque when stalled (and less pulsation).  Is this solely due to diminishing returns, with only a small increase in smoothness of torque application, at the cost of increased complexity (increased number of wires (albeit of smaller CSA)).  To be clear, the phases are all evenly distributed, that is, five phases separated by 72 degrees. Is there a better alternative to ambiguous for a word with a wide range of meanings, difficult to find, because they become different in connection with person's opinion. Update Manager asking me to update kernel but apt-get upgrade does not? Accessing the web page's HTTP Headers in JavaScript How do I access a page's HTTP response headers via JavaScript?  Related to , which was modified to ask about accessing two specific HTTP headers.     Related: Proving at least 99 pairwise sums of the reals are non-negative Suppose, one hundred real numbers are given and their sum is 0.Then how can I prove that at least 99 of the pairwise sums of these hundred numbers are non-negative?  I tried this: Let the real numbers be $a_i$,$1\leq i\leq100$. By the given condition, $a_1+a_2+\dots +a_{100}=0$.Suppose for the sake of contradiction, that at most 98 of the pairwise sums of these given reals are non-negative.I just tried to examine the case when exactly 98 of them are non-negative. I labelled the sums $S_1$,$S_2,\dots S_{4950}$,WLOG assume that sums $S_1,S_2,\dots S_{4852}$ are negative, the rest are non-negative. $$S_1+S_2+\dots +S_{4950}=99(\sum_{i=1}^na_i)=0$$ Case I: $S_{4853}+a_{4854}+\dots +a_{4950}=0$.That simply means that $S_1+S_2+\dots +S_{4852}=0$.But, by the given condition, $S_1+S_2+\dots +S_{4852}&lt;0$,a contradiction.After that, I am not able to make any progress.  Can anyone please suggest a more efficient method to solve this problem.I feel this approach will involve enormous case work. My phone was just stolen an hour or so ago. Are there any options for tracking? Quickly calculate date differences I got a positive definite matrix $B,$ that is, $V(x) = x^TBx &gt; 0$ for any vector $ x \neq 0.$  I want to show that $ \lambda_\min \|x\|_2^2 \leq V(x) \leq \lambda_\max \|x\|_2^2$ for any $x \neq 0,$ where $\lambda_\min$ and $ \lambda_\max$ are defined by $$ \lambda_\min = \min \lbrace | \lambda|: \lambda \text{ is an eigenvalue of } B \rbrace$$ and  $$ \lambda_\max = \max \lbrace | \lambda|: \lambda \text{ is an eigenvalue of } B  \rbrace$$  Any hint please? How do I change skins in minecraft pe? Android : Is there any alternative to listFile function (Android java.io.File.listFiles()) Why does this not work with an imaginary exponent? Could someone please tell me why this exponentiation rule does not work when the exponent is imaginary?  The following seems to be true but is only true if $x$ is an integer.  $$e^{2\pi ix} = \left( e^{2\pi i} \right)^x = 1^x = 1$$ How do I summon mobs with block heads on Minecraft? Importing only certain rows between spreadsheet documents Document 1 has many rows of data.  How do I import into document 2 only those rows that have a certain value in column C? What techniques are available for collapsing (or pooling) many categories to a few, for the purpose of using them as an input (predictor) in a statistical model?    Consider a variable like  (discipline chosen by an undergraduate student). It is unordered and categorical, but it can potentially have dozens of distinct levels. Let's say I want to use major as a predictor in a regression model.  Using these levels as-is for modeling leads to all sorts of issues because there are just so many. A lot of statistical precision would be thrown away to use them, and the results are hard to interpret. We're rarely interested in specific majors -- we're much more likely to be interested in broad categories (subgroups) of majors. But it isn't always clear how to divide up the levels into such higher-level categories, or even how many higher-level categories to use.  For typical data I would be happy to use factor analysis, matrix factorization, or a discrete latent modeling technique. But majors are mutually exclusive categories, so I'm hesitant to exploit their covariance for anything.  Furthermore I don't care about the major categories on their own. I care about producing higher-level categories that are coherent with respect to my regression outcome. In the binary outcome case, that suggests to me something like linear discriminant analysis (LDA) to generate higher-level categories that maximize discriminative performance. But LDA is a limited technique and that feels like dirty data dredging to me. Moreover any continuous solution will be hard to interpret.  Meanwhile something based on covariances, like multiple correspondence analysis (MCA), seems suspect to me in this case because of the inherent dependence among mutually exclusive dummy variables -- they're better suited for studying multiple categorical variables, rather than multiple categories of the same variable.  edit: to be clear, this is about collapsing categories (not selecting them), and the categories are predictors or independent variables. In hindsight, this problem seems like an appropriate time to "regularize 'em all and let God sort 'em out". Glad to see this question is interesting to so many people! My textbook explains the proof, which I don't understand:  "Consider two bases $v_1...v_p$ and $w_1...w_q$ of V. Since the vectors $v$ are linearly independent and the vectors $w$ span V..."  How exactly does $w$ span V?   The book then says the same for vectors $v$, that $v$ spans V and hence $p=q$, but I don't really understand how you can assume that given two sets of vectors that are basis, one set must span V. Book series where they collect either stones or gems I'm looking for a fantasy book I read about 10 years ago. I don't remember a lot of it, but there are a few things I still know:   The setting was in medieval times. There was no traveling dimensions. I can't recall whether there was magic or not. It wasn't on Earth, but on some invented world. I believe it was a trilogy, with a focus on the son of some nobility. The goal for the characters was to collect a certain number of stones or gems (I believe there were 5 of them), all in certain colours. Every stone has a certain power attached to it. I believe it started out with one or two characters, but the group grew and every character had a certain colour stone at the end. What is important about the gems is that they are unique. It's not part of a bigger magic system, but they are artefacts from somewhere.   There are some minor incidents I can recall vividly:   They build up a fellowship with some stereotypical fantasy builds: an old school fighter, a minstrel, a female archer and probably more. At one point, they mention that if one of the guards in a country falls asleep on duty, he will be kept awake by his garrison/brothers in arms for seven days. At some point the minstrel falls asleep, and the old fighter teaches him how to stay awake. They travel through a forest full of leeches and other insects to reach one of the stones. Also, I seem to recall there was a member of an underground evil organisation among the nobility, who tried to poison someone and were able to do that because they built up an immunity to the poison.   Does anyone has a clue what this series might be?   Suggestions by kind people, but not what I'm looking for, are:   The Seventh Tower Deltora Quest Diadem Westria Sword of Heavens series Using "nor" in a list without "neither"