Let x=√2+√3+…+√n,n≥2. I want to show that [Q(x):Q]=2ϕ(n), where ϕ is Euler's totient function.
I know that if p1,…,pn are pairwise relatively prime then [Q(√p1+…+√pn):Q]=2n. But how to proceed in the above case? I could not apply induction also. Any help is appreciated.
The assertion is false. Actually [Q(x):Q]=2π(n), where π(n) is the number of prime numbers less than or equal to n.
Answer
Let L=Q(∑nj=1√j) , k=Q and N=Q(√2,√3,...,√n) .
Clearly N|k is Galois and the Galois group is of the form Zm2 for some m since every k automorphism of N has order at most 2. Note that each element of Gal(N|k) is completely specified by it's action on {√p: p prime p≤n} by the fundamental theorem of arithmetic. So this gives m≤π(n)
Now if the Galois group is Zm2 then it will have 2m−1 subgroups of index 2 and hence there exist 2m−1 subfields F of N containing k such that F:k=2 . But we already have 2π(n)−1 many such subfields by taking product of a nonempty subset of {√p: p prime p≤n} and hence we get 2π(n)−1≤2m−1
⟹π(n)≤m
And hence Gal(N|k)=Zπ(n)2
Now we just observe that the orbit of ∑nj=1√j under the action of Gal(N|k) contains 2π(n) distinct elements by linear independence of {√pi,√pipj,...} and hence N=L
So Gal(Q(n∑j=1√j)|Q)≅Zπ(n)2
No comments:
Post a Comment