Adv Alegbra HW Solutions 122

Adv Alegbra HW Solutions 122 - F p [ x ] x 4 + 1 = ( x 2 +...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
122 (ii) If x 4 + 1 = ( x 2 + ax + b )( x 2 + cx + d ) F p [ x ] , where p is an odd prime, prove that c =− a and d + b a 2 = 0 a ( d b ) = 0 bd = 1 . Solution. After expanding, we obtain the equations a + c = 0 d + ac + b = 0 ad + bc = 0 bd = 1 . Substituting c =− a yields the desired equations. (iii) Prove that x 4 + 1 factors in F p [ x ] , where p is an odd prime, if any of the following congruences are solvable: b 2 ≡− 1mod p , a 2 ≡± 2mod p . Solution. Using the hint, x 4 + 1 = ( x 2 + b )( x 2 b ) in F p [ x ] if a 0mod p .I f a ²≡ 0mod p , then d b mod p and b 2 bd 1mod p . Hence, b ≡± 1mod p , by Lemma 3.82 and Exercise 3.100. From part (i), we have a 2 ≡± 2mod p .As - suming that one of these congruences can be solved, we have fac-
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: F p [ x ] x 4 + 1 = ( x 2 + ax + 1 )( x 2 ax + 1 ) or x 4 + 1 = ( x 2 + ax 1 )( x 2 ax 1 ). (iv) Prove that x 4 + 1 factors in F p [ x ] for all primes p . Solution. In part (i), we saw that x 4 + 1 factors in F 2 [ x ] , and in part (iii), we saw that it factors in F p [ x ] for every odd prime p if certain congruences can be solved. As every odd prime (indeed, every odd integer) is congruent to 1 or 3 mod 4, Exercise 3.100 completes the proof....
View Full Document

This note was uploaded on 12/21/2011 for the course MAS 4301 taught by Professor Keithcornell during the Fall '11 term at UNF.

Ask a homework question - tutors are online