#How do I solve this? NO guess and check.
hallow ember
runic hillBOT
hallow ember
How do I solve this? NO guess and check.
indigo vigil
bruteforce would be good here tbf
devout tartan
like going for the largest prime number < 173 then going through the smallest until 2 fit
hallow ember
bruteforce would be good here tbf
I don't have that much knowledge in python
atomic chasm
since they are consecutive, you can first set an upper bound on the largest prime found.
or an estimate of the largest prime found.
actually I'm not sure how well this holds, let me cross that out. sorry.
hallow ember
oh shoot i forgot
indigo vigil
I don't have that much knowledge in python
bruteforce meaning guess, what i would look around is tuples near 173/2
atomic chasm
it is a Grothendieck prime I suppose. 
but you're rather close to the actual triple.
hallow ember
~~it is a Grothendieck prime I suppose.~~ <:KEK:586240877358350341>
what's Grothendieck prime?
atomic chasm
it's a kind of funny term to describe a number that is not a prime, but is 3 times a prime.
57 is the smallest amongst them for some reason. not too relevant here.
indigo vigil
what's Grothendieck prime?
-# seems like an inside joke
devout tartan
idk if there exist a general form
isn't this like one of the millennia problems?
-# or something like this
nope I apperantly missread
