In bash (or, I'm assuming, any linux shell), I would expect cd /../ to return an error. I interpret that to be asking for the parent of the root of the directory tree. Since it's the root of the directory tree, I was under the impression that it has no parent.  However, it returns no error, and looks to be equivalent to cd /. I would also expect an error from cd / &amp;&amp; cd ../ for the same reason: asking for the parent of the root directory, but it has the same result.  Why is this?
I'm currently developing a fake filesystem for a browsergame. I recently implemented ".." and "." folders so every folder has a reference to its parent. Then I checked in my terminal if "/" also has these folders.  Actually I was very surprised that it has a directory ".." which obviously is a reference to itself.  Is the reason for this consistency or is there a better explanation?  Edit: I'm basically looking for the document where this is documented.
Why do some tests have a (nonzero) minimum score? Graph Theory: Tree has at least 2 vertices of degree 1 To convert an MKV to AVI, I do two things. The first thing I do is this:  ffmpeg -i filename.mkv -vcodec copy -acodec copy output.avi   or this:  ffmpeg -i filename.mkv -sameq -acodec copy output.avi   Either of these will convert the MKV to an AVI, but the problem is that the video does not play smoothly for some reason. That's fine though, because if I do one more thing it gets fixed:  ffmpeg -i output.avi -vcodec mpeg4 -b 4000k -acodec mp2 -ab 320k converted.avi   After I do this then the file plays without problem. I had success doing it this way for one file, but then I tried it on another file, and there is a slight, but noticeable loss in video quality. This is the output I get when doing the second step:  FFmpeg version 0.6.1, Copyright (c) 2000-2010 the FFmpeg developers   built on Dec 29 2010 18:02:10 with gcc 4.2.1 (Apple Inc. build 5664)   configuration:    libavutil     50.15. 1 / 50.15. 1   libavcodec    52.72. 2 / 52.72. 2   libavformat   52.64. 2 / 52.64. 2   libavdevice   52. 2. 0 / 52. 2. 0   libswscale     0.11. 0 /  0.11. 0  Seems stream 0 codec frame rate differs from container frame rate: 359.00 (359/1) -&gt; 29.92 (359/12) Input #0, avi, from 'output.avi':   Metadata:     ISFT            : Lavf52.64.2   Duration: 00:04:17.21, start: 0.000000, bitrate: 3074 kb/s     Stream #0.0: Video: mpeg4, yuv420p, 704x480 [PAR 229:189 DAR 5038:2835], 29.92 fps, 29.92 tbr, 29.92 tbn, 359 tbc     Stream #0.1: Audio: vorbis, 48000 Hz, stereo, s16 Output #0, avi, to 'converted.avi':   Metadata:     ISFT            : Lavf52.64.2     Stream #0.0: Video: mpeg4, yuv420p, 704x480 [PAR 229:189 DAR 5038:2835], q=2-31, 4000 kb/s, 29.92 tbn, 29.92 tbc     Stream #0.1: Audio: mp2, 48000 Hz, stereo, s16, 320 kb/s Stream mapping:   Stream #0.0 -&gt; #0.0   Stream #0.1 -&gt; #0.1   I just used arbitrarily large settings on the second step and it worked nicely before but not in this case. What settings should I use? Are there any drawbacks to legacy BIOS as opposed to UEFI? Are there any drawbacks to installing Ubuntu 13.10 (and soon 14.04) in Legacy BIOS instead of UEFI?  I have installed 13.10 64bit in Legacy by mistake and was just wondering if it would hurt anything to simply leave it there as is?  EDIT  Everything seems to be running just fine in Legacy and all my drivers work. How to calculate last four digits of $2^{2017}$? can u suggest me any short trick of solving these kind of problems. How to find last four digits of any number raised to some power ? Prove $(1-a)(1-b)(1-c)(1-d)\geq abcd$ if $a^2+b^2+c^2+d^2=1$ Let $a,b,c,d\geq0$, $a^2+b^2+c^2+d^2=1$ Prove $\displaystyle (1-a)(1-b)(1-c)(1-d)\geq abcd$ I mutiplied both with $\displaystyle (1+a)(1+b)(1+c)(1+d)$ to use $1-a^2=b^2+c^2+d^2$ and try using the cauchy-schwarz and holder but it is doesn't work. Open program/windows on specific monitor Is there a way to tell Windows on which monitor it should open a windows  independently of where it was closed? I'm running an SSH server on my personal computer. The log had many people(or bots?) repeatedly trying to log in to my server (that is before I changed the default port), which made me a little freaked out. I was worried about their dictionary attacks or brute force password guessing.  But then if you type wrong password (or wrong username), the server waits for about 2 seconds before it asks for password again. So an attacker can try one password per 2 seconds. So I concluded that these attacks aren't that great a threat (as long as your password does not consist of dictionary words.) Am I correct? In set theory, if natural numbers are represented by nested sets that include the empty set, how are the rest of the real numbers represented as sets?    Thanks for the answers. Several answers basically said for irrational numbers that  A Dedekind cut is a pair of sets of rational numbers $\{L, R\}$. The set of real numbers is defined to be the set of all Dedekind cuts, where a Dedekind cut is a pair of sets of rational numbers $\{L, R\}$ which have no elements in common, and where all the elements of $L$ are less than any element of $R$.  Each Dedekind cut is a real number. This is where I have a problem - surely that can’t be correct. The set $L$ is a set of all rationals, and there must be a rational in the set $L$ that is greater than all other rationals in that set, even if we have no method of determining it. And similarly, there must be a rational in the set $R$ that is less than all other rationals in that set, even if we have no method of determining it. If every irrational number has a corresponding set $L$, then each irrational number has some such corresponding largest element of that set $L$, and then each irrational number has some corresponding rational number. And that would mean that the irrational numbers are countable. So, with Dedekind cuts,  the only conclusion is that there must be irrational numbers $x$ which are either greater or lesser than some irrational cut $y$ of the rationals, and between $x$ and $y$ there is no rational number.  But that is impossible, so that the Dedekind cuts cannot be the correct representation of the real numbers.  Surely the problem with Dedekind cuts is in using sets of rationals that include all rationals up to a certain rational. But there is an alternative method of representing irrationals can be defined in terms of infinite sets of rational numbers. For example, in binary notation, the non-integer part of $\pi$ is $.00100100\ 00111111\ 01101010\ 10001$. You define a set by: if the nth digit is a $1$, then  the natural number $n$ is in the set. And then we have that, for the real numbers between $0$ and $1$, that the set of real numbers is simply the set of all subsets of natural numbers. Each subset corresponds to some real number between $0$ and $1$.  And in this way, all real numbers can be considered to be some set based only on nested sets of the empty set.  But I still haven’t got a satisfactory answer for how negative numbers can be represented in terms only of sets containing the empty set. Any ideas? xml serializing of saved game data Question about proof that $(a + b)^p = a^p+b^p$ in a field of characteristic $p$. Definition charactersitic $p$: a field has characterstic $p$ is its prime field is isomorphic to $\mathbb{Z}/p\mathbb{Z}$.  Proposition: let $K$ be a field of characteristic $p$. Then for any $a, b \in K$ we have $(a + b)^p = a^p + b^p$.  Proof: (from my text) because $p \choose i$ is divisible by $p$ for $0 &lt; 1 &lt; p$ it is zero $\mod p$, so $p \choose i$  $a^{p - i}b^i$ is zero (this is the part I don't understand), so it follows from Newton's binomial law.  I understand that the prime field of $K$ is isomorphic to $\mathbb{Z}/p\mathbb{Z}$, so if $a, b$ are in the prime field, then $p \choose i$  $a^{p - i}b^i$ is zero, but that is not necessarily the case is it? How to delete entry in Auto Complete in Microsoft Edge How do I delete an unwanted entry in AutoComplete in Microsoft Edge?  I have tried everything including highlighting with the down arrows and nothing works. A random variable that induces a $\sigma$-algebra the same as the one in the sample space Understanding slice notation I need a good explanation (references are a plus) on Python's slice notation.   To me, this notation needs a bit of picking up.   It looks extremely powerful, but I haven't quite got my head around it. How to load JAR files dynamically at Runtime? Why is it so hard to do this in Java? If you want to have any kind of module system you need to be able to load JAR files dynamically. I'm told there's a way of doing it by writing your own ClassLoader, but that's a lot of work for something that should (in my mind at least) be as easy as calling a method with a JAR file as its argument.  Any suggestions for simple code that does this? Prove that if prime $p$ divide $a_{2k}-2$, then $p$ divide also $a_{2k+1}-1$. I installed a nightly or unstable build of a custom ROM and now my phone doesn't work Drawing function in tikzpicture Got NODATA issue: 'NODATA' (does the network require authentication?) What exactly is the difference between a parametric and non-parametric model? I am confused with the definition of non-parametric model after reading this link  and .   Originally I thought "parametric vs non-parametric" means if we have distribution assumptions on the model (similar to parametric or non-parametric hypothesis testing). But both of the resources claim "parametric vs non-parametric" can be determined by if number of parameters in the model is depending on number of rows in the data matrix.  For kernel density estimation (non-parametric) such a definition can be applied. But under this definition how can a neural network be a non-parametric model, as the number of parameters in the model is depending on the neural network structure and not on the number of rows in the data matrix?  What exactly is the difference between parametric and a non-parametric model?