Literature and Table of Contents
Insert list of figures in the table of contents
Two finite abelian groups with the same number of elements of any order are isomorphic Suppose $G, H$ are finite abelian groups with the same number of elements of any given order. Show they are isomorphic.   Since finite abelian groups are isomorphic if and only if their Sylow subgroups are, we may restrict our attention to the case where $G, H$, are $p$-groups, but I can't quite make it past there... How to make \left, \right pairs of delimiter work over multiple lines? I have a very long equation that must be separated into two lines, and it has several pairs of nesting \left \right delimiters. Unfortunately, it seems that they need to be on the same line in order for them to work.  Also I'm using the align environment because I need the aligning functionality. Is there a way to have the size of delimiters automatically adjusted over multiple lines? How to import a module given its name as string? Find all n such that $\phi(n) = n/2$ My idea for the solution is something like this:  Since $2 | n$, $n = 2^a p_1^{e1} p_2^{e2} \cdots p_t^{et}$ where $a \geq 1$.  Then, $n/2 = \phi(2^a) \phi(p_1^{e1}) \phi(p_2^{e2}) \cdots \phi(p_t^{et})$.  Looking at the case that $t = 0$,  $n/2 = \phi(2^a) = 2^{a-1}$, and therefore $n = 2^a$.  Otherwise, $n = 2^a \phi(p_1^{e1}) \phi(p_2^{e2}) \cdots \phi(p_t^{et}) = n = 2^a p_1^{e1} p_2^{e2} \cdots p_t^{et}$. Since $\phi(n) &lt; n$, this is a contradiction, and therefore, the only $n$'s that apply are the powers of 2.  Is this right? Also, we were asked to find $n$ such that $\phi(n) = n/3$. How would I go about that one? I have an external hard drive and I did something which I shouldn't have done, and I am annoyed that many files are prompting me about Administrator permissions to move a folder.  They are regular files.  How do I reset all the permission on the external hard drive? Quoting in ssh $host $FOO and ssh $host "sudo su user -c $FOO" type constructs I often end up issuing complex commands over ssh; these commands involve piping to awk or perl one-lines, and as a result contain single quotes and $'s.  I have neither been able to figure out a hard and fast rule to do the quoting properly, nor found a good reference for it.  For instance, consider the following:  # what I'd run locally: CMD='pgrep -fl java | grep -i datanode | awk '{print $1}' # this works with ssh $host "$CMD": CMD='pgrep -fl java | grep -i datanode | awk '"'"'{print $1}'"'"   (Note the extra quotes in the awk statement.)  But how do I get this to work with, e.g. ssh $host "sudo su user -c '$CMD'"?  Is there a general recipe for managing quotes in such scenarios?.. Why is it that they decided to make String immutable in Java and .NET (and some other languages)? Why didn't they make it mutable? Git is automatically merging changes from a different branch to master Power set equivalency of Axiom of Choice Java equivalent of unsigned long long? In C++, I enjoyed having access to a 64 bit unsigned integer, via unsigned long long int, or via uint64_t. Now, in Java longs are 64 bits, I know. However, they are signed.  Is there an unsigned long (long) available as a Java primitive? How do I use it? workspace switching via ctrl + alt + arrow not working after upgrade to 13.04, how to fix this? If $A^2\succ B^2$, then necessarily $A\succ B$ I remember reading somewhere about the following properties of non-negative definite matrix. But I don't know how to prove it now.  Let $A$ and $B$ be two non-negative definite matrices. If $A^2\succ B^2$, then it necessarily follows that $A\succ B$, but $A\succ B$ doesn't necessarily leads to $A^2\succ B^2$.  How can you prove it? Thanks! To my knowledge there are three types of acceleration when a body (e.g. a rod) is moving in a circle about an axis. These are:   Angular acceleration : this is the rate of change of angular velocity. Tangential acceleration : this is the linear acceleration of the system in a tangential direction to the circle and equals the radius times the angular acceleration. Radial/centripetal acceleration : this is the linear acceleration of the system that is directed inwards towards the center of the circle.   I also think there are two types of velocity:   Linear velocity: this is its velocity in the tangential direction and is constantly changing Angular velocity or angular frequency: this is the rate of change of angle.   Is the above correct? And have I missed anything? Here is my candidate for  the most elementary proof that $\lim_{n \to \infty}(1+1/n)^n $ exists. I would be interested in seeing others.  $***$ Added after some comments: I prove here by very elementary means that the limit exists. Calling the limit "$e$" names it. $***$  It only needs Bernoulli's inequality (BI) in the form $(1+x)^n \ge 1+nx$ for $x &gt; -1$ and $n$ a positive integer, with equality only if $x = 0$ or $n = 1$. This is easily proved by induction: It is true for $n=1$, and $(1+x)^{n+1} = (1+x)(1+x)^n \ge (1+x)(1+nx) = 1+(n+1)x+nx^2 \ge 1+(n+1)x $. (If $-1 &lt; x &lt; 0$, if $1+nx \ge 0$, the above proof goes through, and if $1+nx &lt; 0$, $1+mx &lt; 0$ for all $m \ge n$ so certainly $(1+x)^m &gt; 1+mx$.)  This proof originally appeared in N.S Mendelsohn, An application of a famous inequality, Amer. Math. Monthly 58 (1951), 563 and uses the arithmetic-geometric mean inequality (AGMI) in the form $\big(\sum_{i=1}^n v_i/n\big)^n \ge \prod_{i=1}^n v_i$  (all $v_i$ positive) with equality if and only if all the $v_i$ are equal.  Let $a_n = (1+1/n)^n$ and $b_n = (1+1/n)^{n+1}$.  We will prove that $a_n$ is an increasing sequence  and $b_n$ is an decreasing sequence.  Since $a_n &lt; b_n$, this implies,  for any positive integers $n$ and $m$ with $m &lt; n$  that $a_m &lt; a_n &lt; b_n &lt; b_m$.  For $a_n$, consider n values of $1+1/n$ and $1$ value of $1$.  Since their sum is $n+2$ and their product is $(1+1/n)^n$, by the AGMI,  $((n+2)/(n+1))^{n+1} &gt; (1+1/n)^n$,  or $(1+1/(n+1))^{n+1} &gt; (1+1/n)^n$,  or $a_{n+1} &gt; a_n$.  For $b_n$, consider $n$ values of $1-1/n$ and $1$ value of $1$.  Since their sum is $n$ and their product is $(1-1/n)^n$, by the AGMI,  $(n/(n+1))^{n+1} &gt; (1-1/n)^n$  or $(1+1/n)^{n+1} &lt; (1+1/(n-1))^n$,  or $b_n &gt; b_{n+1}$.  Since $b_n-a_n  = (1+1/n)^{n+1} - (1+1/n)^n = (1+1/n)^n(1/n) =a_n/n $ and every $a_n$ is less than any $b_n$ and $b_3 = (1+1/3)^4 = 256/81 &lt; 4$, $b_n-a_n &lt; 4/n$, so $b_n$ and $a_n$ converge to a common limit.  These proofs do not seem to be really elementary,  since they use the AGMI.  However, they use a special form of the AGMI,  where all but one of the values are the same,  and this will now be shown to be implied by BI,  and thus be truly elementary.   Suppose we have $n-1$ values of $u$ and $1$ value of $v$ with $u$ and $v$ positive.  The AGMI for these values is  $(((n-1)u+v)/n)^n \ge u^{n-1}v$  with equality if and only if $u = v$.  We will now show that this is implied by BI: $(((n-1)u+v)/n)^n \ge u^{n-1}v$  is the same as  $(u+(v-u)/n)^n \ge u^n(v/u)$.  Dividing by $u^n$,  this is equivalent to  $(1+(v/u-1)/n)^n \ge v/u$.  By BI,  since $(v/u-1)/n &gt; -1/n &gt; -1$, $(1+(v/u-1)/n)^n \ge 1+n((v/u-1)/n) = v/u$  with equality only if $n=1$ or $v/u-1 = 0$. Thus BI implies this version of the AGMI. Adding a comment should not make me fail the review audit Show that the integral of a positive function is positive I am on a MacBook Pro 13 running latest Sierra. I have an external Seagate solid state hard drive that was working and out of the blue stopped working. The only thing on it was my Adobe Lightroom images/videos. Not the LR DB files. I'm sure you have all heard this woe before, so I won't dwell on that. And yes, I back up to the cloud. AWS S3 specifically. Though I am traveling South East Asia for the last year, and staying in cheap hostels. So good internet is hard to come by sometimes. I can't back it up after every export. While most of it is backed up, there is some that is not.  Moving on. The symptoms seems to change every time I plug it in. The first sign was it ejected on it's own. I plugged it in again, and it wouldn't mount. Disk Utility recognized it, so did the command line diskutil list but it wouldn't mount. I rebooted and it worked for a second. Then I could only get to it from the command line. Then trying to frantically back up to my local what was not backed up to the cloud, it all failed. Basically just a cp -R [directory] [local-directory] command.  After some more frantic unplugging and re-plugging plus some command line manual mounts, I finally got it to where the Disk Utility would be able to run first aid on it. It failed. I don't recall the error. So I put it in a freezer. After a few hours I tried again. It is not any better. It still will not mount. Now Disk Utility sees it, but with no partition. I can't even give me information about how much space is used on it.  I have also tried it from a Windows machine. It did not mount. I have tried other cables. No success. As well as tried my other USB port. I also have another working external hard drive exactly like the one giving me issues. It works on all cables and USB ports.  I do have Docker running with a Ubuntu container, I'm trying to think of a way to see if I can try to get to the USB from there. I also have a USB that I have thought about running a live Ubuntu on there to see if I can mount and retrieve the data or fix the HDD that way. But if it will not mount, I doubt these will work.  Can anyone else think of any other tricks I can try myself to see if I can repair this or at least retrieve the data without paying for a service or software? If not, those suggestions are also welcome.  Update   I made the mistake in original post that it was a Solid State Drive. This is my mistake, it is actually a spinning disk hard drive. I bought them long ago and have been traveling with them for so long I just forgot. Question is updated to reflect this. Now diskutil list does not show it at all. The Disk Utility app also does not see it. Based on suggestion from @Allen I seeked out the USB to SATA cable. I did not quite find it, as my options are extremely limited where I am at. Though a local expat on a facebook group was able to help me with a empty 2.5 casing that I was able to extract the drive from original casing and put it in his blank case. It now mounts. Though it has the "click of death" sound to it. And data is not really reachable. While I can ls the directories and Adobe Lightroom does not have the exclamation mark when it can not reach the actual external files. Right clicking on the images and clicking on "Show in Finder" or any other variation of trying to get to the files through Finder or terminal, I have no success. It usually hangs and I get the spinning wheel. Since Adobe Lightroom imports these images into directories named by date, I am going to send the drive off to a data recovery service and ask to recover just unbacked up directories i.e. dates. Next time I will make harder efforts to backup and probably get an actual SSD.   I think this can be closed, due to my low reputation points I can not close this myself. Practical uses for the "internal" keyword in C# Could you please explain what the practical usage is for the internal keyword in C#?  I know that the internal modifier limits access to the current assembly, but when and in which circumstance should I use it? Can you use the /testfor command in minecraft 1.8 to find out if a player has died ?  I need it for my map, where 2 players (Only) are pitted against eachother. I want it so that when one of them dies, it will detect the death and declare the victor. Bohr's model of an atom doesn't seem to have overcome the drawback of Rutherford's model