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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
66 | help-10 | 28cb70fd2d414e7381a4a0cdb9e87df8 | 897,280,611,490,857,000 | Karlsfeni | 01/14/2022 13:45:37 | i dont understand | 1 | 0 | null | null | null | null | null |
|||||
66 | help-10 | 28cb70fd2d414e7381a4a0cdb9e87df8 | 183,668,144,404,037,630 | Ann | 01/14/2022 13:50:33 | what do you not understand exactly? | 0 | 1 | null | null | null | null | null |
|||||
67 | help-10 | fb6566dc441e4876b0782fbe5c19a09a | 368,100,347,681,701,900 | Avernakis | 01/14/2022 14:36:49 | Somebody please explain how to do this. I only have an hour to finish and submit, i know what a tesselation and I have the necesarry software but how do I actually create one please. (Don't do it for me just explain)
```Using your geometry software, create a regular tessellation. You may use color patterns to make the tessellation more visually interesting.Make a screenshot of your tessellation and paste it into this assignment. In the space provided below, write a detailed explanation of the steps you followed to create your tessellation. A model worksheet and response have been provided for you. If you choose to tessellate the same regular polygon as the example provided, you must use different transformations from those used in the model
``` | 1 | 0 | null | null | null | null | null |
|||||
67 | help-10 | fb6566dc441e4876b0782fbe5c19a09a | 508,442,553,754,845,200 | vera. | 01/14/2022 14:37:54 | Just select some polygons that can be tessellated and spam them lol | 0 | 1 | null | null | null | null | null |
|||||
67 | help-10 | fb6566dc441e4876b0782fbe5c19a09a | 508,442,553,754,845,200 | vera. | 01/14/2022 14:38:38 | Ex squares are simple and can be tessellated and I can spam them in geogebra | 0 | 1 | null | null | null | null | null |
|||||
67 | help-10 | fb6566dc441e4876b0782fbe5c19a09a | 508,442,553,754,845,200 | vera. | 01/14/2022 14:38:52 | Find some more complex ones and do the same | 0 | 1 | null | null | null | null | null |
|||||
67 | help-10 | fb6566dc441e4876b0782fbe5c19a09a | 368,100,347,681,701,900 | Avernakis | 01/14/2022 14:38:58 | They also want me to create a "nonregular" and an "escher" tesselation | 1 | 0 | null | null | null | null | null |
|||||
67 | help-10 | fb6566dc441e4876b0782fbe5c19a09a | 508,442,553,754,845,200 | vera. | 01/14/2022 14:39:38 | Escher uses the same shape to tesselate infinitely | 0 | 1 | null | null | null | null | null |
|||||
67 | help-10 | fb6566dc441e4876b0782fbe5c19a09a | 508,442,553,754,845,200 | vera. | 01/14/2022 14:40:02 | For nonregular you should watch veritasiums video on nonperiodic tilings | 0 | 1 | null | null | null | null | null |
|||||
67 | help-10 | fb6566dc441e4876b0782fbe5c19a09a | 368,100,347,681,701,900 | Avernakis | 01/14/2022 14:40:31 | aa | 1 | 0 | null | null | null | null | null |
|||||
67 | help-10 | fb6566dc441e4876b0782fbe5c19a09a | 368,100,347,681,701,900 | Avernakis | 01/14/2022 14:40:35 | can u show example of escher and nonregular pls | 1 | 0 | null | null | null | null | null |
|||||
67 | help-10 | fb6566dc441e4876b0782fbe5c19a09a | 368,100,347,681,701,900 | Avernakis | 01/14/2022 14:40:39 | i get regular perfectly | 1 | 0 | null | null | null | null | null |
|||||
67 | help-10 | fb6566dc441e4876b0782fbe5c19a09a | 368,100,347,681,701,900 | Avernakis | 01/14/2022 14:40:42 | just spam congruent shapes | 1 | 0 | null | null | null | null | null |
|||||
67 | help-10 | fb6566dc441e4876b0782fbe5c19a09a | 368,100,347,681,701,900 | Avernakis | 01/14/2022 15:11:06 | @Mathematics Bot | 1 | 0 | 805,217,272,087,838,700 | Mathematics Bot | 0196 | Bot | true |
|||||
67 | help-10 | fb6566dc441e4876b0782fbe5c19a09a | 368,100,347,681,701,900 | Avernakis | 01/14/2022 15:11:10 | !close | 1 | 0 | null | null | null | null | null |
|||||
67 | help-10 | fb6566dc441e4876b0782fbe5c19a09a | 368,100,347,681,701,900 | Avernakis | 01/14/2022 15:11:34 | .close | 1 | 0 | null | null | null | null | null |
|||||
68 | help-10 | fb623a7b1be4493ca43f44662e583495 | 922,755,569,171,963,900 | smiless | 01/14/2022 15:24:24 | unknown.png | 1 | 0 | null | null | null | null | null |
|||||
68 | help-10 | fb623a7b1be4493ca43f44662e583495 | 312,559,012,346,331,140 | xdk1235 | 01/14/2022 15:26:21 | what are the units of volume and time? | 0 | 1 | null | null | null | null | null |
|||||
68 | help-10 | fb623a7b1be4493ca43f44662e583495 | 312,559,012,346,331,140 | xdk1235 | 01/14/2022 15:26:35 | assuming cm^3 and seconds you just plug in time = 12 | 0 | 1 | null | null | null | null | null |
|||||
68 | help-10 | fb623a7b1be4493ca43f44662e583495 | 922,755,569,171,963,900 | smiless | 01/14/2022 15:26:37 | I've had covid or something for 2 weeks now, I've been out for so long haha | 1 | 0 | null | null | null | null | null |
|||||
68 | help-10 | fb623a7b1be4493ca43f44662e583495 | 922,755,569,171,963,900 | smiless | 01/14/2022 15:26:39 | I have no clue | 1 | 0 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 898,205,674,931,122,200 | Dino Palavra | 11/03/2021 15:46:52 | Anyone willing to help with some "basic math homework ? :) | 1 | 0 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 898,205,674,931,122,200 | Dino Palavra | 11/03/2021 15:48:25 | So we have a logical expression of EBA!D v B!C!A!D v !EBC!D v EBC v BCD v E!CAD, the assignment is a) using quine mcCluskys algorithm find the minimal disjunctive form of the expression b)Using quine mccluskys algorith find the minimal conjunctive form of the expression and c) Show a) and b) results using Veitch diagrams. Im not stuck I just dont know how to do it, this is my first homework and its way too hard for a first homework, and I need to do it for points , so If you could help I would appreciate it very much sir | 1 | 0 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 15:49:02 | well a good start would be to know if you know Quine McClusky's algorithm | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 898,205,674,931,122,200 | Dino Palavra | 11/03/2021 15:49:43 | Well yeah... thats the problem I do not sir | 1 | 0 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 898,205,674,931,122,200 | Dino Palavra | 11/03/2021 15:50:07 | If you do not have the time its completely understandable | 1 | 0 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 898,205,674,931,122,200 | Dino Palavra | 11/03/2021 15:50:18 | I am asking for way too much | 1 | 0 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 15:50:26 | i mean | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 15:50:29 | did you not study it? | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 15:51:00 | i roughly know what this is about, but if your teacher didn't cover the algorithm in class that would be thoroughly surprising | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 15:51:22 | cause yknow, you don't ask for something you didn't study just like this | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 898,205,674,931,122,200 | Dino Palavra | 11/03/2021 15:52:31 | The thing is, this is my first homework and its way too hard (for me) I watched a lot of vids on yt, did some examples but then I just forget a lot of it, I will make sure to study it, but math is one of the subjects ive been lacking due to other assignments... The problem is they give out points for homeworks so yeah... | 1 | 0 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 898,205,674,931,122,200 | Dino Palavra | 11/03/2021 15:52:48 | I did learn truth tables and some basic things | 1 | 0 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 898,205,674,931,122,200 | Dino Palavra | 11/03/2021 15:52:51 | about axioms | 1 | 0 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 898,205,674,931,122,200 | Dino Palavra | 11/03/2021 15:53:10 | I havent had the time to understand these more complex subjects tho | 1 | 0 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 15:57:07 | Alright, I've brushed up on the algorithm | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 15:58:09 | Though, it might prove a bit cumbersome to explain within a text channel | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 15:58:16 | well, i'll be back with some pen and paper | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 898,205,674,931,122,200 | Dino Palavra | 11/03/2021 15:58:43 | Thank you sir! | 1 | 0 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 16:02:19 | The point of the Quine-McCluskey algorithm is looking for redundancies/patterns in the values that satisfy the expression | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 16:02:32 | (I won't need pen and paper after all I think) | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 898,205,674,931,122,200 | Dino Palavra | 11/03/2021 16:02:39 | makes sense | 1 | 0 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 16:02:51 | Here, I'll represent a value ABCDE in binary | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 16:03:01 | So TTFFT will be 11001 | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 898,205,674,931,122,200 | Dino Palavra | 11/03/2021 16:03:13 | yep that part I understand hahaha | 1 | 0 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 16:03:35 | So to start off we will write all of the values that satisfy the expression. I will write x in the cases where the value doesn't matter | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 16:05:08 | ```
11x01
0100x
x1100
x11x1
x111x
1x011
``` | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 16:05:18 | are all the "shapes" that satisfy the expression | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 16:05:34 | To calculate that I just looked at every "multiplicative" term of the expression | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 16:05:52 | I put a 1 where a value needed to be true, a 0 where it needed to be false, and x if the term in question didn't depend on it | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 16:06:22 | So what `0100x` means is that both `01000` and `01001` satisfy the expression | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 16:06:31 | Now we want to find redundancies | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 16:07:04 | To do that, we can scan each value, and see if by chance, they can be simplified | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 16:07:56 | For example, consider x1100, x111x and x11x1 | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 16:08:10 | Notice that in any case, the value of the last two bits doesn't matter | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 898,205,674,931,122,200 | Dino Palavra | 11/03/2021 16:08:38 | how did you know which values satistfy the expression? | 1 | 0 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 898,205,674,931,122,200 | Dino Palavra | 11/03/2021 16:08:43 | sorry if its a dumb question | 1 | 0 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 16:09:19 | The expression is a conjunction (everything is linked by logical ORs) | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 898,205,674,931,122,200 | Dino Palavra | 11/03/2021 16:09:33 | yep | 1 | 0 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 16:09:36 | so for a value to satisfy the expression, it only needs to satisfy one of the terms (between the ORs) | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 16:09:44 | For instance EBA!D | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 898,205,674,931,122,200 | Dino Palavra | 11/03/2021 16:09:49 | aaa okay | 1 | 0 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 898,205,674,931,122,200 | Dino Palavra | 11/03/2021 16:09:54 | makes sense | 1 | 0 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 16:09:56 | Let's reorder it to AB!DE | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 16:10:10 | We need A=1,B=1,D=0,E=1 and C doesn't matter | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 16:10:17 | Hence, 11x01 | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 16:10:30 | Back to this | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 898,205,674,931,122,200 | Dino Palavra | 11/03/2021 16:10:32 | ahhh okay | 1 | 0 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 898,205,674,931,122,200 | Dino Palavra | 11/03/2021 16:10:38 | now I understand!! | 1 | 0 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 16:10:50 | x1100 is the first one, x1101 satisfies the third one, x1110 satisfies the second one, x1111 satisfies both the last two | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 16:11:11 | so really, since the last two bits don't matter in this pattern | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 16:11:25 | We can merge x1100, x111x and x11x1 into `x11xx` | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 16:11:53 | So our new list looks like
```
11x01
0100x
x11xx
1x011
``` | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 898,205,674,931,122,200 | Dino Palavra | 11/03/2021 16:12:06 | that makes sense but anither question | 1 | 0 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 16:12:19 | go ahead | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 898,205,674,931,122,200 | Dino Palavra | 11/03/2021 16:12:24 | how? | 1 | 0 | 193,692,307,453,771,780 | Syst3ms | 9959 | Syst3ms | false |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 898,205,674,931,122,200 | Dino Palavra | 11/03/2021 16:12:35 | oh nvm | 1 | 0 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 898,205,674,931,122,200 | Dino Palavra | 11/03/2021 16:12:38 | I got it I got it | 1 | 0 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 898,205,674,931,122,200 | Dino Palavra | 11/03/2021 16:12:51 | Wow you explain this stuff really well | 1 | 0 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 898,205,674,931,122,200 | Dino Palavra | 11/03/2021 16:13:02 | I didnt expect this kind of help | 1 | 0 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 16:13:08 | you're welcome | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 898,205,674,931,122,200 | Dino Palavra | 11/03/2021 16:13:09 | Thank you so much | 1 | 0 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 898,205,674,931,122,200 | Dino Palavra | 11/03/2021 16:13:13 | continue sir | 1 | 0 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 898,205,674,931,122,200 | Dino Palavra | 11/03/2021 16:13:17 | its a pleasure to learn from u | 1 | 0 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 16:13:23 | now here, scan all you want, but you're not gonna find redundancies | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 16:13:31 | the patterns don't really overlap | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 16:13:49 | An example of a redundancy could have been `11x01` and `11x11` | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 16:13:59 | Which we could have simplified to `11xx1` | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 898,205,674,931,122,200 | Dino Palavra | 11/03/2021 16:14:11 | hmmm | 1 | 0 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 898,205,674,931,122,200 | Dino Palavra | 11/03/2021 16:14:45 | hiw can we simplify that the x is third in both cases | 1 | 0 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 16:15:08 | x means that this bit doesn't matter | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 16:15:15 | If it's 0 it satisfies the first one | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 898,205,674,931,122,200 | Dino Palavra | 11/03/2021 16:15:15 | yeah I understand | 1 | 0 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 16:15:21 | If it's 1 it satisfies the second one | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 16:15:33 | So we can just put an x instead of the fourth bit | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 16:15:37 | since it doesn't change the result | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 898,205,674,931,122,200 | Dino Palavra | 11/03/2021 16:15:53 | ahhh okay | 1 | 0 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 16:16:01 | as for the rest of the pattern i just made up something | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 16:16:24 | So if you scan you won't find redundancies | 0 | 1 | null | null | null | null | null |
|||||
69 | help-10 | 7af76615c1b149a98285f5b36eca7d34 | 193,692,307,453,771,780 | Syst3ms | 11/03/2021 16:16:52 | But if you really want to make sure there are none, you can do this : try to find a value that only one pattern satisfies | 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.