Using Wilson's theorem, show that if $p$ is prime of the form $p=4n+1$ and if $y=(\frac {p-1}2)!$, then $y^2\equiv -1\mod p$.   My attempt: By Wilson, $(4n+1-1)!\equiv (4n+1-1) \mod p$,$(4n)!\equiv4n\mod p$. The statement we want to show is equivalent to  $((2n)!)^2\equiv 4n\mod p$, which is transformed into $((2n)!)^2\equiv (4n)!\mod p$
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!
I'm looking for an algorithm which when given a latitude and longitude pair and a vector translation in meters in Cartesian coordinates (x,y) would give me a new coordinate. Sort of like a reverse Haversine. I could also work with a distance and a heading transformation, but this would probably be slower and not as accurate. Ideally, the algorithm should be fast as I'm working on an embedded system. Accuracy is not critical, within 10 meters would be good. Is there more to an interface than having the correct methods So lets say I have this interface:  public interface IBox {    public void setSize(int size);    public int getSize();    public int getArea();   //...and so on }   And I have a class that implements it:  public class Rectangle implements IBox {    private int size;    //Methods here }   If I wanted to use the interface IBox, i can't actually create an instance of it, in the way:  public static void main(String args[]) {     Ibox myBox=new Ibox(); }   right? So I'd actually have to do this:  public static void main(String args[]) {     Rectangle myBox=new Rectangle(); }   If that's true, then the only purpose of interfaces is to make sure that the class which implements an interface has got the correct methods in it as described by an interface? Or is there any other use of interfaces? If $q: E\rightarrow X$ is a covering map that has a section (i.e. $f: X\rightarrow E, q\circ  f=Id_X$) does that imply that $E$ is a $1$-fold cover? In my Java application, I want to run a batch file that calls "scons -Q implicit-deps-changed build\file_load_type export\file_load_type"  It seems that I can't even get my batch file to execute. I'm out of ideas.   This is what I have in Java:  Runtime.    getRuntime().    exec("build.bat", null, new File("."));   Previously, I had a Python Sconscript file that I wanted to run but since that didn't work I decided I would call the script via a batch file but that method has not been successful as of yet. Is there a website that summarizes the luggage and check-in requirements for each airplane company? I don't travel much by plane but I use a wide variety of companies. Since there is not much harmonization, specially with LCC, each one has its own requirements about luggage size, weight, extra luggage price, need for on-line check-in and printed ticket.  Each time I fly I ask my self what are the requirements, and although I can check them online at the official website this can't be quick, sometimes I leave it for last or, with so many, I just confuse airline requirements.  Is there a website or resource that lists this information? This would be very useful to quickly check or just compare requirements. How to choose a circle for default stream in Google Plus? How can I choose a specific circle for the default stream in Google+ ? Many extensions don't work, and are not comfortable if using another PC. Let $T:V\to V$ be a linear map, where $V$ is an inner product space. Given $T^2=\frac{T+T^*}{2}$, prove that $T$ is normal and that $T=T^2$. Let $T:V\to V$ be a linear map, where $V$ is a finite-dimensional inner product space. Given $T^2=\frac{T+T^{*}}{2}$, I would like to prove that $T$ is normal and that $T=T^2$. The first part, to prove that $T$ is normal, is quite easy: from $T^2=\frac{T+T^{*}}{2}$ we'll have $\,T^{*}=2T^2 - T$, and as $TT^{*} = 2T^3 -T^2 = T^{*}T$. Now, I need to prove that $T=T^*$, then $T = T^2$ is immediate. I have been thinking about this question for some days and I can't figure out in what technique to prove that $T = T^{*}$. In D&amp;D 4e there was an option to Delay your initiative:     Perform your actions as desired and adjust your initiative to your new   position in the order.   Does this rule to change initiative order still exist in 5th edition? I cannot find it in the PHB. How can I prove that $\frac{n^2}{x_1+x_2+\dots+x_n} \le \frac{1}{x_1}+ \frac{1}{x_2} +\dots+ \frac{1}{x_n}$? How can I prove that $\frac{n^2}{x_1+x_2+\dots+x_n} \le \frac{1}{x_1}+ \frac{1}{x_2} +\dots+ \frac{1}{x_n}$?   im trying to use AM-GM  $\sqrt[n]{ \frac{1}{x_1} \frac{1}{x_2} \frac{1}{x_3} ..\frac{1}{x_n}}   \le \sum_{k=1}^n \frac{{\frac{1}{x_1} +\frac{1}{x_2}+ \frac{1}{x_3}+ ..\frac{1}{x_n}}}{n}$  $ln\sqrt[n]{ \frac{1}{x_1} \frac{1}{x_2} \frac{1}{x_3} ..\frac{1}{x_n}} \le ln \frac{1}{n} \sum_{k=1}^n {\frac{1}{x_1} +\frac{1}{x_2}+ \frac{1}{x_3}+ ..\frac{1}{x_n}}$  $ \frac{1}{x_1} \frac{1}{x_2} \frac{1}{x_3} ..\frac{1}{x_n}\le  \sum_{k=1}^n {\frac{1}{x_1} +\frac{1}{x_2}+ \frac{1}{x_3}+ ..\frac{1}{x_n}}$  im not sure is this right or not, however i dont know how to include the $n^2$ in the nominator? is there also alternative proof using jensen inequality? Inverse metric in linearised gravity From what I've read, in the framework of linearised gravity, one perturbs the metric around a Minkowski background, $\eta_{\mu\nu}$, such that  $$g_{\mu\nu}(x)=\eta_{\mu\nu}+h_{\mu\nu}(x)\tag{1}$$  where $h_{\mu\nu}(x)$ is a small perturbation, i.e. $$\big\lvert h_{\mu\nu}\big\rvert&lt;&lt;1.\tag{2}$$  The inverse metric is then found by assuming the following ansatz:  $$g^{\mu\nu}(x)=\eta^{\mu\nu}+\tilde{h}^{\mu\nu}\tag{3}$$  where $\tilde{h}^{\mu\nu}$ is also small (i.e. $\big\lvert \tilde{h}_{\mu\nu}\big\rvert&lt;&lt;1$).   Using this, it is easy to find that  $$g^{\mu\nu}(x)=\eta^{\mu\nu}-h^{\mu\nu} \tag{4}$$  to first order.   My question is, what is the justification for this ansatz? Is it simply that one expects the inverse metric to have a similar form to the metric in order to satisfy $$g^{\mu\alpha}g_{\alpha\nu}=\delta^{\mu}_{\;\nu}~?\tag{5}$$ My 3 years old doesn't tell me when he needs to use the bathroom Rotation and Scale have suddenly stopped working? I was working quickly, (making mistakes), and suddenly rotation and scale transforms stopped working. I think I hit some shortcut or button by accident. Translate still works though. I checked that the transforms weren't locked and such, to no avail. What could be the cause? How to connect to Android through SSH over 3G/4G public IP? I have a small Problem that occurs from time to time.   Sometimes, when I copy things or when I put an object from the symbol library on my page, the whole file gets messed up. The screenshot shows it. I make the graphic on the right, Illustrator the ones on the left.   I have pixel snapping checked. Is there a way to tell Illustrator to align everything to pixels no matter what? How do you define an arbitrary sort sequence for views? Past tense and the phrase "who knows what" How do I install libtiff.so.3? When I try to run Maya from the terminal, I get:  error while loading shared libraries: libtiff.so.3: cannot open shared object file: No such file or directory.   How do I solve this?  Note: Maya is a third-party software. How do I find this limit: $\lim_{n\to\infty} \left[ n-{n\over e}\left(1+{1\over n}\right)^n \right]$? I'm working on a practice exam for my masters quals and I am having difficulties with the following limit. According to wolfram alpha, it's value is 1/2. Does anyone know how to find this limit?   $$\lim_{n\to\infty} \left[ n-{n\over e}\left(1+{1\over n}\right)^n \right].$$ Show sub reasons in close review queue Currently close vote review queue shows the top level close reason in the header, but some close reasons, for instance, off topic have very different sub reasons. For instance, "demonstrate minimal understanding" is different from "This question belongs on a different site in the stack exchange network".  It would be nice if sub close reasons were also shown. Is this an instance of Priori Incantatem? During the climax of Fantastic Beasts and Where to Find Them, Tina briefly duels with Graves and their wands appear to lock with each other (see picture). I believe this also happens some other times in the later Harry Potter films other than Harry and Voldemort's duel in the graveyard during Goblet of Fire.    We know that this is definitely a case of Priori Incantatem for the graveyard duel in Goblet of Fire, as the wands are locked for a sufficient amount of time for past spells to begin showing themselves (significantly, showing the people Voldemort had murdered), but is this the case for the other instances of wands locking? If so, does that mean there are a lot more wands out there with shared cores, as it was my understanding this could only happen if that criteria was satisfied?