5
$\begingroup$

Sophie Germain's identity is only about factorising $a^4+4b^4$ as product of two squares.It's not quite difficult.So,why is it so popular?

$\endgroup$
1
  • 1
    $\begingroup$ This question is answered here hsm.stackexchange.com/questions/2786/… It is often useful in number theoretic arguments, especially related to divisibility, and so features in solutions to mathematical olympiad problems. $\endgroup$
    – Conifold
    Oct 28 '15 at 18:16
5
$\begingroup$

For any field $K$, $c \in K^\times$ and integer $n > 2$, when is $X^n - c$ irreducible over $K$? A necessary condition is that for each prime number $p$ dividing $n$, $c$ is not a $p$th power in $K$; otherwise $X^p - c$ would be reducible over $K$ (a linear factor), so $X^n - c$ would be reducible over $K$ too. It turns out that this necessary condition is sufficient except if $4\mid n$, in which case we also need to check $c$ is not of the form $-4d^4$ for some $d$ in $K$ precisely because of the "unexpected" factorization of $X^4+4d^4$ over $K$.

Thus the only subtlety in determining irreducibility of $X^n-c$ over $K$ is due to the type of factorization going back to Sophie Germain.

Lang's Algebra devotes a section to the study of $X^n - a$, and its irreducibility is the first main result he describes.

$\endgroup$
3
$\begingroup$

Because of it's simplicity I guess. The identity is $a^4+4b^4=(a^2+2b^2-2ab)(a^2+2b^2+2ab)$. The identity is easy to verify but difficult to arrive at in the first place. We are familiar with $a^2-b^2=(a+b)(a-b)$, but not with the kind $a^2+b^2$ splitting as two factors. Also knowing the sum can be factored by such a identity, it is helpful in number theory, specially factoring numbers, determining a large number is prime or not. You can check here for an example.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.