If $p$ is a prime number, how can I prove by contradiction that this equation $x^{n}=p$ doesn't admit solutions in $\mathbb {Q}$ where $n\ge2$
Subscribe to:
Post Comments (Atom)
analysis - Injection, making bijection
I have injection $f \colon A \rightarrow B$ and I want to get bijection. Can I just resting codomain to $f(A)$? I know that every function i...
-
Find all integer solutions of $2n \equiv 12 \bmod 19$ So I have re-arranged to: $2x-19y=12$ and by the extended Euclidean Algorithm, I get $...
-
We need to find out the limit of, lim$_{n \to \infty} \sum _{ k =0}^ n \frac{e^{-n}n^k}{k!}$ One can see that $\frac{e^{-n}n^k}{k!}$...
-
I understand that a continued fraction of the form: $g(n_1,n_2,n_3,n_4,n_5,\ldots)= n_1 + \cfrac{1}{n_2 + \cfrac{1}{n_3 + \cfrac{1}{n_4 + \c...
No comments:
Post a Comment