Command not found message When running invalid commands without any parameters or options, in my experience we get only two kinds of messages which are exemplified below:  ~$ Date No command 'Date' found, did you mean:  Command 'yate' from package 'yate' (universe)  Command 'date' from package 'coreutils' (main)  Command 'late' from package 'late' (universe)  Command 'kate' from package 'kate' (universe) Date: command not found ~$ fjldjflsk fjldjflsk: command not found ~$   I'm interested in knowing more about how this works. Specifically, when can I know which of these two kinds of messages I'm going to get prior to running the command? Is there some kind of environment variable or any other device that would allow me to alter this behavior easily? I'd like to get only the second kind of message.
No command 'bla' found, did you mean:? So, when a command is not found, by what means is the "did you mean:" list populated? What program finds these alternate commands?  What is the meaning of: "(main), (universe)..."? Can I change which program finds these?
If $\lambda_{max} = n$, then $n\times n$ positive, reciprocal matrix A is consistent At the end of . the author states that  Suppose we have $n \times n$ matrix $A$ having only positive elements and satisfying the property $a_{ij}=1/a_{ji}$ (a matrix satisfying this property is called a reciprocal matrix).  If its largest eigenvalue $\lambda_{max}$ is equal to $n$, then the matrix $A$ satisfies the property (consistency property) $a_{ij} a_{jk} = a_{ik}$ where $i,j,k=1,2,...,n$.  I'm not convinced this theorem is true. Could anyone help? no cycles if and only if has $n-m$ connected components Can I exchange limit and differentiation for a sequence of smooth functions? Let $(f_n)_{n\in \mathbb N}$ be a sequence of smooth functions converging to some $f$.  Under what circumstances can I exchange limit and derivative?, i.e.  $$\lim_{n\rightarrow \infty} \frac{\partial f_n(x)}{\partial x} = \frac{\partial f(x)}{\partial x}$$ What exactly does the *frequency* of a photon mean? Copy files from Network Mapped Drive I am trying to copy a file over from a mapped drive on a network to the current computer through a batch file.   I've already attempted the following below and still no results. The plan is to run a batch file to copy a file from a network drive down to the local C:\ drive.   @echo off copy H:\Videos\TargetVideo\TargetVideo.mp4 C:\Video\ 'AND' vs '&&' as operator I found  post about how to do Crow's Foot ERM Diagrams with Tikz, but it looks strange because the entity is outside the frame. However, it worked.  Then I found  even nicer version and tried to combine it, but sadly I'm not able to find out why it doesn't work. I'm not able to print two entities side by side and connect them with a crow's foot wire. They always print over each other...  How can I have both the lines and the style?  \documentclass{article}  \usepackage{tikz} \usetikzlibrary{shapes.multipart} \usetikzlibrary{matrix} \usetikzlibrary{positioning} \usetikzlibrary{shadows} \usetikzlibrary{calc}  \tikzset{     entity/.code={         \tikzset{             rounded corners,                          name=#1,             inner sep=2pt,             every entity/.try,         }%         \def\entityname{#1}%     },     entity anchor/.style={matrix anchor=#1},     every entity/.style={             draw,     },     every property/.style={         inner xsep=0.20cm, inner ysep=0.075cm, anchor=west, text width=1.75in     } } \def\property#1{\node[name=\entityname-#1, every property/.try]{\propertysplit#1;};} \def\properties{\begingroup\catcode`\_=11\relax\processproperties} \def\processproperties#1{\endgroup%     \gdef\propertycode{}%     \foreach \p in {#1}{%     \expandafter\expandafter\expandafter\gdef\expandafter\expandafter\expandafter\propertycode%             \expandafter\expandafter\expandafter{\expandafter\propertycode\expandafter\property\expandafter{\p}\\}%     }%     \propertycode% } \def\propertysplit#1:#2;{#1:\hfill#2}  \def\entitynamenode{% \node[every entity name/.try] (\entityname-name) {\entityname}; \draw (\entityname-name.south west) -- (\entityname-name.south east); \\[1ex] } \tikzset{   every entity name/.style={every property/.try, align=center} } \begin{document} \begin{tikzpicture}[every node/.style={font=\ttfamily}, node distance=0.5in] \matrix (m1) [entity=Employee] {     \entitynamenode     \properties{         Username:,         Password :  varchar(255),                 Name :  varchar(255),         LastName :  varchar(255)     } }; \matrix (m2) [entity=Student] {     \entitynamenode     \properties{         Username:,         Password :  varchar(255),                 Name :  varchar(255),         LastName :  varchar(255)     } }; \draw [-&gt;] (m1) -- (m2); % &lt;-- it break's here... %\draw [one to omany] (Employee-Username:) to node[above]{label} (Student-Username:); \end{tikzpicture} \end{document}      Edit: this is a Crow's Foot Notation for visualizing IT Database structures: proof that topologist sine curve is not locally connected I know that this question has been asked before, but it is still not clear to me why the topologist sine curve is not locally connected.     The topologist's sine curve: Let $S$ denote the following subset of the plane. $$S = \{ (x, \sin(1/x)) \mid 0 &lt; x \le 1\}.$$ The set $\bar{S}$ is called the topologist's sine curve, which equals the union of $S$ and the vertical interval $0 \times [-1,1]$.   My attempt was:  Fix a point $p = (0, t)$ where $t &gt; 0$, and consider a neighborhood $N = B(p,\delta)\cap\bar S$, where $B(p,\delta)$ denotes a ball centered at $p$ with radius $\delta$.  Then, I want to show that every open subset of $N$ is disconnected, so there can't be connected neighborhood of $p$ contained in $N$.  But, I am having a trouble with establishing that every open subset of $N$ is disconnected.  How can I prove the claim? Is it possible to transfer Minecraft PE worlds to Minecraft PC? If I have a sequence of .obj (or any other readable format) files created from my own simulation code (say cloth simulation), can I use the rendering capabilities of blender to generate a video?   Is there a way to set the material properties for frame 1 and use the same or rest of the frames while the corresponding meshes are imported afresh from that ones I provide? Auto Package download for TeXLive I use MiKTeX on Windows and quite satisfied with it. Recently I started switching all my tasks toward open-source alternatives, and in the course I would love to use Linux. In Linux TeXLive is available as alternative to MiKTeX. The thing I really like about MiKTeX, is its ability to install packages automatically. Can I do the same in TeXLive too? Is there a way I can enable such or install some plugins for it?  I am using Fedora 18, if that's needed. Do sets, whose power sets have the same cardinality, have the same cardinality? Is there any way to fix the wavy lines that appear when photographing a striped dress?   It's not just in viewing online: when it was printed at wallet size, the wavy lines showed up. Sieve of eratosthenes infinite primes I don't understand why the sieve of eratosthenes doesn't prove an infinite number of primes.  For example the number 2 eliminates 1/2 of an infinite number of numbers.  The next prime, 3, eliminates 1/3 of the remainder, not 1/3 of all the numbers and so on.  5 would eliminate 1/5 of the remaining numbers. Why doesn't that prove an infinite number of primes? Thanks mysqldump, preserve update_time and modify_time attributes as listed by show table status from Does mysqldump preserve the create_time and update_time attributes that are output by show table status from?  If not, is there an option that does this?   it looks like mysqldump preserves this data if you export to XML. EDIT: Well the data is included in the export. Whether it's read in at the other end I'm not sure.  Is there a way to do this with a normal .sql dump? How can I evaluate $$\sum_{n=1}^\infty\frac{2n}{3^{n+1}}$$? I know the answer thanks to , but I'm more concerned with how I can derive that answer. It cites tests to prove that it is convergent, but my class has never learned these before. So I feel that there must be a simpler method.  In general, how can I evaluate $$\sum_{n=0}^\infty (n+1)x^n?$$ How can I find $\gcd(a^m+1,a^n+1)$ with $a,m,n$ positive integers? How can I find $\gcd(a^m+1,a^n+1)$ with $a,m,n$ positive integers?    I have this idea:  Let $d=\gcd(m,n)$. Then there exist positive integers $x,y$ such that $mx-ny=d$ (WLOG). We shall find $G=\gcd(a^m+1,a^n+1)$.  If $m,n$ are odd, then $d$ is odd, therefore one and only one of $x,y$ is even. We have:  $$a^{ny}(a^d+1)=a^{mx}+a^{ny}=(a^{mx}-1)+(a^{ny}+1)=(a^{mx}+1)+(a^{ny}-1).$$  If $x$ is even and $y$ is odd, then $a^{m}+1\mid a^{mx}-1$ and $a^{n}+1\mid a^{ny}+1$, therefore $G\mid a^{ny}(a^d+1)$. If $x$ is odd and $y$ is even, then $a^{m}+1\mid a^{mx}+1$ and $a^{n}+1\mid a^{ny}-1$, thus $G\mid a^{ny}(a^d+1)$. However, since $\gcd(a^m+1,a^{ny})=\gcd(a^n+1,a^{ny})=1$, so $\gcd(G,a^{ny})=1$, hence $G\mid a^d+1$. We also have $a^d+1\mid a^{m}+1$ and $a^d+1\mid a^{n}+1$, so $a^d+1\mid G$. Thus $G=a^d+1$.  If $v_2(m)=v_2(n)=v_2(d)=k&gt;1$, then there exist some odd numbers $m_1,n_1,d_1$ such that $m=2^km_1,n=2^kn_1,d=2^kd_1$. We shall have $m_1x-n_1y=d_1$, so one and only one of $x,y$ is even, and we can use the same argument when $m,n$ are odd, so $G=a^d+1$.  However, if $v_2(m) \neq v_2(n)$, I cannot find any solutions for this. I think that $G \in \{1,2\}$, but I cannot prove or disprove it. How can I find $G=\gcd(a^m+1,a^n+1)$ if $v_2(m) \neq v_2(n)$ ? Moreover, is there anything from my arguments that can be improved ? need to move a domain controller, the first in the forest that holds all the fsmo roles, to another location in a clients building. it will require turning off this dc, call it dc1 for this question. i want to transfer the fsmo roles to a new domain controller call the new one dc2. dc2 is already on the network and has been promoted and made a domain controller, it's dns settings are set and it is also a global catalog (GC). the work is scheduled to be done after hours and i am also planning on moving the dhcp server to dc2.  i am looking for a best practices checklist of things to verify prior to moving fsmo roles and turning dc1 off? as far as i know there are no issues with replication between the dc's. my biggest worry is if i turn on dc1 after moving it and i have hardware issues or boot issues, i would rather move the fsmo roles to a known good one that is a few months old (dc2) vs still using a 5yr old box (dc1), this is part of my migration strategy too.   thanks for the help. Which characters played the parts of the lineup discussed by Rusty and Daniel? In planning the heist, Rusty names a number of roles that are going to be needed to pull off the job.      Off the top of my head, I'd say you're looking at a Boesky, a Jim Brown, a Miss Daisy, two Jethros, and a Leon Spinks. Not to mention the biggest Ella Fitzgerald ever.   Which characters in the film lined up with these named roles? If $n\ne 4$ is composite, then $n$ divides $(n-1)!$.