Friday, 19 July 2013

polynomials - sum of square root of primes 2

I dont know how to solve the problem below.



(1) p[1], p[2], , p[n] are distinct primes, where n=1,2,
Let a[n] be the sum of square root of those primes, that is, a[n]=p[1]++p[n]. Show that there exists a polynomial with integer coefficients that has a[n] as a solution.




(2) Show that a[n] is irrational.



I can solve this without using (1) for (2). But my teacher said (1) is a hint for (2).
Help please?

No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find limh0sin(ha)h without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...