We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.

# Project Euler #238: Infinite string tour

# Project Euler #238: Infinite string tour

#### Sort by

recency

#### |

#### 7 Discussions

#### |

Please Login in order to post a comment

my P(k) string is as below and i think everyone should have the same but i am missing something if anyone can find mistake

[3, 6, 6, 0, 2, 8, 9, 0, 2, 5, 5, 0, 3, 3, 3, 5, 0, 1, 1, 2, 2, 5, 7, 0, 1, 10, 0, 8, 9, 0, 2, 3, 9, 0, 1, 1, 1, 0, 2, 7, 8, 9, 0, 3, 6, 7, 0, 0, 1, 6, 8, 0, 0, 3, 5, 7, 9, 10, 0, 2, 0, 5, 6, 0, 1, 9]

I am getting 410241156867473431801162641014689466961281989186677795665...... as w. while the given string w is different..

I need a lead to a mathematical paper for simplifying a sum of powers of integers... the decomposition using the Bernoulli numbers is still not fast enough.

My C++/PyPy solutions output a different answer for the Sample Input 3 (, ). (They output same answers for Sample Input 0-2)

I have verified my solutions using a brute-force solution for , .

Could you please check the judge source code ?

It seems there is a mistake in the question and test cases.

As per question 'w' is concatentaion of numbers s0, s1, s2, s3. w = 4,1024,11568674,97880....

s0 = 4 s1 = 1024 s2 = 11568674

Till s2 is correct but s3 is not correct.

As per my calculation s3 which is ((11568674)^5) mod 16710461 = 7343180. But as per number (for w) given in question s3 is a number starting with '97880'.This doesnt seem correct. So test cases are also wrong.