« first day (679 days earlier)      last day (4638 days later) » 

21:00
@Gigili i figured.
William's was 12 seconds earlier?
I'll something you all. I can't tell because I'll get suspended.
@anon Hm. But it seems pairwise coprimality is not needed. Just that $(x_1,x_2,\dots, x_n)=1$ and that $x_i$ doesn't repeat, or repeats $k \le |x_i|$ times.
@Gigili william answered a few seconds earlier...
21:02
@anon 12 seconds? rly?
Someone posted an answer 3 minutes earlier than me but edited it over a million times.
@PeterTamaroff My version requires that $x_n$ is coprime with each of $x_1,x_2,\cdots,x_{n-1}$. Of course for the induction hypothesis to hold we want $x_{n-1}$ coprime with $x_{n-2},\cdots$ and so forth, which amounts to the full requirement of pairwise coprimality.
Errata in there $\le$ is supp to be $<$.
@anon Ugh, right.
I'm going to write this as an answer.
@anon Wait, please.
I WAIT FOR NO ONE MORTAL.
21:05
another one down! that makes 2 unanswered EC questions i disposed off.
@anon Fool. I'm no mortal.
@anon Please, do wait, listen (well, read).
k
2
@Gigili It's now 3 vs 2 ;-)
@anon I need to establish a condition on the multiset we were talking.
For example,
$0\not\in S$
21:06
@anon Sure. But
$$1 + \frac{1}{4} + \frac{1}{4} + \frac{1}{4} + \frac{1}{3}$$ is clearly not an integer.
but the hard mode version is not your question
@robjohn i've decided to dispose of old elliptic curve questions rather than race against arturo and brian.
those are lost causes.
$$1 + \frac{1}{4} + \frac{1}{2} + \frac{1}{9} + \frac{1}{3} + \frac{1}{{14}}$$ isn't either.
21:07
@Eugene probably a wise move, but sad.
However, $9$ and $3$ are not coprime.
Same with $4$, $4$, $4$.
What's your point?
@robjohn well i don't think i can compete with them unless i raise my typing speed by a factor of 50
@anon That coprimality is not needed.
Yes, I know. What of it?
21:08
@Eugene they have to sleep sometime! :-)
@anon That then induction falls apart... ='(
@robjohn not from what i've seen!
Indeed.
But have the idea, I just can't make it into a proof.
Darn.
@PeterTamaroff practice and experience helps there.
21:09
@anon Even if we summed $4$ $1/4$ths, summing a $1/9$th would make the sum a non integer.
@PeterTamaroff indeed.
@Eugene I need to think about the relations between the numbers in the set.
@Eugene shhh.. they'll start to suspect
I think the order is important.
@robjohn sorry!
21:10
Also the number of repetitions, and coprimality.
So many variables!
welcome to number theory! it only gets worse.
@Eugene Yay!
Challenge accepted, dude.
The characterization of an integer being the sum of two squares is a good start in number theory, I think.
I think it got me my first bounty here
@robjohn Don't you mean $4$ squares?
@PeterTamaroff is there anything that can't be written as 4 squares?
21:13
@robjohn Dunno. But $3 \neq a^2+b^2$.
@PeterTamaroff no
@PeterTamaroff yes, but proving the characterization of when an integer is the sum of two squares is interesting and a good introductory topic
@robjohn Oh! OK. Couldn't get your point.
quadratic reciprocity is a good gateway into number theory
@DylanMoreland i worked out the elliptic curve problems!
21:15
for example, $x^2+y^2\not=76$
@Eugene I'll keep thinking about the theorem. Maybe later on I'll prove it.
I find Diophantine equations more interesting than quadratic reciprocity...
@anon reciprocity in general motivates so many questions in NT
@Eugene BTW, I reserved this book in a bookshop today amazon.com/God-Created-Integers-Mathematical-Breakthroughs/dp/…
I don't like Diophantine equations :(
21:16
Amazing content.
@ZhenLin diophantine equations are a generalization of reciprocity.
Do the users who answer questions get updates if the OP edits the question?
@anon i love em!
@skullpatrol Nuuu.
@Eugene So, can you tell me why reciprocity is interesting?
21:18
I don't get it. You can say who answers first before an hour but not after it?
@PeterTamaroff Then the OP could almost completely change the question from the original.
@skullpatrol Yes. But he/she should tell about an edit.
@ZhenLin you can see this
@robjohn @robjohn Thanks for your explanation and for your answer to my question on the main site.
@AméricoTavares any time. Thank you for the points :-)
21:21
@ZhenLin a lot of algebraic number theory machinery was motivated by reciprocity
@Eugene Anyone can point to a fact. Why is this fact more interesting than any other? :p
@AméricoTavares Find a proof of the Euler-Maclaurin Sum Series and you'll see the integral that gives the remainder term.
@robjohn Your answer was easier for me than any other.
@robjohn I almost got suspended for adding in the "textbook answer" to my question :(
@ZhenLin can you be more specific? it almost seems like you're asking why some math is more interesting than any other...
21:22
@PeterTamaroff Why are you changing your question so drastically?
I'm basically a layperson when it comes to number theory. I've never taken a basic course.
@skullpatrol how did they justify that? Were they worried about plagiarism?
Your theorem applies to pairwise coprime integers just fine.
@ZhenLin reciprocity is a useful piece of machinery actually
OK, can you give an example?
21:24
@ZhenLin for instance you can count the number of points on certain elliptic curves using legendre's symbol.
@robjohn I'm not sure, I wanted answers from those users who showed interest in the question, so I put it into the "comments" section of each of their answers. The mods said this was SPAM.
@skullpatrol where?
@ZhenLin in chapter 8 of ireland and rosen, they show how you can count the number of solutions of diophantine equations over finite fields using gauss and jacobi symbols!
@skullpatrol You wanted them to change their answers? That's not how it works.
@Eugene OK, now I have some idea of what reciprocity is useful for. Thanks!
21:27
@skullpatrol You certainly got a lot of attention to the question.
@ZhenLin it's tedious though if you've only seen quadratic residues in an elementary number theory course though. then it looks like it's developed for the sake of being developed.
@ZhenLin also you can use it to prove interesting stuff about taxicab numbers
I mean, before, the only thing I knew about counting points on an elliptic curve was to use the Frobenius action over finite fields and invoke the Lefschetz trace formula :p
@robjohn I'm thinking of putting a bounty on it :D
@skullpatrol negative 50 points or minus 50 points?
@robjohn Both :D
21:29
answer this question and risk losing 50 points
Is that how bounties work?
@skullpatrol no, you can't have a negative bounty
@robjohn I'll see it in detail. I've read long time ago the evaluation of $\zeta (s)$ by the Euler-Maclaurin Sum in Edwards' Riemann's Zeta Function (p. 114), and one or two more computations, but it is actually something I still have to understand better and be able to apply by myself.
@AméricoTavares Good book! I have it. I need to reread some of it I think.
@anon I just added that the numbers are coprime.
21:32
@robjohn What amount of a bounty do you suggest, oh great mean square bounty hunter?
@AméricoTavares I find the EMS formula quite handy, indeed!
@anon Happy to hear that! But maybe it can be applied to the harmonic numbers
We just need to split the harmonic number approprietly and apply the theorem.
No, that won't work.
@skullpatrol I got a bounty this morning that I had not noticed before, thanks to Américo. I don't know if you can put a bounty on a CW question.
@ZhenLin you can see here to see how ken ono uses the legendre symbol to count the number of points on certain classes of elliptic curves with CM over finite fields
21:34
@robjohn But I'm not satisfied with any of the answers :(
$$\eqalign{
& 1 + \frac{1}{2} + \frac{1}{3} + \frac{1}{4} + \frac{1}{5} + \frac{1}{6} + \frac{1}{7} = \cr
& 1 + \left( {\frac{1}{2} + \frac{1}{4} + \frac{1}{6}} \right) + \frac{1}{3} + \frac{1}{5} + \frac{1}{7} = \cr
& 1 + \frac{1}{2}\left( {1 + \frac{1}{2} + \frac{1}{3}} \right) + \frac{1}{3} + \frac{1}{5} + \frac{1}{7} = \cr} $$
@ZhenLin also Jacobi symbols are a very canonical example of dirichlet characters!
@PeterTamaroff You can split the harmonic number into a sum of sums, wherein the theorem applies to each individual sum, hence write the harmonic number as a sum of nonintegers, but that doesn't establish that the harmonic sum is itself noninteger.
aaaaa, lots of words I don't know!
@robjohn It is proved in Apostol's Mathematical Analysis.
21:35
@skullpatrol You can try to put a bounty and see if it works. As for how much, that is up to you.
The number not in parenthesis is a sum of exclusively coprime numbers.
@ZhenLin it's a rich topic actually. BUT... i like diophantine equations better
@AméricoTavares It is proven in a number of places. It is similar to the proof of Taylor's theorem (power series)
@AméricoTavares repeated integration by parts.
@anon I'll try to make an extension then.
@ZhenLin so many more beautiful results in DE!
and i don't mean differential equations
21:38
I have to leave my nice sunny courtyard here and walk to the library where the exam is being held that I am proctoring. See you all later!
@robjohn you too eh? good luck then! bye!
@robjohn Just a final question. Since a duplication of my question is still not answered on MathOverflow, do you think I can link to your answer there?
@robjohn See you later!
 
1 hour later…
22:41
@robjohn Hi!
23:09
oh lawd I is not gettin differential equations
23:27
400 points?? skullpatrol, you are totally screwy
This place is infested with harmonic analysts. Why the fokke are they working at 1:40AM?

« first day (679 days earlier)      last day (4638 days later) »