Question

Let p be a prime and m an integer. Suppose that the polynomial f(x) = x^4+mx+p...

Let p be a prime and m an integer. Suppose that the polynomial f(x) = x^4+mx+p is reducible over Q. Show that if f(x) has no zeros in Q, then p = 3.

Math   Advanced-Math   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

0 0
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Let p be an odd prime. Let f(x) ∈ Q(x) be an irreducible polynomial of degree...
Let p be an odd prime. Let f(x) ∈ Q(x) be an irreducible polynomial of degree p whose Galois group is the dihedral group D_2p of a regular p-gon. Prove that f (x) has either all real roots or precisely one real root.
Let f ∈ Z[x] be a nonconstant polynomial. Prove that the set S = {p prime:...
Let f ∈ Z[x] be a nonconstant polynomial. Prove that the set S = {p prime: there exist infinitely many positive integers n such that p | f(n)} is infinite.
1. Let p be any prime number. Let r be any integer such that 0 <...
1. Let p be any prime number. Let r be any integer such that 0 < r < p−1. Show that there exists a number q such that rq = 1(mod p) 2. Let p1 and p2 be two distinct prime numbers. Let r1 and r2 be such that 0 < r1 < p1 and 0 < r2 < p2. Show that there exists a number x such that x = r1(mod p1)andx = r2(mod p2). 8. Suppose we roll...
3. Let P(x) be a polynomial with P(0) > 0 and suppose that P has at...
3. Let P(x) be a polynomial with P(0) > 0 and suppose that P has at least one real zero which is not an integer multiple of π. Prove that there exists a solution to P(x) = sin2 x
Let p be an odd prime and let a be an odd integer with p not...
Let p be an odd prime and let a be an odd integer with p not divisible by a. Suppose that p = 4a + n2 for some integer n. Prove that the Legendre symbol (a/p) equals 1.
Let x be an integer bigger than 4. Prove that x is prime if and only...
Let x be an integer bigger than 4. Prove that x is prime if and only if x does not divide (x − 1)!.
Formal Proof: Let p be a prime and let a be an integer. Assume p ∤...
Formal Proof: Let p be a prime and let a be an integer. Assume p ∤ a. Prove gcd(a, p) = 1.
1. a) For the polynomial f(x) = ?4 − 4?^3 + 22?^2 + 28?− 203, find...
1. a) For the polynomial f(x) = ?4 − 4?^3 + 22?^2 + 28?− 203, find the following: a. Find all the zeros using the given zero ? = 2 − 5?. Write the zeros in exact form. b. Factor f(x) as a product of linear factors. Zeros: x = x = x= x=
Let p(x) be an irreducible polynomial of degree n over a finite field K. Show that...
Let p(x) be an irreducible polynomial of degree n over a finite field K. Show that its Galois group over K is cyclic of order n and then show how the Galois group of x3 − 1 over Q is cyclic of order 2.
Let P be a subgroup of Sn of prime order, and suppose the element x in...
Let P be a subgroup of Sn of prime order, and suppose the element x in Sn normalizes but does not centralize P. Show that x fixes at most one point in each orbit of P. Help with a solution would be appreciated.
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT