« first day (1588 days earlier)      last day (3436 days later) » 

5:00 PM
Way 1 : $(x,y)+(x',y')=(x+x',y+y')=(x'+x,y'+y)=(x'+y')+(x+y)$
Way 2 : $2(A+B)=(2x+2x',2y+2y')$, and we see that $2(B+A)=(2x'+2x,2y'+2y)$
There are two ways, but they're both equivalent. No problem here. @KellyBlunie
 
Yes i see that but in my 2 i sub back in to the equation, and that is wrong proving?
 
No
I told you, both ways are ok
 
https://math.stackexchange.com/questions/136831/factorial-number-of-digits/688304#688304?newreg=3a91eb63e4fc4291be2e0cc5b686cba3

can anyone explain the 2nd comment...please...
 
@quidstone The 2nd comment is just telling you that 20*19*...*2 can be done by hand
 
no its not telling me that...
 
5:05 PM
IThe addition could be defined as $(x_1,y_1)+(x_2,y_2)=(0,5x_1*x_2)$
 
its telling me the number of digit in a multiplication but i have reasons not to believe it...
 
@KellyBlunie But it isn't. Addition over $R^2$ is defined as $(x,y)+(n,w)=(x+n,y+w)$
 
@Hippalectryon my bad!! i mean the 2nd answer...
 
5:06 PM
Oh ok
This one right ? @quidstone
3
A: Factorial number of digits

SabyasachiI come from a background in computers, so here's my two cents. Taking the logarithm to the base 10 of n!. If the log comes out to be x, it is not hard to see that the number of digits must be the lowest integer greater than or equal to x, i.e, $floor(x)+1$. Now the question comes down to approxim...

 
yeah!! exactly...
 
@Hippalectryon thank you for your help i appreciated
 
@quidstone What part of the answer don't you understand ? Do you know base 10 log ?
@KellyBlunie No problem :)
 
@Hippalectryon It is possible to prove by induction that n! lies between (n2)n and (n3)n. this part
 
@quidstone
2
Q: Factorial lower bound

flashburnA professor in class gave the following lower bound for the factorial $$ n! \ge {\left(\frac n2\right)}^{\frac n2} $$ but I don't know how he came up with this formula. The upper bound of $n^n$ was quite easy to understand. It makes sense. Can anyone explain why the formula above is the lower bou...

 
5:16 PM
@Hippalectryon thanks...get it...
 
@Hippalectryon appreciate it...:)
 
Have you done any Analysis, @Hippa?
 
@Khallil Some
 
What kinds of things have you done?
 
5:18 PM
@Khallil Define Analysis :)
I'm in France
 
Mmmmm ...
Hmmmmm ...
 
Hey @Hippalectryon i want to know about the first answer now...sorry for not mentioning...
 
@quidstone No problem :) what is your question ?
 
Defining it is pretty hard, but I can tell you what I've done so far, @Hippa.
 
@Khallil Ok
 
Is that similar to what you've done so far, @Hippa?
 
@quidstone I know that :) I meant, where do you need help ?
@Khallil I've done 1
@Khallil I've done 2
@Khallil I've done 3
And i've done 4
 
"As a rough approximation, multiplying an n-digit number by an m-digit number yields a result with about n+m digits"......this doesn't work for lower numbers....

what i understand is 1*2 should be a two digit number...well...it not....
 
Huy
@Khallil: Are you writing a summary of your Calc1 lecture?
 
@quidstone It's an approximation :) it doesn't work with $1$
Nor with $0$
 
5:25 PM
Awesome! If I ever have any questions, would you mind giving me a few hints for them, @Hippa?
 
@Hippalectryon again....i am messing up for 20! too i am getting answers of having 34 digit...
 
@Khallil Sure. $5/question
:D
 
Nope. I found them online, @Huy!
 
@quidstone Give me an example
 
Huy
@Khallil: I see.
 
5:26 PM
@Hippalectryon yeah i totally get it...but from what number it starts working! 10* 12 should be 4 digit i guess..!!!
 
Hahaha! It took me a while to figure that out, @Hippa.
I thought you were writing some $\LaTeX$ code at the beginning and a \ had gone awry!
 
Why would one like to become a moderator for free? What's the gain?
 
@quidstone It works for any number, with a 1 number possible error.
@Chris'ssis Ask @robjohn
 
Huy
@Chris'ssis: I assume some people want to give back to the community.
 
@Hippalectryon yeah!! right!! its a bad guess then....okey going on with it....again how he makes a guess about (20!) so close....!!! i dont know...i am again lost here...
 
5:29 PM
@Huy If you wanna give some back to the community you can post answers and questions (that I did already).
@Hippalectryon Yeah, good point.
 
Huy
@Chris'ssis: I don't, it was an assumption.
 
@Huy I see, OK.
 
@quidstone for instance 5!=5*4*3*2 ~= (1+1+1+1) digits
 
Huy
@Khallil: Let $\{a_n\}_{n \in \mathbb{N}}$ be a sequence and $\sum_{n=1}^\infty a_n$ conditionally convergent. Prove that for all $a \in \mathbb{R}$ there exists a bijection $\phi: \mathbb{N} \to \mathbb{N}$ such that $$\sum_{n=1}^\infty a_{\phi(n)} = a.$$
 
Conditional convergence means that $\displaystyle \sum_{n=1}^{\infty} a_n$ converges, but $\displaystyle \sum_{n=1}^{\infty} \left| a_n \right|$ doesn't, right @Huy?
 
Huy
5:31 PM
@Khallil: Yes.
 
Ah, nice. Then absolute convergence is the opposite, right?
 
@Hippalectryon what i am doing is...5!= 5*4(=2digit)*3(=3digit)*2(=4digit)...
yeah it same...
 
but
20*19*18*17*16*15*14*13*12*11*10*9*8*7*6*5*4*3*2(2+2+2+2+2+2+2+2+2+2+2+nine 1s = 31)
is it okey!! @Hippalectryon
why i am getting 31 digit....as a guess @Hippalectryon
 
Did you see the answer's second comment ?
20*19*18*17*16*15*14*13*12*11*10*9*8*7*6*5*4*3*2 => 11*2 digits + 8*1 digits = 29 digits
 
5:36 PM
hi
anyone got any ideas about math.stackexchange.com/questions/1059379/… ?
 
Huy
@Khallil: Absolute just means that the sum of the absolute values converges. Nothing is said about the normal sum.
@Khallil: It's not a very beautiful proof but I think the result is really cool.
 
I think I've seen a proof of it before and it was a monstrosity.
I don't know where to begin.
 
Huy
@Khallil: It's not a monstrosity, I think we did it on a single page in our first semester.
 
How does one go about proving the existence of something, @Huy?
(I mean, is there a general way of doing so?)
 
Huy
@Khallil: Sometimes you can only show that there exists something, sometimes you can explicity construct it (which is more helpful then).
 
5:44 PM
ohh!! sorry i didn't see that... and i should have!!! by the way can you vote it down it preciously deserve!!
@Hippalectryon
 
@quidstone ok :)
 
thanks...:)
 
5:55 PM
Have a look what have been discussed on
It's all about Pedro & you guys
 
Aaaand I'm back. I'm part of a study conducted by the NIH and FDA, sorry I took so long
 
Who are the NIH, @teadawg1337?
 
@Khallil National Institutes of Health
Basically, I'm part of a Federal study
Enough about that, let's get back to maths. Has anyone seen any interesting questions lately?
 
No.
 
Me neither...
 
6:04 PM
Huy's one just a small scroll up is pretty cool.
 
Riemann's rearrangement theorem; it's a cute little trick.
 
Is it Hilbert's, @Mike?
 
Huy
No, it's mine, @Khallil.
 
No, it's not. Apologies.
 
Huy
@Khallil: A little hint in case you don't know how to start: I can do it in one line, without pen and paper.
 
6:08 PM
Its Riemann, right?
 
Yes, I edited it.
 
Hi @MikeMiller
 
Ah, just saw that.
I can make a bijection too.
 
Hello yourself, @Alizter
 
6:09 PM
Hi @teadawg1337
@MikeMiller I feel much better today. I have clearer thoughts.
 
$1 \mapsto 2$, $2 \mapsto 1$ and all other elements of $\mathbb{N}$ map to themselves, right @Huy?
 
That's good.
 
I am currently tutting at my notes riddled with yesterdays jibberish.
 
If you only rearrange finitely many terms, the sum is the same, @Khallil.
 
Oh. So we're talking about a bijection that swaps infinitely many terms and ensures that the sum retains it's value, @Mike?
 
6:12 PM
@Khallil I don't quite understand. I thought the question was to start with a conditionally convergent series and change it so that it converges to some arbitrarily chosen real $a$.
I'm saying that if you want to change the value it converges to, you need to rearrange infinitely many terms.
 
Ohhh.
I misread the original question!
Thank you!
 
Huy
@Khallil: That's a lot more powerful, no? (sorry, I'm cooking dinner)
 
What's a lot more powerful, @Huy? (Also, what are you making? ^_^)
 
@Chris'ssis I was wondering, if I ever need to use some of your results in one of my works, under which pseudo do I refer to you ?
 
@Hippalectryon I'll let you know my name one day. Anyway, I'm not a famous person as many of you here, I'm totally unknown.
 
6:23 PM
@Chris'ssis ok
@Chris'ssis I'm not famous at all
 
There are famous people here?
 
@Chris'ssis No one knows me irl here
 
Huy
@Khallil: The theorem is more powerful the way you read it correctly.
 
Ah, yep. Indeed, @Huy!
 
Huy
@Khallil: I made some bread and schnitzel. :D
 
6:24 PM
@Hippalectryon I think r9m knows me (if so, I wonder how it was that possible). I have reasons to believe that.
 
@r9m :O
 
Huy
@Khallil: You ever had schnitzel?
 
Nope. Never. What is it, @Huy?
 
Huy
It's sort of breaded meat.
@Khallil: google.ch/…
 
@Hippalectryon The MSE policy is to remain anonymous if you wanna be anonymous. When I asked him for more informations, he said it was just a misunderstanding. Let it be so ... (but I have doubts).
 
6:26 PM
Oh, I've had that before! I never knew it was called Schnitzel, @Huy. It's really nice. ^_^
 
@Chris'ssis I know :)
@Chris'ssis I do it that way too
 
Indeed @Balarka, thanks! :) And Thanks @Mike. I needed to practice a bit with direct products, and this also practiced up homomorphisms and so on, it was real good.
 
@Hippalectryon I wanna learn one thing: every time when I have reasons to get annoyed to try to make fun of that situation. :-)
 
@Chris'ssis Or, do as I do, try not to get annoyed :D
 
@Hippalectryon I'm annoyed again looking at the list of those who want to be moderators. :-))))
 
Huy
6:33 PM
@Chris'ssis: Look at me instead, then.
I'm Huy.
 
^
Haha
 
@Huy Great! :-)
 
Huy
See, already better. :D
 
@Chris'ssis I'm not even looking at it
 
@Huy hahaha, yeah! :-))))
 
6:33 PM
Problems solved
 
@Hippalectryon That's better :-)
 
@Chris'ssis Is that Pedro, the trivial guy? :D
 
Huy
@Khallil: Yeah, it used to be my favourite meal as a kid (schnitzel with chips). I think I didn't fry it for the required amount of time though, it's a bit chewy. One day I'll be a good cook. :3
 
@Venus Trivial guy? :P
There is a stronger version of Riemann rearrangement theorem, although proved similarly, @Khallil
It says that every divergent series can be rearranged to give a convergent series. In fact, given a value, the series can be rearranged to give exactly that value
 
@Balarka I wrote a proof for that a few years ago, wasn't too hard. Don't ask me to find it, I've recycled most of my papers from high school
 
Huy
6:45 PM
@BalarkaSen: So it's stronger because it applies to every divergent series and not only every conditionally convergent one?
 
This statement made my day so far: "Coming from a strictly neutral country - Switzerland - I think I have the ideal predisposition to be a moderator :)"
 
Huy
@Venus: I too live in Switzerland.
 
@Huy I think you have to consider yourself to nominate as a candidate
 
Huy
@Venus: I'm a frayed knot.
 
@Huy Right.
@Huy What's your fundamental group?
 
Huy
6:48 PM
@BalarkaSen: It's trivial. But I'm not a sphere.
 
@Huy Interesting.
I don't think that's even possible.
 
@Huy A ball maybe ?
 
Huy
@BalarkaSen: But can you prove it?
 
@Huy Not sure. I can try, but I have barely studied fundamentals of algebraic topology.
 
6:51 PM
My intuition comes from the fact that the complement of a nontrivial link can never be simply connected.
 
Huy
@BalarkaSen: Neither have I. I barely remembered what a fundamental group was and thus could only come up with a sphere.
 
I think similar works for knots.
 
Give me a independent branch of mathematics
which focuses on new things than set theory
and is calculus independent
I'm tired of integrals :(
 
@FreeMind Abstract algebra, maybe?
It's calculus independent.
 
I'm tired of bad notations, confusions
 
6:53 PM
Abstract Algebra is beautiful. It ... freed my mind.
 
You're a free group, @Khallil? :P
 
Huy
@FreeMind: Complex analysis?
 
@BalarkaSen Anything else? Is it independent of any prerequisite?
 
@BalarkaSen No.
 
Ahh, what's a free group?
 
6:53 PM
@Huy No No nO!
 
I know what a group is, but not a free one.
 
@FreeMind It requires a bit of set theory.
 
Huy
@FreeMind: Why not? It's not as ugly as real analysis.
In fact, it is rather beautiful.
 
No more prerequisites needed.
 
$\mathbb{R}$ analysis is eugh.
 
6:54 PM
Totally, @Huy. Complex analysis is cool stuff.
 
Huy
@FreeMind: Have you studied linear algebra yet?
 
@BalarkaSen I want something out of mechanical stuff ( not completely ) , I mean I'm tired of watching inequalities :|
+ absolute values
then epsilon !!!!
 
Abstract Algebra is the way to go, @FreeMind.
It's so nice.
 
@FreeMind Abstract algebra is free of inequalities, absolute value and epsilons.
 
Huy
@FreeMind: Are you at all interested in theoretical physics?
 
6:55 PM
@Huy I have studied linear algebra, just on eigenvalues and diagnolization.
I suck at transformation , specially notation used for stuff.
I am tired :D
 
I think abstract algebra would suit your tastes, @FreeMind
 
@huy yeah physics
 
Try picking up Dummit-Foote.
 
@BalarkaSen What is that? I am tired dude :D
 
Huy
@FreeMind: I'd suggest studying quantum mechanics, it has some rather beautiful proofs and constructions, which are purely mathematical.
 
6:57 PM
It's a book. If you're so tired that you can't open up a book, you should forget about studying math @FreeMind.
 
@BalarkaSen That's the truth.
@BalarkaSen I think, calculus kills innovation.
 
I don't like calculus. So, instead of whining about it, I started studying algebra.
 
calculus does not sharpen your mind, it just solidifies your creativity then restricts it badly.
 
Huy
@FreeMind: Complex analysis is the opposite, imo. And quantum mechanics is just mind-blowing.
 

« first day (1588 days earlier)      last day (3436 days later) »