« first day (1353 days earlier)      last day (3669 days later) » 

2:04 PM
LOL, I did it without pen and paper using complex numbers.
$$\text{Im} (e^{i/2})=\sin(1/2)$$
 
r9m
@Chris'ssis post it on main pleej :D
 
@r9m I'm not active on main anymore for a long period of time. (I don't think I'll ever be active again there).
 
r9m
@Chris'ssis :'( .. you made the boy cry (boo-hoo!!)
 
:'(
 
r9m
@Sawarnik do you know what I do to people who call Naruto silly ??? >:(
 
2:10 PM
@r9m No, I don't.
 
r9m
@Sawarnik I do this mangekyō sharingan :P
 
@r9m What is that :?
 
I've gotta learn how to dive and tuck my shoulder into a somersault midair, so I can roll and jump back up with momentum like in an action movie.
 
@r9m What is that again :? Tell.
@MickLH I think you can do it only once in your life.
 
r9m
@Sawarnik never mind :P
 
2:14 PM
When I can, I would be ready to bust through the window and spring immediately back up into the air shouting about Riemann
I'd like if @Chris'ssis comes with though in case they try to use directed infinite series weapons to subdue me
 
@r9m Ok r9m :P
 
r9m
@Sawarnik my name is not to be taken around here lightly >8(
 
@Sawarnik People who call Naruto silly, should feel the wrath of Kirin
 
I really am loving the neon blue
I particularly enjoy the way it tricks my brain into believing that the white lines are actually just intensely bright blue
Brighter than my monitor can physically display
 
Its so silly that I am laughing now!
@MickLH Nice spot :D
 
2:22 PM
@Sawarnik It's from being obsessed with computer graphics for years, I'm like an optical illusion crackhead
 
hello
 
hi
 
hi
 
@MickLH sup? (its your dialogue, i think)
 
Well I can flood you with information but I'm grinding away at my arbitrary precision math program
 
r9m
2:34 PM
@Chris'ssis regarding chinamath's more general question $\lim_{n\to\infty}\int_{0}^{1}\cdots\cdots\int_{0}^{1} \left(\dfrac{x_{1}+x_{2}+\cdots+x_{n}}{n}\right)dx_{1}dx_{2}\cdots dx_{n}=\dfrac{1}{2}$ .. I am thinking weierstrass approximation of continuous functions after that ..
I think I am done with only real-analysis :D
 
hi
 
does anybody know how to ping everybody in a room with a single word after "@"
 
I am under the impression (and hope) that's not really available or encouraged
 
It would create a lot of problems.
 
@r9m Ah, yes. Using polynomials trick to approximate that. I have some problems where I need to employ this way. It's a very powerful way.
 
r9m
2:37 PM
@Chris'ssis YAY :D
 
@AwalGarg Have you studied the precise definition of limits?
 
Open question to everyone, and in particular @r9m since you're fresh on the train of thought, are complex series fundamentally more powerful than real series?
Or can you always convert a complex series into two real series?
 
r9m
@MickLH how about $x_n = \sin (x_{n-1})$ .. where $x_0 = z \in \mathbb{C}$ ? not sure about your question though .. will be back after dinner (didn't eat anything since last 24 hours .. I feel like fainting)
 
@r9m Understandable! actually I need to do my morning rituals as well, but I'll consider in a moment
 
3:00 PM
@r9m Surely its an exaggeration, or were you on some religious fasting?
@MickLH What kind of rituals?
 
@Sawarnik If he's anything like me, he might have just been too busy with something interesting
 
@MickLH If he was a sane person, he won't starve himself watever the case be.
 
I find myself trying to skip dinner, but the pain reminding me that I've skipped last dinner, lunch, breakfast, and maybe the dinner before that too
 
r9m
@MickLH I don't exactly come under the 'sanity' spectrum :P LOL
 
lol :D
 
3:03 PM
@r9m Then wat? -_-
 
I've been told that I don't quite hit that spectrum either
 
@AwalGarg I'm not aware of any way to do that. I don't even think there is a mod option to do it
 
.... All day I was engaged in my professional work, and it was late in the evening before I returned to Baker Street. Sherlock Holmes had not come back yet. It was nearly ten o'clock before he entered, looking pale and worn. He walked up to the sideboard, and tearing a piece from the loaf he devoured it voraciously, washing it down with a long draught of water.

"You are hungry," I remarked.

"Starving. It had escaped my memory. I have had nothing since breakfast."

"Nothing?"

"Not a bite. I had no time to think of it." ....
 
@r9m hehe, this I can relate to. I just naturally don't get hungry sometimes for 24+ hours so sometimes I forget to eat if I get in to something and don't think about food
 
$$\lim_{n\to\infty} \int_0^1 \int_0^1 \cdots \int_0^1 \int_0^{\large 2(x_1+x_2+\cdots +x_n)/n}\frac{\arctan(t)}{t} \ dt \ dx_1 dx_2 \cdots dx_n =\text{Catalan}$$
@r9m see above what I just created.
 
r9m
3:07 PM
@Chris'ssis do you ever get tired of making awesome stuff ?? :P :D
 
@r9m Never. :-)
 
nervously enters the chat
 
well well
 
:)
 
3:16 PM
another day?
 
i doubt i'll stay long
 
$$
\begin{align}
\int_0^{\pi/2}\int_0^{\sin(x)}\frac{\arcsin(t)}{t}\,\mathrm{d}t\,\mathrm{d}x
&=\int_0^{\pi/2}\int_0^xt\cot(t)\,\mathrm{d}t\,\mathrm{d}x\\
&=\int_0^{\pi/2}x(\pi/2-x)\cot(x)\,\mathrm{d}x\\
&=\int_0^{\pi/2}x(\pi/2-x)\tan(x)\,\mathrm{d}x\\
&=-\int_0^{\pi/2}x(\pi/2-x)\,\mathrm{d}\log(\cos(x))\\
&=\int_0^{\pi/2}\log(\cos(x))(\pi/2-2x)\,\mathrm{d}x\\
&=\int_0^{\pi/2}\left(-\log(2)+\sum_{k=1}^\infty(-1)^{k-1}\frac{\cos(2kx)}{k}\right)(\pi/2-2x)\,\mathrm{d}x\\
&=\int_0^{\pi/2}\sum_{k=1}^\infty(-1)^{k-1}\frac{\cos(2kx)}{k}(\pi/2-2x)\,\mathrm{d}x\\
 
@robjohn Marvellous!
 
@Chris'ssis there are many paths to follow to get a successful integral. I hope this is one of the shorter.
 
3:31 PM
@robjohn have you ever met it (that question) before?
 
@AwalGarg BANG!
 
@robjohn lol
 
@Chris'ssis No... at least not obfuscated in that fashion using arcsin
 
@robjohn I created it today ...
 
@Chris'ssis I am finding more usage for that expansion of $\log(\cos(\theta))$
 
3:33 PM
@robjohn Agree.
@robjohn You have some $n$ in some lines. Typos, right? I hope I don't miss anything.
 
@robjohn hey, thats for mods. you are not a mod. you are a room owner. right?
 
amazing how diverse and awesome a group hangs out on SE
 
@AwalGarg lulnub
 
people from all over the world
it's cool
 
@MickLH didn't got that. is he a mod?
then its ok. i take my words back
 
3:43 PM
Notice the blue name
 
blue name?
 
Yes the name being written in blue all across the chat
 
@MickLH ohh. he is both. i certainly take my words back
so shouldn't his name be blue and italics?
what is SHK?
 
brb, I need to finish some proofs.
 
Well damn, I'm still pretty stumped as to how to structure this code
I think I am really going to keep all the numerical approximations real-only, and implement the complex approximations in terms of them
 
r9m
4:01 PM
@Chris'ssis posted my solution in chinamath's link :D
 
@r9m Great! You're awesome! :-)
(I'll read it soon)
 
@meer2kat Sorry.
@meer2kat Forgive me!
Who is starring?
 
@Sawarnik Not me starring, but I've noticed some kind of culture difference between here and India, just a tip if you want people to forgive you, don't bark commands at them to do so.
 
@MickLH Oh! What should I say? [And I passed 2 mins edit time :(]
 
@Sawarnik You should change your behavior and let them decide to forgive you on their own
 
4:08 PM
That's tougher!
@AwalGarg Stop starring!
 
@Sawarnik i am not the one, i would rather flag it. but i wonder why you want the starrer to stop starring. I am starring in a different way. I am a star everywhere - the intelligent guy you see. starring everywhere... but i dd starred @MickLH's comment about not barking comments...
its curious to see, someone did star them (and even the one saying - Who is starring !)
 
math.stackexchange.com/questions/758900/… this guy always comes up with challenging yet interesting questions.
 
@AwalGarg So? Will you go hunting?
 
@DanielFischer no, i don't care about rep...
@DanielFischer i was reading the advertisement thread. i found it interesting to see dynamic images based on server content. thought of sharing
 
4:20 PM
Ah.
 
@AwalGarg What will you flag?
 
Hi.
 
@ParthKohli Hi!
@ParthKohli What have you been doing these days?
 
@Sawarnik More of math now. :P
 
Yay! What exactly?
 
4:28 PM
Hi, I have seen if $lim f(x)\ne 0$ as x tends to infinity then is there exist a sequence $(x_n)$ such that $x_{n+1}-x_{n}\ge \varepsilon $, I don't understand why we have the inequality. Thanks!
 
Just the theory of polynomials and stuff.
We'll continue everything in that room.
 
@Sawarnik for what...?
 
@Chris'ssis I thought I changed them all to $k$... let me look
 
How are residues calculated?
$$\text{residue}\left(\zeta (s)-\frac{\zeta '(\rho _n+s-1)}{\zeta \left(\rho _n+s-1\right)},\{s,1\}\right) = 1$$

$$\text{residue}\left(\zeta (s)-\frac{\zeta '(k+i n+s-1)}{\zeta (k+i n+s-1)},\{s,1\}\right)=0$$
$\rho_n$ is a Riemann zeta zero, trivial or non-trivial.
 
@meer2kat Since your room was deleted due to me.
 
4:34 PM
@Sawarnik It's okay
 
Yay! :D :) :))
 
@robjohn It's ok. I use to mix them up when I work on more open proofs. :-)
 
@AwalGarg I'm a moderator... my name is in blue in chat and there is a $\unicode{x2666}$ after my name in my profile.
 
Plus the mean square to keep you frightened! :D
 
Can anyone help me, in the expressions above should I expand Riemann zeta at the pole, s=1?
 
4:40 PM
@robjohn I never expect it was a diamond..^^
 
r9m
4:52 PM
@Chris'ssis r9m blushes <|o^_^o|> and then -- [] -- >-|o -- >dives out of the window :P
 
@r9m :-)
 
5:06 PM
how do i know a solution exists for $\gamma_0,\ldots, \gamma_n$ for the system of equations $\frac{b^{k+1}-a^{k+1}}{k+1}=\sum_{i=0}^n\gamma_ix_i^k$ (where $k=0,\ldots, n$)? $a,b,$ and the $x_i$s are given.
(i've got that it's unique, how do we know the system isn't inconsistent though?)
 
@r9m are you alive?
 
r9m
@Sawarnik ya its only 2 floors .. and I landed on a bush ... so alive :P
 
@AlexanderGruber If the $x_i$ are all different, you have M. Vandermonde telling you it is consistent.
 
@DanielFischer ah right of course, thanks
 
@AlexanderGruber Hey
What do you think about this comment here? I was about to report it, but thought it would be wise to see here first.
 
5:12 PM
@N3, how's it going.
@N3buchadnezzar off topic at best, offensive at worst. i've removed it.
 
Yeah. I do not think it was meant harmfull, but it could easilly be interpreted that way.
@AlexanderGruber How are you doin ?
 
@N3buchadnezzar yeah, no need for anything punitive, just a removal.
i'm stressed out! semester's ending.
 
Zomg
My first exam is 30th april
 
i have projects due before finals, then finals, then quals. it'd be real nice if MSE would quit misbehaving for the next couple weeks. T.T
 
@AlexanderGruber Arrest the usual suspects.
 
5:22 PM
@AlexanderGruber Finals when being a PhD student? Well good luck
@DanielFischer Is not the saying "Round up the usual suspects" ?
 
@N3buchadnezzar yup.
 
@N3buchadnezzar Mistranslated. I've seen it more often in German than in English.
 
You could just execute the usual suspects and be done with it.
 
For general $f(n,m)$ such that $\lim_{n \to \infty}f(n,m),\lim_{m \to \infty}f(n,m)$ exist, will $\lim_{\text{min}(n,m) \to \infty}f(n,m)$ exist?
 
Generally not.
 
5:24 PM
It seems that it will be highly dependent on how $(n,m)\to (\infty, \infty)$, but I could be wrong.
 
@N3buchadnezzar It's "Wir müssen ... ". (using "ü")
 
@Chris'ssis I write Erdös! That should tell how picky I am about correct spelling.
 
I need to figure out where to grade. I wonder of Starbucks will let me stay there for four hours.
 
@N3buchadnezzar Was that a ő or a ö?
 
@N3buchadnezzar hmmm, am I wrong then?
 
5:28 PM
@Alyosha that's a pretty interesting question.
@Mike yes.
 
@Alyosha The latter ;)
 
If you're to be picky, at least use the Hungarian rather than the German!
 
@AlexanderGruber good to know. guess it's time to pack up and head out.
 
SF gains 1 point.
 
@Alyosha My joke was that i misspell Erdös on purpose using the german ¨ instead of the hungarian ő, which actually does differ in pronounciation..
 
5:30 PM
@N3buchadnezzar It seems it was I who gave up points to the SF.
 
@Alyosha SF?
 
Supreme Fascist.
 
@AlexanderGruber i should probably buy a table at some point
 
@Alyosha What does that notation mean? $\min(m,n)\to\infty$? Do you mean simply $(m,n)\to\infty$?
 
blahblahblahblah
 
5:36 PM
@meer2kat Don't be spamming, girl.
2
 
@PedroTamaroff <3
 
@PedroTamaroff I mean whatever it means here.
 
@meer2kat If you're bored, here's a toy: nowykurier.com/toys/gravity/gravity.html
@Alyosha Yeah, weird notation.
 
@meer2kat I can irritate you :D
 
I assume it means any path in the $(n,m)$ plane that goes to $(\infty, \infty)$
 
5:38 PM
@PedroTamaroff OH I HAVE AN APP LIKE THIS
@Sawarnik No.
@Sawarnik I will leave.
 
@meer2kat Ok, then get bored :)
 
@Sawarnik Don't be an asshole.
Your kind are turning this chat into a sewage spill.
6
Really.
 
@PedroTamaroff All asses have holes.
 
@WillHunting Thanks, Sherlock.
 
sup @Pedro
 
5:40 PM
@FernandoMartin Hello.
Slept a good bunch,.
 
@PedroTamaroff :D
 
@Sawarnik I'm not smiling.
 
This room is full of garbage.
 
@PedroTamaroff Ok :D I studied the precise definitions of limits today.
 
5:52 PM
@Sawarnik Pretty simple right? Don't stagnate! Derivatives now
 
Can anyone hint me with the following:
If $G$ is abelian and finite, prove that there is a subgroup of $G$ isomorphic to $G/H$, where $H$ is a subgroup of $G$.
 
What can you say about finite abelian groups?
 
I'm not sure what's of relevance.
Well, it and its subgroups are finitely generated.
Ah, is that it?
 
6:07 PM
Do you know about the structure theorem for finitely generated abelian groups?
 
Yes, though not the proof.
 
Well, any finite abelian group is isomorphic to $\Bbb Z_{p_1}\oplus\dots\oplus \Bbb Z_{p_i}$
where $p_j$ are powers of primes
 
@FernandoMartin DAT NOTATION.
PAL.
 
Can you prove the result for finite direct sums of $\Bbb Z_{p_i}$s?
@Pedro: What's up with my notation?
 
@FernandoMartin $p_i$ looks prime to me. Not prime power. =P
 
6:11 PM
I was too lazy to type ^\alpha_i
 
hello
 
@FernandoMartin How do the $p_j^{\alpha_j}$ relate to $|G|$?
 
thank you
 
Is $\alpha_j= \nu_{p_j}(|G|)$?
 
What's $\nu$?
Obviously $\Pi p_j^{a_j} = |G|$
 
6:12 PM
$p$-adic order
 
I don't know what that means
 
The maximum $n$ such that $p_j^n| |G|$
 
I think that's correct
In any case, I think you can prove this without using the structure theorem
 
Yes, I guessed I was overcomplicating.
Would I explicitly construct some sort of isomorphism?
I considered tweaking the homomorphism $\phi(g)=gH$ to make it an isomorphism, but I don't think I can.
 
@Alyosha You want to prove that for any $H\leqslant G$, there is $K\leqslant G$ such that $K\simeq G/H$. So you're proving that $G$ is an extension of any of it's subgroups.
Suppose first that $G$ is a $p$-group.
Since $G=\bigoplus G(p)$.
 
6:21 PM
$G(p)$ is the $p$-primary component of $G$?
 
Aha.
I would try induction on $n$ where $|G|=p^n$. $n=1$ is trivial.
 
I don't know the definition of extension. In your first line, is $G$ an extension of $K$ if $H$ is nontrivial?
 
@Alyosha Nevermind.
 
Does the induction not prove it?
 
@FernandoMartin No, it is definitely not p-adic order, since $\Bbb Z_2 \oplus \Bbb Z_4$ has $2^3|8$
 
6:28 PM
True
 
@FernandoMartin checketh thyself before thoust wrecketh thyself
 
@Mike Is this concerning the value of $\alpha$ in the structure theorem?
 
yes
every finitely generated abelian group is isomorphic to a direct sum of cyclic groups of prime power order
 
But if $5^3||G|$ there must be a $\mathbb{Z}_{125}$ in the direct sum?
 
no.
we write $$G \cong \Bbb Z_{p_1^{\alpha_1}} \oplus \dots \oplus \Bbb Z_{p_r^{\alpha_r}}$$
 
6:31 PM
too busy to think @Mike
 
there's no reason the $p_i$ can't repeat themselves
there's no reason the $\alpha_i$ can't repeat themselves too
@Alyosha counterexample to your question: $\Bbb Z_5 \oplus \Bbb Z_5 \oplus \Bbb Z_5$
 
@Mike I made an error in assuming $(1,1,...,1)$ was automatically a generator.
When of course there rarely is a single generator.
 
:D
ah, right
but if your group is cyclic, then we might as well just stop there
because "cyclic group of order __" is a perfectly nice descriptor
 
Does the number of times $p$ appears in the direct sum (obviously counting $p^2$ twice, for instance) equation equal the $p$-adic valuation of $|G|$?
 
sure
 
6:40 PM
Excellent.
I think I'll try to solve the rest by myself now, thanks all.
 
Guys, please, a hint on how to solve this: $\int [x]|\sin{\pi x}|dx$
 
What do you mean by $\int [x]$?
 
@mirgee Is that indefinite?
 
$[x]*|sin\pi x|$ or?
 
6:50 PM
Then you'll have to define a big piecewise function.
The solution family will we infinite dimensional over $\Bbb R$.
 
@Studentmath Yes, it is integer part multiplied by the absolute value
 
Ah, integer..
Yeah, if it's indefinite that will be a big piecewise function
 
@seaturtles Hey there.
I wonder if you can help me understand some algorithm for obtaining the Smith normal form over an Euclidean domain.
 
hello
sounds annoying but okay
an ED? why not PID?
 
6:57 PM
@seaturtles Yeah, it's the same thing. In the ED you make the norm smaller, and in the PID you make the length (# of prime factors) smaller.
Let me get the excerpt.
 
I'm not sure I know what you mean by "big piecewise function", I will have to split the domain according to the sign of sin and define primitive function for infinitely many intervals because of the integer part, is that so
But the solution is quite compact
 
@seaturtles That's the statement. Not that you don't know it.
 
$\frac{[x]}{\pi}([x] - (-1)^{[x]}\cos(\pi x))$ I have no idea how this was arrived at :(
 
THM 3.8
Proof starts down below.
I am not sure about The second paragraph in this last page.
"We can also arrange to have $b_{11}\mid c_{kl}$ for every $k,l$."
 
Pedro do you gotta do whole images like that
 
7:02 PM
I mean, I cannot see how to do that.
 
thanks bro
 
@PedroTamaroff it is soo tiny
 
@N3buchadnezzar oh, sheesh
I didn't realize.
@seaturtles can you read it?
 
after zooming in yes, although the proof seems to have started on pg182 and the reason for the fact you're asking about relates to applying the initial process on that page
 
@seaturtles yes, I said the proof starts there =D
@seaturtles but I am not sure why we can "keep $b_{11}$"
 
7:06 PM
oh, your second link is to that page
 
as far as I cna tell, the $b_{11}$ (the pivot) will change eventually.
For example, suppose we have the matrix $$\begin{pmatrix}3&0&0\\0&11&-9\\0&-7&8\end{pmatrix}$$
How can we make what Jacobson says to get it to the said form.
Without changing the $3$ in the upper left.
A first a application of the algorithm, which'd be summing the second row to the first and dividing, would give us $$\begin{pmatrix}3&2&0\\0&11&-9\\0&-7&8\end{pmatrix}$$
 
@Mike nah man. buy a standing desk.
 
@PedroTamaroff I don't see where in the proof it says $b_{11}$ is kept?
 
Oh, I get it now...
 
@seaturtles Err, I assumed that since he uses the same symbol...
 
7:13 PM
:)
 
Even so.
How do I get the matrix as Jacobson says?
In my example.
@seaturtles (That I did consider, but I don't know how to argue we will get to the form he claims.)
I mean, now that I got $$\begin{pmatrix}3&2&0\\0&11&-9\\0&-7&8\end{pmatrix}$$ after summing row 2 and reducing, should I change my pivot to the two in $a_{12}$?
 
PSA: Please do not spam the star queue with strings of random messages.
6
 
Doing so, I end up with $$\begin{pmatrix}1&0&0\\0&33&-9\\0&-21&8\end{pmatrix}$$
 
right
 
Which satisfies J's conditions.
 
7:19 PM
I was busy writing all of that out...
 
Ah, well.
In this case, I got a $1$.
 
@AlexanderGruber we can remove stars if we really want to :)
 
@PedroTamaroff It certainly satisfies me, lol.
 
I wonder if I can pull of an example where I get a $2$, say.
 
@PedroTamaroff I understand how extension can be used now, thanks.
 
7:20 PM
@AlexanderGruber nonetheless i desire something to write on
 
@seaturtles I can remove stars too. I can also remove users.
>:(
 
@seaturtles At any rate, what's the justification for this?
 
I am the only one who can remove all of you, mwahahaha.
 
Other than "repeat till things are good."? =P
 
@AlexanderGruber from chat? cool. they don't give room owners that ability >:(
 
7:21 PM
@seaturtles I don't have to do it often, but there are cases when it's been necessary
 
@PedroTamaroff this process you just did decreased $\delta(b_{11})$. in fact, it's guaranteed to do that. what happens when you can't decrease $\delta(b_{11})$ anymore?
 
I thought studying mathematical physics is going to make me smarter, I was wrong. It has only revealed how dumb I actually am.
The idea of studying it was dumb in the first place
 
@mirgee studying anything will, first and foremost, show one how little they know
we're all dumb
we're just trying to be a little less so
 
@seaturtles It is zero.
 
$\delta(b_{11})$ is zero? mmm, no. what state of affairs would eventually prevent the process you just used from further decreasing $\delta(b_{11})$?
 
7:35 PM
@seaturtles I don't know.
Well, I might. I'm not sure where you're getting at.
Or what part of the algorithm we're in.
 
the algorithm decreases $\delta(b_{11})$ if and only if the remainder of one of the other entries mod $b_{11}$ has $\delta$ smaller than $\delta(b_{11})$.
 
@seaturtles Correct.
 
there are only finitely many possibilities for $\delta(b_{11})$, so eventually this algorithm minimizes it
at that point, the negation of the second part of the iff I just stated above becomes true. what is the negation?
the negation is that $b_{11}$ divides all those entries
 
@seaturtles Yes.
 
well, I should have said iff "has nonzero $\delta$ smaller than $\delta(b_{11})$"
 
7:38 PM
alright alright.
 
not sure of tone
 
@seaturtles Well, of course if the $\delta$ is zero, who cares? =)
 
nerds
 
@Mike wusser
 
7:58 PM
Mmm
$$
\int_0^{2\pi} \frac{1 - \cos nx}{1 - \cos x}\,\mathrm{d}x
= 2 \int_0^{\pi} \frac{1 - \cos nx}{1 - \cos x}\,\mathrm{d}x
$$
Something obvious I am missing ?
 
@N3buchadnezzar Periodicity?
 
@N3buchadnezzar Periodicity, parity
 
But the $\cos nx$ ?
 
Still even, and has period $2\pi$.
 
I know that $\int_0^{2\pi} f(\cos x) \,\mathrm{d}x= 2 \int_0^{\pi} f(\cos x)\,\mathrm{d}x$
 
8:02 PM
@N3buchadnezzar Let $f_n(x)=\rm your\,\, thing$.
Then $f_n(x)=f_n(-x)$.
 
$\cos nx$ is a polynomial in $\cos x$
 
And $f_n(x)=f_n(x+2\pi)$.
 
@DanielFischer Ah! clever man
 
@DanielFischer Also that.
 
8:28 PM
@robjohn when you have time, take a look on it pls and let me know if I missed something.
I'm a bit sleepy now.
 
8:41 PM
0,1,70,1107,8092,28165,135954,... ?
 
r9m
52,63,94,46, _ ?
 
8:55 PM
18
 
r9m
@Chris'ssis yass !! :)
 

« first day (1353 days earlier)      last day (3669 days later) »