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

Pages: 1-

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 21:58

0 ≤ x, y ≤ N
Please refrain from using ambiguous syntax.

Also, mathematics are Jewish, but they're also Arabic, and I think someone once said Arabs are proto-Jews who evolved into al-muslimi.

Name: Anonymous 2013-05-09 21:59

>>2
you are stupid and racist to boot

Name: Anonymous 2013-05-09 21:59

poop sdfgdfghdgh asaaaaaaaaaaaaaaa sdfa dasda safg sfgh gr4e56ur5 kwehl5tkljhwoooooooooooooooooooooooooooooooooooooooooooooo

Name: Anonymous 2013-05-09 22:01

what is this nerd shit

Name: Anonymous 2013-05-09 22:04

>>3
Does it mean that 0 is less or equal than x, *and* that y is less than N? Or does it mean that x and y are between 0 and N? You could have said $x, y \in (0,N)$ if you wanted to said that.

But no, not being able to guess the meaning makes me a retard.
Yes, I hate kikes and sandniggers.

Name: Anonymous 2013-05-09 22:07

>>6
hey mathboy looks like math isn't your thing it seems
you ought to go shoot yourself racist

Name: Anonymous 2013-05-09 22:13

>>7
Are you a kike or a mudslime? Why do you care?

looks like math isn't your thing
Programming isn't my thing because someone made a a = a++ + ++a and I'm asking the author to clarify what he meant? Yeah, no. Fuck off.

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

Name: Anonymous 2013-05-09 22:19

wat dude???

Name: Anonymous 2013-05-09 22:19

>>9
Sadly, IHBT.

Name: Anonymous 2013-05-09 22:22

>>11
u got egged gro

lelelellele fag

Name: Anonymous 2013-05-09 22:22

Name: Anonymous 2013-05-09 22:29

LLLLLLLLEEEEEEEEEEEELLLLLLLLLLLLLLLLLLLLLLLLLLL
>POUNDING A PILLOW WITH A FLESHLIGHT
>OMG MFW LLEELLLLL EGGIINNNNN!!!!!

Name: Anonymous 2013-05-09 22:30

LLLLLLLLEEEEEEEEEEEELLLLLLLLLLLLLLLLLLLLLLLLLLL
>POUNDING A PILLOW WITH A FLESHLIGHT
>OMG MFW LLEELLLLL EGGIINNNNN!!!!!

Name: Anonymous 2013-05-09 23:56

Eggwing? I love eggs.

Name: Anonymous 2013-05-10 0:08

...why is T(1) = 11 ?

Name: Anonymous 2013-05-10 0:12

oh, i think i get it..

T(0) = 1 ? =)

Name: Anonymous 2013-05-10 0:22

no no t(0)=0 because no duplicates...

actually sounds pretty easy once you get over the size of the grid..

for each point A
  for each point B > A
    all combinations of points not on line A-B

Name: Anonymous 2013-05-10 0:24

...try doing it so that there are not more than two points on any line ;D

Name: Anonymous 2013-05-10 5:26

>>20
Fuck you, Luke.

Name: Anonymous 2013-05-10 5:34

>>3
you are stupid anad racist to boot and YHBT

Name: Anonymous 2013-05-10 6:11

what is this nerd shit

Name: Anonymous 2013-05-10 6:21

I'm not too hip on math OP, can you define line for me?

Name: Anonymous 2013-05-10 8:56

>>17-20
Fuck off and die, ^^-retard.

Name: Anonymous 2013-05-10 10:49

We won't solve Project Euler for you, Jew.

Name: Anonymous 2013-05-10 11:03

Project  Jewler

Name: Anonymous 2013-05-10 11:09

...nah i think i got that mostly right..
the combinations are binary though (points are either in a set, or not..)

Name: Anonymous 2013-05-10 11:20

and it probably counts many twice.. =/
maybe all binary combos above B would work..?

Name: Anonymous 2013-05-10 11:26

>>3
That's redundant.

Name: Anonymous 2013-05-10 11:45

>>1
The problem seems to not be given correctly.
If x and y can be any real number less than N, then there should be an infinite number of sets even for T(1), unless there is something I'm missing.

Name: Anonymous 2013-05-10 13:02

Name: ain't mathematician 2013-05-10 13:04

If it ain't Math, it's crap.
Math is shit.

Name: Anonymous 2013-05-10 22:22

...Would it be faster to count the invalid sets..?
eg. T(1) = 11 vS T(1) = 16 - 5

>>31
it seems x and y must be ints..

Name: Anonymous 2013-05-10 22:25

T(2) = 494 = 512 - 18

Name: Anonymous 2013-05-10 22:36

T(3) = ? (2^16 - x)
x = 1[0] + 16[1] + 0[2] + y[3] + z[4]

z = 4 + 4 + 2

y = 4 * 4 + 4 * 4 + 4 * 2 ?

Name: Anonymous 2013-05-10 22:56

+4 =)

So t(3) = 65455 ?

Name: Anonymous 2013-05-10 23:08

T(4) = (2^25 - x)
x = 1 + 25 + 0 + y[3] + z[4] + 12

z = 5*5 + 5*5 + 5*2 + 4 [64]

y = 2*3*5 + 2*3*5 + 2*3*2 + 4*4 + 4 (?) [92]

x = 92 + 64 + 38 ?

t(4) = 33554238 ..? nope =/ close though..

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