« first day (592 days earlier)      last day (4724 days later) » 

00:00
@HenningMakholm Yes.
@tb somebody else agrees with you. he (or she) added a comment saying 'looking at a graph is always a good start'
@Jeff can you see it here?
@tb Okay. If I were to ask you to share that purpose with us here, would you do it?
@tb yes, it was there. (I was looking for a link that said 'comments', or something like that). thx
@tb : D
00:02
so now, about this comment i made: math.stackexchange.com/questions/120708/…, should that be taken down? somebody said the same as me right before me, but my explanation was much better (I thought).
because someone in here said the math.SE standard is to remove your comment/answer if someone beats you to it.
@tb There are quite a few questions at the moment that you could answer.
@HenningMakholm Hm. Let me think about it. You wouldn't believe me that its sole purpose was to amuse Matt, would you? It was just a piece of silliness...
@MattN well, maybe, there always are. I am sort of waiting for the one question I would like to answer before I leave the site for good.
@tb What "quits"? (Must. Resist. Temptation. To add more than one ?.)
00:11
@tb Sure, I'll believe that. I was just wondering whether I was missing something.
@tb Not funny.
hey guys
@tb I saw your explanation yesterday, I am going to try to work it out
hi @ben
00:12
@MattN No, it isn't. It's pretty serious actually. I'll come to the chat occasionally but I lost all motivation to answer the questions on the main site.
@Jeff Hey
@tb Why no motivation, and why are you leaving the site?
@tb Oh dear. I thought quitting meant actually quitting.
@tb Is that contagious? Several other well-known users have expressed similar sentiments recently.
Why the urge of people to leave the site?
@BenjaminLim It's getting too repetitive to be inspiring and the quality of both answers and questions have dropped dramatically over the past half year.
(there are of course laudable exceptions).
00:15
@BenjaminLim everything gets old after a while. people need variety in life - can't spend all of it on a math chat site.
@tb really? wow
@tb Common man don't you see yourself as like a "mentor" or "inspirer" for people like me, Matt and Kannappan?
@BenjaminLim that's something that is very hard to write down in a good way. It's best if you try to figure it out for yourself without giving too much thought on typos that I may have made. I gave you the idea and I hope that suffices.
@BenjaminLim I do. That's kind of what is still keeping me here.
2
@tb Thanks man.
@BenjaminLim You don't need to thank him. If he also quits chat I'll hunt him down and handcuff him to his desk in front of his computer.
@MattN C'est très sérieux maintenant.
00:19
Should I tell Pete that his otherwise-very-good-Commutative-Algebra-Notes is crippled with so many typos--some Mathematical and some non-Mathematical?
@tb Curiously, the past half year is also exactly the time I've been here. It's all my fault! Waaah!
To prove that piecewise function $x \sin(1/x), 0 (when\ x=0)$ is a continuous function, do I just take the limit from the right, the left, and the value at $0$ and show they're all equal?
@BenjaminLim Bien sûr. : )
@Jeff $-x \leq x\sin(1/x) \leq x$ therefore by the squeeze theorem.....
@KannappanSampath Definitely. But I would do so anonymously. Otherwise it might (or might not) hail down votes on you, depending on whether he is the tantrum kind of guy like you-know-who or not.
00:22
@KannappanSampath Pete's notes are for graduate students.
@KannappanSampath they always are...
@BenjaminLim Too late.
I thought he'd left.
peur de quoi?
@BenjaminLim But, he writes his notes very well. I love that! :-)
@MattN I don't think he would downvote though! :-)
@BenjaminLim De moi. Obviously : D
@KannappanSampath I was semi-serious.
00:24
@BenjaminLim ahhh. thx!
@tb They are always very good but crippled with so many ..... , you mean?
@HenningMakholm I must have missed those remarks.
@KannappanSampath If you really want to learn commutative algebra, AM is short and concise. I find Pete's notes are more for a second course in commutative algebra or something. Like once you have done AM, then you can look at Eisenbud's text or something. AM or Miles Reid's Undergraduate Commutative Algebra is a good place to start.
@ben I am 45 (for another 4 months). why?
00:26
@HenningMakholm of course not, there are quite a few of your answers that I liked a lot :)
@BenjaminLim Sure, I was just skimming through for some definition once. I am anyway not reading it thoroughly!
@Jeff Forget what I said. Sorry if that hurt you in any way.
@KannappanSampath let's leave it at that. I don't want to elaborate.
@ben I'm not at all hurt!
but i am curious why you ask.
He's into numerology...
00:28
@Jeff "I am subject to aging, have not gone beyond aging." - advice by the Buddha on what one should reflect on often.
if it'll help, i was programmer for about 20 years before i decided to go back to school for math. i had no real math background and raced through a graduate program. it's not the most elite school around, so i feel like i'm still learning).
off to walk the dog in the rain. bbl
that's why my questions are much simpler than my maturity. i'm not hurt or ashamed, though. i still have a lot to learn.
Later!
00:29
@Jeff That is very wonderful to hear. I think at the moment in my place there is pressure to get grades and stuff, no real learning.
Bye robjohn!
@Jeff I am sorry to have asked that. I thought you were in college in something. I was biased into thinking that all college students are young. But that is not true as even in my institution there are adults who learn. It is wonderful to see them there.
@robjohn bye
i hear you! that was part of my issue. i was always rushing through the courses trying to keep up and get a grade without always understanding everything. plus i didn't get the repetitions of having done it as undergrad and then again as a grad
@BenjaminLim Same here at cattle farm.
@robjohn Bye See you later.
00:30
@MattN cattle farm? What do you mean?
@ben don't be sorry.
Matt heads out to search the transcript
@KannappanSampath When you get to snake lemma you will need some guidance on that. It is very confusing for the first time chasing a big diagram like that.
@Jeff but wouldn't a grad school that wouldn't leave you with that impression be a rather ... uninspiring one?
@ben besides, i'm so immature i might as well be college age :D
00:31
^ welcome to the club, we meet once a year at the coliseum!
@BenjaminLim This.
@KannappanSampath : )
@BenjaminLim Sure! I'll take two more weeks I guess!
@tb What do you do there?
@KannappanSampath he has it bookmarked, for sure :)
@MattN What do you mean exactly about that statement?
00:32
@MattN we indulge ourselves in our immaturity
@tb well, my grad school was kind of uninspiring. most of the experienced students there thought it was a very weak school and made jokes about it. if it had been an elite school, i would not have been admitted and would not have survived.
@MattN What about cattle being driven and fed??
@BenjaminLim What about it? moo
@Jeff No problem! As long as there is good beer.
00:33
@tb the graduate classes were the same as the undergraduate classes, but we were given more homework. we sat in the same class and had the same lectures
@MattN I don't understand what you meant?
@Jeff huh? This sounds awful.
@tb Same here. Grad + undergrad in same class.
even though i almost have a grad degree, i feel as though i'm just a 'good' undergrad (honestly).
So a grad student is the same as an undergrad except for his capability of coping with more homework?
00:35
What? They don't even do that here 8-).
@BenjaminLim I meant to say that the uni I study at is a depressing place with a food catering company that feeds crap to the students because they wouldn't give a damn if they killed them (except for that there is a law preventing them from killing people).
@tb well, i guess that depends on how you look at it. i didn't have a lot of options, the school was close to home and offered me a graduate assistanceship (i'm unemployed). and i did learn a lot.
the glass could be half full or half empty, i guess
@MattN We have to cook our own food here. But is it depressing because of the food or the uni in general?
I thought ETH was one of the best in the world?
@BenjaminLim Haha... Funny!
No seriously is it the uni that is depressing or the food?
00:37
Both!
@JonasTeuwen true. good beer is important!
i feel so frustrated
@BenjaminLim The teaching follows the same principle as the food. Make as much as you can as cheaply and of as low quality as possible.
What about the teaching Matt?
@MattN I seriously reiterate the recommendation to visit any of the cattle-feeding places elsewhere...
00:38
@tb </rant>
(not that I don't agree that the food is abysmal :))
Food? What food?
Sometimes even I use euphemisms.
@MattN The teaching where I am now is not that good either. In fact I have not been to a single analysis lecture in 2 weeks. It is boring as hell and the lecturer confuses me even more.
i just found out about F[x]-modules today, and they are so cool, but nobody i know cares.
00:39
$F$ a field?
Did you know that if you delete your answer you lose all the upvotes attached to it? T_T
yes, but it is good that it happens rather instantaneously now instead of a big drop at some point when they cleaned up their databases...
@MattN Yes, I did, but I am not sure why your answer wasn't right!
what's hot about $F[x]$ - modules?
00:41
@MattN no, but i would have assumed as much
well, if you use them to study the F[x] action on a vector space, it tells you about the structure of linear transformations
@MattN zie is back... lovely tone as usual...
@MattN What was wrong with your answer/ why did you delete it?
@KannappanSampath Because the question was changed.
Good night guys.
00:44
Good night, Jonas
Holy....., normal was dropped!
@MattN What is Mensa at ETH?
@KannappanSampath Arturo posted a comment below it warning me to add a disclaimer since the question had changed but I couldn't be bothered, so I deleted it.
Good night Jonas.
@BenjaminLim Cafeteria. Where they feed you.
00:44
@JonasTeuwen bye Jonas
@JonasTeuwen Night! Sweet dreams.
night beer guy
@MattN Ah ok Mensa = german for cafe
@BenjaminLim Yep.
@tb joriki is taking care of it.
00:46
Why was this flagged as too localized?
@tb Me neither.
@tb who are you guys talking about?
Extra credit question: how do you find limits of Dirichlet functions?
@tb Dunno. But I didn't even know you could flag as too localised. I thought that was voting to close as too localised.
Oh! It's... LATE! How did it get so late?
@matt you entered a different time zone?
00:53
Looks like it.
Because, you travelled into the world of ideals and they use a different system for measuring times. And, the up and down journey to that world is like 3 full hours in your place. :-)
@MattN well, it was having a flag as too localized. While the OP is one of the worst question askers on this site (excluding a few obvious exceptions), I don't quite get it.
@tb Plus she owes me an accept.
I wish the chat room was less crowded.
Yes, it's pretty busy these days.
Oh, I haven't made the connection so far...
I don't see how it's his problem.
Why can't he just leave them alone and let them do what they like?
01:00
@tb I think someone must be trying to get a Deputy badge quickly.
...because their way is obviously not the way to go?
@tb Thanks btw. I've worked it out. I guess I got stuck yesterday at the step $v'(f(m)) = f''(v(m))$ :D
@HenningMakholm maybe. That would be an explanation for all those flags.
Well, if I taught a course, I expect my students to understand the material because I take pain in writing my lectures, in writing problem sets, in making material more clear. So, I'd want some work to be put in by them. If Math was all done by someone helping you, we would not learn anything!
01:02
@BenjaminLim don't forget the commutativity of the diagram
@MattN have you seen a single reasonable question from that person?
I was using that yesterday but somehow got confused about something which I don't quite remember....
i think it's a complicated problem. the goal of taking a class is to learn the material. the trouble is, the effectiveness of this is adjudicated by assigning a grade. students get confused, and figure erroneously that "getting the grade" is the objective.
@MattN Depends. If the homework ends up affecting what's on the student's eventual diploma, then the school has an interest in making sure that they can stand behind the skills they certify to future employers, etc. But if the consequence is just that the student will fail his exam later, then I'd say it's his own problem.
Maybe I chased too much
@tb No.
01:02
that's what tests are for. homework is for learning, tests are for demonstrating that you learned.
@DavidWheeler Hah. Tell the administrators at my uni about it :D
YOU DID NOT GET 80% AVERAGE YOU SUCK
@DavidWheeler that's the fact
@HenningMakholm Exactly what I think. It's their problem.
Anyway. Too tired to participate in an argument about teaching.
the students usually heavily out-number the instructor. time limitations effectively restrict how well an instructor can know their students.
On the other hand, many universites are punished financially if too many students fail their exams, so they still have an incentive to try to dicourage their students from using counterproductive studying "techniques" that will lead them to fail eventually.
01:05
@tb Will you be around in the morning? For a quick question, that is...
sure, a poor reputation can impact endowment, and enrollment
@MattN if you want to know now, just send an email, I'll respond quickly... I'm not sure when I'll get up in the morning and if I'll have time to come here.
@DavidWheeler I don't get how exam grades are the objective. One gets scaled up so how is that an indicator of anything?
but even leaving aside the issue of "internet answer farming", it's still common practice for students to discuss homework amongst themselves...so homework performance is not a reliable indicator of information absorbtion
@tb The question is actually silly. If I send you it in an email it suddenly turns serious and weird. : D
01:11
@MattN sheesh then just ask here...
@BenjaminLim often GPA's determine what higher learning institutes (like graduate schools) or even potential employers are available...this gives students incentive to cheat
@DavidWheeler Not only reputation: around here the funding the universities receive from the government is directly proportional to the number of ECTS points their students pass. (Well, affinely related, at least). Creates a tremendous internal pressure to lower standards, of course, but also -- as a side effect -- an incentive to make sure the students learn.
@MattN but I get your point. No hurry.
@tb Too many people. And no hurry. : )
Okay then. I should go and sleep for a bit. See you tomorrow at some point.
Good night y'all
01:13
@HenningMakholm it's an on-going problem with trying to establish any "standardized" bench-mark of education quality
Good Night!
@tb Good night!
And me too: good night.
Good night @Matt
my girlfriend is studying for a medical coder's certification...one of the ways her instructors deal with this is giving full credit for ALL homework turned in, but such work only counts as 10% of the grade awarded.
you also learn a some when you cheat
.... or so I'm told :D
01:16
well, in the long-term, you short yourself, but it's hard to convince "now-oriented" people that "someday" they will be poorer off
@tb @MattN good night
credentials may get you "in the door", but only proven performance keeps you "in the room"
@DavidWheeler At my institution we have degrees where students need to maintain 80% to stay in them. This puts pressure on the students and affects the learning a lot.
OK. On that note, I'm going to try asking this questoin again: How do you find a limit on a (nowhere continuous) Dirichlet function? That is $F(x)=$ piecewise $x$, if $x$ is rational, or $0$ if $x$ is not rational. And the question is "Determine which values of a does the $\lim_{x->a}F(x)=F(a)$
So F(x) is not continuous anywhere. I was tempted to say it's $\lim_{x->a}F(x)=F(a)$ whenever $a$ is rational, but i'm not sure.
Actually there is a single point at which your F is continuous.
01:21
actually F is continuous at 0, right?
oh yeah. i didn't even consider that! :D
Bye guys
I have procrastinated too much
bye @ben
at any other a, the trick is to show the limit cannot exist
01:24
Bye @Ben
you have two options: proof by contradiction, or direct exhibition of an epsilon for any non-zero a, that fails to yield an appropriate delta
you can choose a different epsilon for each a.
@DavidWheeler ah. so the answer is the same as for every other math question: use the definition (in this case, of limit)! :D
howdy :)
more seriously. i don't have the definition of conts in front of me now. but i have to use the def. of conts, pick $a \in Q$, pick a delta and show there is a non-rational number within $a \pm \delta$.
@ThomasShields hi Thomas
i suggest looking at $\epsilon = |a|/2$ for rational a. that leaves just showing the limit doesn't exist at irrational a. you might want to show there is a rational number b "close enough to a" that you can use.
01:29
unrelated to current conversation before I ask a simple question that gets rage-down-voted into oblivion - is there a relationship of any sort between a number and the length of its Collatz chain? I'm guessing no, since it seems that'd provide some sort of proof for the Conjecture, but hey, no stupid questions... right?
@DavidWheeler OK. I get the idea now. I think I can finish this question. Thanks much.
a look at the graph of numbers vs. length of their collatz chains indicates some "partial" relationships...perhaps there is a tighter relationship for certain KINDS of numbers
@ThomasShields That would be my immediate reaction too -- if there were any simple upper bound, that would effectively prove the conjecture. Of course the upper bound might be a bound of the length of the chain until some cycle was reached (which then wouldn't prove the conjecture), but it would be a very peculiar sort of result to prove that without proving that there's only one cycle.
@DavidWheeler interesting.
01:39
anyone here know about nontransitive dice games
@HenningMakholm you sort of lost me, but yeah
@JohnSmith Not even what "transitive" means in this case, but please go ahead and enlighten me :-)
sets of dice where no matter which die the first player picks, you can pick one that will beat it
b beats a, c beats b, a beats c
@ThomasShields What I mean is that one could conceive of a result saying, for example, that the Collatz function iterated n!!! times on n will always yield a point that belongs to a cycle -- but didn't guarantee that this cycle has to be the 1-1-1-1-... one.
@JohnSmith i don't. but i sure would like to :D
01:42
@HenningMakholm oh okay. yeah
The reason I'm wondering is that I'm working on Problem 14 of Project Euler (find the number under 1 million that has the longest Collatz chain) and so far, brute-force has failed me, so I was wondering if there was some sort of connection I could draw that would rule out certain sets of numbers.
@JohnSmith Sounds a bit like paper-rock-scissors played with mixed strategies.
indeed
well you can rule out powers of 2, but that's not much help :(
@JohnSmith when you say "b beats a", you mean over time (hundreds or thousands or rolls), right?
@DavidWheeler right - oh, yeah, whole powers. I was stupidly only doing the first power, lol.
01:45
yes
(i am reading this from an interesting PE problem)
@ThomasShields How brute is your brute force? For example, have you tried memoization / dynamic programming?
the thing is, it seems to me that even if you could find a relationship with phi(n), phi(n) itself is kind of unpredictable
@HenningMakholm memorization, yes. Dynamic programming - sort of; i'll check with some guys in SO chat for improvement
@DavidWheeler yeah, interesting.
I have PE 14
I think i'll just start graphing L(n) where L gives the Collatz length of n. Probably won't gain anything useful but it should be fun, if only because graphs are cool.
01:51
i don't know what the partial "radial lines" represent...but they seem to take care of "most" of the cases...and then a lot of the "exceptional cases" seem to have constant lengths (lying on a horizontal line).
@ThomasShields How do you find L(n)?
@ThomasShields I think memoization and dynamic programming are roughly equivalent here (different ways of thinking of essentially the same idea). So even with memoization you still have two numbers that take so long time to get back into your memoization range that you don't know which takes longer?
looks like there's a chain of length near 1,000,000 for some n around 9,000, so you're no doubt looking at some VERY big numbers.
They are not the same Henning
They can be similar though
@DavidWheeler right; that's why my brute force solution chokes when i find the greatest length of a number under 1000000
01:54
You can use brute force on problem 14
@JohnSmith I am; it's taking too long.
That is what memoization is good here for
Storing results as you go so you don't have to keep recalculating things
@JohnSmith yeah, i'm utilizing memorization
@JohnSmith Oh, they are not the same in general -- I just think (based on not more than a few minutes of deliberation) that the effect of applying them to this problem looks like it will be roughly the same.
In other words, you're just going to calculate it (or have the 'puter do it for you)
01:58
@Jeff right
this code is way complicated for this problem
@ThomasShields is that C?
@Jeff JavaScript; I'm trying to improve my JS skills as I work through Project Euler
You're not using Haskell like this guy, right? Or using 32-bit arithmetic?
i just cooked up a python solution in aircode
works in a minute, no memoization needed
just straight up brute looping
02:05
@JohnSmith it finds the number with the greatest chain under 1 mil?
@ThomasShields what do you run javascript in? don't you have to go and make a web page to load it and all?
@Jeff I just load it in the console and run; it's pretty quick (copy-paste and call the function)
unfortunately, i'm not a programmer, but it seems to me, if you store calculated L(n) somewhere, and test output values (of the chain iteration) against previously calculated L(n), it should help with computation time...for example, we have L(5) = 5, so when we get to 10, we just add 1 to L(5).
02:07
@DavidWheeler yeah, that's what I'm doing. It still takes forever. It might just be my browser running JS slowly. I'm going to try the check against powers of 2 thing.
@DavidWheeler That's what momoization is (what @Henning said before)
spoiler (my python code): ideone.com/2pvLb
if you want to see how you can just brute it
@Jeff it's not every day i learn a new word :)
@DavidWheeler especially a specialized, strange one like that, huh? :D
@JohnSmith wow, that even makes sense to me
02:10
@JohnSmith thanks; I think the fact that i was using JS was part of the problem; but I don't just want to solve the problem, I want to learn, hence the inquiry into the problem :)
@DavidWheeler python is nice like that :)
25 upvotes and I break 5k. !! I am there!
i assume % means "modulo"?
@DavidWheeler yup
yes
i%2=0 means it is even
since dividing by 2 with no remainder means it is even
i%2 being 1 therefore equates to being odd
02:12
sure 0 mod 2. Z2 is "binary"
i can't believe that Python is catching on so fast. I don't like it.
anyone good with dice math?
i suppose if i felt like it, i could design logic gate circuits that encoded the field structure of Z2, but that bores me
the only programming experience i ever had was a bit of pascal 20 years ago (or was it 25, i forget)
02:16
@JohnSmith yikes, nice. If my plan goes well I should reach that one in about a year. :)
@JohnSmith I don't think that's "dice math"; it's combinatorics.
@John How did they calculate: P(second player wins) = 7/12 > 1/2
oooooh, nontransitive dice. I asked a question about that.
1/2*6/6+1/2*1/6
is that just a probability tree of one die vs the other? like the probability of die A=1 AND die B=2, or similar?
02:19
half chance of landing a 5 on B, which always wins, half chance of landing 2, which will only win if A rolls a 1 with 1/6 probability
checking all possible 36 outcomes and figuring out the total number of winning outcomes (for P2) and reducing the fraction
and yeah it's combinatorics which I suck at
no 6/6
because I have a 3/6 chance of rolling a 5, which beats A no matter what he rols
so half the time I win no matter what
the other half of the time I win as long as he rolls a 1
i saw a forum signature once: there are two ways to solve a mathematical problem: 1. reduce it to an easier problem. 2. turn it into a combinatorial problem, and have somebody smart solve it.
@JohnSmith oops. my bad. :D
problem is i dont know where to even begin coyunting these
02:23
@JohnSmith holy cow (that problem).
@JohnSmith and you've done 375 of these problems already.
you dont have to go in order
@JohnSmith the home page suggests you do.
yeah, it's a good idea but not required
I just did number 3 (using Wolfram Alpha)
i solved problem 1 by hand. not very interesting.
02:36
@David not very interesting, yes, but you did it by hand! are you some kinda Luddite or somethin'?
:D
of course, you did it by hand faster than i could program a calculator to do it
hey
i just added the multiples of 3 and the multiples of 5 and subtracted the multiples of 15
@anon hi anon (you changed your avatar)
indeed
how do you find the multiples of 3 (and multiples of 5 and 15) so fast?
using 1 + 2 +...+ n = n(n+1)/2
@anon My point is it is obvious that the question is strangely posed. Do you agree there?
Yes.
02:39
Then, we have nothing to discuss. :D
the only tricky part is finding "n"
@anon...what are you 2 talking of?
... I don't know, what am I taking two of? Advil?
@DavidWheeler ok. i know that eq. so for multiples of (from 1 to 1000), hmm.... (wait, don't answer yet)
@DavidWheeler Well, we are talking about a problem from the main site.
@anon You let me down. I thought you were following. : /
I'm totally confused right now.
02:41
@anon in which case my question is: which problem?
Oh, what were us two talking about. Lol, I read that as "what were you taking 2 of".
@JohnSmith bored?
@David we're adding multiples of 3 from 1 to 1000, so it's 3+999, divided by two, times the number of (3+999)s you have. i'm guessing you have somewhere like 1000/3 of them. am i on the right track here?
I read taking as talking. sigh
02:42
PE 376 is kicking my ass
i suck with combinatorics
@anon okay, I agree :-)
@KannappanSampath howzitgoin?
the largest multiple of 3 < 1000 is 999 = 3(333), so for the multiples of 3, n is 333, so we have 3(333)(334)/2 = 166,833 contribution from the multiples of 3
@robjohn It's on well. I'll put up a link in some moment.
02:45
@DavidWheeler I'd add 1+...+333 and multiply by 3
And, thanks for asking.
similarly, we get n = 199 for the multiples of 5, which gives us 5(199)(200)/2 = 99,500 from the multiples of 5
@robjohn, that is precisely what i am doing :)
@DavidWheeler so you're actually taking three hundred and thirty-four 999s and dividing by 2. that is a little bit tricky
@Jeff not as tricky as adding 333 individual numbers :-)
and then since the intersection of (3) and (5) in Z is (15), we need to subtract the multiples of 15, since we've counted them twice (inclusion-exclusion principle)
02:49
@robjohn :D
@Jeff and they're adding 333 334's and dividing by 2, or 333 167s
334 is even so you can just multiply 333 by 167
@robjohn haha :)
or just adding 3*167 + 3*167*10 + 3*167*100, which is computationally more efficient
i simply hate arithmetic, so i try to use the distributive law to simplfy things whenever possible
@DavidWheeler they're two consecutive numbers, hopefully one is even :-)
02:54
n(n+1)/2 is always an integer, yep
@DavidWheeler It is a theorem that any polynomial in $x$ that is always an integer is an integral linear combination of $\binom{x}{k}$'s
i hardly ever "actually multiply by 5" in real life, i halve, and add a 0 (move over one decimal place left).
pascal's pointy 3-gon?
@DavidWheeler most people are so bad at simple arithmatic that on another forum, i actually posted a suggestion to help people compute restaurant tips
well at least we have a "good numeral system"...imagine doing arithmetic with roman numbers

« first day (592 days earlier)      last day (4724 days later) »