Page 2 of 2
Re: Problem 035
Posted: Sat Feb 22, 2014 4:18 pm
by TheEvil
You can send it to me, if you want.
Re: Problem 035
Posted: Sun Feb 23, 2014 9:45 am
by pimspelier
Thanks mdean, for helping me, and thanks TheEvil, for the offer. Now onto the rest of the problem!
EDIT: Yeah, succeeded

Problem 035
Posted: Sat Oct 07, 2017 5:02 pm
by LateStart
Hello,
Why number 917 is not considered as a valid digit rotation of number 197?
Re: Problem 035
Posted: Sat Oct 07, 2017 5:10 pm
by LilStalker
How exactly do you get to 917 from 197?
Your posible moves are either left rotation or right rotation and thus the numbers you can get from 197 are:
197 -> 719
719 -> 971
971 -> 197
Or the same procedure with the other rotation. There is no way you can get to number 917. That is why it is not considered a valid rotation.
Re: Problem 035
Posted: Sat Oct 07, 2017 5:15 pm
by LateStart
Thanks, I was thinking about possible combinations.
Re: Problem 035
Posted: Sat Sep 15, 2018 4:45 pm
by sriramrajan
My program only reaches up to 991.
Any suggestions on what I might have missed ? What is the number of Circular primes till 10K ?
time Euler35(10000)
297 ms ± 4.22 ms per loop (mean ± std. dev. of 7 runs, 1 loop each)
Re: Problem 035
Posted: Sat Sep 15, 2018 11:39 pm
by Animus
Answered via PM.
Re: Problem 035
Posted: Sat Oct 13, 2018 5:48 am
by sriramrajan
I have solved this problem.
Earlier, I was reading Circular primes incorrectly. We are only taking of rotations of a prime.
I was using <removed by moderator>
Moderator note: Do not discuss solutions in this forum! Please use the threads on the main site instead, as they are only visible to those who have already solved the problem.