« first day (2481 days earlier)      last day (2835 days later) » 

00:00
Genius Balarka.
(i'd rather you not use those adjectives.)
Well, I'll respect that :)
Heather what math do you like?
Thanks. I think I am far from a genius. I know more than the other high school math enthusiasts here, but they are really very good at solving problems. I value that more than knowledge.
currently trying to get better at that to be honest
@Dodsy well, I'm not very advanced
I am trying to more rigorously learn calculus, and I also dabble around - abstract algebra is pretty cool; I've got Durbin's book.
I love linear algebra, though I can't say I know it, but it has many applications and has such a beautiful geometric interpretation.
@BalarkaSen is far beyond me.
I didn't even know he had a show.
00:06
@Dair I responded to your comment
thank you, you brought up a good point - I completely missed that.
he does, but i haven't seen it. we just talked about a question on MSE he asked
and related things
Oh cool.
@heather That's cool, I wish I had that enthusiasm in middle school.
Zach's and Balarka's mathematical ability is well beyond mine, and I am 23 years old.
it's never too late to learn =)
I agree.
@BalarkaSen Do you know of any numbers where the square root is equal to the sum of the digits?
00:09
Hmm!
assuming that math knowledge is a total ordering.
@Dodsy, ooh, interesting question...
I bet you could write a program to solve that...
81 works, right?
indeed.
OH YES
That was quick.
Just by brute?
00:10
Yeah. I think there should be more examples.
I'll let heather write a program
you could argue that 1 works
yeah but meh
yeah =P
hmm
I am not sure if there would be anymore.
Write the program heather.
For instance a 3 digit number the highest it could possibly count is 27
Good point actually.
Hmm. If I have a number of n digits, what the tentative size of it's square root? n/2 digits?
Right, because sqrt(10^n) = 10^(n/2)
00:13
that makes sense yes.
Maximum of sum of digits of an n digit number is 9n, like you said
right.
So to check it
hmm, my program's kind of a brute force sort of program, and it's not coming up with anything other than 1 and 81
9n is very very small compared to 10^(n/2), which is the tentative size of it's square root
all you need to do is do 9n^2
00:14
^that?
@heather Not gonna lie, the papers algorithm is kind of weird. I wouldn't have written it that way, and I'm not sure if there is something small that I don't understand about it. Your bottom code looks mostly correct except for some plurality issues, but I don't feel confident enough to answer it.
Heather 81 is the only number I believe.
@Dodsy Why n^2?
so 9 multiplied by the number of digits squared
@Dair it is, I'm having a lot of trouble with it - do you happen to have a resource where I could learn to calculate/prove an algorithm's complexity?
00:15
(9n)^2
also, what do you mean by plurality issues?
sorry forgot the brackets
Well, 9n = sum of digits. I wouldn't square that.
and if it's smaller than the number then it doesn't work.
You compute each element and then remove one element.
00:16
Basically it proves that 81 is the only number
But I think I sketched what you had in mind; sum of digits = 9n << 10^(n/2) = square root.
Yeah.
Yes you explained it best Balarka :)
It was an interesting thought though!
I liked the question
@Dodsy There's actually a lot of fun questions like this. Can you give an example of a number which is equal to the sum of factorial of it's digits?
(There's a 3 digit number)
hmmmmmmmmmm
@Dair but only while the elements can be computed - once it reaches an element that can't, it removes that element and restarts
00:19
@Dodsy starred for r/nocontext
haha
@BalarkaSen, with that problem I realized that because the sum of the digits will be a whole number, you don't even have to square root - you just check if the sum of the digits is equal to the number itself.
okay so...
the maximum total any number can have is 9n, where n is the number of digits.
so there's a limit on the value the total can have...
oh so you say while it is computable... most languages don't work that way but I guess pseudocode can be however you want it to be. As for computational complexity, I don't have a good reference. Might want to check cs.stackexchange
00:21
@EricSilva Yo
Right. Usually the max total of digit is going to be very small compared to the square root.
@Dair while there exists a real solution, I guess? I think you can code so that works...
254
no.
For n = 3 you get max total 27 like Dodsy said and square root is already of order sqrt(1000) = 31.blah
@Dodsy ooh close
oh, wait...ack, i have no clue what i'm doing.
00:22
144
(with the number problem)
@heather You can, but I'm not sure the pseudocode translates as easy as you think it does to python.
@Dodsy Did you mistype a digit?
gah
anyway I need to go for now. gl @heather
00:24
@Dair, okay, thank you.
Okay I need help Balarka.
How do you do it.
This is what I know
number must be less than 7.
Both your answers were pretty close. What's the least number n such that n! is 3 digits?
5
which is 120.
Right. so you know 5 is going to be a digit of your number. can you amalgamate that with your other almost-answers?
well 5! + 4! = 144
00:28
yep yep yep
and 1! = 1
so it's 145
I am so stupid.
Great, thanks!
It was right there
I was so close.
Nah you were quite good
I kept using 5 and not thinking to put a 5 in there haha.
00:30
There's actually a bigger number. I think 5 digits?
Let's look it up on OEIS
Is there an infinite amount?
No, I think that's it. There's no more other than that 5 digit thing
Ah I see.
Oh cool!
brb Balarka.
00:33
see ya
00:45
Balarka, are you still not unsleeping?
I slept from 5PM to 1AM yesterday; my sleep schedule is in shambles
you're totally a shamble.
I feel bad for your Circadian rythyms
he's a Circadian grasshopper.
Oh, never mind, that's a cicada.
00:47
lol
Good pun nonetheless. Demonark-style.
You might get ignored for less of an insult than that, Balarka.
I'm honored
A new interesting pattern to $i↑↑n$ that looks cool if anyone is interested. The graphs are pretty cool looking.
00:59
ponders dishonoring Demonark
@SimplyBeautifulArt they are pretty cool =)
@heather Fancy seeing you here
@TedShifrin D:
@SimplyBeautifulArt rather strange, I know =)
@heather Wait till you see $(-i)↑↑x$. It looks even crazier. Though I have to go to bed right now :(
aw, bed interfering with mathematics?
=/
have a good night, anyway.
01:04
Yeah =/
I'll try
Wait 'til you're Simply's age, @heather.
Hey look, its @EricStucky. Fancy seeing you here
@TedShifrin :-(
@TedShifrin why, i thought @SimplyBeautifulArt wasn't that much older...?
eh, 2.5 years
okay, yeah, that's a ways from now.
=P
01:06
@heather Is high school next year for you?
"Given the existence as uttered forth in the public works of Puncher and Wattmann of a personal God quaquaquaqua with white beard quaquaquaqua outside time without extension who from the heights of divine apathia divine athambia divine aphasia loves us dearly with some exceptions for reasons unknown but time will tell"
@SimplyBeautifulArt yep
why do I have this stuck in my head
go to bed, @Balarka.
@heather :-) Hope you'll like it
01:07
@SimplyBeautifulArt i'm more than a bit nervous
@heather what for?
i vacillate between the situation that i'll be very disappointed and it'll still be boring, and the situation that it'll be really hard and I'll fail
You won't fail
:-)
you'll do fine, heather
thank you, but it worries me
everyone says honors english = tons of homework
I remember being told I shouldn't take 4 honors courses. They were full of it.
tons of homework not equal fail
It just means that its more work than you are used to
yeah, but i have a bunch of extracurriculars i want to do - robotics, mock trial, quiz bowl...
@SimplyBeautifulArt yeah well =P
Trust me, I have to write 10 page essays sometimes
i actually don't really mind essays
01:10
._. Can you do my homework then?
um. i'd say yes but i think that's academic dishonesty =P
you know what's really terrible? I have to take health again next year. health.
::shivers::
you don't want to be unhealthy
i mean, i like the actual thing, just not the class
the class is awkward
what is "the actual thing"?
i had to take health this year too...we're in that unit right now.
01:12
@heather sh...
@TedShifrin being healthy, like in real life.
well, that's not a bad thing!
@TedShifrin You don't get healthier by taking health class in my opinion
^that's what i mean.
well, being educated helps
01:12
Meh... I'd rather do real exercise and stuff
but, no, I had two heart surgeries and a cancer surgery, and it wasn't due to my ignorance ...
yes, real exercise is super important
also, the unit where you talk about stuff in a co-ed class is awkward...
@SimplyBeautifulArt yeah, I actually kind of like P.E.
it's a nice break.
@heather I liked dodgeball
@TedShifrin Oh noo....
@SimplyBeautifulArt haha, yeah. i like playing soccer =)
@TedShifrin i'm so sorry
I thought dodgeball was super American. @Simply, you're not in the US, are you?
no need to be sorry, @heather. I was just stating facts. I'm doing quite well.
01:14
@TedShifrin I am. What made you think otherwise?
Also enjoyed flag football.
Isn't 9:15 early for bedtime on a Friday?
have you ever done rock climbing @Simply?
@heather nah... I'm scared of heights
@TedShifrin sh!
01:15
oh.
I'm too much of a klutz for that, heather.
@TedShifrin i'm a klutz too, and it's still really fun - I'm on a team that trains and competes
Good for you!! I still love volleyball and tennis ... although my back betrays me now.
01:17
hello
oh no, it's Semiclassic.
5
lol
I could really horrify you and talk about a research question :P
(i say that, but i'm not sure i'd really want to anyways.)
Or we can talk about my weird $i↑↑x$ graphs
That actually look cool :P
You're asleep, @Simply.
01:19
@TedShifrin SH!!!!
But it does look cool
WTH is Eric doing back?
lol
@TedShifrin Sleep is for the weak.
Or for the weekends.
anyone in here know how to calculate algorithmic complexity?
Not I.
01:22
specifically, I want to know a. whether or not this algorithm is polynomial time and b. whether or not this algorithm is more or less efficient than another.
@TedShifrin tru tru, but not at night, sleep through the morning and wake up in the afternoon.
the algorithm in question being the third here, compared to the first on the same question
@heather I know of it a bit, but not enough to help at all.
Or maybe enough to help
::hopes it is enough to help::
but not enough to understand what your code is doing...
or... I shall go to bed
g'night all!
01:23
ah, okay. good night (for the second time =P)
keeping mum
=P
WHOA! I KNOW THIS @ZAID PERSON!
:O
night, Simply.
Heyy
@SimplyBeautifulArt, how are you doing ?
@ZaidAlyafeai Supposedly sleeping, you?
01:27
@SimplyBeautifulArt, Watching Cavs versus Celtics play offs match
And g'night for real
@SimplyBeautifulArt g'night for the third time
Just got back @Ted and :O don't dishonor me
It's hard not to dishonor you, Demonark.
Impossible!
01:41
daminark*
Demonark would be cooler hough
That's Ted's nickname for me
Aren't I just out of the loop
So it seems :P
@TedShifrin can you view site analytics?
<a href="https://math.stackexchange.com/users/432114/dodsy">
<img src="https://math.stackexchange.com/users/flair/432114.png" width="208" height="58" alt="profile for Dodsy at Mathematics Stack Exchange, Q&amp;A for people studying math at any level and professionals in related fields" title="profile for Dodsy at Mathematics Stack Exchange, Q&amp;A for people studying math at any level and professionals in related fields">
</a>
I thought it'd show my flair.
Now I see that it looks sketchy
AKIVAAAAAAAAAAAAAAAAAAAAAAAA WEINBURGER
01:57
Yo @Akiva Laci was explaining the integral solution to me earlier
He said it's basically the same as the checkboard one in a way
You could see it as a signed measure, with one color being positive and the other negative
So that's kind of why the integral works
"control of the mighty pickle"
Daminark I have a somewhat easy math question for you.
Which I thought up earlier.
Let's hear it
Okay find a number whose digits add up to the number's square root, and prove that this is the only number with this attribute.
1
Darn @Dair sniped
02:08
Other than 1...
Can the number be the average of some non-terminating decimal expansion?
didn't you do a variant of this problem earlier today?
Yessssssss
Prove that it's the only number Daminark
other than 1.
Well, you can manually handle 2 digit numbers
And for 3 digits and above, I think you'd use something like making all the digits 9 and proving it's never enough?
02:11
Yeah that's it.
I guess it was too easy for you.
I mean it's a good problem for sure
The one pattern that always unnerved me was 3^2+4^2=5^2, 3^3+4^3+5^3=6^3 but that's it.
Why does it unnerve you?
3,4=5
3,4,5=6
Just the ascending nature.
3^4+4^4+5^4+6^4 $\neq$ 7^4
@Dair It's strange, innit?
02:14
Hm.
i misread the first time.
I thought you said $3^2 + 4^2 = 5^2$ and $3^3 + 4^3 = 5^3$
actually wait
#FLTrekd
that doesn't make any sense lmao. i'm dumb
classic fermat
It's a coincidence, that pattern, I'm sure. (Also known as "strong law of small numbers") But a weird one.
number theory patterns are always fun to look at.
02:18
true
and i can explain them to non-mathy friends. :)
(well in a lot of cases)
it's always fun to quote project euler solutions to my friends and at the end be like: "The more you know, the better prepared you'll be for tomorrows problems"
@Dair, fyi, I significantly updated the question
@heather Ok, I'll take a look, but I'm not sure how much I can help.
@Dair, you don't need to take a look; I just know you were interested earlier so I thought I'd let you know.
it's rather weird they use a goto at all, not just in python, but in every language it is considered a bad practice in general
02:21
but if you do, thanks
ah ok.
@Dair yeah, I've received several comments to that effect and also to the general effect that the paper was very confusing
(in the way it was written)
Man I really can't deal with sequences of sequences questions
can anyone explain to me how the comment on my post here (math.stackexchange.com/questions/2287327/…) gives total boundedness of that set?
03:02
good night everyone
04:01
$(1+a+b+c).(1+\frac{1}{a}+\frac{1}{b}+\frac{1}{c}) = 16$ then $a+b+c = ?$
hints?
do you have an integer solution?
yes
I see that $a=b=c=1$
satisfy but how to show that this is the only triple?
like the sum $a+b+c$ is fixed!
Sorry I forgot to mention $a,b,c$ are positive real numbers.
04:22
Hey everyone!
hey@Daminark
any chilling soundtracks anyone?
@Balarka So I think I may have a way of proving that if $p\equiv_4 1$, then it is not Gaussian, which does not use the Fermat squares thing.
If $p$ is prime, you have a primitive root mod $p$
Call it $r$
Now if $r^{p-2} \equiv_p p -1 \equiv_4 0$
Wait merp not sure how to continue
So $p - 1 = 4n$, and $r^{p-2} - 4n = pk$
04:48
Wait I misread the existence of primitive roots
OK so we know we have some $k$ such that $r^k \equiv_p p - 1$
And we know by assumption that $p - 1 \equiv_4 0$
$f:[0,1] \rightarrow R$ , non-negative with $\int_{0}^{1}f^{n} dx \rightarrow 2$ as $n \rightarrow \infty$ , is this possible ?
Is $f^n$ a power or is it composition?
Power!
Then I think $f(x) = \sqrt{2}$ might work? If I remember correctly
Also hey @Dair
Hey @Daminark
04:57
Wait a second I think this might amount to proving the squares thingy
$f(x)^4 = \sqrt{2}^4 = 2(2) = 4$. But $\int_0^1 f^4(x) dx = 4$...
Wait nevermind I was thinking of something else, $\sqrt{2}^{\sqrt{2}}$ and iterating that
Nevermind
I feel like something like a bump function should work...
Yeah a constant could never work, either it explodes or it tanks to 0
Right now I'm not wearing my analysis cap :P
But yeah so assume $x^2 \equiv_p -1$, then $x^4 \equiv_p 1$
bump function? @Dair

« first day (2481 days earlier)      last day (2835 days later) »