[ 3 / biz / cgl / ck / diy / fa / ic / jp / lit / sci / vr / vt ] [ index / top / reports ] [ become a patron ] [ status ]
2023-11: Warosu is now out of extended maintenance.

/sci/ - Science & Math

Search:


View post   

>> No.15199219 [View]
File: 197 KB, 2356x1403, are you winning, demiurge.jpg [View same] [iqdb] [saucenao] [google]
15199219

>>15198031
I like the Demiurge.
I think he is cute.

>> No.12430283 [View]
File: 198 KB, 2356x1403, Heh.jpg [View same] [iqdb] [saucenao] [google]
12430283

How do I find the number of un-ordered subsets of size N in a set of size M? I intuit that it relates to the nature of euclidean space. It's also interesting that the solution for N=2 is generally (M-1)M/2 which is the sum of the first M-1 integers!

Navigation
View posts[+24][+48][+96]