| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 9 months |
| seen | yesterday | |
| stats | profile views | 19 |
|
May 9 |
awarded | Tumbleweed |
|
May 2 |
revised |
What is the error in Newton's Method for Matrix Inversion? edited tags |
|
May 2 |
asked | What is the error in Newton's Method for Matrix Inversion? |
|
Dec 13 |
asked | Different elliptic curves over given $\mathbb{F}_q$ can have different orders? |
|
Sep 21 |
awarded | Custodian |
|
Sep 7 |
comment |
Storing a group in a computer I am interested in easifying equations, such as: Given a Group $G$, what is $a+a$ for $a \in G$? It is $2a$. The question is: How to store $G$ herefore. |
|
Sep 7 |
comment |
Storing a group in a computer Maybe it's not necessary to store the generating system... Maybe there's another way to "store" a group? |
|
Sep 7 |
comment |
Storing a group in a computer They were both new to me, thanks! But what about non finite generated groups? |
|
Sep 7 |
asked | Storing a group in a computer |
|
Sep 2 |
awarded | Commentator |
|
Sep 2 |
comment |
Transforming root-equations into polynomials Oh, also: May I assume that instead of calculating $a-b=0$, calculating $a^n-b^n$ for arbitrary $n \in \mathbb{N}$ is equivalent? That way I could finally transform every sum of $n$th roots into a root-less sum? |
|
Sep 2 |
comment |
Transforming root-equations into polynomials Cool, I think that solves the first two questions. Indeed, for $3$rd roots, it should work, too! Now I am not completely sure about which X must be excluded from the domain (3rd point on my list...). For $(\sqrt{X}+(X+1))$, I only need to check that solutions are no roots of $(\sqrt{X}-(X+1))$. Which I could do by just putting them into $(\sqrt{X}-(X+1))$. Correct? |
|
Sep 2 |
revised |
Transforming root-equations into polynomials added 22 characters in body |
|
Sep 2 |
reviewed | Approve suggested edit on Transforming root-equations into polynomials |
|
Sep 2 |
comment |
Transforming root-equations into polynomials Thanks, but I was aware of Abel-Ruffini. I only want to turn the special polynomial into a normal polynomial. Then, I hope that I can solve it. But my question is only about the transformation. |
|
Sep 2 |
revised |
Transforming root-equations into polynomials grammar fixed |
|
Sep 2 |
asked | Transforming root-equations into polynomials |
|
Aug 27 |
accepted | Solving polynomials in $\mathbb{Q}[X]$ exactly |
|
Aug 27 |
comment |
Solving polynomials in $\mathbb{Q}[X]$ exactly Thanks. If I got you right, between $a$ and $b$ is exactly one root in $P$, so $(a,b,P)$ indeed references exactly one root. This is amazing. However, I think it does not let me do much computation with it, e.g. split a polynomial into factors, right? |
|
Aug 22 |
comment |
Solving polynomials in $\mathbb{Q}[X]$ exactly I see it. Thanks! Only for interest: What can we say about the roots of $X^5-X+1$? Is there anything better than giving a comma approximation? Anything where we do not lose precision? Something with $\log, \pi$ or whatever...? |