math
posted by nancy .
Find a polynomial with integer coefficients such that (sqrt3 + sqrt5) is a root of the polynomial

Going back over some previous posts, I noticed you had posted this same question earlier, but for that you had
3 + √5 as a root.
I will answer it as if that was the right question.
If 3+√5 is a root, then its conjugate 3√5 must also be a root, or else a radical will show up in the expansion.
so the polynomial is
(x  (3+√5))(x (3√5))
= (x  3  √5)(x  3 + √5)
= x^2  3x + x√5  3x + 9  3√5  x√5 + 3√5  5
= x^2  6x + 4
Respond to this Question
Similar Questions

math
find a polynomial with integer coefficients such that square root of 3 + square root of 5 is a root of the polynomial 
math
find a polynomial with integer coefficients such that square root of 3 + square root of 5 is a root of the polynomial 
math
Find a polynomial with integer coefficients such that (sqrt3 + sqrt5) is a root of the polynomial 
PreCalculus
Find a polynomial function with integer coefficients with degree 4, one root 3+radical2, and another root 43i. I got x^414x^3+80x^2206x+175 I'm I correct? 
Math (Algebra)
A number is called algebraic if there is a polynomial with rational coefficients for which the number is a root. For example,√2 is algebraic because it is a root of the polynomial x^2−2. The number √2+√3+√5 … 
algebra!!!! please help me!!!!
A number is called algebraic if there is a polynomial with rational coefficients for which the number is a root. For example, √2 is algebraic because it is a root of the polynomial x^2−2. The number √(2+√3+√5)is … 
heeeeeeeeelp math
Find the largest possible number of distinct integer values {x_1,x_2,…,x_n}, such that for a fixed reducible degree 4 polynomial with integer coefficients, f(x_i) is prime for all i? 
plsheeeeeeeeeeelp math
Find the largest possible number of distinct integer values {x_1,x_2,…,x_n}, such that for a fixed reducible degree 4 polynomial with integer coefficients, f(x_i) is prime for all i? 
heeeelp math
Find the largest possible number of distinct integer values {x_1,x_2,…,x_n}, such that for a fixed reducible degree 4 polynomial with integer coefficients, f(x_i) is prime for all i? 
math
For every positive integer n, consider all monic polynomials f(x) with integer coefficients, such that for some real number a x(f(x+a)−f(x))=nf(x) Find the largest possible number of such polynomials f(x) for a fixed n<1000. …