471,325 Members | 1,741 Online
Bytes | Software Development & Data Engineering Community
Post +

Home Posts Topics Members FAQ

Join Bytes to post your question to a community of 471,325 software developers and data experts.

A Complex Python Program dealing with Prime Numbers!

"Given natural numbers N and b, find the first N base-b digit prime number in consecutive base-b digits of e."

N and b are to be treated as inputs. I will be using base-7 digits of e as my base-b.

I am a beginner in python and was thrown at with this problem to get a feel of how python works. Since I do not know how to get started on this, I was wondering if someone would offer some sort of an algorithm to solving this problem. Perhaps a step by step guideline to get to the solution. I am not asking for the entire program to be written in front of me as that would be cheating.

Any help?
Sep 13 '07 #1
0 934

Post your reply

Sign in to post your reply or Sign up for a free account.

By using Bytes.com and it's services, you agree to our Privacy Policy and Terms of Use.

To disable or enable advertisements and analytics tracking please visit the manage ads & tracking page.