Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon. Entire thread

Can you find it?

Name: Anonymous 2013-05-09 21:55

A set of lattice points S is called a titanic set if there exists a line passing through exactly two points in S.

An example of a titanic set is S = {(0, 0), (0, 1), (0, 2), (1, 1), (2, 0), (1, 0)}, where the line passing through (0, 1) and (2, 0) does not pass through any other point in S.

On the other hand, the set {(0, 0), (1, 1), (2, 2), (4, 4)} is not a titanic set since the line passing through any two points in the set also passes through the other two.

For any positive integer N, let T(N) be the number of titanic sets S whose every point (x, y) satisfies 0 ≤ x, y N.

It can be verified that T(1) = 11, T(2) = 494, T(4) = 33554178, T(111) mod (108) = 13500401 and T(105) = 63259062.

Find T(1011) mod 108.

Name: Anonymous 2013-05-09 22:17

>>8
Rofl, telling me to fuck off over the internet? I'll do what I want and you cant do shit about it.

fuckin nerd u dumbass

Newer Posts
Don't change these.
Name: Email:
Entire Thread Thread List