I deleted the /etc/passwd file and cannot login now. I don't know the root password and tried lots of passwords, but none of them worked.  How can I fix this?
I was trying to change my username and also my home directory (/home/username) and my system started to crash. I deleted the passwd file but I had a backup named passwd_bkp. I tried to rename this passwd_bkp as passwd and it did not work. No commands were being executed... I was in a terminal window.   I restarted my system and now I cannot log in. GRUB gives two options: Linux and recovery mode.   I tried to open a sessions as root but it says the filesystem is corrupted. I cannot access my files.  Did I lose all my files?
In our application, we receive text files (.txt, .csv, etc.) from diverse sources. When reading, these files sometimes contain garbage, because the files where created in a different/unknown codepage.  Is there a way to (automatically) detect the codepage of a text file?   The detectEncodingFromByteOrderMarks, on the StreamReader constructor, works for UTF8  and other unicode marked files, but I'm looking for a way to detect code pages, like ibm850, windows1252.     Thanks for your answers, this is what I've done.  The files we receive are from end-users, they do not have a clue about codepages. The receivers are also end-users, by now this is what they know about codepages: Codepages exist, and are annoying.  Solution:    Open the received file in Notepad, look at a garbled piece of text. If somebody is called François or something, with your human intelligence you can guess this. I've created a small app that the user can use to open the file with, and enter a text that user knows it will appear in the file, when the correct codepage is used.  Loop through all codepages, and display the ones that give a solution with the user provided text.  If more as one codepage pops up, ask the user to specify more text. What is the sum of this series: $\displaystyle\sum_{n=0}^{\infty} \dfrac{a^n}{(3n)!}$ I tried getting it into a closed form but failed. Could someone help me out?  $$\sum_{n=0}^{\infty} \dfrac{a^n}{(3n)!}$$ As a developer of free software, I want to get my application into Ubuntu.  Should I provide a source tarball and ask for packaging? Or should I create a package myself? Should I target Ubuntu directly, or should I try to get into Debian and then into Ubuntu automatically? C# 3.0 auto-properties — useful or not? Note: This was posted when I was starting out C#. With 2014 knowledge, I can truly say that auto-properties are among the best things that ever happened to the C# language.  I am used to create my properties in C# using a private and a public field:  private string title; public string Title {     get { return title;  }     set { title = value;  } }   Now, with  3.0, we got auto-properties:  public string Title { get; set; }   I know this is more a philosophical/subjective questions, but is there any reason to use these auto-properties except from saving five lines of code for each field? My personal gripe is that those properties are hiding stuff from me, and I am not a big fan of black magic.  In fact, the hidden private field does not even show up in the debugger, which is OK given the fact that the get/set functions do nothing. But when I want to actually implement some getter/setter logic, I have to use the private/public pair anyway.  I see the benefit that I save a lot of code (one vs six lines) without losing the ability to change the getter/setter logic later, but then again I can already do that by simply declaring a public field "Public string Title" without the need of the { get; set; } block, thus even saving more code.  So, what am I missing here? Why would anyone actually want to use auto-properties? When to use “that” and when to use “which”, especially in relative clauses Matching text using grep or awk Counting set for generating functions Give  a  proof  of  the  following  identity  by  counting  two  sets  of  partitions  in  two  different ways.  \begin{equation*}  \prod_{i\geq 0}(1+x^{2i+1})=1 + \sum_{n\geq 1}x^{n^2}\prod_{j=1}^n\frac{1}{1-x^{2j}}  \end{equation*} To prove this inductively, i only successfully complete the base cases, however the counting set for the left side i concluded that would be the number of partitions of n with distinct odd parts and for RS the product part would be the number of partitions of n with even parts, how would the summation of $x^{n^2}$ come into play with counting set. How would i initiate my proof? Below is a visual proof (!) that $32.5 = 31.5$. How could that be?    (As noted in a comment and answer, this is known as .) Is it just that nvarchar supports multibyte characters? If that is the case, is there really any point, other than storage concerns, to using varchars? Find all quadruples of real numbers $(a,b,c,d)$ satisfying the system of equations  $(b+c+d)^{2010}=3a$  $(a+c+d)^{2010}=3b$  $(a+b+d)^{2010}=3c$  $(a+b+c)^{2010}=3d$  I tried to find the solutions using hit and trial and by using some logic also I find two solutions which are $(0,0,0,0)$ and $(\frac{1}{3},\frac{1}{3},\frac{1}{3},\frac{1}{3})$  I think these are the only solutions that exist. Should I mention about my governmental-funded PhD scholarship which I don't want to use Deprecated: Function split() is deprecated. How to rewrite this statement? It's easy to check that for any natural $n$ $$\frac{n+1}{n}=\cfrac{1}{2-\cfrac{n+2}{n+1}}.$$  Now,   $$1=\frac{1}{2-1}=\frac{1}{2-\cfrac{1}{2-1}}=\frac{1}{2-\cfrac{1}{2-\cfrac{1}{2-1}}}=\cfrac{1}{2-\cfrac{1}{2-\frac{1}{2-\frac{1}{2-1}}}}=\ldots =\cfrac{1}{2-\cfrac{1}{2-\frac{1}{2-\frac{1}{2-\frac{1}{2-\dots}}}}},$$  $$2=\cfrac{1}{2-\cfrac{3}{2}}=\cfrac{1}{2-\cfrac{1}{2-\cfrac{4}{3}}}=\cfrac{1}{2-\cfrac{1}{2-\frac{1}{2-\frac{5}{4}}}}=\cfrac{1}{2-\cfrac{1}{2-\cfrac{1}{2-\frac{1}{2-\frac{6}{5}}}}}=\ldots =\cfrac{1}{2-\frac{1}{2-\frac{1}{2-\frac{1}{2-\frac{1}{2-\ldots}}}}}.$$  Since the right hand sides are the same, hence $1=2$. It seems like I'm doing something wrong when using foreach variables to indicate node numbers. The two foreach loops are anchoring the paths to the east of each node. Why does this happen?    \documentclass{article}  \usepackage{tikz} \usetikzlibrary{backgrounds,fit,patterns,decorations.pathreplacing,calc}  \makeatletter \tikzset{   labelnode/.style={draw=none, fill=none, black},   latentnode/.style={draw, minimum width=5mm, shape=circle, ultra thick, black},   dagconn/.style={arrows=-&gt;, black, thick}, } \makeatother  \begin{document} \begin{tikzpicture}[scale=1]  \pgfmathsetmacro{\colgap}{1.6}  \pgfmathsetmacro{\rowgap}{1.3}   \node[labelnode] (x1) at (\colgap*0,\rowgap*1) {$X_1$};  \node[labelnode] (x2) at (\colgap*1,\rowgap*1) {$X_2$};  \node[labelnode] (x3) at (\colgap*2,\rowgap*1) {$X_3$};   \node[latentnode,blue] (x4) at (\colgap*0,\rowgap*0) {$X_4$};  \node[latentnode,red] (x5) at (\colgap*1,\rowgap*0) {$X_5$};  \node[labelnode] (x6) at (\colgap*2,\rowgap*0) {$X_6$};   \foreach \c in {1,...,2} {    \foreach \r in {1,...,2} {      \pgfmathsetmacro{\st}{(((\r-1)*3)+\c)}      \pgfmathsetmacro{\en}{\st+1}      \draw[dagconn] ([xshift=0.2cm]x\st) to ([xshift=-0.9cm]x\en);    }  }   \foreach \c in {1,...,3} {    \foreach \r in {1,...,1} {      \pgfmathsetmacro{\st}{((\r-1)*3)+\c}      \pgfmathsetmacro{\en}{\st+3}      \draw[dagconn] (x\st) to (x\en);    }  } \end{tikzpicture} \end{document} I'm thinking about buying the new MacBook Pro with 4 USB-C ports.  I want to attach two screens, mouse and keyboard and ethernet to the MacBook Pro while using the fewest number of USB-C ports possible.  So what I need is an adaptor with:   two DP or HDMI ports (or one DP port with daisy chaining support) two or more USB ports an ethernet port   Best case would be a hub to which all devices are connected with a single connection to the MacBook Pro, including power supply. Worst case if attaching the MacBook Pro to the devices would require me to use all four of USB-C ports.  Given the answers up to far, I can tell that:   Daisy chaining might or might not work with the MacBook Pro (since it requires DP1.2 which is supported by the graphics chipset, but it's uncertain if it's supported by the MacBook Pro itself) I can attach the monitors with two cables as a last resort, leaving me with two ports for the remaining peripherals.   What I still don't know:   Would daisy chaining work with a hub or does it require the first monitor to be directly attached to the MacBook Pro? Does some kind of hub exist supporting attachment of all listed devices with a single upstream connection to the MacBook Pro? Problems with \pgfplotstableread and relative paths Why is the sample distribution the Exponential distribution Gamma distributed? I was doing graph theory homework. I was counting the spaning trees of graph G. Such that G is two complete graphs on n vertices connected by two edges. I got to this expression: $$2n^{2\left(n-2\right)}+2\left(n^{\left(n-2\right)}\sum_{i=0}^{n-2}\binom{n-2}{i}\left(1+i\right)^{\left(i-1\right)}\left(n-i-1\right)^{\left(n-i-3\right)}\right)$$ I know that this expression gives the correct result, however, I was told by my teacher that it is possible to express that number in closed form e.g. without the summation. However, I have yet to find a solution. Is it possible to highlight text inside of a textarea using javascript? Either changing the background of just a portion of the text area or making a portion of the text selected? Performing Raster Reclassification in QGIS? Is there a way to perform a reclassify of a raster image in QGIS?  In ArcGIS you can do that in Spatial analyst Tools→Reclass→Reclassify  Any ideas?