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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
205,453 | help-1 | ef375eaf044947ae8ae1b80da7a12239 | 526,808,110,443,266,050 | Dev Shah | 01/17/2022 07:19:03 | can't it? | 0 | 1 | null | null | null | null | null | |||||
205,453 | help-1 | ef375eaf044947ae8ae1b80da7a12239 | 610,844,733,194,895,400 | Foremost | 01/17/2022 07:19:34 | Yes. How does that repeat? | 1 | 0 | null | null | null | null | null | |||||
205,453 | help-1 | ef375eaf044947ae8ae1b80da7a12239 | 526,808,110,443,266,050 | Dev Shah | 01/17/2022 07:20:01 | I'm just saying it's confusing for a standardised notation | 0 | 1 | null | null | null | null | null | |||||
205,453 | help-1 | ef375eaf044947ae8ae1b80da7a12239 | 456,226,577,798,135,800 | Deleted User | 01/17/2022 07:20:44 | You are basically writing in hexadecimal if you change it a bit | 0 | 1 | null | null | null | null | null | |||||
205,453 | help-1 | ef375eaf044947ae8ae1b80da7a12239 | 610,844,733,194,895,400 | Foremost | 01/17/2022 07:20:58 | I haven't learned hex yet. I just learned binary tonight lol. | 1 | 0 | null | null | null | null | null | |||||
205,453 | help-1 | ef375eaf044947ae8ae1b80da7a12239 | 526,808,110,443,266,050 | Dev Shah | 01/17/2022 07:21:10 | plus, base n by definition is 1,n,n^2 and so on | 0 | 1 | null | null | null | null | null | |||||
205,453 | help-1 | ef375eaf044947ae8ae1b80da7a12239 | 456,226,577,798,135,800 | Deleted User | 01/17/2022 07:21:21 | You can represent every 4 bit as a hexadecimal number | 0 | 1 | null | null | null | null | null | |||||
205,453 | help-1 | ef375eaf044947ae8ae1b80da7a12239 | 526,808,110,443,266,050 | Dev Shah | 01/17/2022 07:21:23 | not really, hexadecimal is just base 16 | 0 | 1 | null | null | null | null | null | |||||
205,453 | help-1 | ef375eaf044947ae8ae1b80da7a12239 | 526,808,110,443,266,050 | Dev Shah | 01/17/2022 07:21:39 | yes, but 4 binary bits, not this | 0 | 1 | null | null | null | null | null | |||||
205,453 | help-1 | ef375eaf044947ae8ae1b80da7a12239 | 456,226,577,798,135,800 | Deleted User | 01/17/2022 07:21:53 | Yeah isn't that what he's doing? | 0 | 1 | null | null | null | null | null | |||||
205,453 | help-1 | ef375eaf044947ae8ae1b80da7a12239 | 526,808,110,443,266,050 | Dev Shah | 01/17/2022 07:21:59 | no | 0 | 1 | null | null | null | null | null | |||||
205,453 | help-1 | ef375eaf044947ae8ae1b80da7a12239 | 526,808,110,443,266,050 | Dev Shah | 01/17/2022 07:22:16 | they're making a new system | 0 | 1 | null | null | null | null | null | |||||
205,453 | help-1 | ef375eaf044947ae8ae1b80da7a12239 | 526,808,110,443,266,050 | Dev Shah | 01/17/2022 07:22:32 | where ones place is 1, tens place is 2, hundreds is 3 and so on | 0 | 1 | null | null | null | null | null | |||||
205,453 | help-1 | ef375eaf044947ae8ae1b80da7a12239 | 610,844,733,194,895,400 | Foremost | 01/17/2022 07:22:40 | That was the idea, yes. | 1 | 0 | null | null | null | null | null | |||||
205,453 | help-1 | ef375eaf044947ae8ae1b80da7a12239 | 610,844,733,194,895,400 | Foremost | 01/17/2022 07:23:33 | And it seems to be working well thus far. Except for the factorization snag, which I may have a solution to provided that there are any unused sequences available to be used. | 1 | 0 | null | null | null | null | null | |||||
205,453 | help-1 | ef375eaf044947ae8ae1b80da7a12239 | 526,808,110,443,266,050 | Dev Shah | 01/17/2022 07:25:11 | I mean i do think it's not as functional as binary when it'll definitely have redundant numbers, but it maybe can have some specific uses | 0 | 1 | null | null | null | null | null | |||||
205,453 | help-1 | ef375eaf044947ae8ae1b80da7a12239 | 610,844,733,194,895,400 | Foremost | 01/17/2022 07:25:38 | If it works well, I'm going to encode it to my Alphabet (I'm also a conlanger lol) | 1 | 0 | null | null | null | null | null | |||||
205,453 | help-1 | ef375eaf044947ae8ae1b80da7a12239 | 526,808,110,443,266,050 | Dev Shah | 01/17/2022 07:25:42 | but base n is still a well defined thing, so it has to be 1,2,4,8,16 for base 2 number system. | 0 | 1 | null | null | null | null | null | |||||
205,453 | help-1 | ef375eaf044947ae8ae1b80da7a12239 | 526,808,110,443,266,050 | Dev Shah | 01/17/2022 07:25:45 | noice | 0 | 1 | null | null | null | null | null | |||||
205,453 | help-1 | ef375eaf044947ae8ae1b80da7a12239 | 526,808,110,443,266,050 | Dev Shah | 01/17/2022 07:25:52 | it might work! | 0 | 1 | null | null | null | null | null | |||||
205,453 | help-1 | ef375eaf044947ae8ae1b80da7a12239 | 610,844,733,194,895,400 | Foremost | 01/17/2022 07:26:31 | thx :b | 1 | 0 | null | null | null | null | null | |||||
205,454 | help-1 | 49f64b1e1ccb42edb4caba968fc5c890 | 742,155,378,221,121,500 | kayl.09 | 12/20/2021 11:14:41 | how would u go about solving this ? | Screen_Shot_2021-12-20_at_12.14.31_PM.png | 1 | 0 | null | null | null | null | null | ||||
205,454 | help-1 | 49f64b1e1ccb42edb4caba968fc5c890 | 742,155,378,221,121,500 | kayl.09 | 12/20/2021 11:15:10 | the part up to V= U1+ U2 i get, and i understand | 1 | 0 | null | null | null | null | null | |||||
205,454 | help-1 | 49f64b1e1ccb42edb4caba968fc5c890 | 742,155,378,221,121,500 | kayl.09 | 12/20/2021 11:15:24 | but i cant seem to give the formula for P1 and P2, nor do the proof in the last line | 1 | 0 | 348,696,743,388,381,200 | A Lonely Bean | 7998 | A Lonely Bean | false | |||||
205,454 | help-1 | 49f64b1e1ccb42edb4caba968fc5c890 | 742,155,378,221,121,500 | kayl.09 | 12/20/2021 11:15:28 | any help would be appreciated | 1 | 0 | null | null | null | null | null | |||||
205,454 | help-1 | 49f64b1e1ccb42edb4caba968fc5c890 | 440,202,413,610,237,950 | T🤫 | 12/20/2021 11:38:25 | Isn’t P1 just Av1+Bv2 | 0 | 1 | null | null | null | null | null | |||||
205,454 | help-1 | 49f64b1e1ccb42edb4caba968fc5c890 | 440,202,413,610,237,950 | T🤫 | 12/20/2021 11:38:38 | Where A and B are constants | 0 | 1 | null | null | null | null | null | |||||
205,454 | help-1 | 49f64b1e1ccb42edb4caba968fc5c890 | 440,202,413,610,237,950 | T🤫 | 12/20/2021 11:39:10 | And then same with P2 | 0 | 1 | null | null | null | null | null | |||||
205,454 | help-1 | 49f64b1e1ccb42edb4caba968fc5c890 | 742,155,378,221,121,500 | kayl.09 | 12/20/2021 11:39:23 | but wouldnt i need to show that using the definition or orthagonal projection? | 1 | 0 | null | null | null | null | null | |||||
205,454 | help-1 | 49f64b1e1ccb42edb4caba968fc5c890 | 440,202,413,610,237,950 | T🤫 | 12/20/2021 11:39:56 | Yeah using defn | 0 | 1 | null | null | null | null | null | |||||
205,454 | help-1 | 49f64b1e1ccb42edb4caba968fc5c890 | 440,202,413,610,237,950 | T🤫 | 12/20/2021 11:40:29 | Isn’t the defn like if every v in V =u1+u2 where u1 and u2 are unique | 0 | 1 | null | null | null | null | null | |||||
205,454 | help-1 | 49f64b1e1ccb42edb4caba968fc5c890 | 440,202,413,610,237,950 | T🤫 | 12/20/2021 11:40:45 | And u1 belongs to U1 and u2 to U2 | 0 | 1 | null | null | null | null | null | |||||
205,454 | help-1 | 49f64b1e1ccb42edb4caba968fc5c890 | 440,202,413,610,237,950 | T🤫 | 12/20/2021 11:40:54 | Then define the projection using the basis | 0 | 1 | null | null | null | null | null | |||||
205,454 | help-1 | 49f64b1e1ccb42edb4caba968fc5c890 | 440,202,413,610,237,950 | T🤫 | 12/20/2021 11:43:28 | Does that help at all? | 0 | 1 | null | null | null | null | null | |||||
205,454 | help-1 | 49f64b1e1ccb42edb4caba968fc5c890 | 742,155,378,221,121,500 | kayl.09 | 12/20/2021 12:06:21 | i think so | 1 | 0 | null | null | null | null | null | |||||
205,455 | help-1 | fe932ba117a4448c94965242fdb772e6 | 550,391,700,288,438,340 | Soroush | 01/17/2022 07:52:11 | Hello.
How can I find the number of perfect squares in given range?
E.g.: How many perfect squares are there between 40^4 – 1 and 50^4 + 1? | 1 | 0 | null | null | null | null | null | |||||
205,455 | help-1 | fe932ba117a4448c94965242fdb772e6 | 526,808,110,443,266,050 | Dev Shah | 01/17/2022 07:54:57 | there won't be any perfect square b/w n^2 and, (n+1)^2 | 0 | 1 | null | null | null | null | null | |||||
205,455 | help-1 | fe932ba117a4448c94965242fdb772e6 | 526,808,110,443,266,050 | Dev Shah | 01/17/2022 07:55:56 | so there'll be exactly (m-n+1) perfect squares between n^2 -1 and m^2 +1 | 0 | 1 | null | null | null | null | null | |||||
205,455 | help-1 | fe932ba117a4448c94965242fdb772e6 | 550,391,700,288,438,340 | Soroush | 01/17/2022 07:56:37 | My question isn't the same is it? | 1 | 0 | null | null | null | null | null | |||||
205,455 | help-1 | fe932ba117a4448c94965242fdb772e6 | 526,808,110,443,266,050 | Dev Shah | 01/17/2022 07:57:13 | that's just the starting thing we need for finding the total number of perfect squares | 0 | 1 | null | null | null | null | null | |||||
205,455 | help-1 | fe932ba117a4448c94965242fdb772e6 | 526,808,110,443,266,050 | Dev Shah | 01/17/2022 07:58:19 | it goes like n^2, (n+1)^2, (n+2)^2 ... (n+k)^2 | 0 | 1 | null | null | null | null | null | |||||
205,455 | help-1 | fe932ba117a4448c94965242fdb772e6 | 550,391,700,288,438,340 | Soroush | 01/17/2022 07:59:04 | I tested this question with a Python code and it said there are 11 perfect squares between those numbers. | 1 | 0 | null | null | null | null | null | |||||
205,455 | help-1 | fe932ba117a4448c94965242fdb772e6 | 526,808,110,443,266,050 | Dev Shah | 01/17/2022 07:59:08 | so between n^2 -1 and (n+k)^2 +1, there'll be k+1 perfect squares | 0 | 1 | 803,015,460,106,928,100 | AlienofJuptr | 1066 | AlienofJuptr | false | |||||
205,455 | help-1 | fe932ba117a4448c94965242fdb772e6 | 526,808,110,443,266,050 | Dev Shah | 01/17/2022 08:00:02 | I think your code's wrong, then. there should be 2500-1600+1 perfect squares | 0 | 1 | null | null | null | null | null | |||||
205,455 | help-1 | fe932ba117a4448c94965242fdb772e6 | 526,808,110,443,266,050 | Dev Shah | 01/17/2022 08:00:21 | 11 will be the answer for 40^2 -1 and 50^2 +1 | 0 | 1 | null | null | null | null | null | |||||
205,455 | help-1 | fe932ba117a4448c94965242fdb772e6 | 550,391,700,288,438,340 | Soroush | 01/17/2022 08:00:55 | Yeah I knew that solution.
Does it always work? | 1 | 0 | null | null | null | null | null | |||||
205,455 | help-1 | fe932ba117a4448c94965242fdb772e6 | 526,808,110,443,266,050 | Dev Shah | 01/17/2022 08:01:58 | yes | 0 | 1 | null | null | null | null | null | |||||
205,455 | help-1 | fe932ba117a4448c94965242fdb772e6 | 526,808,110,443,266,050 | Dev Shah | 01/17/2022 08:02:38 | if you know the squares near the boundary, you can always do it | 0 | 1 | null | null | null | null | null | |||||
205,455 | help-1 | fe932ba117a4448c94965242fdb772e6 | 550,391,700,288,438,340 | Soroush | 01/17/2022 08:04:48 | Is it right? | unknown.png | 1 | 0 | null | null | null | null | null | ||||
205,455 | help-1 | fe932ba117a4448c94965242fdb772e6 | 526,808,110,443,266,050 | Dev Shah | 01/17/2022 08:05:09 | 👍 | 0 | 1 | null | null | null | null | null | |||||
205,455 | help-1 | fe932ba117a4448c94965242fdb772e6 | 550,391,700,288,438,340 | Soroush | 01/17/2022 08:07:28 | You're so helpful.
Thank you! | 1 | 0 | null | null | null | null | null | |||||
205,455 | help-1 | fe932ba117a4448c94965242fdb772e6 | 550,391,700,288,438,340 | Soroush | 01/17/2022 08:07:46 | .close | 1 | 0 | null | null | null | null | null | |||||
205,456 | help-1 | 8336f20112a0447aa18e6f0896bc35e3 | 309,827,487,217,483,800 | Bordyll | 01/17/2022 08:18:19 | this may be a bit of a simple question, but if you have 3 bags of 5 and want to pick at least 2 from each for 7 total, why cant you do it by 5C2 * 5C2 * 5C2 * 9C1 | 1 | 0 | null | null | null | null | null | |||||
205,456 | help-1 | 8336f20112a0447aa18e6f0896bc35e3 | 309,827,487,217,483,800 | Bordyll | 01/17/2022 08:20:40 | because i think there should be 3000 possible but using the above method produces 9000 and i do not understand why it must be divided by 3 | 1 | 0 | null | null | null | null | null | |||||
205,456 | help-1 | 8336f20112a0447aa18e6f0896bc35e3 | 321,445,119,171,756,000 | Shuri2060 | 01/17/2022 08:22:43 | Bag 1: 1 2 3 4 5
Bag 2: 6 7 8 9 10
Bag 3: 11 12 13 14 15 | 0 | 1 | null | null | null | null | null | |||||
205,456 | help-1 | 8336f20112a0447aa18e6f0896bc35e3 | 321,445,119,171,756,000 | Shuri2060 | 01/17/2022 08:23:30 | With your method of counting... | 0 | 1 | null | null | null | null | null | |||||
205,456 | help-1 | 8336f20112a0447aa18e6f0896bc35e3 | 321,445,119,171,756,000 | Shuri2060 | 01/17/2022 08:23:51 | Aren't you counting | 0 | 1 | null | null | null | null | null | |||||
205,456 | help-1 | 8336f20112a0447aa18e6f0896bc35e3 | 321,445,119,171,756,000 | Shuri2060 | 01/17/2022 08:24:32 | 1 2 3 6 7 11 12 | 0 | 1 | null | null | null | null | null | |||||
205,456 | help-1 | 8336f20112a0447aa18e6f0896bc35e3 | 321,445,119,171,756,000 | Shuri2060 | 01/17/2022 08:24:35 | In multiple ways | 0 | 1 | null | null | null | null | null | |||||
205,456 | help-1 | 8336f20112a0447aa18e6f0896bc35e3 | 321,445,119,171,756,000 | Shuri2060 | 01/17/2022 08:25:09 | (1 2) (6 7) (11 12) (3) | 0 | 1 | null | null | null | null | null | |||||
205,456 | help-1 | 8336f20112a0447aa18e6f0896bc35e3 | 321,445,119,171,756,000 | Shuri2060 | 01/17/2022 08:25:16 | (1 3) (6 7) (11 12) (2) | 0 | 1 | null | null | null | null | null | |||||
205,456 | help-1 | 8336f20112a0447aa18e6f0896bc35e3 | 321,445,119,171,756,000 | Shuri2060 | 01/17/2022 08:25:26 | (2 3) (6 7) (11 12) (1) | 0 | 1 | null | null | null | null | null | |||||
205,456 | help-1 | 8336f20112a0447aa18e6f0896bc35e3 | 321,445,119,171,756,000 | Shuri2060 | 01/17/2022 08:28:25 | ===
Another way of counting is
3(5c3 5c2 5c2).
Choose which bag contains 3. Then count. | 0 | 1 | null | null | null | null | null | |||||
205,457 | help-1 | 06bd490895a54a15b46266dfb9fe25c6 | 283,813,869,938,540,540 | Saruman | 01/17/2022 10:21:13 | Hi, can anyone explain how the final answer is made positive? Because in my calculations it becomes negative | IMG_3792.jpg | 1 | 0 | null | null | null | null | null | ||||
205,457 | help-1 | 06bd490895a54a15b46266dfb9fe25c6 | 348,696,743,388,381,200 | A Lonely Bean | 01/17/2022 10:22:05 | Because you rewrote (-2)^2 as (-4) | 0 | 1 | null | null | null | null | null | |||||
205,457 | help-1 | 06bd490895a54a15b46266dfb9fe25c6 | 348,696,743,388,381,200 | A Lonely Bean | 01/17/2022 10:22:08 | Which is false | 0 | 1 | null | null | null | null | null | |||||
205,457 | help-1 | 06bd490895a54a15b46266dfb9fe25c6 | 312,559,012,346,331,140 | xdk1235 | 01/17/2022 10:22:08 | The first step is wrong ^ | 0 | 1 | null | null | null | null | null | |||||
205,457 | help-1 | 06bd490895a54a15b46266dfb9fe25c6 | 283,813,869,938,540,540 | Saruman | 01/17/2022 10:23:14 | it would be positive right? | 1 | 0 | null | null | null | null | null | |||||
205,457 | help-1 | 06bd490895a54a15b46266dfb9fe25c6 | 348,696,743,388,381,200 | A Lonely Bean | 01/17/2022 10:23:18 | Yes | 0 | 1 | null | null | null | null | null | |||||
205,457 | help-1 | 06bd490895a54a15b46266dfb9fe25c6 | 283,813,869,938,540,540 | Saruman | 01/17/2022 10:23:41 | so it is just that one error XD | 1 | 0 | null | null | null | null | null | |||||
205,457 | help-1 | 06bd490895a54a15b46266dfb9fe25c6 | 283,813,869,938,540,540 | Saruman | 01/17/2022 10:23:44 | yikes | 1 | 0 | null | null | null | null | null | |||||
205,457 | help-1 | 06bd490895a54a15b46266dfb9fe25c6 | 283,813,869,938,540,540 | Saruman | 01/17/2022 10:24:06 | well thank you so much | 1 | 0 | null | null | null | null | null | |||||
205,457 | help-1 | 06bd490895a54a15b46266dfb9fe25c6 | 283,813,869,938,540,540 | Saruman | 01/17/2022 10:24:09 | .close | 1 | 0 | null | null | null | null | null | |||||
205,458 | help-1 | dcac515c0c3347f483509aa09e53f0d1 | 404,188,181,559,246,850 | leewchaha | 01/17/2022 10:39:27 | $13x (3x-6) + (x+1)$ | 1 | 0 | null | null | null | null | null | |||||
205,458 | help-1 | dcac515c0c3347f483509aa09e53f0d1 | 510,789,298,321,096,700 | TeXit | 01/17/2022 10:39:29 | **leewchaha** | 404188181559246858.png | 0 | 1 | null | null | null | null | null | ||||
205,458 | help-1 | dcac515c0c3347f483509aa09e53f0d1 | 404,188,181,559,246,850 | leewchaha | 01/17/2022 10:40:12 | do i multiply the 13x into only (3x -6) or to both (3x - 6) and (x + 1) | 1 | 0 | null | null | null | null | null | |||||
205,458 | help-1 | dcac515c0c3347f483509aa09e53f0d1 | 220,517,274,845,577,200 | ramonov | 01/17/2022 10:41:03 | only the (3x-6) | 0 | 1 | 733,716,035,659,628,500 | fulgangstamod22 | 5768 | fulgangstamod22 | false | |||||
205,458 | help-1 | dcac515c0c3347f483509aa09e53f0d1 | 220,517,274,845,577,200 | ramonov | 01/17/2022 10:41:26 | recall the order of operations | 0 | 1 | null | null | null | null | null | |||||
205,458 | help-1 | dcac515c0c3347f483509aa09e53f0d1 | 404,188,181,559,246,850 | leewchaha | 01/17/2022 10:45:24 | thanks a lot! | 1 | 0 | null | null | null | null | null | |||||
205,458 | help-1 | dcac515c0c3347f483509aa09e53f0d1 | 404,188,181,559,246,850 | leewchaha | 01/17/2022 10:45:28 | .close | 1 | 0 | null | null | null | null | null | |||||
205,459 | help-1 | d77ced20f7304d88bcdb4257fd4cdf15 | 896,755,250,092,998,800 | b3s4d | 01/17/2022 10:54:48 | guys why is this legal? | unknown.png | 1 | 0 | null | null | null | null | null | ||||
205,459 | help-1 | d77ced20f7304d88bcdb4257fd4cdf15 | 348,696,743,388,381,200 | A Lonely Bean | 01/17/2022 10:55:16 | Because ln is continuous | 0 | 1 | null | null | null | null | null | |||||
205,459 | help-1 | d77ced20f7304d88bcdb4257fd4cdf15 | 896,755,250,092,998,800 | b3s4d | 01/17/2022 10:55:25 | that means? | 1 | 0 | null | null | null | null | null | |||||
205,459 | help-1 | d77ced20f7304d88bcdb4257fd4cdf15 | 348,696,743,388,381,200 | A Lonely Bean | 01/17/2022 10:55:35 | So you can interchange the limit and the ln | 0 | 1 | null | null | null | null | null | |||||
205,459 | help-1 | d77ced20f7304d88bcdb4257fd4cdf15 | 260,975,264,987,611,140 | gmod | 01/17/2022 10:55:48 | do you know what a continuous function is? | 0 | 1 | null | null | null | null | null | |||||
205,459 | help-1 | d77ced20f7304d88bcdb4257fd4cdf15 | 896,755,250,092,998,800 | b3s4d | 01/17/2022 10:56:07 | a function without missing a part right? | 1 | 0 | null | null | null | null | null | |||||
205,459 | help-1 | d77ced20f7304d88bcdb4257fd4cdf15 | 896,755,250,092,998,800 | b3s4d | 01/17/2022 10:56:21 | so i can take any function like sin or e and swap it with lim? | 1 | 0 | null | null | null | null | null | |||||
205,459 | help-1 | d77ced20f7304d88bcdb4257fd4cdf15 | 260,975,264,987,611,140 | gmod | 01/17/2022 10:56:38 | technically yeah | 0 | 1 | null | null | null | null | null | |||||
205,459 | help-1 | d77ced20f7304d88bcdb4257fd4cdf15 | 260,975,264,987,611,140 | gmod | 01/17/2022 10:56:57 | yeah if im not mistaken | 0 | 1 | null | null | null | null | null | |||||
205,459 | help-1 | d77ced20f7304d88bcdb4257fd4cdf15 | 260,975,264,987,611,140 | gmod | 01/17/2022 10:57:24 | first always make sure the function is continuous | 0 | 1 | null | null | null | null | null | |||||
205,459 | help-1 | d77ced20f7304d88bcdb4257fd4cdf15 | 348,696,743,388,381,200 | A Lonely Bean | 01/17/2022 10:57:40 | Might be some exceptions but 99% you'd do that | 0 | 1 | null | null | null | null | null | |||||
205,459 | help-1 | d77ced20f7304d88bcdb4257fd4cdf15 | 896,755,250,092,998,800 | b3s4d | 01/17/2022 10:57:45 | ok but thats so weird | 1 | 0 | null | null | null | null | null | |||||
205,459 | help-1 | d77ced20f7304d88bcdb4257fd4cdf15 | 896,755,250,092,998,800 | b3s4d | 01/17/2022 10:57:47 | why is that possible | 1 | 0 | null | null | null | null | null | |||||
205,459 | help-1 | d77ced20f7304d88bcdb4257fd4cdf15 | 348,696,743,388,381,200 | A Lonely Bean | 01/17/2022 10:58:09 | Well, you know | 0 | 1 | null | null | null | null | null | |||||
205,459 | help-1 | d77ced20f7304d88bcdb4257fd4cdf15 | 348,696,743,388,381,200 | A Lonely Bean | 01/17/2022 10:58:42 | Limit of, for example ln(2x + 1) as x approaches 1 is equal to ln3, because 2x + 1 approaches 3 here | 0 | 1 | 321,445,119,171,756,000 | Shuri2060 | 9525 | a μ-er | false | |||||
205,459 | help-1 | d77ced20f7304d88bcdb4257fd4cdf15 | 348,696,743,388,381,200 | A Lonely Bean | 01/17/2022 10:58:45 | Same logic here | 0 | 1 | null | null | null | null | null | |||||
205,459 | help-1 | d77ced20f7304d88bcdb4257fd4cdf15 | 896,755,250,092,998,800 | b3s4d | 01/17/2022 10:59:36 | ok thats true | 1 | 0 | null | null | null | null | null | |||||
205,459 | help-1 | d77ced20f7304d88bcdb4257fd4cdf15 | 896,755,250,092,998,800 | b3s4d | 01/17/2022 10:59:38 | thank you | 1 | 0 | null | null | null | null | null | |||||
205,460 | help-1 | f996cff531ce4fe59d4759d873a814ce | 283,813,869,938,540,540 | Saruman | 01/17/2022 11:26:34 | Really small question, but why does this equal 1 and not zero? | IMG_3796.jpg | 1 | 0 | null | null | null | null | null | ||||
205,460 | help-1 | f996cff531ce4fe59d4759d873a814ce | 283,813,869,938,540,540 | Saruman | 01/17/2022 11:27:08 | The exponents would cancel out | 1 | 0 | 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.