Math Is Fun Forum

http://mathworld.wolfram.com/topics/PrimeNumbers.html

Logic:
You are playing two chess games at the same time (first you move in the first, then your from the first moves then you move in the second then the second opponent moves and you get back to the first and so on)
Give a strategy (it's logical) when you are black in the first game and white in the second to be sure you'll get at least one point at the end.

Another question: why the scientists haven't revealed a strategy for the chess?

Sorry, santh, first time i didn't saw your last post. It's pretty good.  And something interesting.
Conjecture:
Let p-prime.
Then for every k∈[1,p) there exist prime number q>p for such
q==k(mod p)

I'll test it using computer program.

Guess 6:9215

I told you it will be ugly.

I'm close to next algoritm

It would be something very VERY ugly.
And probably it's complexity will make it useless.

{2,34,47}!!!

So we dont have solutions for the following:
3,4,26,27

Length: 6
MaxNumber: 19
sq(3,6)={3, 1, 8, 17, 19, 6}