Misplaced Pages

Sophie Germain's identity

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
(Redirected from Sophie Germain identity) Mathematical polynomial factorization This article is about a polynomial identity attributed to Sophie Germain. For the pseudonymous identity used by Germain, see Antoine-Auguste Le Blanc.

In mathematics, Sophie Germain's identity is a polynomial factorization named after Sophie Germain stating that x 4 + 4 y 4 = ( ( x + y ) 2 + y 2 ) ⋅ ( ( x − y ) 2 + y 2 ) = ( x 2 + 2 x y + 2 y 2 ) ⋅ ( x 2 − 2 x y + 2 y 2 ) . {\displaystyle {\begin{aligned}x^{4}+4y^{4}&={\bigl (}(x+y)^{2}+y^{2}{\bigr )}\cdot {\bigl (}(x-y)^{2}+y^{2}{\bigr )}\\&=(x^{2}+2xy+2y^{2})\cdot (x^{2}-2xy+2y^{2}).\end{aligned}}} Beyond its use in elementary algebra, it can also be used in number theory to factorize integers of the special form x 4 + 4 y 4 {\displaystyle x^{4}+4y^{4}} , and it frequently forms the basis of problems in mathematics competitions.

History

Although the identity has been attributed to Sophie Germain, it does not appear in her works. Instead, in her works one can find the related identity x 4 + y 4 = ( x 2 − y 2 ) 2 + 2 ( x y ) 2 = ( x 2 + y 2 ) 2 − 2 ( x y ) 2 . {\displaystyle {\begin{aligned}x^{4}+y^{4}&=(x^{2}-y^{2})^{2}+2(xy)^{2}\\&=(x^{2}+y^{2})^{2}-2(xy)^{2}.\\\end{aligned}}} Modifying this equation by multiplying y {\displaystyle y} by 2 {\displaystyle {\sqrt {2}}} gives x 4 + 4 y 4 = ( x 2 + 2 y 2 ) 2 − 4 ( x y ) 2 , {\displaystyle x^{4}+4y^{4}=(x^{2}+2y^{2})^{2}-4(xy)^{2},} a difference of two squares, from which Germain's identity follows. The inaccurate attribution of this identity to Germain was made by Leonard Eugene Dickson in his History of the Theory of Numbers, which also stated (equally inaccurately) that it could be found in a letter from Leonhard Euler to Christian Goldbach.

The identity can be proven simply by multiplying the two terms of the factorization together, and verifying that their product equals the right hand side of the equality. A proof without words is also possible based on multiple applications of the Pythagorean theorem.

Applications to integer factorization

One consequence of Germain's identity is that the numbers of the form n 4 + 4 n {\displaystyle n^{4}+4^{n}} cannot be prime for n > 1 {\displaystyle n>1} . (For n = 1 {\displaystyle n=1} , the result is the prime number 5.) They are obviously not prime if n {\displaystyle n} is even, and if n {\displaystyle n} is odd they have a factorization given by the identity with x = n {\displaystyle x=n} and y = 2 ( n − 1 ) / 2 {\displaystyle y=2^{(n-1)/2}} . These numbers (starting with n = 0 {\displaystyle n=0} ) form the integer sequence

1, 5, 32, 145, 512, 1649, 5392, 18785, 69632, ... (sequence A001589 in the OEIS).

Many of the appearances of Sophie Germain's identity in mathematics competitions come from this corollary of it.

Another special case of the identity with x = 1 {\displaystyle x=1} and y = 2 k {\displaystyle y=2^{k}} can be used to produce the factorization Φ 4 ( 2 2 k + 1 ) = 2 4 k + 2 + 1 = ( 2 2 k + 1 − 2 k + 1 + 1 ) ⋅ ( 2 2 k + 1 + 2 k + 1 + 1 ) , {\displaystyle {\begin{aligned}\Phi _{4}(2^{2k+1})&=2^{4k+2}+1\\&=(2^{2k+1}-2^{k+1}+1)\cdot (2^{2k+1}+2^{k+1}+1),\\\end{aligned}}} where Φ 4 ( x ) = x 2 + 1 {\displaystyle \Phi _{4}(x)=x^{2}+1} is the fourth cyclotomic polynomial. As with the cyclotomic polynomials more generally, Φ 4 {\displaystyle \Phi _{4}} is an irreducible polynomial, so this factorization of infinitely many of its values cannot be extended to a factorization of Φ 4 {\displaystyle \Phi _{4}} as a polynomial, making this an example of an aurifeuillean factorization.

Generalization

Germain's identity has been generalized to the functional equation f ( x ) 2 + 4 f ( y ) 2 = ( f ( x + y ) + f ( y ) ) ( f ( x − y ) + f ( y ) ) , {\displaystyle f(x)^{2}+4f(y)^{2}={\bigl (}f(x+y)+f(y){\bigr )}{\bigl (}f(x-y)+f(y){\bigr )},} which by Sophie Germain's identity is satisfied by the square function.

References

  1. ^ Moreno, Samuel G.; García-Caballero, Esther M. (2019), "Proof without words: Sophie Germain's identity", The College Mathematics Journal, 50 (3): 197, doi:10.1080/07468342.2019.1603533, MR 3955328, S2CID 191131755
  2. ^ "CC79: Show that if n {\displaystyle n} is an integer greater than 1, then n 4 + 4 {\displaystyle n^{4}+4} is not prime" (PDF), The contest corner, Crux Mathematicorum, 40 (6): 239, June 2014; originally from 1979 APICS Math Competition
  3. ^ Engel, Arthur (1998), Problem-Solving Strategies, Problem Books in Mathematics, New York: Springer-Verlag, p. 121, doi:10.1007/b97682, ISBN 0-387-98219-1, MR 1485512
  4. ^ Łukasik, Radosław; Sikorska, Justyna; Szostok, Tomasz (2018), "On an equation of Sophie Germain", Results in Mathematics, 73 (2), Paper No. 60, doi:10.1007/s00025-018-0820-y, MR 3783549, S2CID 253591505
  5. ^ Whitty, Robin, "Sophie Germain's identity" (PDF), Theorem of the day
  6. Dickson, Leonard Eugene (1919), History of the Theory of Numbers, Volume I: Divisibility and Primality, Carnegie Institute of Washington, p. 382
  7. ^ Bogomolny, Alexander, "Sophie Germain's identity", Cut-the-Knot, retrieved 2023-06-19
  8. Granville, Andrew; Pleasants, Peter (2006), "Aurifeuillian factorization", Mathematics of Computation, 75 (253): 497–508, doi:10.1090/S0025-5718-05-01766-7, MR 2176412
Categories: