hacker.org

... the answer must be written without spaces between the words...

...I'm searching for primes - not pi...

Hi! Question: Is there any page where I can found the primes between 1500 - 2048 Digits? If your answer is yes - would you plz post the link? (It spends about more than 30 minutes to test a prime with 1499 digits - so I think it will spend too much time to calculate all those longer primes...) Thx abc

Is it right, that the answer has more than 1000 digits?

It is not asking for the number of digits - correct?

Greetings
abc

Hi again!

Now I solved the challenge.
My pattern and assumptions were correct - but my program code was incorrect.

@all: plz be careful with some life-programs - there's one that got an counting error...

Grettings
abc

@tails: you will have pm soon

Hi again! I found out an pattern - and I really think it's ok. But If I calculate the population at generation 10 000 000 000 and type it into the answer box, it calls me "incorrect". In my opinion this Challenge is searching for an incorrect answer. I've tested my pattern to generation 1 ...

Hi again!

Thx for your answer adum!


I really think I just have the right answer, but it says "incorrect".
So - I need some help again:
Can someone tell me please if it is right, that the population is 1227 at generation 4312.

Thank you in advance!
abc

Hi!
Maybe a very stupid question but:

Is 10 Billion in English:
a) = 10 000 000 000
b) = 10 000 000 000 000

The reason why I ask this is, that www.dict calls me more possible solutions for "billion".
It could be "Billion" or "Milliarde" in German.

Thx
abc

Hi!
I think everybody should know that the first fib=1 in this challenge. (not 0)
Still got the same problems...

abc

Hi! I just tried to solve the Challenge "I Will Be Execute". First I copy and paste the complete Line: 79+3>111++<9+3>0<1+0>999**0<:6?084*-g1111++*<p Result: !ERROR: illegal value The Error happens after: 79+3>111++<9+3>0< Ok - there's nothing in the Memory Stack. Let's initialize the Memo...

Hi all! First let me explain, that I'm no Englishman -> so, sorry for my bad english language. Here is the challenge again: k = {unknown 4-byte value} x = {unknown 4-byte value} for (i = 0; i < len(txt); i += 4) c = (txt -> txt[i + 3]) ^ k print c k = (c + x) % 0x100000000 Now my question: How does ...