@arctictern So, suppose we consider $x = (1 2 3 4)$ then we need to construct a y such that $yxy{-1} = x^{-1}$ so we constructed and got $y = (1 4)(2 3)$ we consider $H = <x>$ and $K = <y>$. Then $HK = H \rtimes K = Z_4 \rtimes Z_2 = D_8$ so we are done.
$\alpha$ is a root of $x^4+ax^2+b$ $\alpha^2$ is a root of $u^2+au+b$ $u^2+au+b$ factors as $(u-\alpha^2)(u-b/\alpha^2)$ $x^4+ax^2+n$ factors as $(x^2-\alpha^2)(x^2-b/\alpha^2)$ so $\sqrt{b/\alpha^2}=\sqrt{b}/\alpha$ is another root of $x^4+ax^2+b$
cases: (a) u^2+au+b=(u-p)(u-q) so splitting field is sqrts of p and q adjoined to Q so extension has degree 1,2 or 4 so galois group has size 4. (b) u^2+au+b is irreducible, roots are p+/-sqrt(q) (go from there)
If $\alpha$ is a root then the polynomial factors as $(x+\alpha)(x-\alpha)(x+\sqrt{b}/\alpha)(x-b/\sqrt{\alpha})$. all roots are expressible in terms of $\alpha$ and $\sqrt{b}$ and conversely $\alpha$ and $\sqrt{b}$ are expressible in terms of roots.
@arctictern I was trying to find polynomials of degree 4 which gives galois group $\{e\},Z_2,Z_2xZ_2,Z_4$ I found all but I can't seem to find one for $Z_4$
@Alessandro I was thinking that if it is in some sense minimal then it could not be in $A\times A$ since it would have to come from something in $A$ which would have to be "smaller"
I am considering the following variation of nim
Same as the original game of nim there are $n$ piles of stones. The person to take the last stone loses.
Considering both players play optimally and a winning position is a position such that if one player ends up with this position he can win...
Hi! How do I do the integral the domain of a semi-circle(top) radius 1, center (1, 0)? What is the radius integral limit and the theta? how can I discover this?
@DHMO ok. I know solve that using cartesian coordinates. I would like to know how to write the polar integral, because the circle isnt centered on (0, 0)
@DHMO Consider what orthogonality means in the context of R^n. The simplest way to present that is to say that two vectors are orthogonal if their dot product vanishes.
For L^2 you instead have the inner product that @s.harp just indicated, and then the definition of orthogonality is that said inner product vanishes.
The 'geometric' content is much the same, though: You can write any 'vector' in L^2 (i.e. a square-integrable function) as a linear combination of basis vectors (complex exponentials) which are orthogonal with respect to the inner product.
user227867
3:53 PM
@robjohn This month, I got new blue spectacles, blue watch, blue wallet, blue socks and blue umbrella =D
user227867
@meow-mix Have you studied calculus? I know you are studying algebra from Aluffi's book.
If I want to model a peak that has a known mean, a known "left-width" and a known "right-width", but these are not symmetrical, what are standard functions used to approximate this?
if the left and right width were the same I'd take a Gaussian for example
I've probably forgotten everything about statistics that I could forget, but I'm pretty sure you want a skewed distribution. This kind of question will probably get more response on Cross-Validated, though
Could someone of you take a look at my question: http://math.stackexchange.com/questions/2035934/how-much-are-the-annual-contributions-to-be-paid and tell me how we could continue?
We have the set $\{(x,y) \in \mathbb{R}^2 \mid y\leq f(x)\}$, where $y=f(x)$ is a concave function. That means that each line segment between two points of the graph of $f$ is completely below the graph. In that set there are all the elements that are below the function, right? For for all $x$ the $y=f(x)$ is below the graph. That means that all the points of a line segment belong to that set. Is this correct?
As far as every question I've seen concerning "what is $\sum_{k=1}^nk^p$" is always answered with "Faulhaber's formula" and that is just about the only answer. In an attempt to make more interesting answers, I ask that this question concern the problem of "Methods to compute $\sum_{k=1}^nk^p$ wi...