« first day (1499 days earlier)      last day (3516 days later) » 

12:01 PM
I wanted to use that bookmarklet on Google Groups some time ago. Didn't work either :-( (Which is a pity - Google Groups is, in my opinion, the way to discuss things with selected groups of people which is easiest to create. Although it is less organized than some kind of bulletin board/forum.)
 
12:13 PM
@robjohn Thank you for that comment, that makes sense. Facebook comments don't work I am sure, I haven't tested other aspects(just saying so you know).
 
@IceBoy I told him he should do that, but it's more likely that the upvote went to Noam Elkies's (really good, as usual) answer to Thursday's own question.
2
 
This is actually the first time in the existence of Thursday that I have seen him drop off the first page of monthly rep.
 
@DanielFischer interesting
 
There should be a badge for this :-)
 
what do we call it?
 
12:25 PM
No idea.
 
super negativity
 
I am working with generating functions and am required to prove that the generating function for the sequence $\{a_k\}$ where $a_k = (-8)^k$ for all integers $k\geq0$ is $\frac{1}{1+8x}$ and I have gotten it to:

$g(x)[1+8x] = \lim \limits_{n\to\infty} 1 - (-8)^{n+1}x^{n+1}$ I can see that I want to take both of those ${n+1}$ terms to be $0$, but I don't know how I can say this is alright.
Is it appropriate for me to even ask that on chat here?
It works for $0\lt x\lt\lt\lt1$ I suppose
 
Isn't it sufficient to show that $(1+8x)\sum_{k=1}^\infty (-8)^k x^k = 1$, when viewed as formal power series?
 
I suppose so, would this be easier?
Than using the geometric trick($g(x) - xg(x)$)? Or is it that I can't move forward from what I have above
 
To be honest, I haven't used generating functions for quite a long time. So maybe I should let someone else answer this. (I don't want to say you something incorrect.)
 
12:39 PM
That's okay xD. I shall ask on the actual stack exchange
 
@MartinSleziak Thank you for that, it does seem to be what I am looking for. I just posted my question unfortunately.
 
12:57 PM
http://math.stackexchange.com/questions/927548/showing-that-a-generating-function-is-equivalent-to-some-fraction?noredirect=1#comment1914690_927548

"but it has no meaning mathematically", surely this isn't true?
Or he is still talking about $x$ being indeterminate, I guess I will clarify
 
1:18 PM
@robjohn It's OK. Indeed, it's pretty hard.
 
@Chris'ssis I would be interested to see an answer if it exists
 
@robjohn If there exists one, that will appear in my book.
My philosophy is this (it may sound pretty crazy): I'll publish my book only if I manage to create the nicest book on this topic from all times. Each page is meant to be absolutely amazing.
 
Can someone read the comments under the answer here http://math.stackexchange.com/questions/927548/showing-that-a-generating-function-is-equivalent-to-some-fraction/927553?noredirect=1#comment1914748_927553

And tell me how we are miscommunicating?
 
1:39 PM
@robjohn For this one I can tell you almost I'm almost 100% sure that there exists a nice form, but if we choose a certain type of $n$.
@robjohn perhaps it's about the form $n=2k-1$
 
@Chris'ssis I have $g(x)[1+8x] = \lim \limits_{n\to\infty} 1 - (-8)^{n+1}x^{n+1}$ for question of showing $a_k = (-8)^k$ for all integers $k\geq0$ is $\cfrac{1}{1+8x}$

You seem to know a thing or two about series. Am I allowed to touch the indeterminate $x$ at all? E.g. I want to say it is confined within $\frac{-1}{8}\lt x\lt\frac18$
 
@Algebra I don't know what you mean by "Am I allowed to touch the indeterminate x at all? "
 
Am I allowed so state it has to be inbetween those two bounds?
I got it to $g(x)[1+8x] = \lim \limits_{n\to\infty} 1 - (-8)^{n+1}x^{n+1}$ using that geometric $g(x)-xg(x)$ but now I have it only equalling $\frac{1}{1+8x}$ if that limit takes $-8^{n+1}x^{n+1}\to 0$
Which is only true for that interval of $x$
 
1:56 PM
@Chris'ssis I will look at that, but I have to give an exam at UCLA today. I may not get much time until this later this afternoon.
 
@Algebra You asked in a comment how is this step achieved $\displaystyle \sum \limits_{n=0}^\infty (-8x)^n$ to $\displaystyle \frac{1}{1+8 x}$. This is nothing but a a geometric series with some restrictions.
@Algebra do you know the geometric series?
 
Yeah, but isn't that achieved by taking $g(x)=1+x+x^2+\dots+x^n$
$g(x)-xg(x)=1-x^n$, and then take $g(x)(1-x)=1-x^n$ goes to $\frac{1-x^n}{1-x}$
I tried that for this case, where I have $(-8)x$, and I get that limit problem. Maybe I will go back and try it all again
 
@Algebra Choosing the proper bounds, that limit goes to $0$ as some already suggested in your answer, or do you refer at something else?
@robjohn could you take a look at @Algebra's question, I might misunderstand his point?
@robjohn OK
 
I suggested that, but Snufsan says that " but it has no meaning mathematically" "The fact that we write it is just writing it, we dont care about it's mathematic meaning"

I will leave it at that, thank you for your efforts I will just keep at it
 
Hi @Anastasiya-Romanova
 
2:08 PM
Hi @WillHunting! You're always kind to me
 
@Anastasiya-Romanova Why did you change your username?
 
@Algebra by the way, to be more exact, what is $$1+x+x^2+\dots+x^n$$?
 
@Algebra the variable is an indeterminate, you don't bound it at all
one speaks of formal power series
 
It is only in form.
 
@WillHunting Today I studied history about her
 
2:09 PM
But then how does $g(x)[1+8x] = \lim \limits_{n\to\infty} 1 - (-8)^{n+1}x^{n+1}$ lead me to proving $g(x) = \frac{1}{1+8x}$
 
@Anastasiya-Romanova Did you watch Good Will Hunting?
 
@Algebra since (1+8x)(1-8x+64x^2-...) expanded equals 1, we know the latter is the inverse of 1+8x in the formal power series ring
by definition $x^n\to0$ as $n\to\infty$ in the formal power series ring (technically, using what's called the $(x)$-adic topology it has)
 
@WillHunting I become her fan now!
 
Wait so $x^n \to 0$ as $n\to\infty$, doesn't that imply $0\lt x\lt\lt 1$? That was my confusion in the first place
 
@WillHunting Yes!
 
2:12 PM
@Algebra $x$ is not a number
 
But parent didn't know. lol
 
@Anon But is treated like a number being multiplied by itself $n$ times, and somehow equalling $0$, can you see why that is confusing to me?
 
the product of $\sum a_nx^n$ and $\sum b_mx^m$ is defined to be $\sum(\sum_{n+m=k}a_nb_m)x^k$ in the formal power series ring
@Algebra everything in a ring is treated "like a number": you can add and multiply them
 
I think formal power series ring does not make sense to him at all.
 
that doesn't mean they are numbers
do you know what a ring is?
 
2:14 PM
A ring is what you put on a finger at a wedding.
4
 
Abelian group with two operations, commut etc
 
have you heard of a polynomial ring?
 
@WillHunting Why my nickname is still V-Moy?
 
Not that I recall
 
@Anastasiya-Romanova What do you mean?
 
2:15 PM
look it up
 
@Chris'ssis and @robjohn Please take a look my new problem: math.stackexchange.com/q/927427/133248
 
F[x] is the ring of all F-coefficient polynomials in a formal variable x
F[[x]] is the ring of all formal power series in the formal variable x
 
@WillHunting In my PC my display name is V-Moy in the chat room
 
by definition (for your purposes anyway) equipped with exactly the multiplication I defined above
 
@Anastasiya-Romanova You may need to log out, log in and refresh your browser for changes to be effected.
 
2:16 PM
you don't speak of limits in F[[x]] unless you know what the topology is, and you don't know what the topology is so I don't think you should even be talking about limits in it
 
Alright, so at my level I can just write, x^n goes to zero here, and this guarentees $8^{n+1}$ goes to zero
 
I would not even write that
 
@robjohn I think the core of that problems gets reduced to computing
 
Okay, I see. Good @WillHunting
 
8^(n+1) does not go to 0, it's just as close to 0 as 1 or 1/10000 is. it's the x^n that's going to 0.
 
2:18 PM
@robjohn see above
 
@Anastasiya-Romanova What is your favourite calculus book?
 
@Anastasiya-Romanova OK
 
@WillHunting Calculus 9th Edition - Dale Varberg, Edwin Purcell, and Steve Rigdon
 
@Anastasiya-Romanova Never heard of. I like Marsden and Weinstein's Calculus I, II and III.
 
@Chris'ssis Thank you. Don't forget to upvote. hohoho
 
2:21 PM
Sometimes I write in English as if I'm drunk, although I almost never drink. Today is just one of those days.
 
@Chris'ssis Alcohol tastes terrible.
 
@WillHunting Never heard of.
@WillHunting I also visit Paul's Online Math to learn calculus
 
@WillHunting Is your plan to become a professor in the future? :-)
 
@Chris'ssis Yes, I hope to find a job in some university in the US. I don't want to return to my country.
 
@WillHunting Nice.
 
2:25 PM
Not nice :c
'I don't want to return to my country'
 
@Chris'ssis You should be one too.
@Hippalectryon There is nothing here for me. I don't like the people here and they don't like me. I am too different.
 
Good night everyone! Zai jian @WillHunting!
 
@Anastasiya-Romanova See you in your dreams!
 
@WillHunting Come to France :D
 
@WillHunting I don't manage to get a job in the automotive industry, and then I can barely imagine such a career in some university. :D
(it's also true I put the correct price on myself)
 
2:27 PM
@Chris'ssis Uh ? a job in the automotive industry ?
 
@Hippalectryon I hope to be born in Germany or France in my next life. I believe in rebirth.
 
@Hippalectryon Yeah, that was my last try. :-)
 
@WillHunting Hence the constant accounts change :P
@Chris'ssis really ??
@Chris'ssis What part of the automotive industry exactly ?
Well, as long as you don't apply for a Comcast job, I guess it's okay :c
 
@Hippalectryon steering wheels manufacturing
 
Before I sleep I just wanted to say thank you to users, Anon, Chris's sis and others who helped, I will think more about it over the next few days and hopefully all will be well. Goodnight
 
2:36 PM
@Algebra See you in your dreams!
 
@Algebra Don't let the bed bugs bite!
 
I am concerned now @will
 
@WillHunting Good luck then! :-)
 
@Chris'ssis Which languages do you speak?
 
@WillHunting Italian, English, a bit of German and Spanish
 
2:40 PM
@Chris'ssis Do you speak Romanian? Is there such a language?
 
@Chris'ssis Waaaaa. WAAAAT ?
Manufacturing ? you ?
 
@WillHunting Well, I didn't count the native one. ;)
 
@Chris'ssis Why don't you apply for a job with more qualifications ?
 
@Hippalectryon Yeap.
 
@DanielFischer
 
2:42 PM
@Chris'ssis Move to Germany and start teaching at my university :)
 
@rehband Nooooo France
 
@Hippalectryon Where in France are u from by the way?
 
You are so lucky to be French or German. I envy you.
 
@rehband Dublin
@rehband Kidding :P
Paris
@WillHunting Where are you from ?
 
@Hippalectryon Nice
 
2:47 PM
@Chris'ssis Wow that's good... I guess
I know nothing about that field
 
@Hippalectryon It's amazing, a very complex area.
 
@BalarkaSen ?
 
@rehband hehe :-)
 
@Chris'ssis Could you be a bit mire specific on what part you were working ? (I mean, it's a very very very broad field)
 
@DanielFischer $[0, 1] \cup [0, \infty]$ is a plausible branch cut for $\log(z - z^2)$, am I right?
$[0, \infty]$ is any path on $\Bbb C \cup \{\infty\}$, btw.
 
2:55 PM
@BalarkaSen Ah. I wondered about the union ;) Yes, it's okay. You can always have branches on the complement. If you pick a sensible path, the complement is simply connected, which makes it easy to define a branch.
 
@Chris'ssis I was just thinking, from what you said earlier, you might be older than what I had in mind xD
 
@Hippalectryon How old?
 
@Chris'ssis Before i was thinking around 25-30
Now more like 28-35
 
@Hippalectryon And now?
@Hippalectryon lol :-) You're funny.
 
2:59 PM
Uh :c
Am I that far ?
She doesn't say, but she's 652 y.o.
 
@Hippalectryon Singapore
 
Is it that bad ? @WillHunting
 
@Hippalectryon Yes, it is for me, because of various reasons I shan't elaborate.
 
@DanielFischer Maybe you'll like this question.
 
3:05 PM
My meds are very bitter.
They are the most bitter thing I have ever tasted.
 
@WillHunting What's the link with singapore :c
 
@Hippalectryon I say random things all the time.
2
 
@MikeMiller A two-sheeted covering of $P^n\times P^n$. Could it be homeomorphic to $P^n\times S^n$?
 
It's certainly the case for $n=1$, @DanielFischer.
I might try to write down a CW structure for the quotient and see if the homologies match up; at least for, say, $n=2$.
 
@MikeMiller Well, but in that case, it's also homeomorphic to $S^n\times S^n$, and to $P^n\times P^n$, so that base case isn't too safe to base assumptions on here ;)
 
3:10 PM
@DanielFischer I know :) I just wanted to be sure it didn't give me something completely different!
(By Euler characteristic considerations, it can't be either of those for $n$ even.)
 
Does Euler's constant mean e or gamma to you?
 
Gamma
 
What do you call e then?
 
@WillHunting The Euler-Non-Mascheroni constant ;)
 
I have not eaten macaroni for a long time.
I have a joke which may be very hard to get.
"I have a headache. Not tonight, honey." LOL
 
3:16 PM
Nooooo server down
 
sarovar.org has been down for months for me.
 
Hmpf, I have some problems with some elementary analysis. bleh
"Between any two real numbers there is a rational number"
The first part of the proof is fine, eg using the archimedian principle and first assuming that $a>0$.
 
3:32 PM
Ahem continued fractions Ahem
 
@N3buchadnezzar, if your reals are $x>y$, all you really need to do is get a positive rational less than $x-y$
 
ignore that. I am killing flies with mortars
 
@BalarkaSen I enjoy killing ants with LOIC
 
Let $a,b\in\mathbb{R}$, with $a<b$. Assume $a>0$. By the archimedian principle there is an $n \in \mathbb{N}$ such that $n > (b-a)^{-1}$. Note that $nb>nb-a>1+na-a\geq 1$; so $nb>1$
What happens in the second inequality?
ah!
 
mmhmm
 
3:33 PM
smacks oneself with a fish
2
b>a...
 
yes.
 
@N3buchadnezzar Here's another problem for you : prove that powers of $2$ are dense in the set of $2^k$-powers.
 
scratches head
 
i.e., for any two $2^k$-power for any $k$, there is a power of $2$ sitting between them
 
3:37 PM
Please elucidate.
 
gah internet connection.
@Jayesh are you referring to my question?
 
@BalarkaSen so 2^2 and 2^3 there is a 2 between them ?
 
@N3buchadnezzar If $a, b$ are integers such that $b > a$ then there exists a $k \in \Bbb N$ such that there is a power of $2$ sitting inside $(a^{2^k}, b^{2^k})$. yep, that's what I meant.
@N3buchadnezzar No, no.
I mean 2^k-powers.
 
@BalarkaSen ah!
 
@BalarkaSen Prove that there are finitely such primes that cannot be written as $|3^a-2^b|$ where $a,b\in\Bbb Z$
 
3:44 PM
@BalarkaSen I heard a short presentation on primes and zeros today
 
in English Language & Usage, 40 mins ago, by Matt Эллен
A piece of string walks into a bar and orders a drink
The barman says, "Sorry, we don't serve string"
The piece of string leaves, disappointed.
Just outside the bar, the piece of string is mugged, leaving it disheveled and somewhat tied up.
It decides to go back into the bar.
The barman asks, "are you a piece of string?"
It replies, "I'm a frayed knot".
 
@BalarkaSen I was, its clear now.
 
what is most used in mathematics mathscr mathcal or mathfrak ?
 
mathfrak yo dawg
That ortograph
 
4:01 PM
beh internet
@Alizter no idea. is that even known?
@N3buchadnezzar you mean zeta zeros?
what did it say?
 
@BalarkaSen Yeah
It was nice to see it again
 
is there any online slide for the presentation?
coincidentally, i had written up something about that in here a few days ago.
 
@BalarkaSen the first one is 41
 
@Alizter that's fine, but is the result known?
looks hard at @Alizter
 
How can i prove that $|xy|=|x||y|$? scratches head
 
4:06 PM
@N3buchadnezzar what are $x, y$?
reals? complex numbers?
 
Numbers in the extended real plane $x,y \in \mathbb{R}_+$
 
just use some sign arguments.
 
It feels so silly proving something so elementary
 
What a great question I created!
 
Aug 30 at 17:02, by Ted Shifrin
Proof by intimidation is NOT a proof.
 
4:08 PM
Greetings
 
(hmmm, good for my book)
Greetings
 
@BalarkaSen Apparently there is an elementary proof to determine it. Tbh I don't know if it is true or not.
 
@Chris'ssis Please show me if you don't mind :)
 
@Alizter idk. never dealt with such questions. interested to see a solution.
 
@BalarkaSen Found it here
consult the bottom
 
4:10 PM
@Alizter that's no elementary solution =P
 
@BalarkaSen in the comments they say there might be
 
@rehband Sorry, I can't now. This one won't be seen until I publish the book. I also communicate some problems to the others once in a while, but the special ones are meant for my book only. :-)
 
might be.
well, I will see if I can fiddle with it.
@Alizter meanwhile, did you try the problem above?
30 mins ago, by Balarka Sen
@N3buchadnezzar If $a, b$ are integers such that $b > a$ then there exists a $k \in \Bbb N$ such that there is a power of $2$ sitting inside $(a^{2^k}, b^{2^k})$. yep, that's what I meant.
 
gcd?
 
interval
 
4:16 PM
positive integers?
 
@Alizter positive.
@Alizter gcd?
oh that
 
@Chris'ssis Okay, I understand :)
 
no, it's an open interval
 
so $a^{2^k}<2^m<b^{2^k}$?
 
yes
Hello @RandomVariable
 
4:24 PM
@BalarkaSen Hello.
 
@RandomVariable You're not active on MHB anymore. What's the matter?
 
@BalarkaSen I just don't feel like posting as much as I once did.
 
Ah, how that happens sometimes.
I was never active on MHB until recently.
 
Can I get anyone to discuss more on Fibonacci pseudoprimes, even though I lack knowledge? I would like to know why 2737 and 6479 are not in the list.
 
@BalarkaSen Seems hard. I tried fiddling but I cant even prove for k=1 :P
 
4:35 PM
@Alizter It's not even true for $k = 1$. I asked for existence of a $k$.
 
that's probabally why
oh
tahts alot easier
let me try again
or not
 
Hmm. An interesting question would be whether there is such a fixed $k$. Or even a lower bound would do.
 
@Ropstah 'the first ten Fibonacci pseudoprimes are 2737, 4181, 5777, 6721, 10877, 13201, 15251, 29281, 34561, and 51841.'
2737 is there
 
It depends on the definition
Lucas pseudoprimes and Fibonacci pseudoprimes are composite integers that pass certain tests which all primes and very few composite numbers pass: in this case, criteria relative to some Lucas sequence. == Basic properties == Given integers P and Q, where P > 0 and , let Uk(P, Q) and Vk(P, Q) be the corresponding Lucas sequences. Let n be a positive integer and let be the Jacobi symbol. We define If n is a prime such that the greatest common divisor of n and Q (that is, GCD(n, Q)) is 1, then the following congruence condition holds (see page 1391 of ): If this equation does not hold, then n...
 
4:39 PM
I understand, I'm using a different algorithm which isn't computationally interesting but produces very similar, however different results
 
@Alizter Let me know if you find a proof/want a reveal.
 
@Ropstah Are you using the 1st or second definition given on wiki ?
I'd say the first given the list you posted
 
@Hippalectryon I'm checking if pseudo != realprime
pseudo being:
n = gcd(n, fibonacci(n-1)) or gcd(n, fibonacci(n+1))
so I'm not looking for gcd = 1
but where N equals the GCD of a Fibonacci number and N
1
5
323
377
442
1891
2737
2834
3827
4181
5777
6479
6601
6721
8149
10877
 
Where did you see that definition ?
 
first results
I went copy pasting stuff, as I'm visually understanding mathematics and am a fairly decent programmer
I made sample scripts using arbitrary precision in python which makes it easy to play with numbers
Let me upload two diagrams
@Hippalectryon: These are the values: tinypic.com/r/2m85vyg/8
This is the distribution: tinypic.com/r/2hnytxy/8
both under 1.000.000
took 30 minutes to run, I need to modify certain parts to go higher
 
4:46 PM
So... what exactly is your question ?
 
Well, does the produced distribution look familiar?
 
Not to me, though I'm not an expert in that field
 
It looks random to me, but it isn't
Riemann zeta waves are also random, I would like to apply this waveform to that hypothesis, fully understanding that if i started doing math now, i wouldn't fully understand 10% of the concepts after 10 year. That's why i'm here
 
@Ropstah How does this relate to zeta waves?
 
I can't sleep.
 
4:51 PM
The waves predict primenumbers to my understanding. Algorithms which produce waveforms are used to correct the errors.
I want to use this waveform as an error corrector on the Riemann hypothesis
 
@Chris'ssis Find $S\cdot\int\frac{\mathrm{d}x}{1+x^2}$
pun
 
OK, kick the primes, what are "zeta waves" and "waveform"?
 
@WillHunting drink milk
milk mak u sleepeh
 
@Alizter I should have asked for sleeping pills, lol.
 
@Alizter Drugz too
 
4:53 PM
@WillHunting Sleeping pills make you sleep walk and become a serial killer.
Kill them kellogs
 
@Hippalectryon How about this one? $$\int_0^1 x^n \log(1+x) \ dx$$
 
more like defrostation
haha i am funny
 
@Chris'ssis IBP?
 
4:58 PM
@BalarkaSen: I might went to fast in mentioning the Riemann hypothesis. And the thing is we need to stay at primes
The Riemann hypothesis is also based on primes in the end
 
@BalarkaSen @Hippalectryon Can we express that in terms of harmonic numbers?
 
Let me try to find a visual on what I mean
 

« first day (1499 days earlier)      last day (3516 days later) »