Lost disk after migrating from XP to Ubuntu After migrating from windows XP (they still exist ;) I "lost" the disk with 3 partitions on it. One of these partitions  was the windows system disk. This disk is now marked as "unallocated". How do I get access to this disk again?   Thnx for helping out...
How do I recover my accidentally lost Windows partitions after installing Ubuntu? I have a Toshiba satellite A-200 laptop with a Vista OS on it with 4 NTFS partitions  (C:) Vista  (D:) Entertainment  (E:) Work  (F:) Sources   and I wanted to start using Ubuntu instead. So I tried it first from the live CD and everything was OK and all the partitions were shown and working and so I decided to install Ubuntu to replace Vista on the (C:) drive. After I did that I can no longer find my folders and files on the (D:), (E:), (F:) partitions and the only file system that is shown is one 198 GB although my HDD is 320 GB.  I can't access the lost data on the remaining 120 GB which I hope is still there and not totally lost  I am now working from the live CD but I am unable to install testdisk. Can I recover the Vista partitions by the product recovery CD to get my laptop back to the factory settings? Can I recover the NTFS partitions using a recovery program for Windows or will that make the problem worse?   I need these data badly as I don't have a backup for them.
What to do when visa admission expires during lockdown? How do I detect running processes using a library package? This command is doing the rounds for detecting currently running processes using glibc:  lsof | grep libc | awk '{print $2}' | sort | uniq   I find it intensely annoying, since /libc/ matches not only libc, but on my system:  /lib/x86_64-linux-gnu/libcap.so.2.24 /lib/x86_64-linux-gnu/libcgmanager.so.0.0.0 /lib/x86_64-linux-gnu/libcom_err.so.2.1 /lib/x86_64-linux-gnu/libcrypt-2.19.so /lib/x86_64-linux-gnu/libcrypto.so.1.0.0 /usr/lib/libcamel-1.2.so.45.0.0 /usr/lib/unity-settings-daemon-1.0/libcolor.so /usr/lib/unity-settings-daemon-1.0/libcursor.so /usr/lib/x86_64-linux-gnu/colord-plugins/libcd_plugin_camera.so /usr/lib/x86_64-linux-gnu/colord-plugins/libcd_plugin_scanner.so /usr/lib/x86_64-linux-gnu/gtk-3.0/modules/libcanberra-gtk3-module.so /usr/lib/x86_64-linux-gnu/libcairo-gobject.so.2.11301.0 /usr/lib/x86_64-linux-gnu/libcairo.so.2.11301.0 /usr/lib/x86_64-linux-gnu/libcanberra-0.30/libcanberra-pulse.so /usr/lib/x86_64-linux-gnu/libcanberra-gtk3.so.0.1.9 /usr/lib/x86_64-linux-gnu/libcanberra.so.0.2.5 /usr/lib/x86_64-linux-gnu/libcap-ng.so.0.0.0 /usr/lib/x86_64-linux-gnu/libck-connector.so.0.0.0 /usr/lib/x86_64-linux-gnu/libcolordprivate.so.1.0.23 /usr/lib/x86_64-linux-gnu/libcolord.so.1.0.23 /usr/lib/x86_64-linux-gnu/libcroco-0.6.so.3.0.1 /usr/lib/x86_64-linux-gnu/libcupsmime.so.1 /usr/lib/x86_64-linux-gnu/libcups.so.2 /usr/lib/x86_64-linux-gnu/samba/libcliauth.so.0 /usr/lib/x86_64-linux-gnu/samba/libcli_cldap.so.0 /usr/lib/x86_64-linux-gnu/samba/libcli-ldap-common.so.0 /usr/lib/x86_64-linux-gnu/samba/libcli-nbt.so.0 /usr/lib/x86_64-linux-gnu/samba/libcli_smb_common.so.0 /usr/lib/x86_64-linux-gnu/samba/libcli_spoolss.so.0 /usr/lib/x86_64-linux-gnu/samba/liblibcli_lsa3.so.0 /usr/lib/x86_64-linux-gnu/samba/liblibcli_netlogon3.so.0   I understand that libc is used by pretty much everything, but I'd like to refine this command. Consider its applications for other libraries. How can I do this?  The flaw in this approach, in my opinion, is that the package providing libc may include a whole host of other shared library files (all of which may or may not be covered under the umbrella term that is the library name, like glibc, or libboost-python). Using a word boundary or - to mark the end of libc doesn't really fix this. This may not be a flaw, perhaps, as Braiam points out, since many or all of these .so files may link to a core file in which the flaw resides, as is the case for libc6 on Debian.   If a specific OS/distro is needed, assume Debian Linux.  Also annoying is that this command could be condensed to lsof | awk '/libc/{print $2}' | sort -u. Groups with Same Number Of Elements and Subgroups I'm looking to install 32-bit windows with IIS to dual-boot with my 64-bit edition of windows on a laptop. I have a ten gig partition on my harddrive - is this large enough for a simple Windows install and a few programs?   I've never dual booted before, so I'm not quite sure how easy it is to mess up the process. Can you recommend any tutorials on how to set up a dual-boot configuration on Windows? Questions on "All Horse are the Same Color" Proof by Complete Induction I'm bugged by the following that's summarized on p. 109 of .     False theorem: All horses are the same color.      Proof by induction:      $\fbox{$P(n)$ is the statement: In every set of horses of size $n$, all $n$ horses are the same color.}$   $\fbox{Base Case or $P(1)$:}$ One horse is the same color as itself. This is true by inspection.   $\fbox{Induction Step:}$ Assume $P(k)$ for some $k \geq 1$.   $\fbox{Proof of $P(k + 1) :$}$   Since $\{H_1, H_2, ... , H_n\}$ is a set of $n$ horses, the induction hypothesis applies to this set. Thus, all the horses in this set are the same color.   Since $\{H_2, H_3, ... , H_{n+1}\}$ is also a set of $n$ horses, the induction step likewise holds for this set. Thus, all the horses in this set are the same color too.         Therefore, all $n +1$ horses in $\{H_1, H_2, H_3, ... , H_n , H_{n+1}\}$ are the same color. QED.   The issue the instructor was trying to point out is clearly valid. For the case $n = 1$, there is only ${H_1}$. So this case says nothing about possible overlapping elements of each set of $(n + 1)$, for instance $H_2$ in the above proof.    But it was proposed in the class discussion that this was the only problem. Had you been able to prove $P(2)$ true, then a proof of the above format would have been fine.    My interpretation is that yes, you could prove all horses are the same color, if you can prove that any set of two horses will be the same color. But this format would not work.  Why not? The problem I see is that the above proof is for the existence of at least one particular pair of sets of horses of sizes $n$ and $n + 1$, such that in each set, all horses are the same color.  Particularly when the set of size $n$ is a subset of the set of size $n + 1$.  In order to prove the induction step, don't you need to prove that sets of sizes $n$ and $n + 1$, do not necessarily contain the same, overlapping elements?  You could prove that any horse can be added to a set of 2 horses.  Take the last two, and they must be the same color, and so on.  Wwhatever color the first two happen to be, all other horses must thus be the same color.    Am I misinterpreting the example, or am I making a logical error? Thanks in advance. Prove $\sum_{i=1}^n2^{i-1}=\sum_{i=0}^{n-1}2^i=2^n-1$ combinatorially.  This is easy to prove inductively.  I know that $\sum_{i=0}^n{n\choose i}=2^n$ so maybe change $\sum_{i=0}^{n-1}2^i$ to $\sum_{i=0}^{n-1}\sum_{j=0}^i{i\choose j}$.  I also know that $2^n-1$ is the number of proper subsets in a set of size $n$. iOS 9.2 double touch fingerprint sensor XCOPY still asking (F = file, D = directory) confirmation Error: Counter too large! with \alph{cntr} and cntr>26 I would like to have \alph{counter} for values larger than 26. The following MnWE gives me the error ! LaTeX Error: Counter too large.  \documentclass{article} \begin{document}  \begin{enumerate} \def\theenumi{\alph{enumi}} \setcounter{enumi}{24} \item twenty-five \item twenty-six \item twenty-seven \end{enumerate}  \end{document}   I would like it to behave like one of these:  ..., x, y, z, aa, bb, cc, ..., xx, yy, zz, aaa, bbb, ccc, ... (preferred) ..., x, y, z, aa, ab, ac, ..., ax, ay, az, ba,  bb,  bc,  ... (can be if nothing else works)   A solution without LaTeX3 extensions would be awesome as I cannot run LaTeX3 extensions. I have this setup:   The mesh is only the visible top side, with a mirror modifier for the bottom part. Now I want to unwrap it like in the picture. I want the inner circle (red) to go to the top of the UV map...  The problem is that no matter what automatic unwrapping I use, it never works as intended.  The closest I've gotten was by using "follow quads", but that skewed the UV map a lot:   I used the result from the second image and manually adjusted the vertices with a lot of scaling and "align auto", but its very far from perfect as you can see in the first image.  Here's what I want exactly:   The uv vertices should be distributed evenly (horizontally) The middle line (yellow) should be on a "natural" y height (so there's no stretching)   I hope it's clear what I want to achieve. I'm sure there must be some automatic way to perfectly align and distribute the UVs in this way.  By the way: If you look closely you can see that I already placed a uv seam (aligned with the green y axis in the screenshot) but that didn't really help. How do I free up disk space? My Ubuntu cloud server has left only 900MB of disk space.   I'll just empty the directory /tmp and wondering if there is any other location to clean up. Finding Stack Overflow/Exchange users based on geographic area? How to enable root login again after changing password? I had enabled root login before and tried to change its password using this . But after successfully changing the password and locking it via sudo passwd -dl root. I cannot login back to SSH, it says Access is denied.  I have two users on my machine. root and admin, admin does not have su permission. When I try to use sudo on admin user, it says that admin is not in the sudoers file. That is why i need my su user back. How to bind 'touchstart' and 'click' events but not respond to both? root of an odd degree polynomial Im asked to prove that a polynomial of an odd degree has a root. Im going to use IVT to prove this, but I'm wondering if I can use the assumption that an odd degree polynomial has either two cases:  $$ \lim_{x\to\infty}h(x)=+\infty \\ \lim_{x\to-\infty}h(x)=-\infty \\ $$ $$and$$ $$ \lim_{x\to\infty}h(x)=-\infty \\ \lim_{x\to-\infty}h(x)=+\infty \\ $$ Then by this there exists numbers $a,b$ such that $$ h(a)&lt;0&lt;h(b) $$ $$or$$ $$ h(b)&lt;0&lt;h(a) $$ Which I think would prove that odd degreed $h(x)$ has at least a root. Or is there a more convincing way to show that there are numbers in $h(X)$ greater than zero and less than zero?  edit: (sorry about the bad limit notation) How do I build a TRRS headphone jack with a jack that is detectable by an iPhone I have a circuit and I am trying to integrate it with an iPhone via a TRRS headphone jack's microphone input. I have a generic TRRS cord and am trying to send a signal through it. However, the iPhone does not detect that a mic is even plugged in. However, if I plug it into my Mac via line-in and record, I can record the signal I am sending perfectly.   I have read online that it needs to detect resistance between the ground and mic, which I have. Are there any other things I need to do? It seems like this is an issue that stems from Apple's proprietary technology, as the earbuds are from a Windows Phone before they were spliced.    Thanks so much! Get value of R, G, B by color I often have to sort a dictionary, consisting of keys &amp; values, by value. For example, I have a hash of words and respective frequencies, that I want to order by frequency.  There is a SortedList which is good for a single value (say frequency), that I want to map it back to the word.   orders by key, not value. Some resort to a , but is there a cleaner way? I can't use the terminal while gedit command is running How do I use the Chinese remainder theorem to find all the square roots of 11 in $\mathbb Z_{35}$?