Coloring all elements in prime ordered sets amongst a set of sets
Coloring specific elements of sets with a prime modified order in an array plot
I think we need a button that says Edit and Close added to the Review Close button options.  Many of these closed posts will be around forever (and should be, closed should not just be a path to deletion), so they need editing.  If I edit it now it goes away, with the only option being a back click to get back to the review, and then click into the post and edit it.  We have an Edit and Reopen button, so this would fit in just fine. I tried to install Ubuntu 12.10 with the Wubi installer while running Windows, because my PC does not accept my BootCD as a bootable medium.  But Wubi showed me this error:  Ubuntu-Installationsprogramm (X) Ein Fehler ist aufgetreten: Could not retrieve the required disk image files Weiter Informationen finden Sie in der Protokolldatei: c:\users\username\appdata\local\temp\wubi-12.10-rev273.log   What can I do, because I want to get rid of my Windows 7 and use the way better Ubuntu 12.10?  Thanks for your huge answer, now my next problem after trying to install wubi with the .iso is, that the same error shows up again and i am not shure which part of the errorreport you need.  Can you tell me? Because i'm not that good at linux. How to modify the space between the numbers and text of sectioning titles in the table of contents? I'm preparing a document using the book class. In the table of contents, the space between the subsection number and title is too wide. How to reduce it? How to find the inverse modulo $m$? For example: $$7x \equiv 1 \pmod{31} $$ In this example, the modular inverse of $7$ with respect to $31$ is $9$. How can we find out that $9$? What are the steps that I need to do? Update If I have a general modulo equation: $$5x + 1 \equiv 2 \pmod{6}$$ What is the fastest way to solve it? My initial thought was: $$5x + 1 \equiv 2 \pmod{6}$$ $$\Leftrightarrow 5x + 1 - 1\equiv 2 - 1 \pmod{6}$$ $$\Leftrightarrow 5x \equiv 1 \pmod{6}$$ Then solve for the inverse of $5$ modulo 6. Is it a right approach? Thanks. I was surprised to find that standalone package can not compile a document with an equation:  \documentclass{standalone} \begin{document} \begin{equation} % not working! F(V, T) = E(V) + D(T) \end{equation} \end{document}   Is there an option or some workaround that allows this? The current error is something like:   ! Missing $ inserted.   in line 4. (The idea of course is that the including (main) document can just \input the standalone without knowing if is going to be an equation or something else) Complex number isomorphic to certain $2\times 2$ matrices? I have been trying to prove this, but I am having trouble understanding how to prove the following mapping I found is injective and surjective. Just as a side note, I am trying to show the complex ring is isomorphic to special $2\times2$ matrices in regard to matrix multiplication and addition. Showing these hold is simple enough.  $$\phi:a+bi \rightarrow \begin{pmatrix} a &amp; -b \\ b &amp; a \end{pmatrix}$$  This is what I have so far:  Injective: I am also confused over the fact that there are two operations, and in turn two neutral elements (1 and 0). Showing that the kernel is trivial is usually the way I go about proving whether a mapping is injective, but I just can't grasp this.  $$ \phi(z_1) = \phi(z_2) \implies \phi(z_1)\phi(z_2)^{-1} = I = \phi(z_1)\phi(z_2^{-1}) = \phi(z_2)\phi(z_2^{-1}).$$  So if we can just show that the kernel of $\phi$ is trivial, then it also shows that $z_1 = z_2$. The only complex number that maps to the identity matrix is one where $a = 1$ and $b = 0$, $a + bi = 1 + 0i = 1$.  Using a similar argument for addition we can just say that the only complex number $z$ such that $\phi(z) = 0\text{-matrix}$, is one where $a=0$ and $b=0$, $a+bi=0+0i=0$.   Surjective:  I forgot to add this before I posted, but I honestly don't really understand how to prove this because it just seems so obvious. All possible $2\times2$ matrices of that form have a complex representation because the complex number can always be identified by its real parts and since the elements of the $2\times2$ matrix are real then the mapping is obviously onto.  I have always had trouble understanding when I can say that I have "rigorously" proved something, so any help would be appreciated! Doubles rules in table tennis I started learning Bash a couple of days ago.  I'm trying to obtain an exit status of grep expression into a variable like this:  check=grep -ci 'text' file.sh   and the output that I got is   No command '-ic' found   Should I do it with a pipe command? some \newcommand instructions not working I always thought water sources were called taps in kitchens, bathrooms etc, but a Google search only returned outdoor taps.  So my question is, what are indoor taps really called? Like this one: Find all functions $f$ such that $(x+y)f(x)+f(y^2)=(x+y)f(y)+f(x^2)$ I've got a custom loop that I'm using to display some Real Estate listings that will be available within 60 days. I'm calling it with the following function:   &lt;?php  $sixtydays = date('Y/m/d', strtotime('+60 days')); $paged = (get_query_var('paged')) ? get_query_var('paged') : 1; $query = new PostsOrderedByMetaQuery(array(   'post_type' =&gt; array('post', 'real-estate'),   'meta_key' =&gt; 'Time Available',   'meta_compare' =&gt; '&lt;=',   'meta_value' =&gt; $sixtydays,   'paged' =&gt; $paged,   'orderby_meta_key' =&gt; 'Price',   'orderby_order'    =&gt; 'ASC' )); ?&gt; &lt;?php while ($query-&gt;have_posts()) : $query-&gt;the_post(); ?&gt;   While the loop works great, I can't get it to paginate. It shows the first 10 (my default) posts but doesn't show the pagination. The only way to display all posts is to show them on one page by adding 'posts_per_page' =&gt; -1, I have similar loops on other pages that have no problem paginating. The only difference with this one is that there are two meta keys that are filtering the posts.   I'm using WP Page Navi for this and the rest of my pages. I'm closing the loop and adding the pagination using the following code:   &lt;?php endwhile; // End the loop. Whew. ?&gt; &lt;?php wp_pagenavi(); ?&gt; &lt;?php wp_reset_query(); ?&gt;   How can I go about fixing this? How to recover a deleted file from /data partition? I factory reset my rooted Android M phone but now I realize that there was a file in the /data directory which I need.  Is it possible to create an image (.img or something similar) of the /data partition so that I could run some recovery software for ext4 on that image? I have a little knowledge about ADB. Where's the BIOS on an Intel Mac? Port forwarding with UFW I realize UFW is mainly just for enabling/disabling access on particular ports, but I'm trying to forward one port to another. I want any connection to port 1724 to be forwarded to 1723.   The file /etc/default/ufw already has DEFAULT_FORWARD_POLICY="ACCEPT". And I believe I need to uncomment net/ipv4/ip_forward=1 in /etc/ufw/sysctl.conf. Finally I need to edit /etc/ufw/before.rules to add an iptables rule.   And here is where I get lost because I can't find any documentation for this file. Where do I add the rule? And how exactly?  In particular:   On exactly which line do I add the rule? Do I put anything before or after it? The direct sum $\oplus$ versus the cartesian product $\times$ In the case of abelian groups, I have been treating these two set operations as more or less indistinguishable. In early mathematics courses, one normally defines $A^n := A\times A\times\ldots\times A$; however in, for example, the fundamental theorem of finitely generated abelian groups, we normally write that every such group is isomorphic to one of the form $$ \mathbb{Z}^n \oplus \mathbb{Z}_{r_1} \oplus \cdots \oplus \mathbb{Z}_{r_t}  $$ where $\mathbb{Z}^n$ now means $\mathbb{Z}\oplus\mathbb{Z}\oplus\cdots\oplus\mathbb{Z}$.  From an intuition perspective, and in the sense of sets, is this more or less the same as $\mathbb{Z}\times\mathbb{Z}\times\cdots\times\mathbb{Z}$? (Bear in mind I am normally using these ideas in relation to homology groups.) Fields - Proof that every multiple of zero equals zero This is one of my first proofs about fields. Please feed back and criticise in every way (including style and details).  Let $(F, +, \cdot)$ be a field. Non-trivially, $\textit{associativity}$ implies that any parentheses are meaningless. Therefore, we will not use parentheses. Therefore, we will not use $\textit{associativity}$ explicitly.  By $\textit{identity element}$, $F \ne \emptyset$. Now, let $a \in F$. It remains to prove that $0a = 0$. \begin{equation*} \begin{split} 0a &amp;=  0a +  0      &amp;&amp; \quad \text{by }\textit{identity element }(+    ) \\    &amp;=  0a +  a + -a &amp;&amp; \quad \text{by }\textit{inverse element  }(+    ) \\    &amp;=  0a + 1a + -a &amp;&amp; \quad \text{by }\textit{identity element }(\cdot) \\    &amp;= (0 + 1)a + -a &amp;&amp; \quad \text{by }\textit{distributivity   }        \\    &amp;= (1 + 0)a + -a &amp;&amp; \quad \text{by }\textit{commutativity    }(+    ) \\    &amp;=      1 a + -a &amp;&amp; \quad \text{by }\textit{identity element }(+    ) \\    &amp;=        a + -a &amp;&amp; \quad \text{by }\textit{identity element }(\cdot) \\    &amp;=  0            &amp;&amp; \quad \text{by }\textit{inverse element  }(+    ) \end{split} \end{equation*} QED  PS: Is "Let $(F, +, \cdot)$ be a field." ok? Besides, I would not want to call $F$ a field, because $F$ is just a set. Also, what do you think about using adverbs like "Now"? How would you have said the associativity-thing? Crash adding comment The SE iOS app crashes when adding comments to certain posts.  It was discovered to be if the "Add an Answer" button was visible, not just responding to a deleted comment.  Edited to match answer. Previous steps were not the only use case, and this error keeps getting re-reported in different ways. I have found a strange behavior in TikZ. When using the \draw ... to ... syntax and trying to place nodes along the line with the node[...]{...} syntax, the nodes do not turn up at the expected location.  \documentclass{standalone} \usepackage{tikz} \begin{document} \begin{tikzpicture}   \draw(0,0) to[out=60,in=120] (1,0) node[midway]{x}; \end{tikzpicture} \end{document}     How is this done properly? I need to show that for prime numbers of the form $p=4n+1$, $x=(2n)!$ solves the congruence $x^2 \equiv-1\pmod p$. I then need to show this implies p isn't a gaussian prime.   I have started to solve this using Wilson's theorem that a number $z$ is prime iff $(z-1)!\equiv-1\pmod z$. Therefore the endpoint of my proof should be that $(p-1)!\equiv-1\pmod p$.  As $p$ is of the form $p=4n+1$, I only need to prove that $4n!$ is congruent to $-1$ modulo $p$.   Here is my working so far: Starting with the congruence $x^2 \equiv -1\pmod p$:    $$\eqalign{x^2 = -1\pmod p&amp;\implies   x^2 + 1 = kp \implies (x-i)(x+i) = kp\cr &amp;\implies ((2n)!-i)((2n!)+i))=kp \implies 4n!- 1 =kp\cr}$$   This is where I start to run out of any ideas that seem to get me anywhere. Any tips would be greatly appreciated!