/sci/ - Science & Math

>>15381062
XD
we made similar jokes when someone shared news saying he won the fields medal.
>>15382552
That's amazing anon. Like I mentioned here >>15380472 I'm still in the last year of high school. Do you have any tips? I know that's a bit vague and to be honest I'm not sure what I'm asking for either. But either way I'd appreciate if you could tell more about how your undergraduate studies went, how your masters is going and what you intend to do in the future. And any advice you might have.
>The guy in OP's pic
June Huh was a good choice, glad you noticed!
>because of all the machine learning and data science fags taking over the world
Is combinatorics ever useful for machine learning?
Anyway, I appreciate if you can answer my question. Have a nice day!
>>15383433
I like [n] simply because it's what a friend of mine used and I liked it. It's also common and intuitive enough that most people would understand. When in doubt {1,2,...,n} just does the job.
>>15383507
Using range(n) is quite based. If I saw someone using it I'd be admiring honestly.
>>15383568
>approval from my combinatorist /mg/ friends over here
Well, Stanley's Enumerative combinatorics book uses it and I think that's a pretty good approval.
>>15384346
Well the simplest cases happen when you have just 3 flags. Since every pole needs at least one flag, you have no choice but to put 1 flag on each pole. And then depending on how those 3 flags are colored, your job is quite simple. If they're all different colors, there are 6 different ways, if 2 are the same color but 1 is different there are 3 ways and if they are all the same color, there is just one way. When we have 4 flags it's a bit more complicated but not much. Can you try to do what happens if we have 3 flag poles, 2 blue flags and 2 red flags and every pole must have at least one flag. Try to do this first and see if you can, after that try the problem I shared. If you get stuck ask for help! Good luck! I believe in you chap.