Hacker News new | past | comments | ask | show | jobs | submit login

Another good link concerned with this problem is from OEIS:

https://oeis.org/A090245

"Maximum numbers of cards that would have no SET in an n-attribute version of the SET card game"

The OEIS links appear to have been updated to reflect the recent breakthrough of Ellenberg and Gijswijt, including their unified paper arXiv:1605.09223 from May 30.




Consider applying for YC's Spring batch! Applications are open till Feb 11.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: