Problem 133
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.
See also the topics:
Don't post any spoilers
Comments, questions and clarifications about PE problems.
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
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.
-
ayan_2587
- Posts: 1
- Joined: Fri Oct 16, 2009 2:51 pm
Problem 133
Hello frnds....
need a bit of help here..
for the problem no: 133, I am unable to understand for what of value of n should the program be executed.
is there any upper limit of n...i mean what values of n should i try for??
need a bit of help here..
for the problem no: 133, I am unable to understand for what of value of n should the program be executed.
is there any upper limit of n...i mean what values of n should i try for??
Last edited by ayan_2587 on Fri Oct 16, 2009 3:38 pm, edited 1 time in total.
- stijn263
- Posts: 1505
- Joined: Sat Sep 15, 2007 11:57 pm
- Location: Netherlands
Re: Problem 133
Problem 133 (View Problem)
There's no upperlimit on n. (but perhaps you don't need to check for n all the way up to infinity?) Good luck!
There's no upperlimit on n. (but perhaps you don't need to check for n all the way up to infinity?) Good luck!
-
Smaug
- Posts: 15
- Joined: Thu Aug 06, 2009 5:08 pm
Quibble with Problem 133
I have a quibble with the wording of this problem - given that 2 is prime, and a repunit must be odd, 2 is a prime which will never be a factor of a repunit. Surely it should be stated that odd primes are being searched for?
- elendiastarman
- Posts: 410
- Joined: Sat Dec 22, 2007 8:15 pm
Re: Problem 133
Well....wouldn't 2 be one of the primes you're trying to find?
Want some
3.14159265358979323846264338327950288419716939937510
58209749445923078164062862089986280348253421170679...?

3.14159265358979323846264338327950288419716939937510
58209749445923078164062862089986280348253421170679...?

- daniel.is.fischer
- Posts: 2400
- Joined: Sun Sep 02, 2007 11:15 pm
- Location: Bremen, Germany
Re: Problem 133
Quite.
Il faut respecter la montagne -- c'est pourquoi les gypaètes sont là.
-
Smaug
- Posts: 15
- Joined: Thu Aug 06, 2009 5:08 pm
Re: Problem 133
But in the example, it says that ''it is remarkable that 11, 17, 41, and 73 are the only four primes below one-hundred that can ever be a factor of R(10^n)" - and 2 is not included!elendiastarman wrote:Well....wouldn't 2 be one of the primes you're trying to find?
- daniel.is.fischer
- Posts: 2400
- Joined: Sun Sep 02, 2007 11:15 pm
- Location: Bremen, Germany
Re: Problem 133
''it is remarkable that 11, 17, 41, and 73 are the only four primes below one-hundred that can ever be a factor of R(10n)"Smaug wrote:But in the example, it says that ''it is remarkable that 11, 17, 41, and 73 are the only four primes below one-hundred that can ever be a factor of R(10^n)" - and 2 is not included!elendiastarman wrote:Well....wouldn't 2 be one of the primes you're trying to find?
Probably you misread that as never.
Since we don't want to lay artificial traps, I'll think about wording it differently to avoid that particular error.
Il faut respecter la montagne -- c'est pourquoi les gypaètes sont là.
-
Smaug
- Posts: 15
- Joined: Thu Aug 06, 2009 5:08 pm
-
mynameisalreadytaken
- Posts: 20
- Joined: Sun Sep 25, 2011 11:20 pm
Re: Problem 133
Can anyone confirm the sum 20308 for all the primes below 5000?
Edit: Alright, never mind. Next time, i should take a closer look at the description: I actually summed up all the primes, that can be factors of R(10^n) -___-
Edit: Alright, never mind. Next time, i should take a closer look at the description: I actually summed up all the primes, that can be factors of R(10^n) -___-

-
leijurv
- Posts: 1
- Joined: Thu Nov 15, 2012 2:48 pm
Lower limit
Can anyone confirm 5701941 for the primes up to 10,000?
(And yes, 20308 is correct for the ones that will be a factor up to 5000)
(And yes, 20308 is correct for the ones that will be a factor up to 5000)
-
thundre
- Posts: 356
- Joined: Sun Mar 27, 2011 10:01 am
Re: Lower limit
My sum for that is 5701946.leijurv wrote:Can anyone confirm 5701941 for the primes up to 10,000?
Did you forget 5?
