"Whether he’s blocking a 300-pound defensive lineman or hitting the math books, this doctoral candidate just won’t quit."
(my first try, hello ev'ryone) Ulam spiral, the classic squared one. I paint case "1" with colour c1, the next 2 cases with colour c2, next 3 cases with colour c3... and so on, cycling on n colours. My absolutely hypotethic conjecture, based on a small limited try: if I use n<=4 colours I obtain a partition of the spiral in n connexes subset. If n > 5 the same-coloured areas are disconnexed
The social network of the future: No ads, no corporate surveillance, ethical design, and decentralization! Own your data with Mastodon!