« first day (4864 days earlier)      last day (453 days later) » 
00:00 - 23:0023:00 - 00:00

23:03
Huh
$x^2-1 = (x-1)(x+1)$ always
@oscarmetalbreak what kind of isomorphism
I call this theorem Fubini for poor people
Idk. It might be strong for gauge integrals
Though I don't think Bartle was aiming high with this one
Just the very beginning kind of isomorphism that we saw in abstract algebra. Proving the map is both bijective and homomorphism.
What?
What kind of isomorphism...
I only know one kind of isomorphism
And what kind of isomorphism is it
Of what objects
From $F[x]/(x^2+1)$ to $F\times F$ where $F$ has prime number of element and is equaled to $4k+1$.
This kind
23:17
You're not answering my question
I don't understand...
I don't understand what "kind" do you mean?
Isomorphism of vector spaces, rings, groups, idk. There are isomorphisms of sets too
Its such a vague question
In abstract algebra alone you have so much of them
So telling me you are considering abstract algebra one tells me nothing at all
i "found" a weird function
2
Q: About $f(x) = \frac{\sum_{n=1}^{\infty} \sin^2(x/n)}{x}$

mickConsider for $x>0$ $$f(x) = \frac{\sum_{n=1}^{\infty} \sin^2(x/n)}{x}$$ I was fascinated by the behaviour of this function. It is easy to show that $$\lim_{x \to +0} \frac{f(x)}{x} = \zeta(2) = \frac{\pi^2}{6}$$ It seems we get for all $x>1$ $$f(1) \leq f(x) \leq \zeta(2)$$ and for all sufficient...

23:22
In this case, since $F[x]$ is a polynomial ring and $(x^2+1)$ is a principle ideal and $F\times F$ is a vector space, so it will be the quotient ring $F[x]/(x^2+1)$ to the vector space $F\times F$.
@oscarmetalbreak Primes not of the form 4k+3 can always be written as the sum of two squares. And that is related to the fact that $x^2+1\equiv 0 \pmod p$ always has a solution for such primes. See en.wikipedia.org/wiki/Fermat%27s_theorem_on_sums_of_two_squares
Sorry I didn't realize that premise that I omit in my question
@oscarmetalbreak so are you considering them as F-vector spaces
Yes
That is why I was looking if $x^2+1$ is reducible or not so that I can write a direct sum
@PM2Ring I don't think I need the solution for $x^2+1\equiv 0\pmod p$.
I think its pretty clear that it has dimension at most $2$
23:28
Eg, $13=2^2+3^2$, so $2^2\equiv -3^2\pmod{13}$. But $2×7\equiv1$, so $3×7\equiv 8$ solves $x^2+1\equiv 0$
Hence, $(x-5)(x-8)\equiv x^2+1$
@oscarmetalbreak Factoring a quadratic is equivalent to finding its roots.
Hi, PM2
@PM2Ring Thank you
23:37
No worries, Oscar. The theory of quadratic residues is a fascinating field. Several of the great masters spent considerable time on it.
Hi, Ted
00:00 - 23:0023:00 - 00:00

« first day (4864 days earlier)      last day (453 days later) »