conversation_id int64 1 206k | help_channel stringlengths 6 7 | __rowid__ stringlengths 32 32 | author_id int64 62,061,868B 1,071,443,446B | author_name stringlengths 2 32 | timestamp stringlengths 19 19 | content stringlengths 0 3.97k | reference.messageId stringclasses 3
values | reference.channelId stringclasses 3
values | reference.guildId stringclasses 1
value | url stringlengths 0 591 | fileName stringlengths 0 513 | student int64 0 1 | helper int64 0 1 | references.id float64 62,061,868B 1,071,056,124B ⌀ | references.name stringlengths 2 32 ⌀ | references.discriminator stringlengths 4 4 ⌀ | references.nickname stringlengths 1 32 ⌀ | references.isBot bool 2
classes |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
531 | help-10 | 939427de5e194032a1875ec105a8f9a7 | 186,109,587,366,215,680 | Omegabet_ | 02/06/2022 15:48:07 | ... | 0 | 1 | null | null | null | null | null | |||||
531 | help-10 | 939427de5e194032a1875ec105a8f9a7 | 396,358,891,237,015,550 | Sea Doggo | 02/06/2022 15:48:12 | 😦 | 1 | 0 | null | null | null | null | null | |||||
531 | help-10 | 939427de5e194032a1875ec105a8f9a7 | 186,109,587,366,215,680 | Omegabet_ | 02/06/2022 15:48:22 | you didn't know **vertex** form had something to do with the vertex? | 0 | 1 | null | null | null | null | null | |||||
531 | help-10 | 939427de5e194032a1875ec105a8f9a7 | 396,358,891,237,015,550 | Sea Doggo | 02/06/2022 15:48:30 | yeah cos they didn’t teach it to me that way | 1 | 0 | null | null | null | null | null | |||||
531 | help-10 | 939427de5e194032a1875ec105a8f9a7 | 396,358,891,237,015,550 | Sea Doggo | 02/06/2022 15:48:39 | They just told me to use it | 1 | 0 | null | null | null | null | null | |||||
531 | help-10 | 939427de5e194032a1875ec105a8f9a7 | 507,584,570,485,506,050 | aspwil | 02/06/2022 15:48:40 | hay man, maybe he just never made that connection | 0 | 1 | null | null | null | null | null | |||||
531 | help-10 | 939427de5e194032a1875ec105a8f9a7 | 396,358,891,237,015,550 | Sea Doggo | 02/06/2022 15:48:43 | Xd | 1 | 0 | null | null | null | null | null | |||||
531 | help-10 | 939427de5e194032a1875ec105a8f9a7 | 507,584,570,485,506,050 | aspwil | 02/06/2022 15:49:05 | i miss the point all the time and then 10 min later im like "OOOHHHHH" | 0 | 1 | null | null | null | null | null | |||||
531 | help-10 | 939427de5e194032a1875ec105a8f9a7 | 396,358,891,237,015,550 | Sea Doggo | 02/06/2022 15:49:19 | They called it like the square form or something | 1 | 0 | null | null | null | null | null | |||||
531 | help-10 | 939427de5e194032a1875ec105a8f9a7 | 507,584,570,485,506,050 | aspwil | 02/06/2022 15:49:28 | lol | 0 | 1 | null | null | null | null | null | |||||
531 | help-10 | 939427de5e194032a1875ec105a8f9a7 | 396,358,891,237,015,550 | Sea Doggo | 02/06/2022 15:49:41 | 👹 who the hell comes up with this shit | 1 | 0 | null | null | null | null | null | |||||
531 | help-10 | 939427de5e194032a1875ec105a8f9a7 | 396,358,891,237,015,550 | Sea Doggo | 02/06/2022 15:49:52 | Anyway thank you guys :>) | 1 | 0 | null | null | null | null | null | |||||
531 | help-10 | 939427de5e194032a1875ec105a8f9a7 | 507,584,570,485,506,050 | aspwil | 02/06/2022 15:50:13 | no problem, come back (or give me an @) if you get stuck somewhere along the way | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 896,029,219,413,438,500 | redeye | 02/06/2022 16:22:37 | ```How many different strings can we get by rearranging the letters of the word
MISSISSIPPI in which there are no consecutive symbols S?
E.g. SIISIMSIPPS is ok, but MISSISSIPPI, ISIPIMSIPSS are not.```
Is 70 correct answer here? (8 chooses 4) ?
```Suppose we want to make strings containing n distinct symbols (diff... | 1 | 0 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 896,029,219,413,438,500 | redeye | 02/06/2022 16:23:26 | ```Suppose we want to make strings containing n distinct symbols (different from
S and each occurring exactly once) and k occurrences of S which are not consecutive, where
n ≥ k ≥ 1 (so the length of such strings is n + k). How many such strings can we make?
```
is the correct answer (n+1 chooses k) ? | 1 | 0 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 896,029,219,413,438,500 | redeye | 02/06/2022 16:39:13 | @Mathematics Bot No | 1 | 0 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 896,029,219,413,438,500 | redeye | 02/06/2022 16:40:04 | @Helpers | 1 | 0 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 295,654,938,741,309,440 | M8732 | 02/06/2022 16:47:49 | @redeye How about calculating it via | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 295,654,938,741,309,440 | M8732 | 02/06/2022 16:49:09 | # words without consequtive s = # words - # word with consequtive s | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 537,482,727,557,955,600 | Chai T. Rex | 02/06/2022 16:49:33 | It's easier to first place the non Ss, then to place the Ss. | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 537,482,727,557,955,600 | Chai T. Rex | 02/06/2022 16:50:35 | Like maybe you'll get xMxIxIxIxIxPxPx when you place the letters other than S in one way. | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 295,654,938,741,309,440 | M8732 | 02/06/2022 16:50:35 | How did you ge those numbers? | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 295,654,938,741,309,440 | M8732 | 02/06/2022 16:50:50 | # words should | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 896,029,219,413,438,500 | redeye | 02/06/2022 16:50:51 | okay. #word = 34650 | 1 | 0 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 537,482,727,557,955,600 | Chai T. Rex | 02/06/2022 16:50:58 | And then you have 8 positions to put 4 Ss. | 0 | 1 | 805,217,272,087,838,700 | Mathematics Bot | 0196 | Bot | true | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 896,029,219,413,438,500 | redeye | 02/06/2022 16:52:53 | yeah that's how i got 70.. (8 chooses 4) is that correct then? | 1 | 0 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 537,482,727,557,955,600 | Chai T. Rex | 02/06/2022 16:53:02 | It's the way to place the Ss. | 0 | 1 | 896,029,219,413,438,500 | redeye | 5302 | redeye | false | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 537,482,727,557,955,600 | Chai T. Rex | 02/06/2022 16:53:16 | But you need to place the other letters in all the different orderings before the Ss as well. | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 537,482,727,557,955,600 | Chai T. Rex | 02/06/2022 16:53:26 | The trick for that is you have 7 other letters. | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 537,482,727,557,955,600 | Chai T. Rex | 02/06/2022 16:53:29 | So, 7! on top. | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 537,482,727,557,955,600 | Chai T. Rex | 02/06/2022 16:53:46 | Then you have 1 M, 4 Is, 2 Ps, so 7!/(1! 4! 2!). | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 537,482,727,557,955,600 | Chai T. Rex | 02/06/2022 16:53:56 | So, altogether 7!/(1! 4! 2!) 8C4. | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 896,029,219,413,438,500 | redeye | 02/06/2022 16:56:46 | 7!/(1! 4! 2!) the relation here is multification? 8C4? | 1 | 0 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 537,482,727,557,955,600 | Chai T. Rex | 02/06/2022 16:57:21 | 7!/(1! 4! 2!) is the number of ways to rearrange MIIIPPI. | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 537,482,727,557,955,600 | Chai T. Rex | 02/06/2022 16:57:26 | You place those first. | 0 | 1 | 537,482,727,557,955,600 | Chai T. Rex | 7323 | Chai T. Rex | false | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 295,654,938,741,309,440 | M8732 | 02/06/2022 16:57:40 | ,wolf Multinomial[1,4,4,2] | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 510,789,298,321,096,700 | TeXit | 02/06/2022 16:57:42 | Results provided by WolframAlpha | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 537,482,727,557,955,600 | Chai T. Rex | 02/06/2022 16:58:05 | No, the multinomial there won't work, since it doesn't count Ss next to each other. | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 537,482,727,557,955,600 | Chai T. Rex | 02/06/2022 16:58:12 | Or it does count them, rather. | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 295,654,938,741,309,440 | M8732 | 02/06/2022 16:58:19 | it's just number of any words | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 295,654,938,741,309,440 | M8732 | 02/06/2022 16:58:26 | wanted to verify the number he got above | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 295,654,938,741,309,440 | M8732 | 02/06/2022 16:59:23 | as for ss next to each other I think you can just threat "ss" as one symbol | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 295,654,938,741,309,440 | M8732 | 02/06/2022 16:59:38 | thus 2 single s to place and one double s | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 295,654,938,741,309,440 | M8732 | 02/06/2022 16:59:58 | ,wolf Multinomial[1,1,2,4,2] | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 510,789,298,321,096,700 | TeXit | 02/06/2022 17:00:00 | Results provided by WolframAlpha | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 295,654,938,741,309,440 | M8732 | 02/06/2022 17:00:17 | wait no huh | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 896,029,219,413,438,500 | redeye | 02/06/2022 17:00:22 | but there are 4 S's.. if i treat them as one there's still a chance that the other 2 will be consecutive | 1 | 0 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 295,654,938,741,309,440 | M8732 | 02/06/2022 17:00:52 | I think that is fine though, we are just interested in the number of words | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 295,654,938,741,309,440 | M8732 | 02/06/2022 17:00:57 | with consecutive ss. | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 896,029,219,413,438,500 | redeye | 02/06/2022 17:01:15 | this makes sense to me .. so 34650 - 70 = 34580 is the answer? i get the 70 as @Chai T. Rex suggested | 1 | 0 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 896,029,219,413,438,500 | redeye | 02/06/2022 17:01:15 | this makes sense to me .. so 34650 - 70 = 34580 is the answer? i get the 70 as @Chai T. Rex suggested | 1 | 0 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 295,654,938,741,309,440 | M8732 | 02/06/2022 17:01:32 | How do you get 70? That seems veeery few. | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 295,654,938,741,309,440 | M8732 | 02/06/2022 17:02:01 | let's say you put the ss in the first position, then you have still 9 arbitrary ways to put all the rest | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 295,654,938,741,309,440 | M8732 | 02/06/2022 17:02:12 | no way that's 70 | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 896,029,219,413,438,500 | redeye | 02/06/2022 17:02:13 | it does. but i got it this way - @Chai T. Rex : "Like maybe you'll get xMxIxIxIxIxPxPx when you place the letters other than S in one way." | 1 | 0 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 896,029,219,413,438,500 | redeye | 02/06/2022 17:02:13 | it does. but i got it this way - @Chai T. Rex : "Like maybe you'll get xMxIxIxIxIxPxPx when you place the letters other than S in one way." | 1 | 0 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 537,482,727,557,955,600 | Chai T. Rex | 02/06/2022 17:02:33 | See how I arranged the non S letters there? | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 537,482,727,557,955,600 | Chai T. Rex | 02/06/2022 17:02:45 | See how there are 8 xs in which to place Ss? | 0 | 1 | 295,654,938,741,309,440 | M8732 | 6402 | M8732 | false | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 537,482,727,557,955,600 | Chai T. Rex | 02/06/2022 17:02:49 | And you have 4 Ss. | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 896,029,219,413,438,500 | redeye | 02/06/2022 17:02:57 | exactly | 1 | 0 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 537,482,727,557,955,600 | Chai T. Rex | 02/06/2022 17:02:59 | So, 8C4 is the ways to arrange the Ss after the rest. | 0 | 1 | 295,654,938,741,309,440 | M8732 | 6402 | M8732 | false | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 896,029,219,413,438,500 | redeye | 02/06/2022 17:03:02 | 8 postion to put 4 S's | 1 | 0 | 537,482,727,557,955,600 | Chai T. Rex | 7323 | Chai T. Rex | false | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 537,482,727,557,955,600 | Chai T. Rex | 02/06/2022 17:03:10 | Subtracting that doesn't make sense. | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 537,482,727,557,955,600 | Chai T. Rex | 02/06/2022 17:03:30 | You multiply it with the number of ways to arrange the non S letters since they're happening simultaneously. | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 896,029,219,413,438,500 | redeye | 02/06/2022 17:04:36 | oh yeah true. we need to find the arrangement that doesn't have consecutive S's.. so why subtracting !! | 1 | 0 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 295,654,938,741,309,440 | M8732 | 02/06/2022 17:12:52 | Oky I see why my second query yields something to large | 0 | 1 | 295,654,938,741,309,440 | M8732 | 6402 | M8732 | false | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 295,654,938,741,309,440 | M8732 | 02/06/2022 17:13:47 | it's because it counts positions doubly since you can place either double ss or 2 single s. | 0 | 1 | 537,482,727,557,955,600 | Chai T. Rex | 7323 | Chai T. Rex | false | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 537,482,727,557,955,600 | Chai T. Rex | 02/06/2022 17:14:02 | Verified it with computer. | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 295,654,938,741,309,440 | M8732 | 02/06/2022 17:14:35 | verify what | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 537,482,727,557,955,600 | Chai T. Rex | 02/06/2022 17:15:00 | The answer. | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 537,482,727,557,955,600 | Chai T. Rex | 02/06/2022 17:15:36 | It's 7!/(1! 4! 2!) 8C4 | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 537,482,727,557,955,600 | Chai T. Rex | 02/06/2022 17:15:48 | ```haskell
import Data.List (isInfixOf, nub, permutations, tails)
import qualified Data.Set as Set (filter, fromList, size)
main :: IO ()
main = print . Set.size . Set.filter (not . isInfixOf "SS") . Set.fromList . permutations $ "MISSISSIPPI"
``` | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 537,482,727,557,955,600 | Chai T. Rex | 02/06/2022 17:16:23 | Take the permutations of MISSISSIPPI, put them all in a set, keep only the ones with no neighboring Ss, count how many elements are in the set. | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 537,482,727,557,955,600 | Chai T. Rex | 02/06/2022 17:16:45 | Gives 7350 after checking everything. | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 295,654,938,741,309,440 | M8732 | 02/06/2022 17:20:03 | I was gonna calculate it a different way without the 70. | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 295,654,938,741,309,440 | M8732 | 02/06/2022 17:20:34 | I thought he meant 70 as a step in my solution strategy. | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 537,482,727,557,955,600 | Chai T. Rex | 02/06/2022 17:23:00 | ,w 7!/(1! 4! 2!) Binomial[8, 4] | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 510,789,298,321,096,700 | TeXit | 02/06/2022 17:23:05 | Results provided by WolframAlpha | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 896,029,219,413,438,500 | redeye | 02/06/2022 17:29:30 | okay. it's starting to make sense. | 1 | 0 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 896,029,219,413,438,500 | redeye | 02/06/2022 17:29:48 | how about this question? | 1 | 0 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 896,029,219,413,438,500 | redeye | 02/06/2022 17:59:11 | @Helpers | 1 | 0 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 896,029,219,413,438,500 | redeye | 02/06/2022 18:29:43 | @Helpers | 1 | 0 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 537,482,727,557,955,600 | Chai T. Rex | 02/06/2022 19:09:03 | ```Suppose we want to make strings containing n distinct symbols (different from
S and each occurring exactly once) and k occurrences of S which are not consecutive, where
n ≥ k ≥ 1 (so the length of such strings is n + k). How many such strings can we make?
``` | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 537,482,727,557,955,600 | Chai T. Rex | 02/06/2022 19:09:32 | OK, so place the distinct symbols in a particular order. How many ways are there of doing that? | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 537,482,727,557,955,600 | Chai T. Rex | 02/06/2022 19:09:35 | @redeye | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 896,029,219,413,438,500 | redeye | 02/06/2022 19:11:22 | n! | 1 | 0 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 537,482,727,557,955,600 | Chai T. Rex | 02/06/2022 19:11:37 | OK, so let's say you have the distinct symbols A, B, C. | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 537,482,727,557,955,600 | Chai T. Rex | 02/06/2022 19:11:47 | And one ordering is BAC. | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 537,482,727,557,955,600 | Chai T. Rex | 02/06/2022 19:11:56 | Where can you place the Ss? | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 896,029,219,413,438,500 | redeye | 02/06/2022 19:12:20 | in 4 places `xBxAxCx` | 1 | 0 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 537,482,727,557,955,600 | Chai T. Rex | 02/06/2022 19:12:32 | OK, so how many is that in terms of n? | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 896,029,219,413,438,500 | redeye | 02/06/2022 19:12:53 | n+1 | 1 | 0 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 537,482,727,557,955,600 | Chai T. Rex | 02/06/2022 19:12:55 | And how many of the places are we choosing? | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 896,029,219,413,438,500 | redeye | 02/06/2022 19:13:07 | n+k | 1 | 0 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 537,482,727,557,955,600 | Chai T. Rex | 02/06/2022 19:13:24 | No, for the Ss. | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 537,482,727,557,955,600 | Chai T. Rex | 02/06/2022 19:13:38 | We already placed the distinct letters. | 0 | 1 | 896,029,219,413,438,500 | redeye | 5302 | redeye | false | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 896,029,219,413,438,500 | redeye | 02/06/2022 19:14:27 | for S, we're choosing k | 1 | 0 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 537,482,727,557,955,600 | Chai T. Rex | 02/06/2022 19:14:51 | OK, so first we do n! arrangements, then we choose (n + 1)Ck. | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 537,482,727,557,955,600 | Chai T. Rex | 02/06/2022 19:15:00 | So, n! (n + 1)Ck. | 0 | 1 | null | null | null | null | null | |||||
532 | help-10 | 75b1bffbb1124175815afc02aa6e7131 | 537,482,727,557,955,600 | Chai T. Rex | 02/06/2022 19:15:18 | Do you see why that works? | 0 | 1 | null | null | null | null | null |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.