funfact: we could derive an upper bound for the no-3-in-lline-problem from this, but ...

2024-09-12 09:35:12 UTC

funfact: we could derive an upper bound for the no-3-in-lline-problem from this, but i think it would be much larger than the trivial 2n bound, so basically useless. Adrian Riskin :anarchoheart2: (npub1l27…zpk4) Thomas Kahle (npub1hky…qd8s)

Author Public Key

Show more details

benni on Nostr: funfact: we could derive an upper bound for the no-3-in-lline-problem from this, but ...