[00:19] <syule> ok i have a rule do you want to try
[00:19] <syule> another rule i mean
[00:19] <Floenne> sure
[00:19] <syule> it's a game now
[00:19] <syule> go
[00:19] <Floenne> 1 2 3
[00:19] <syule> yes
[00:19] <Floenne> 2 4 6
[00:19] <syule> yes
[00:20] <Floenne> 3 6 9
[00:20] <syule> yes
[00:20] <+Kalassak> darvince what
[00:20] <+Darvince> 20 900 4500
[00:20] <syule> yes
[00:20] <Floenne> 3 2 1
[00:20] <syule> yes
[00:20] <+Darvince> 0 pi -31
[00:20] <syule> hmm
[00:20] <syule> no
[00:20] <+Darvince> 0 3 -31
[00:20] <Floenne> -1 0 1
[00:20] <syule> oh god
[00:20] <syule> one at a time please
[00:20] <+Darvince> ok
[00:20] <+Kalassak> 1 1 1
[00:20] <Floenne> just do
[00:20] <syule> no to both
[00:20] <Floenne> @dar
[00:20] <Floenne> @fiah
[00:20] <syule> yes to 111
[00:20] <Floenne> 0 1 2
[00:20] <syule> yes
[00:20] <+Kalassak> 101
[00:20] <syule> >101
[00:21] <syule> that's 1 number
[00:21] <Floenne> wtf is 101
[00:21] <+Kalassak> there were supposed to be spaces
[00:21] <+Kalassak> sorry
[00:21] <+Kalassak> my comp
[00:21] <+Kalassak> is shit
[00:21] <+Kalassak> ok
[00:21] <syule> wait
[00:21] <Floenne> -3 -2 -1
[00:21] <syule> -1 0 1 was a yes
[00:21] <+Kalassak> i'm downloading huge files andt hatl agsev erything
[00:21] <syule> i screwed that up
[00:21] <Floenne> oh ok
[00:21] <syule> because i was trying to do 10 things at once
[00:21] <syule> -3 -2 -1 is also yes
[00:21] <Floenne> -1 2 -4
[00:21] <+Kalassak> 1 2.5 3
[00:21] <syule> no
[00:21] <syule> and no
[00:21] <Floenne> 1 2 -4
[00:21] <syule> no
[00:22] <+Darvince> 1 2 4
[00:22] <syule> yes
[00:22] <+Kalassak> 1 -2 4
[00:22] <syule> yes
[00:22] <+Darvince> 1 2 2
[00:22] <syule> no
[00:22] <+Kalassak> 1 2 -1
[00:22] <syule> no
[00:22] <Floenne> no
[00:22] <+Kalassak> -1 -2 1
[00:22] <syule> yes
[00:22] <+Darvince> WHAT
[00:22] <+Kalassak> ^
[00:22] <syule> uh
[00:22] <Floenne> 32 184 -2
[00:22] <syule> what do you mean what
[00:23] <syule> did i disprove your hypotenuse
[00:23] <+Darvince> it broke the rule i had in my head
[00:23] <Floenne> no?
[00:23] <syule> lol what was it
[00:23] <+Kalassak> same
[00:23] <+Darvince> increasing by absolute value
[00:23] <syule> kol
[00:23] <+Kalassak> oh for me it disproved
[00:23] <Floenne> syule 32 184 -2
[00:23] <syule> 32 184 -2 is a no
[00:23] <Floenne> ok
[00:23] <Floenne> 0 0 -1
[00:23] <syule> no
[00:23] <+Darvince> 0 0 0
[00:23] <syule> yes
[00:23] <+Kalassak> hm
[00:23] <Floenne> 0 -1 0
[00:23] <syule> yes
[00:24] <Floenne> hmm
[00:24] <syule> lmao this is immensely amusing
[00:24] <Floenne> i think I have an answer but i'm still not sure
[00:24] <syule> ok
[00:24] <Floenne> or at least a partial answer
[00:24] <syule> wew
[00:24] <syule> try to disprove it
[00:24] <+Kalassak> 0 -1 -1
[00:24] <syule> yes
[00:24] <Floenne> let's see
[00:24] <+Kalassak> -1 0 -1
[00:24] <Floenne> 3 4 -19
[00:24] <syule> no
[00:24] <syule> and no
[00:25] <+Kalassak> i don't know how to state the rule positively
[00:25] <+Darvince> inb4 something to do with sines
[00:25] <Floenne> hmmm how do i disprove this
[00:25] <syule> it's not fucking complicated darvince
[00:25] <syule> uh
[00:25] <syule> i dunno floenne
[00:25] <+Kalassak> i feel like
[00:25] <syule> but i was reading this paper on how people who failed this experiment
[00:25] <+Kalassak> a no is recieved by
[00:25] <syule> kept trying to prove their hypothesis
[00:25] <syule> instead of trying to disprove it
[00:25] <syule> so they failed
[00:25] <+Darvince> but that's what i'm doing
[00:25] <+Darvince> but i have no hypothesis
[00:25] <+Kalassak> the last number being negative
[00:25] <+Kalassak> unless
[00:25] <+Darvince> so i can't do anything
[00:25] <+Kalassak> the 2nd number is negative too
[00:26] <+Kalassak> but idk how to state that
[00:26] <syule> well you want to make a hypothesis
[00:26] <+Darvince> oh i have a hypothesis now thanks nue
[00:26] <Floenne> can we get abstract
[00:26] <Floenne> like
[00:26] <+Darvince> -5 -5 1
[00:26] <Floenne> n n -n
[00:26] <syule> nah man
[00:26] <Floenne> where n > 0
[00:26] * Kalassak predicts yes
[00:26] <Floenne> oh ok
[00:26] <syule> what if it depends on n
[00:26] <syule> not saying it does
[00:26] <syule> -5 -5 1 is yes
[00:26] <+Kalassak> for dar's sequence
[00:26] <+Darvince> can we involve imaginaries
[00:26] <Floenne> well I mean we can baiscally assume anything without a negative at the end and positives at the start works
[00:27] <syule> uh
[00:27] <syule> no keep it to integers
[00:27] <+Darvince> gdi
[00:27] <Floenne> but how would i disprove that
[00:27] <+Darvince> i was about to say
[00:27] <+Kalassak> floenne what do you mean works
[00:27] <+Darvince> -e e e²
[00:27] <syule> also i didn't expect this to be so hard
[00:27] <Floenne> doesn't work*
[00:27] <+Kalassak> that should give a no
[00:27] <syule> darvince yes
[00:27] <+Kalassak> it also seems
[00:27] <syule> wait
[00:27] <syule> actually
[00:27] <+Kalassak> that if both 2nd and last number are negative
[00:27] <+Kalassak> it gives a yes
[00:27] <+Darvince> e² is near 10
[00:27] <syule> it's a no
[00:27] <+Darvince> YES
[00:27] <+Darvince> is it like
[00:28] <+Kalassak> -1 2 3
[00:28] <+Darvince> what's the name for whether a number is positive or negative
[00:28] <+Kalassak> ?
[00:28] <Floenne> -1 2 3 works i think
[00:28] <Floenne> i mean ascending descending
[00:28] <syule> -1 2 3 is no
[00:28] <Floenne> hm
[00:28] <+Darvince> -1 2 -3
[00:28] <syule> yes
[00:28] <syule> wait
[00:28] <syule> shit
[00:28] <syule> no
[00:28] <+Kalassak> what
[00:28] <+Kalassak> ok
[00:28] <+Darvince> rip my hypothesis
[00:28] <syule> -1 2 -3 is no
[00:28] <syule> ok want a hint
[00:28] <Floenne> no
[00:28] <syule> ok
[00:29] <+Darvince> now only people who said 'no' can guess
[00:29] <Floenne> 2 6 -8
[00:29] <+Darvince> all who vote this say aye
[00:29] <syule> no
[00:29] <+Kalassak> 2 -3 4
[00:29] <Floenne> 1 3 -5
[00:29] <+Darvince> wAIT NEW PHYOTHESIS
[00:29] <syule> yes and no
[00:29] <+Darvince> 3000 6000 180000
[00:29] <syule> yes
[00:29] <+Kalassak> the first and last number must be positive, or the second number must be negative?
[00:29] <Floenne> yes
[00:29] <+Kalassak> idk if that's stated logically enough
[00:29] <syule> @nue nope
[00:29] <+Darvince> wait a second
[00:29] <+Darvince> wrong number of 0's
[00:30] <Floenne> 1 6 -1
[00:30] <+Darvince> 3000 6000 18000000
[00:30] <+Kalassak> the first or last number must be positive
[00:30] <+Kalassak> but
[00:30] <syule> no for floenne
[00:30] <+Kalassak> if the first or last number is negative
[00:30] <syule> and yes for darvince
[00:30] <+Kalassak> then the second number must be negative
[00:30] <+Darvince> uh
[00:30] <Floenne> 3 4 -25
[00:30] <+Darvince> 30 60 1800
[00:30] <+Darvince> ?
[00:30] <+Kalassak> am i on the right track and just using the wrong words or what
[00:30] <syule> you all get 2 guesses max
[00:30] <syule> 3 4 -25 is no
[00:30] <syule> 30 60 1800 is yes
[00:30] <+Darvince> if it's still yes i'll switch to a different method
[00:30] <Floenne> wait did i already guess
[00:30] <syule> no you haven't
[00:31] <Floenne> ok
[00:31] <Floenne> hmm
[00:31] <+Darvince> 30 -60 1800
[00:31] <syule> yes
[00:31] <+Darvince> rip hypothesis
[00:31] <Floenne> 1 0 -1
[00:31] <syule> kol i didn't expect this to be so difficult
[00:31] <syule> yes at fiah
[00:31] <Floenne> huh
[00:31] <+Darvince> -3 3 9
[00:31] <+Darvince> 9
[00:31] <Floenne> 1 1 -1
[00:31] <+Darvince> oops
[00:31] <syule> no at fiah
[00:31] <syule> yes for -3 3 9
[00:31] <Floenne> 6 0 -6
[00:32] <syule> yes
[00:32] <Floenne> 5 0 -6
[00:32] <+Kalassak> -2 3 3
[00:32] <syule> no for 5 0 -6
[00:32] <Floenne> 5 -1 -6
[00:32] <syule> no for -2 3 3
[00:32] <+Kalassak> -2 3 100
[00:32] <syule> slow down
[00:32] <syule> yes for 5 -1 -6
[00:32] <syule> yes for -2 3 100
[00:32] <+Darvince> syule if it takes you time to calculate
[00:33] <Floenne> 6 0 -4
[00:33] <+Darvince> then it's going to take us hours to guess
[00:33] <+Kalassak> ^
[00:33] <Floenne> no
[00:33] <Floenne> i feel like i have something
[00:33] <syule> the rule is literally < 10 words
[00:33] <syule> 6 0 -4 is yes
[00:33] <Floenne> 6 3 -4
[00:33] <syule> no
[00:33] <+Darvince> well those 10 words could involve riemann's lemma or whatever i don't know super high level math stuff
[00:33] <+Kalassak> i could make a rule involving polynomials
[00:33] <+Kalassak> that uses less than 10 words
[00:33] <syule> darvince it's not hard
[00:33] <+Kalassak> too
[00:33] <Floenne> 6 -10000000000000000000 -1
[00:33] <syule> yes
[00:34] <Floenne> ok
[00:34] <syule> do you have it
[00:34] <+Darvince> 1E+305 0 0
[00:34] <+Kalassak> -2 3 5
[00:34] <syule> darvince yes
[00:34] <Floenne> i believe I do
[00:34] <syule> nue no
[00:34] <Floenne> but one more
[00:34] <syule> ok
[00:34] <+Kalassak> -2 3 6
[00:34] <Floenne> 2 4 2
[00:34] <syule> no to -2 3 6
[00:34] <syule> no to 2 4 2
[00:34] <+Darvince> 10^10^10^10^10^10^10... 1 1
[00:34] <Floenne> 2 3 2
[00:34] <syule> yes to darvince
[00:34] <+Kalassak> i'm so confused
[00:34] * Darvince has no hypothesis
[00:34] <syule> no to 2 3 2
[00:34] <syule> get one darvince
[00:34] <Floenne> wait
[00:35] <+Darvince> 6 5 4
[00:35] <syule> uh if something messed you up type it again cause i might've screwed up once or twice
[00:35] <syule> yes to 6 5 4
[00:35] <+Darvince> 6 5 5
[00:35] <+Kalassak> syule they should do this at job interviews
[00:35] <syule> yes to 6 5 5
[00:35] <Floenne> 2 3 2 no
[00:35] <+Darvince> darn
[00:35] <Floenne> so hmmmm
[00:35] <syule> 2 3 2 is a no
[00:35] <Floenne> and
[00:35] <+Darvince> 1 2 3
[00:35] <Floenne> wait hmm
[00:35] <+Darvince> 2 3 4
[00:35] <Floenne> 2 3 -2
[00:35] <+Darvince> 3 4 5
[00:36] <+Darvince> 4 5 6
[00:36] <Floenne> dar stfu
[00:36] <+Darvince> 5 6 7
[00:36] <+Darvince> 6 7 8
[00:36] <+Darvince> 7 8 9
[00:36] <Floenne> those are all yes
[00:36] <syule> 2 3 -2 is a no
[00:36] <syule> and floenne is correct about all yes
[00:36] <+Darvince> syule are all mine yes
[00:36] <+Darvince> k
[00:36] <+Darvince> 0 0 -5!
[00:36] <Floenne> 6 5 -1 should be no i think
[00:36] <syule> wtf is -5!
[00:36] <Floenne> wait no
[00:36] <Floenne> idk let's see
[00:36] <+Darvince> uh
[00:36] <+Darvince> a complex number
[00:36] <syule> 6 5 -1 is a no
[00:36] <Floenne> ok 6 5 -2
[00:36] <syule> what
[00:37] <Floenne> i think i had a brain lapse
[00:37] <syule> 6 5 -2 is still no
[00:37] <Floenne> 3 5 3 should be a no
[00:37] <syule> true
[00:37] <+Darvince> is a complex number no
[00:37] <+Darvince> or is it in the bounds of the rule
[00:37] <syule> i don't do complexes
[00:37] <Floenne> but 7 5 -1 yes
[00:37] <Floenne> wait hmm
[00:37] <syule> 7 5 -1 is a no
[00:37] <syule> do you want a problem solving hint
[00:37] <+Darvince> i swear to god
[00:37] <+Darvince> if this is fucking polynomials
[00:38] <syule> IT'S NOT FUCKING POLYNOMIALS
[00:38] <Floenne> no hold on let me collect my thoughts
[00:38] <Floenne> that's our hint guys
[00:38] <+Darvince> but is it normal polynomials
[00:38] <syule> >normal polynomial
[00:38] <syule> i don't know what an unnormal polynomial is
[00:38] <+Darvince> instead of fucking polynomials
[00:38] <syule> can polynomials be gay?
[00:38] <syule> transgender?
[00:38] <syule> sexual?
[00:38] <syule> sexy?
[00:38] <+Darvince> no a fucking polynomial
[00:39] <syule> let's have sex
[00:39] <Floenne> 0 -5 -4
[00:39] <syule> yes
[00:39] <Floenne> 0 -5 -6
[00:39] <syule> yes
[00:39] <Floenne> huh
[00:39] <syule> hue hue hue
[00:39] <+Darvince> 0 -5 -5
[00:39] <Floenne> or if
[00:40] <syule> 0 -5 -5 is a yes
[00:40] * Darvince has new hypothesis that would ca-
[00:40] <+Darvince> GDI
[00:40] <Floenne> -8 -5 -1
[00:40] <syule> yes
[00:40] <+Darvince> my hypothesis would've caused you to take a while on the large number ones
[00:40] <+Darvince> or weird ones
[00:40] <Floenne> -8 9 -1
[00:40] <syule> no
[00:40] <Floenne> ooh
[00:41] <Floenne> 2 -1 2
[00:41] <Floenne> yes?
[00:41] <syule> yes
[00:41] <Floenne> -2 -1 -2
[00:41] <Floenne> yes?
[00:41] <syule> no
[00:42] <Floenne> processing
[00:42] <syule> sounds advanced
[00:42] <Floenne> harvesting available data for further analysis
[00:42] <syule> i wonder if a neural network could do this faster than you guys
[00:43] <+Kalassak> i wonder if a neural network could suck a dick
[00:43] <Floenne> or
[00:44] <syule> >or
[00:44] <Floenne> no hmm
[00:45] <Floenne> ok hint?
[00:45] <syule> plot these points out with the first point at x = 0, the second at x = 1, the third at x = 2
[00:45] <syule> a line through them might help too
[00:45] <+Kalassak> wtf
[00:45] <+Kalassak> that's stupid
[00:45] <syule> i mean a line connecting the points
[00:46] <+Darvince> i was expecting something simpler
[00:46] <+Darvince> but you had to go with like
[00:46] <+Darvince> algebra 1
[00:46] <+Darvince> wait
[00:46] <+Darvince> or
[00:46] <+Darvince> 6th grade math
[00:46] <syule> what
[00:46] <Floenne> 0 0 -1
[00:46] <syule> no
[00:46] <+Darvince> whatever the fuck math class you learn graphs in
[00:46] <Floenne> 1 -2 0
[00:46] <syule> you don't have to plot the fucking points
[00:46] <syule> it's just to help
[00:47] <syule> 1 -2 0 is yes
[00:47] <Floenne> i didn't plot them darvince
[00:47] <Floenne> ezpz to visualise in head
[00:47] <+Darvince> it is polynomials you shit penis
[00:47] <syule> floenne is good
[00:47] <Floenne> 1 -999 1
[00:47] <syule> yes
[00:47] <+Darvince> 1 4 2
[00:47] <syule> no
[00:47] <Floenne> 5 -1 3
[00:47] <syule> yes
[00:47] <+Kalassak> 5 6 5
[00:47] <syule> no
[00:47] <Floenne> dar i think anything where second int is greatest is probably false
[00:47] <Floenne> 5 6 5 fasle
[00:47] <+Kalassak> 5 4 5
[00:47] <Floenne> because
[00:47] <syule> 5 6 5 no 5 4 5 yes
[00:48] <Floenne> 4 3 5
[00:48] <+Darvince> if you use these three points to plot a polynomial, then it must be facing upwards
[00:48] <+Kalassak> 10000000000 9999999 10000000000000
[00:48] <+Darvince> towards the + + directions
[00:48] <syule> >mfw i accidentally send my parents a message at 1 in the morning
[00:48] <syule> >and they think i should sleep at 10
[00:48] <syule> 4 3 5 is yes
[00:48] <Floenne> tell them you woke up for abthroom
[00:48] <syule> that big number is yes
[00:48] <+Kalassak> -25 -27 -26
[00:49] <Floenne> no
[00:49] <syule> nah i'll tell them i'm at a party and they'll be glad i have friends
[00:49] <+Darvince> syule is it my two lines
[00:49] <Floenne> wait
[00:49] <Floenne> yes
[00:49] <syule> -25 -27 -26 is a yes
[00:49] <Floenne> -25 -27 -26 should work
[00:49] <Floenne> ok
[00:49] <+Darvince> if you use these three points to plot a polynomial, then it must be facing upwards
[00:49] <+Darvince> towards the + + directions
[00:49] <+Kalassak> -25 -27 -27
[00:49] <Floenne> it might be
[00:49] <syule> uh
[00:49] <Floenne> n[0] > n[1] and n[2] > n[1] kalassak
[00:49] <Floenne> try to disprove that
[00:49] <+Darvince> WAIT
[00:49] <syule> darvince what do you mean by facing upwards
[00:49] <+Darvince> something outside those bounds would be
[00:49] <+Darvince> 3
[00:49] <+Kalassak> concave up
[00:49] <+Darvince> i mean
[00:49] <+Darvince> 3 3 3
[00:49] <syule> 3 3 3 is yes
[00:50] <+Darvince> i'm talking about quadratics
[00:50] <Floenne> wait what
[00:50] <Floenne> 1 0 0
[00:50] <+Kalassak> not concave down
[00:50] <syule> 1 0 0 is yes
[00:50] <syule> trueee
[00:50] <Floenne> i swear i saw something that rendered 1 0 0 false
[00:50] <syule> so the second difference, x3-x2, is greater than the first difference, x2-x1
[00:50] <syule> darvince and nue got it
[00:50] <syule> greater or equal*
[00:51] <Floenne> hm
[00:51] <+Darvince> then why is 3 3 3 true/yes
[00:51] <syule> because 3-3 >= 3-3
[00:51] <syule> 0 >= 0
[00:51] <+Kalassak> cause it's not concave down
[00:51] <+Darvince> you said greater than
[00:51] <syule> i added or equal later
[00:51] <Floenne> well syule
[00:51] <syule> good try though floenne
[00:51] <Floenne> all they said was concave though
[00:51] <Floenne> they didn't say anything about x3 - x2 > x2 -x1
[00:51] <syule> it's equivalent
[00:51] <syule> calculus terminology but i'll let it pass
[00:52] <+Darvince> wait what
[00:52] <Floenne> oh ok
[00:52] <+Darvince> oh
[00:52] <+Darvince> it does reach the same result
[00:52] <Floenne> wow yay i was close
[00:52] <syule> what was your thought
[00:52] <syule> just curious
[00:53] <Floenne> well originally i thought abs(x1) - abs(x3) > x2 but that didn't hold up
[00:53] <Floenne> then after the hint
[00:53] <+Darvince> also finding the parabola of 0,0; 1,0; 2,1 is something you learn in algebra 2
[00:53] <Floenne> x1 > x2, and x3 > x2
[00:53] <syule> it's not a goddamn polynomial for the last time
[00:53] <Floenne> ^
[00:53] * Darvince it's one step below a polynomial
[00:53] * Darvince bich
[00:53] <+Kalassak> The Stairs of Math
[00:54] <syule> anyway that was fun
[00:54] <syule> we should try this again sometime
[00:54] <syule> idea for new years event: do this but to determine which arrangement of blocks is valid