# math

posted by .

Find a polynomial with integer coefficients such that (sqrt3 + sqrt5) is a root of the polynomial

• math -

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

## Similar Questions

1. ### math

find a polynomial with integer coefficients such that square root of 3 + square root of 5 is a root of the polynomial
2. ### math

find a polynomial with integer coefficients such that square root of 3 + square root of 5 is a root of the polynomial
3. ### math

Find a polynomial with integer coefficients such that (sqrt3 + sqrt5) is a root of the polynomial
4. ### Pre-Calculus

Find a polynomial function with integer coefficients with degree 4, one root 3+radical2, and another root 4-3i. I got x^4-14x^3+80x^2-206x+175 I'm I correct?
5. ### 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 …

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 …
7. ### 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?
8. ### 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?
9. ### 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?
10. ### 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. …

More Similar Questions