Take p1,p2,…,pn,pn+1 be n+1 prime numbers in P⊆N. √pn+1∉Q(√p1,√p2,…,√pn) seems to be quite clear, but still need a proof. I know some proofs are involved with Galois theory, which is not I want.
Subscribe to:
Post Comments (Atom)
real analysis - How to find limhrightarrow0fracsin(ha)h
How to find lim without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...
-
Ok, according to some notes I have, the following is true for a random variable X that can only take on positive values, i.e P(X \int_0^...
-
Self-studying some properties of the exponential-function I came to the question of ways to assign a value to the divergent sum $$s=\sum_{k=...
-
The question said: Use the Euclidean Algorithm to find gcd (1207,569) and write (1207,569) as an integer linear combination of 1207 ...
No comments:
Post a Comment