for n in range(1, 13): field = GF(2^n) count = 0 for x in field: for y in field: if y^2+y == x^3+x: count += 1 print n, 2^n, count
https://news.ycombinator.com/item?id=20912380