hacker.org

HINT: Every composite number can be written as the product of prime factors. Sequence: consecutive digits in the first 2048 decimal places of pi So, if you have a list of the first 100,000 prime numbers, you can 'test' each of the sequences, and whether one of those prime numbers is a factor of it. ...

Just a note, the script is CASE SENSITIVE for the URL you pass it. If your script is called "yourTurn.php", the Hacker.org server will convert it to lower case and request "yourturn.php". So, keep your script names in lower case.

For those wondering, it takes 100-200 steps to solve this maze. Consider that before doing it by hand.

Hi, I solved the maze manually with some support of pen and paper. That way I chose because the server didn't answer correctly on my requests. I used PHP with fsockopen(..). I included cookies, referer, user-agent, accept-encoding and all the headerlines firefox uses too. But instead of "keep ...

I did mine with PHP...first time it ran, I forgot to output the answer... So all I got was "1:56pm Found the ANSWER!" (GMT+10)

Didn't make that mistake again...

Ahhh! That took forever (2-3 hours)

Used first 20-30 factors to work out the formula =(k-1)^5*21+k^3*5*k*MAX(0, k-10)
where k = 100-(time left)

Then used Excel to work out the binary crap along with http://www.subnetonline.com/pages/conve ... to-dec.php

Yea, I used the BC libraries in PHP. Code was about 5 lines.

This is a test of whether you're a true 'hacker' or not :-P

Ugh, that was just annoying in the end. Take a step back, and look closer.

Good ol' bitmap :-)

I don't like java, so I translated the code to PHP: function calc($depth) { if ($depth == 0) return 1; $cc = calc($depth - 1); return (double)$cc + ($depth % 7) + (((($cc ^ $depth) % 4) == 0) ? 1 : 0); } echo calc(11589); Didn't take more than 1 minute to translate and run ;) Yup, did exactly the s...