How do you prove that for any $n$ there are at most two simple groups of order $n$?
states that the isomorphism type of a finite simple group is determined by its order, except that:   $L_4(2)$ and $L_3(4)$ both have order $20160$ $O_{2n+1}(q)$ and $S_{2n}(q)$ have the same order for $q$ odd, $n &gt; 2$   I think this means that for each integer $g$, there are $0$, $1$ or $2$ simple groups of order $g$.  Do we need the full strength of the  to prove this, or is there a simpler way of proving it?
Is this statement true?      In a metric spase $(E,d)$, a sequence $(x_n)$ is Cauchy if and only if $  \forall k\in \mathbb{N}, \lim_{n\rightarrow+\infty}d(x_{n+k},x_n)=0$   I proved that $\Rightarrow$ is true,indeed if $(x_n)$ is Cauchy then for all $\varepsilon&gt;0,\exists n_0\in\mathbb{N}, \forall p,q\geq n, d(x_p,x_q)&lt;\varepsilon$ it still right for all $ n\geq n_0$ and $m=n+k&gt;n\geq n_0$   But I don't know if $\Leftarrow$ is true ? Stack Exchange doesn't allow me to answer protected questions because I gave away earned rep in bounties By 18 years of age, I want a brand new car that's $43,668 I'm from Arizona and I will be 18 in 4 months. I make about $1,200 a month from my job. I have $600 in my bank account and I don't plan to  spend any of it until I'm  18.     I'm looking to get a brand new Jeep Wrangler Rubicon that costs about  $43,000. The down payment is 10% (about $5,000) with an APR of  4.28%. The duration is 60 months with a monthly payment of  $800.  I don't have any credit. My friend suggested that I ask my parents to put my name on one of their credit cards so that I can build some credit. I'm not sure how that works. Can someone suggest a good way of going about this so I can get this car on or around my birthday?  My mom does finance work  for a big company and she told me that I should get a cheaper car. I really want this one and I'm willing to work for it. I'm getting a second job to get more money rolling in. My mom said that the only way that this would work is if I have a down payment of $15-20k. She also said that not everyone qualifies  for a car like this one. What can get me to qualify ASAP when I turn 18? Gravity as a gauge theory Currently, (classical) gravity (General Relativity) is NOT a gauge theory (at least in the sense of a Yang-Mills theory).   Why should "classical" gravity be some (non-trivial or "special" or extended) gauge theory? Should quantum gravity be a gauge theory?  Remark: There are some contradictory claims in the literature to this issue. To what extent gravity is "a gauge" theory?Obviously, GR is not a YM theory. So, why do some people say that gravity "IS" a gauge theory? I found this question relevant, e.g., then we handle GR in the Einstein-Cartan theory or any other theory beyond GR, like teleparallel theories or higher-derivative gravitational theories. So I think it could be useful to discuss the "gauge flavor" of gravity here. I have been attempting to use identities to get to the answer but I am unable to get anywhere. Here is the equation I am trying to prove tautological without using truth tables:  $[(p\rightarrow q) \land (q \rightarrow r)] \rightarrow (p \rightarrow r )$  And here is my attempt at using identities to work my way up. (a link to a page with a table of logical equivalence identities: )  $\lnot [(p \rightarrow q) \land (q \rightarrow r)] \lor (p \rightarrow r)$  $\lnot [(\lnot p \lor q) \land (q \rightarrow r)] \lor (p \rightarrow r)$  $[\lnot (\lnot p \lor q) \land \lnot (q \rightarrow r)] \lor (p \rightarrow r)$  $[(p\land \lnot q) \land (q \land \lnot r)] \lor (p \rightarrow r)$  I don't know where to go from there. For example, in the past, links to www.example.com wouldn't have meant Google would pass any value to say, forum.example.com. What is the current status of this? (Please provide a reference if possible). How to prove that the set $A = \left\{ {p:{p^2} < 2,p \in {\Bbb Q^+}} \right\}$ has no greatest element? More specifically, I have to find a $q$ in $A$ such that $q$ is larger than any $p$ in $A$.  The only thing I can think of is using (${2 - {p^2}}$) somehow, or ${(p+x)^2}&lt;2$, but other than that I don't know how to proceed. This exercise is taken from the very first chapter of Walter Rudin's Principles of Mathematical Analysis. Quoting the exercise:     To do this, we associate with each rational $p &gt; 0$ the number:     $$q = p - \frac{{{p^2} - 2}}{{p + 2}} = \frac{{2p + 2}}{{p + 2}}$$   But he didn't explain how he came up with that number.   The only thing I've thought of is the following procedure:  $$\eqalign{   &amp; {p^2} + (2 - {p^2}) = 2 \Rightarrow {p^2} + (\frac{{2 - {p^2}}}{2}) &lt; 2,{\text{ and since }}2 - {p^2}{\text{ is always positive,}}  \cr    &amp; {p^2} &lt; \left[ {{p^2} + (\frac{{2 - {p^2}}}{2})} \right] &lt; 2  \cr    &amp; {\text{Therefore, let }}q = \sqrt {{p^2} + (\frac{{2 - {p^2}}}{2})} ,{\text{ then:}}  \cr    &amp; p &lt; q &lt; \sqrt 2  \cr} $$  However, my result doesn't necessarily belong to ${\Bbb Q}$. I wonder how did he obtain the value of $q$ in the book.  EDIT: Feel free to point out if there are more appropriate tags for this question. Find the product $\prod_{n=1}^{\infty} (1+x^{2n-1}) $ One of the answers in a reading exercise in my class today was:   100,000,000,000,000,000,000   ... which was the value of the highest denomination note ever issued. It was a 100,000,000,000,000,000,000 Pengo note, issued by Hungary in 1946. The students in my class wanted to know how they could say that last sentence in words in English. So I told them that I didn't know. They pointed out to me that if they wanted to read this bit of writing to someone they'd want to be able to use the words. Fair point.  Can anyone help?  [In case you're interested, a 100,000,000,000,000,000,000 Pengo note was worth about $0.20!] When running umount /path I get:  umount: /path: device is busy.   The filesystem is huge, so lsof +D /path is not a realistic option.  lsof /path, lsof +f -- /path, and fuser /path all return nothing. fuser -v /path gives:                    USER        PID ACCESS COMMAND /path:            root     kernel mount /path   which is normal for all unused mounted file systems.  umount -l and umount -f is not good enough for my situation.  How do I figure out why the kernel thinks this filesystem is busy? How can I capture KeyDown event on a WPF Page or UserControl object? I have a Page with a UserControl on it.  If the user presses Esc while anywhere on Page I want to handle.  I thought this would be as easy as hooking up the PreviewKeyDown event, testing for the Esc key, and then handling it.  However, when I placed I breakpoint in the event handler I found it was never getting called.  I thought perhaps the UserControl might be getting hit, so I tried PreviewKeyDown there... same result.  Does anyone know the proper place to test for a KeyDown or PreviewKeyDown on a Page object? Product of path connected spaces is path connected Will product of path connected topological spaces be necessarily path connected? Why or why not?  Give me some hints. Thank you. Yesterday I started the upgrade from 12.10 to 13.04, but I interrupted it because it was taking too long. Now if I restart it, it doesn't proceed.  Is there any possibility to clean the mess it left when I interrupted it and make a clean restart of this update? How can the median number of sexual partners be 6.1 and 3.6? Median number of female sexual partners in lifetime, for men 25-44 years of age, 2006-2008: 6.1  Wouldn't it only be able to be x.5 or x.0? filling an occluded plane with the smallest number of rectangles I've got a specific problem which I'll try to describe as clearly as possible.   I have a defined rectangular region on a cartesian plane, and within that region there are other given rectangular sub-regions that are described in terms of their 4 vertices, ie {(x1, y1), (x1, y2), (x2, y1), (x2, y2)}, so that these regions form 'occlusions' on the plane. These regions don't overlap, but they can form more complex polygons when different-sized rectangles adjacent to each other appear joined.  here's an illustration:   I am interested in the space between these shapes, and how to define the space in the same way the occlusions are defined, that is as a set of rectangles. In particular I want the definition optimised so that the space is described using the smallest possible number of rectangles. For example, an incomplete rendering might look like this:   Can anyone suggest a way forward with this? How can I have the original set of vertices (describing the black rectangles) generate the 'complementary' set of vertices (red rectangles) such that the number of red rectangles is minimal?  I suspect it's a variation of a 'packing problem', but I have a feeling it might be fairly simple... The question is from Axler's "Linear Algebra Done Right", which I'm using for self-study.  We are given a linear operator $T$ over a finite dimensional vector space $V$. We have to show that $T$ is a scalar multiple of the identity iff $\forall S \in {\cal L}(V), TS = ST$. Here, ${\cal L}(V)$ denotes the set of all linear operators over $V$.  One direction is easy to prove. If $T$ is a scalar multiple of the identity, then there exists a scalar $a$ such that $Tv = av$, $\forall v \in V$. Hence, given an arbitrary vector $w$, $$TS(w) = T(Sw) = a(Sw) = S(aw) = S(Tw) = ST(w)$$ where the third equality is possible because $S$ is a linear operator. Then, it follows that $TS = ST$, as required.  I am, however, at a loss as to how to tackle the other direction. I thought that a proof by contradiction,  ultimately constructing a linear operator $S$ for which $TS \neq ST$, might be the way to go, but haven't made much progress.   Thanks in advance! Profile changes in Q&A are not pushed to Area 51 What Thunderbolt to USB 3.0 cables/adapters exist for OS X and Mac hardware? I have the Late 2013 Macbook Pro, which has two USB 3.0 ports and two Thunderbolt 2 ports. I currently use both USB 3.0 ports and one TB2 port. I want to connect a third USB 3.0 device to the machine, but I don't want to use a USB splitter on one USB port as I'm concerned the devices would draw too much power from the bus. I have no current use for the second TB2 port and I would love to be able to use it for this purpose.   Browsing extensively online, I've found numerous docks, such as , that connect via a Thunderbolt cable. This would work, but it's an expensive, 'bulkier' solution (and not the one I'm looking for).   I'm aware that a USB 3.0 device wouldn't be able to take advantage of Thunderbolt's I/O speeds, but it's certainly compatible, which is all I'd need. After all, Apple even sells a . I also know that Thunderbolt is not only used for digital video purposes (along with the TB > Firewire option, there exists ).   There are almost no Thunderbolt to USB 3.0 cables/adapters on the market. I'd think this hardware would be more prevalent given the prominence of USB devices out there. What adapters are available for OS X? Is this a correct way for passing an environment variable in sudo ?  sudo -u www-data -b env FOOBAR="foobar" /home/user/folder/daemon SSH connection problem with "Host key verification failed..." error I can connect to another Ubuntu machine in my LAN via SSH. On both of then PC's I installed   but from another Ubuntu computer I can not connect to my PC via SSH and I got this error:     Host key verification failed...