Problem 035

A place to air possible concerns or difficulties in understanding ProjectEuler problems. This forum is not meant to publish solutions. This forum is NOT meant to discuss solution methods or giving hints how a problem can be solved.
Forum rules
As your posts will be visible to the general public you
are requested to be thoughtful in not posting anything
that might explicitly give away how to solve a particular problem.

This forum is NOT meant to discuss solution methods for a problem.

In particular don't post any code fragments or results.

Don't start begging others to give partial answers to problems

Don't ask for hints how to solve a problem

Don't start a new topic for a problem if there already exists one


See also the topics:
Don't post any spoilers
Comments, questions and clarifications about PE problems.
User avatar
TheEvil
Posts: 84
Joined: Sun Nov 13, 2011 10:38 am
Location: Szeged, Hungary

Re: Problem 035

Post by TheEvil »

You can send it to me, if you want.
Image

pimspelier
Posts: 41
Joined: Tue Jan 21, 2014 2:06 pm
Location: The Netherlands

Re: Problem 035

Post by pimspelier »

Thanks mdean, for helping me, and thanks TheEvil, for the offer. Now onto the rest of the problem!

EDIT: Yeah, succeeded :D
Image

LateStart
Posts: 10
Joined: Sat Oct 07, 2017 4:59 pm

Problem 035

Post by LateStart »

Hello,
Why number 917 is not considered as a valid digit rotation of number 197?
Image

LilStalker
Posts: 73
Joined: Thu Nov 03, 2016 4:32 pm

Re: Problem 035

Post 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.
Image

LateStart
Posts: 10
Joined: Sat Oct 07, 2017 4:59 pm

Re: Problem 035

Post by LateStart »

Thanks, I was thinking about possible combinations.
Image

sriramrajan
Posts: 4
Joined: Wed Aug 29, 2018 8:22 am

Re: Problem 035

Post 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)

User avatar
Animus
Administrator
Posts: 1906
Joined: Sat Aug 16, 2014 1:23 pm

Re: Problem 035

Post by Animus »

Answered via PM.

sriramrajan
Posts: 4
Joined: Wed Aug 29, 2018 8:22 am

Re: Problem 035

Post 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.
Last edited by RobertStanforth on Sat Oct 13, 2018 9:15 am, edited 1 time in total.
Reason: Removed discussion of how to solve the problem

Post Reply