Certain formulas I really enjoy looking at like the EulerMaclaurin formula or the Leibniz integral rule. What's your favorite equation, formula, identity or inequality?

closed as no longer relevant by Robin Chapman, Akhil Mathew, Yemon Choi, Qiaochu Yuan, Pete L. Clark Aug 22 '10 at 9:00
This question is unlikely to help any future visitors; it is only relevant to a small geographic area, a specific moment in time, or an extraordinarily narrow situation that is not generally applicable to the worldwide audience of the internet. For help making this question more broadly applicable, visit the help center.If this question can be reworded to fit the rules in the help center, please edit the question.
$e^{\pi i} + 1 = 0$ 


Given a square matrix $M \in SO_n$ decomposed as illustrated with square blocks $A,D$ and rectangular blocks $B,C,$ $$M = \left( \begin{array}{cc} A & B \\\ C & D \end{array} \right) ,$$ then $\det A = \det D.$ What this says is that, in Riemannian geometry with an orientable manifold, the Hodge star operator is an isometry, a fact that has relevance for Poincare duality. http://en.wikipedia.org/wiki/Hodge_duality http://en.wikipedia.org/wiki/Poincar%C3%A9_duality But the proof is a single line: $$ \left( \begin{array}{cc} A & B \\\ 0 & I \end{array} \right) \left( \begin{array}{cc} A^t & C^t \\\ B^t & D^t \end{array} \right) = \left( \begin{array}{cc} I & 0 \\\ B^t & D^t \end{array} \right). $$ 


There's lots to choose from. RiemannRoch and various other formulas from cohomology are pretty neat. But I think I'll go with $$\sum\limits_{n=1}^{\infty} n^{s} = \prod\limits_{p \text{ prime}} \left( 1  p^{s}\right)^{1}$$ 


$$ \frac{24}{7\sqrt{7}} \int_{\pi/3}^{\pi/2} \log \left \frac{\tan t+\sqrt{7}}{\tan t\sqrt{7}}\right\\ dt = \sum_{n\geq 1} \left(\frac n7\right)\frac{1}{n^2}, $$ where $\left(\frac n7\right)$ denotes the Legendre symbol. Not really my favorite identity, but it has the interesting feature that it is a conjecture! It is a rare example of a conjectured explicit identity between real numbers that can be checked to arbitrary accuracy. This identity has been verified to over 20,000 decimal places. See J. M. Borwein and D. H. Bailey, Mathematics by Experiment: Plausible Reasoning in the 21st Century, A K Peters, Natick, MA, 2004 (pages 9091). 


$e=lim_{n\to\infty}\sqrt[p_n]{\prod_{k=1}^np_n}$ as seen at Gaussianos $(\prod_{k=1}^np_n=p_n$# which is the primorial of the nth prime number $p_n)$ 


It may be trivial, but I've always found $\sqrt{\pi}=\int_{\infty}^{\infty}e^{x^{2}}dx$ to be particularly beautiful. 


$(A\lambda _1) (A\lambda _2) \ldots = 0$, the CayleyHamilton theorem. 


$\left(\frac{p}{q}\right) \left(\frac{q}{p}\right) = (1)^{\frac{p1}{2} \frac{q1}{2}}$. 


I like RiemannRoch the most!!! 


One that I just learned recently is $$ (1 + q + q^3 + q^6 + q^{10} + q^{15} + \cdots)^4 = \sum_{k=0}^\infty \sigma(2k+1)q^k $$ which states that the number of ways of writing an integer $k$ as a sum of exactly 4 triangular numbers (paying attention to ordering) is equal to the sum of divisors of $2k+1$. If that isn't cool and surprising, I don't know what is. 


My favorite equation is $$\frac{16}{64} = \frac{1}{4}.$$ What makes this equation interesting is that canceling the $6$'s yields the correct answer. I realized this in, perhaps, third grade. This was the great rebellion of my youth. Sometime later I generalized this to finding solutions to $$\frac{pa +b}{pb + c} = \frac{a}{c}.$$ where $p$ is an integer greater than $1$. We require that $a$, $b$, and $c$ are integers between $1$ and $p  1$, inclusive. Say a solution is trivial if $a = b = c$. Then $p$ is prime if and only if all solutions are trivial. On can also prove that if $p$ is an even integer greater than $2$ then $p  1$ is prime if and only if every nontrivial solution $(a,b,c)$ has $b = p  1$. The key to these results is that if $(a, b, c)$ is a nontrivial solution then the greatest common divisor of $c$ and $p$ is greater than $1$ and the greatest common divisor of $b$ and $p  1$ is also greater than $1$. Two other interesting facts are (i) if $(a, b, c)$ is a nontrivial solution then $2a \leq c < b$ and (2) the number of nontrivial solutions is odd if and only if $p$ is the square of an even integer. To prove the latter item it is useful to note that if $(a, b, c)$ is a nontrivial solution then so is $(b  c, b, b  a)$. For what it is worth I call this demented division. 


Pick's theorem $A = I + \frac 1 2 B  1$, where $A$, $I$, and $B$ are the area, number of interior integer points, and number of boundary integer points, respectively, of a polygon with vertices on the integer lattice. Picks identity is fascinating because it computes a continuous quantity completely discretely. (Of course, this is not quite correct, since we have quite a discrete requirement about the vertices of the polygon.) Also, the "1" is not an accident, but the Euler characteristic of the polygon (and so there are various natural extensions of Pick's theorem). 


Cauchy integral formula $$ f(z)=\frac{1}{2\pi i}\int_{\gamma}\frac{f(w)}{wz} dw $$ 


With the stuff I've seen in the literature of sequence transformations, I've started to love the formulae for Aitken's Δ² process: $S_n^{\prime}=S_{n+1}\frac{(\Delta S_n)^2}{\Delta^2 S_n}$ and its generalization the Wynn ε algorithm: $\varepsilon_{k+1}^{(n)}=\varepsilon_{k1}^{(n+1)}+\frac1{\varepsilon_{k}^{(n+1)}\varepsilon_{k}^{(n)}}$ for the latter one especially because it is nicely represented as a lozenge diagram: 


$\sin^2 A + \cos^2 A = 1$ 


There are many beautiful equations above, so I'll be a bit different and add something nonsensical. Namely $$\langle f\rangle = \frac{\int_\ast f(\phi)e^{\frac{\mathrm{i}}{\hbar}\int_M\mathcal{L}(\phi)}\mathcal{D}\phi}{\int_\ast e^{\frac{\mathrm{i}}{\hbar}\int_M\mathcal{L}(\phi)}\mathcal{D}\phi}.$$ Just insert your favourite spacetime manifold $M$ and the classical Lagrangian $\mathcal{L}$ of your choice, and you get to learn the expectation value of any physical observable $f$... as soon as you figure out what the hell $\ast$ and $\mathcal{D}\phi$ are, that is. 


d/dx (e^x) =e^x 


The formula $\displaystyle \int_{\infty}^{\infty} \frac{\cos(x)}{x^2+1} dx = \frac{\pi}{e}$. It is astounding in that we can retrieve $e$ from a formula involving the cosine. It is not surprising if we know the formula $\cos(x)=\frac{e^{ix}+e^{ix}}{2}$, yet this integral is of a purely realvalued function. It shows how complex analysis actually underlies even the real numbers. 


The Pythagorean Theorem for RightCorner Tetrahedra[*]:
where $A$, $B$, $C$ are the areas of the "legfaces" and $D$ is the area of the "hypotenuseface". For rightcorner simplices in higher Euclidean dimensions, we have that the sum of the squares of the content of legsimplices equals the square of the content of the hypotenusesimplex. (I don't happen to know the nonEuclidean counterparts of this generalization. Perhaps this makes for a good MO question!) As generalizations of the Pythagorean Theorem for Triangles, I always found these (Euclidean) results to be more satisfying than the diagonalofabox/distance formulas: instead of dealing only with segments, we have that, as the dimension of the ambient space goes up, so does the dimension of the objects involved in the relations. [*] Edges meeting at the "right corner" are mutually orthogonal. 


The EulerLagrange equations, $$\frac{\partial L}{\partial q_j} = \frac{d}{dt}\frac{\partial L}{\partial \dot{q}_j}$$ 


The braid relation is probably my favorite equation, algebraically capturing the Reidemeister III move as $x y x = y x y$. Although to a younger person, I still find that suggesting that 5 is not prime is reliably charming revelation: $5 = (2 + i)(2  i)$. 


I'm a fan of $\Omega SU \simeq BU$. 


The isogeny theorem: $\mathrm{Hom}_K(A,A')$ $ = \mathrm{Hom}_{G_K}(T_\ell(A),T_\ell(A'))$ 


How about $\displaystyle \sigma_7(n)=\sigma_3(n)+120\sum_{k=1}^{n1} \sigma_3(k) \sigma_3(nk)$? This is an utterly shocking result, and the only known proof uses complex analysis. 


I have a soft spot for Heine's formula from the theory of orthogonal polynomials (since the proof is such a pretty calculation): If $\mu$ is a measure with finite moments $\beta_k=\int x^k d\mu(x)$, then $$\det(\beta_{i+j})_{i,j=0,\ldots,k1} = \frac{1}{k!} \int \cdots \int \Delta(x_1,\ldots,x_k)^2 d\mu(x_1) \cdots d\mu(x_k)$$ where $\Delta$ is the Vandermonde determinant. 


$\prod_{n=1}^{\infty} (1x^n) = \sum_{k=\infty}^{\infty} (1)^k x^{k(3k1)/2}$ 


$196884 = 196883 + 1$ 


The Spectral theorem for normal operators on a Hilbert space: $T = \int_{\sigma (T)} \lambda dP(\lambda)$ where $\sigma (T)$ is the spectrum of $T$ and $P$ is a regular projectionvalued measure supported on $\sigma (T)$. 


The Gauss Formula from Riemannian geometry: $\overline{\nabla}_XY = \nabla_XY + \text{II}(X,Y)$ It may just be a decomposition into tangential and normal parts, but I find it very aesthetically pleasing. (It's also not completely immediate that the tangential part of the ambient connection should actually be the intrinsic connection.) 


Bayes equations: P(AB) = P(A∩B)/P(B) It is the basis of conditional probability. 

